Visualizing the Uncertainty of Graph‐based 2D Segmentation with Min‐path Stability
This paper presents a novel approach to visualize the uncertainty in graph‐based segmentations of scalar data. Segmentation of 2D scalar data has wide application in a variety of scientific and medical domains. Typically, a segmentation is presented as a single unambiguous boundary although the solu...
Uloženo v:
| Vydáno v: | Computer graphics forum Ročník 36; číslo 3; s. 133 - 143 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Oxford
Blackwell Publishing Ltd
01.06.2017
Wiley |
| Témata: | |
| ISSN: | 0167-7055, 1467-8659 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | This paper presents a novel approach to visualize the uncertainty in graph‐based segmentations of scalar data. Segmentation of 2D scalar data has wide application in a variety of scientific and medical domains. Typically, a segmentation is presented as a single unambiguous boundary although the solution is often uncertain due to noise or blur in the underlying data as well as imprecision in user input. Our approach provides insight into this uncertainty by computing the “min‐path stability”, a scalar measure analyzing the stability of the segmentation given a set of input constraints. Our approach is efficient, easy to compute, and can be generally applied to either graph cuts or live‐wire (even partial) segmentations. In addition to its general applicability, our new approach to graph cuts uncertainty visualization improves on the time complexity of the current state‐of‐the‐art with an additional fast approximate solution. We also introduce a novel query enabled by our approach which provides users with alternate segmentations by efficiently extracting local minima of the segmentation optimization. Finally, we evaluate our approach and demonstrate its utility on data from scientific and medical applications. |
|---|---|
| AbstractList | This paper presents a novel approach to visualize the uncertainty in graph‐based segmentations of scalar data. Segmentation of 2D scalar data has wide application in a variety of scientific and medical domains. Typically, a segmentation is presented as a single unambiguous boundary although the solution is often uncertain due to noise or blur in the underlying data as well as imprecision in user input. Our approach provides insight into this uncertainty by computing the
“min‐path stability”
, a scalar measure analyzing the stability of the segmentation given a set of input constraints. Our approach is efficient, easy to compute, and can be generally applied to either graph cuts or live‐wire (even partial) segmentations. In addition to its general applicability, our new approach to graph cuts uncertainty visualization improves on the time complexity of the current state‐of‐the‐art with an additional fast approximate solution. We also introduce a novel query enabled by our approach which provides users with alternate segmentations by efficiently extracting local minima of the segmentation optimization. Finally, we evaluate our approach and demonstrate its utility on data from scientific and medical applications. This paper presents a novel approach to visualize the uncertainty in graph-based segmentations of scalar data. Segmentation of 2D scalar data has wide application in a variety of scientific and medical domains. Typically, a segmentation is presented as a single unambiguous boundary although the solution is often uncertain due to noise or blur in the underlying data as well as imprecision in user input. Our approach provides insight into this uncertainty by computing the " min-path stability " , a scalar measure analyzing the stability of the segmentation given a set of input constraints. Our approach is efficient, easy to compute, and can be generally applied to either graph cuts or live-wire (even partial) segmentations. In addition to its general applicability, our new approach to graph cuts uncertainty visualization improves on the time complexity of the current state-of-the-art with an additional fast approximate solution. We also introduce a novel query enabled by our approach which provides users with alternate segmentations by efficiently extracting local minima of the segmentation optimization. Finally, we evaluate our approach and demonstrate its utility on data from scientific and medical applications. This paper presents a novel approach to visualize the uncertainty in graph-based segmentations of scalar data. Segmentation of 2D scalar data has wide application in a variety of scientific and medical domains. Typically, a segmentation is presented as a single unambiguous boundary although the solution is often uncertain due to noise or blur in the underlying data as well as imprecision in user input. Our approach provides insight into this uncertainty by computing the “min-path stability”, a scalar measure analyzing the stability of the segmentation given a set of input constraints. Our approach is efficient, easy to compute, and can be generally applied to either graph cuts or live-wire (even partial) segmentations. In addition to its general applicability, our new approach to graph cuts uncertainty visualization improves on the time complexity of the current state-oft-the-art with an additional fast approximate solution. We also introduce a novel query enabled by our approach which provides users with alternate segmentations by efficiently extracting local minima of the segmentation optimization. Finally, we evaluate our approach and demonstrate its utility on data from scientific and medical applications. |
| Author | Summa, B. Tierny, J. Pascucci, V. |
| Author_xml | – sequence: 1 givenname: B. surname: Summa fullname: Summa, B. organization: Tulane University – sequence: 2 givenname: J. surname: Tierny fullname: Tierny, J. organization: Sorbonne Universites – sequence: 3 givenname: V. surname: Pascucci fullname: Pascucci, V. organization: University of Utah |
| BackLink | https://hal.science/hal-01510992$$DView record in HAL https://www.osti.gov/servlets/purl/1418630$$D View this record in Osti.gov |
| BookMark | eNp9kcFOHDEMhqOKSl0oh77BiJ56WLAnkww5oi0slbbqgcI1SkKyEzQk2yQL2p76CDwjT9LAolZCan2xZX3-ZfvfJTshBkvIB4RDrHFklu4QKfbdGzLBjvfTY87EDpkA1roHxt6R3ZxvAKDrOZuQqyuf12r0P31YNmWwzWUwNhXlQ9k00TXzpFbD468HrbK9btrPzYVd3tpQVPExNPe-DM1XHyqwUrW8KEr70ZfNe_LWqTHb_Ze8Ry7PTr_PzqeLb_Mvs5PF1FBBu6nWHTLHrjvXUofCiZZz4FwoqhlwjdBrdAo6oEw5wxUH26LlXINA3TNF98jBVjfm4mU2vlgzmBiCNUVih8ecQoU-baFBjXKV_K1KGxmVl-cnC_nUA2QIQrR3WNmPW3aV4o-1zUXexHUK9QaJAhnjtEf8q2hSzDlZ90cWQT75IKsP8tmHyh69YuuWz-8rSfnxfxP3frSbf0vL2fxsO_EboMOakw |
| CitedBy_id | crossref_primary_10_1109_TPAMI_2020_2974475 crossref_primary_10_1111_cgf_13364 crossref_primary_10_1111_cgf_13695 crossref_primary_10_1016_j_cag_2019_07_001 |
| Cites_doi | 10.1111/cgf.12193 10.1038/nm.3289 10.1109/34.969114 10.1101/039958 10.1137/0212005 10.1145/2185520.2185579 10.1109/ISBI.2015.7163890 10.1111/j.1467-8659.2009.01691.x 10.1007/11744047_3 10.1117/1.1631315 10.1109/CVPR.2012.6247958 10.1109/ISBI.2006.1624991 10.1109/ICIP.2010.5652042 10.1016/j.imavis.2009.04.005 10.1145/1015706.1015719 10.1111/j.1467-8659.2011.01942.x 10.1109/CVPR.2012.6247747 10.1007/978-3-642-18421-5_20 10.1117/12.2014161 10.1109/ICCV.2007.4408927 10.1109/ICCV.2007.4409130 10.1109/ICPR.2002.1044788 10.1109/TPAMI.2006.233 10.1007/978-1-4471-6497-5_1 10.1109/PACIFICVIS.2011.5742373 10.1109/CVPR.2009.5206863 10.1007/BF01386390 10.1038/srep27419 10.1016/j.neucom.2015.05.044 10.1016/0031-3203(94)00180-T 10.1109/TPAMI.2004.60 10.1137/0208012 10.1007/978-3-642-33715-4_1 10.1057/palgrave.ivs.9500157 |
| ContentType | Journal Article |
| Copyright | 2017 The Author(s) Computer Graphics Forum © 2017 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd. 2017 The Eurographics Association and John Wiley & Sons Ltd. Copyright |
| Copyright_xml | – notice: 2017 The Author(s) Computer Graphics Forum © 2017 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd. – notice: 2017 The Eurographics Association and John Wiley & Sons Ltd. – notice: Copyright |
| CorporateAuthor | Univ. of Utah, Salt Lake City, UT (United States) |
| CorporateAuthor_xml | – name: Univ. of Utah, Salt Lake City, UT (United States) |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D 1XC VOOES OIOZB OTOTI |
| DOI | 10.1111/cgf.13174 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) OSTI.GOV - Hybrid OSTI.GOV |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | CrossRef Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1467-8659 |
| EndPage | 143 |
| ExternalDocumentID | 1418630 oai:HAL:hal-01510992v1 10_1111_cgf_13174 CGF13174 |
| Genre | article |
| GroupedDBID | .3N .4S .DC .GA .Y3 05W 0R~ 10A 15B 1OB 1OC 29F 31~ 33P 3SF 4.4 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5GY 5HH 5LA 5VS 66C 6J9 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 8VB 930 A03 AAESR AAEVG AAHHS AAHQN AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABDBF ABDPE ABEML ABPVW ACAHQ ACBWZ ACCFJ ACCZN ACFBH ACGFS ACPOU ACRPL ACSCC ACUHS ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADNMO ADOZA ADXAS ADZMN ADZOD AEEZP AEGXH AEIGN AEIMD AEMOZ AENEX AEQDE AEUQT AEUYR AFBPY AFEBI AFFNX AFFPM AFGKR AFPWT AFWVQ AFZJQ AHBTC AHEFC AHQJS AITYG AIURR AIWBW AJBDE AJXKR AKVCP ALAGY ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMYDB ARCSS ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BHBCM BMNLL BMXJE BNHUX BROTX BRXPI BY8 CAG COF CS3 CWDTD D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM DU5 EAD EAP EBA EBO EBR EBS EBU EDO EJD EMK EST ESX F00 F01 F04 F5P FEDTE FZ0 G-S G.N GODZA H.T H.X HF~ HGLYW HVGLF HZI HZ~ I-F IHE IX1 J0M K1G K48 LATKE LC2 LC3 LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES MEWTI MK4 MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 N9A NF~ O66 O9- OIG P2W P2X P4D PALCI PQQKQ Q.N Q11 QB0 QWB R.K RDJ RIWAO RJQFR ROL RX1 SAMSI SUPJJ TH9 TN5 TUS UB1 V8K W8V W99 WBKPD WIH WIK WOHZO WQJ WRC WXSBR WYISQ WZISG XG1 ZL0 ZZTAW ~IA ~IF ~WT AAMMB AAYXX ADMLS AEFGJ AEYWJ AGHNM AGQPQ AGXDD AGYGG AIDQK AIDYY AIQQE CITATION O8X 7SC 8FD JQ2 L7M L~C L~D 1XC VOOES AAJUZ AAPBV ABCVL ABHUG ABPTK ABWRO ACXME ADAWD ADDAD AFVGU AGJLS OIOZB OTOTI PQEST UMP |
| ID | FETCH-LOGICAL-c3934-bb415f5d4f23f19f92660669a3b506b107b1fa04035afc6a60e21e66b091b75a3 |
| IEDL.DBID | DRFUL |
| ISICitedReferencesCount | 5 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000404881200014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0167-7055 |
| IngestDate | Fri May 19 01:42:35 EDT 2023 Tue Oct 14 20:34:37 EDT 2025 Fri Jul 25 04:23:21 EDT 2025 Tue Nov 18 22:36:11 EST 2025 Sat Nov 29 03:41:14 EST 2025 Wed Jan 22 16:28:15 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Language | English |
| License | Copyright: http://hal.archives-ouvertes.fr/licences/copyright |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c3934-bb415f5d4f23f19f92660669a3b506b107b1fa04035afc6a60e21e66b091b75a3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 NA0002375; SC0007446 National Science Foundation (NSF) USDOE National Nuclear Security Administration (NNSA) |
| ORCID | 0000-0003-0056-2831 0000-0002-5794-3355 |
| OpenAccessLink | https://www.osti.gov/servlets/purl/1418630 |
| PQID | 1915563711 |
| PQPubID | 30877 |
| PageCount | 11 |
| ParticipantIDs | osti_scitechconnect_1418630 hal_primary_oai_HAL_hal_01510992v1 proquest_journals_1915563711 crossref_primary_10_1111_cgf_13174 crossref_citationtrail_10_1111_cgf_13174 wiley_primary_10_1111_cgf_13174_CGF13174 |
| PublicationCentury | 2000 |
| PublicationDate | June 2017 |
| PublicationDateYYYYMMDD | 2017-06-01 |
| PublicationDate_xml | – month: 06 year: 2017 text: June 2017 |
| PublicationDecade | 2010 |
| PublicationPlace | Oxford |
| PublicationPlace_xml | – name: Oxford – name: United States |
| PublicationTitle | Computer graphics forum |
| PublicationYear | 2017 |
| Publisher | Blackwell Publishing Ltd Wiley |
| Publisher_xml | – name: Blackwell Publishing Ltd – name: Wiley |
| References | 2010; 16 2012 2011 2010 2004; 26 2004; 23 2002; 1 1998 2009 2011; 30 2008 2007 2006 1995 2004 1991 2002 2001; 23 1959; 1 2012; 31 2001; 20 1983; 12 2013; 19 2016; 6 2006; 28 2007; 6 2016 2015 2014 2013 2005; 2 1979; 8 e_1_2_9_10_2 e_1_2_9_33_2 e_1_2_9_12_2 e_1_2_9_31_2 Kohli P. (e_1_2_9_26_2) 2005; 2 e_1_2_9_14_2 e_1_2_9_37_2 e_1_2_9_16_2 e_1_2_9_35_2 e_1_2_9_18_2 e_1_2_9_39_2 e_1_2_9_41_2 e_1_2_9_20_2 e_1_2_9_45_2 e_1_2_9_22_2 e_1_2_9_43_2 e_1_2_9_6_2 e_1_2_9_4_2 e_1_2_9_2_2 Warfield S.K. (e_1_2_9_52_2) 2004; 23 Zhang Y. (e_1_2_9_53_2) 2001; 20 e_1_2_9_8_2 e_1_2_9_24_2 e_1_2_9_49_2 Saad A. (e_1_2_9_38_2) 2010; 16 e_1_2_9_47_2 e_1_2_9_28_2 e_1_2_9_51_2 e_1_2_9_30_2 e_1_2_9_34_2 e_1_2_9_11_2 e_1_2_9_32_2 Whitaker R.T. (e_1_2_9_50_2) 2013; 19 e_1_2_9_13_2 e_1_2_9_15_2 e_1_2_9_36_2 e_1_2_9_17_2 e_1_2_9_19_2 e_1_2_9_40_2 e_1_2_9_21_2 e_1_2_9_44_2 e_1_2_9_23_2 e_1_2_9_42_2 e_1_2_9_7_2 e_1_2_9_5_2 e_1_2_9_3_2 e_1_2_9_9_2 e_1_2_9_25_2 e_1_2_9_48_2 e_1_2_9_27_2 e_1_2_9_46_2 e_1_2_9_29_2 |
| References_xml | – year: 2009 – start-page: 3625 year: 2010 end-page: 3628 – volume: 23 start-page: 303 year: 2004 end-page: 308 article-title: Lazy snapping publication-title: TOG – volume: 28 start-page: 1768 year: 2006 end-page: 1783 article-title: Random walks for image segmentation publication-title: PAMI – start-page: 1 year: 2007 end-page: 8 – volume: 8 start-page: 135 year: 1979 end-page: 150 article-title: Maximum flow in planar networks publication-title: SIAM Journal on Computing – volume: 19 start-page: 2713 year: 2013 end-page: 2722 article-title: Contour boxplots: A method for characterizing uncertainty in feature sets from simulation ensembles publication-title: TVCG – volume: 1 start-page: 269 year: 1959 end-page: 271 article-title: A note on two problems in connexion with graphs publication-title: Numerische Mathematik – start-page: 2440 year: 2012 end-page: 2447 – volume: 6 start-page: 233 year: 2007 end-page: 246 article-title: Candidtree: visualizing structural uncertainty in similar hierarchies publication-title: Information Visualization – start-page: 3 year: 2014 end-page: 27 – volume: 26 start-page: 1124 year: 2004 end-page: 1137 article-title: An experimental comparison of min‐cut/max‐flow algorithms for energy minimization in vision publication-title: PAMI – year: 2007 – volume: 19 start-page: 1178 year: 2013 end-page: 1183 article-title: Vessel architectural imaging identifies cancer patient responders to anti‐angiogenic therapy publication-title: Nature medicine – volume: 2 start-page: 922 year: 2005 end-page: 929 article-title: Efficiently solving dynamic markov random fields using graph cuts publication-title: ICCV – start-page: 1 year: 2012 end-page: 16 – volume: 30 start-page: 931 year: 2011 end-page: 940 article-title: Probabilistic marching cubes publication-title: CGF – start-page: 799 year: 2015 end-page: 807 – start-page: 372 year: 2015 end-page: 375 – year: 2016 – year: 2014 – volume: 20 start-page: 45 year: 2001 end-page: 57 article-title: Segmentation of brain mr images through a hidden markov random field model and the expectation‐maximization algorithm publication-title: T‐MI – year: 1998 – year: 2010 – year: 2012 – start-page: 30 year: 2006 end-page: 43 – volume: 23 start-page: 903 year: 2004 end-page: 921 article-title: Simultaneous truth and performance level estimation (staple): an algorithm for the validation of image segmentation publication-title: T‐MI – volume: 31 start-page: 83:1 year: 2012 end-page: 83:11 article-title: Panorama weaving: fast and flexible seam processing publication-title: TOG – volume: 1 start-page: 532 year: 2002 end-page: 535 – volume: 16 start-page: 1366 year: 2010 end-page: 1375 article-title: Exploration and visualization of segmentation uncertainty using shape and appearance prior information publication-title: TVCG – year: 2002 – year: 2008 – volume: 6 start-page: 27419 year: 2016 article-title: Gigapixel surface imaging of radical prostatectomy specimens for comprehensive detection of cancer‐positive surgical margins using structured illumination microscopy publication-title: Scientific Reports – year: 2004 – start-page: 59 year: 2011 end-page: 66 – year: 1995 – volume: 23 start-page: 1222 year: 2001 end-page: 1239 article-title: Fast approximate energy minimization via graph cuts publication-title: PAMI – start-page: 614 year: 2006 end-page: 617 – year: 1991 – volume: 12 start-page: 71 year: 1983 end-page: 81 article-title: Minimum s–t cut of a planar undirected network in ( log ( )) time publication-title: SIAM J. Comput – year: 2015 – year: 2013 – ident: e_1_2_9_20_2 doi: 10.1111/cgf.12193 – ident: e_1_2_9_14_2 doi: 10.1038/nm.3289 – ident: e_1_2_9_7_2 doi: 10.1109/34.969114 – ident: e_1_2_9_2_2 – ident: e_1_2_9_4_2 doi: 10.1101/039958 – ident: e_1_2_9_10_2 – ident: e_1_2_9_34_2 doi: 10.1137/0212005 – ident: e_1_2_9_45_2 doi: 10.1145/2185520.2185579 – ident: e_1_2_9_24_2 doi: 10.1109/ISBI.2015.7163890 – ident: e_1_2_9_42_2 doi: 10.1111/j.1467-8659.2009.01691.x – ident: e_1_2_9_27_2 doi: 10.1007/11744047_3 – ident: e_1_2_9_43_2 doi: 10.1117/1.1631315 – ident: e_1_2_9_46_2 doi: 10.1109/CVPR.2012.6247958 – ident: e_1_2_9_15_2 doi: 10.1109/ISBI.2006.1624991 – ident: e_1_2_9_23_2 doi: 10.1109/ICIP.2010.5652042 – volume: 16 start-page: 1366 year: 2010 ident: e_1_2_9_38_2 article-title: Exploration and visualization of segmentation uncertainty using shape and appearance prior information publication-title: TVCG – volume: 2 start-page: 922 year: 2005 ident: e_1_2_9_26_2 article-title: Efficiently solving dynamic markov random fields using graph cuts publication-title: ICCV – ident: e_1_2_9_48_2 doi: 10.1016/j.imavis.2009.04.005 – ident: e_1_2_9_29_2 doi: 10.1145/1015706.1015719 – ident: e_1_2_9_37_2 – volume: 23 start-page: 903 year: 2004 ident: e_1_2_9_52_2 article-title: Simultaneous truth and performance level estimation (staple): an algorithm for the validation of image segmentation publication-title: T‐MI – ident: e_1_2_9_33_2 doi: 10.1111/j.1467-8659.2011.01942.x – ident: e_1_2_9_41_2 doi: 10.1109/CVPR.2012.6247747 – ident: e_1_2_9_47_2 doi: 10.1007/978-3-642-18421-5_20 – ident: e_1_2_9_51_2 doi: 10.1117/12.2014161 – ident: e_1_2_9_35_2 doi: 10.1109/ICCV.2007.4408927 – ident: e_1_2_9_9_2 doi: 10.1109/ICCV.2007.4409130 – ident: e_1_2_9_19_2 – ident: e_1_2_9_17_2 doi: 10.1109/ICPR.2002.1044788 – ident: e_1_2_9_40_2 – ident: e_1_2_9_32_2 – ident: e_1_2_9_16_2 doi: 10.1109/TPAMI.2006.233 – ident: e_1_2_9_5_2 doi: 10.1007/978-1-4471-6497-5_1 – ident: e_1_2_9_18_2 doi: 10.1109/PACIFICVIS.2011.5742373 – ident: e_1_2_9_44_2 doi: 10.1109/CVPR.2009.5206863 – ident: e_1_2_9_12_2 doi: 10.1007/BF01386390 – ident: e_1_2_9_30_2 – ident: e_1_2_9_49_2 doi: 10.1038/srep27419 – ident: e_1_2_9_13_2 doi: 10.1016/j.neucom.2015.05.044 – volume: 20 start-page: 45 year: 2001 ident: e_1_2_9_53_2 article-title: Segmentation of brain mr images through a hidden markov random field model and the expectation‐maximization algorithm publication-title: T‐MI – ident: e_1_2_9_11_2 – ident: e_1_2_9_31_2 – ident: e_1_2_9_25_2 – ident: e_1_2_9_3_2 – ident: e_1_2_9_21_2 doi: 10.1016/0031-3203(94)00180-T – ident: e_1_2_9_6_2 doi: 10.1109/TPAMI.2004.60 – ident: e_1_2_9_22_2 doi: 10.1137/0208012 – ident: e_1_2_9_8_2 doi: 10.1007/978-3-642-33715-4_1 – ident: e_1_2_9_36_2 – volume: 19 start-page: 2713 year: 2013 ident: e_1_2_9_50_2 article-title: Contour boxplots: A method for characterizing uncertainty in feature sets from simulation ensembles publication-title: TVCG – ident: e_1_2_9_39_2 – ident: e_1_2_9_28_2 doi: 10.1057/palgrave.ivs.9500157 |
| SSID | ssj0004765 |
| Score | 2.2112792 |
| Snippet | This paper presents a novel approach to visualize the uncertainty in graph‐based segmentations of scalar data. Segmentation of 2D scalar data has wide... This paper presents a novel approach to visualize the uncertainty in graph-based segmentations of scalar data. Segmentation of 2D scalar data has wide... |
| SourceID | osti hal proquest crossref wiley |
| SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 133 |
| SubjectTerms | Categories and Subject Descriptors (according to ACM CCS) Complexity Computational Geometry Computer graphics methodology, Image processing segmentation, Pixel classification Computer Science Discrete Mathematics I.3.6 [Computer Graphics]: Methodology and Techniques—Graphics data structures and data types I.4.6 [Image Processing and Computer Vision]: Segmentation—Pixel classification MATHEMATICS AND COMPUTING Minima Segmentation Stability analysis Uncertainty Wire |
| Title | Visualizing the Uncertainty of Graph‐based 2D Segmentation with Min‐path Stability |
| URI | https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fcgf.13174 https://www.proquest.com/docview/1915563711 https://hal.science/hal-01510992 https://www.osti.gov/servlets/purl/1418630 |
| Volume | 36 |
| WOSCitedRecordID | wos000404881200014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVWIB databaseName: Wiley Online Library Full Collection 2020 customDbUrl: eissn: 1467-8659 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004765 issn: 0167-7055 databaseCode: DRFUL dateStart: 19970101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT9wwEB7B0kN7oG91C1RW1QOXVHH8SCJOCLpwAFS1XcQtsh2brtRmEbsg0RM_gd_YX9IZb7IsEkiVuOUxliLPjOezM_MNwKdahVRKoZNcWJ_IQpVJqbxLci9FUYtaalfHZhP50VFxclJ-XYKtrhZmxg8xP3Ajz4jrNTm4sZMFJ3en4TPH6CeXYSVDu1U9WNn9Nhge3JZF5lp11N5EGtMSC1Eiz3zwnXC0_JOSIXtjdK47gHMRtsa4M3j-qC9-Aast3GTbM_t4CUu-eQXPFkgIX8Px8WhClZV_8I4hHGRDtIOYJzC9YuPA9ojS-u_1DcW7mmW77Ls__d1WLDWMznHZ4ahBAWpuzBC8xnTbqzcwHHz5sbOftN0WEidKIRNrMZYHVcuQicDLUGLoRjxSGmFVqi1uEy0PBn1eKBOcNjr1GfdaW0QcNldGvIVeM278O2A6FYXFFd1xhFtCC2OlMaV0Ic2dxCWyD5vdpFeupSKnjhi_qm5LglNVxanqw8e56NmMf-NeIdTc_D0xZu9vH1T0DNEO_fvLLnkf1kixFSILosd1lEfkprj14YUWaR_WO31XrRdPKk7k-VrkHAdvRs0-_A3Vzt4gXrz_f9E1eJoRSoiHOuvQm55f-A144i6no8n5h9ac_wFXAPbD |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1fb9MwED9tHRLsgb9DdBtgIR72EhTHjpNIvEwbXRFdhWCd9mbFjt1VghSt3aTtiY_AZ-STcOcmpZNAQuItf85S5Lvz_Xw5_w7gdZX6WEqhokwYF8k8LaIidTbKnBR5JSqpbBWaTWTDYX52Vnxcg7ftWZgFP8Qy4UaeEdZrcnBKSK94uR37NxzDn1yHDYlmhPa9cfipNxr8PheZqbTl9ibWmIZZiCp5loNvxaP1c6qG7EzRu24hzlXcGgJP78H_ffJDuN8ATra_sJBHsObqx7C5QkP4BE5PJzM6W3mDdwwBIRuhJYRKgfk1m3p2RKTWP7__oIhXseSQfXbjr82ZpZpRJpcdT2oUoPbGDOFrKLi93oJR793JQT9q-i1EVhRCRsZgNPdpJX0iPC98gcEbEUlRCpPGyuBG0XBfoteLtPRWlSp2CXdKGcQcJktL8RQ69bR2z4CpWOQG13TLEXAJJUojy7KQ1seZlbhIdmGvnXVtGzJy6onxRbebEpwqHaaqC6-Wot8WDBx_FELVLd8TZ3Z_f6DpGeId-vuXXPEu7JBmNWILIsi1VElk57j54bkScRd2W4Xrxo9nmhN9vhIZx8F7QbV__wZ9cNQLF9v_LvoS7vZPjgd68H74YQfuJYQZQopnFzrzi0v3HO7Yq_lkdvGise1fHm_6sw |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1faxQxEB_aq0h98H_xbNUgPvRlZbPJZnfBl9JzW_E8inqlb2GTTeqB7pXetdA--RH8jH4SZ3K75xUUBN_2zwRCJpP5JZn5DcCrOvWxlEJFmTAuknlaREXqbJQ5KfJa1FLZOhSbyEaj_OSkOFqDN10uzIIfYnngRpYR1msycHdW-xUrt6f-NUf3J9dhQ1IRmR5sDD6W4-HvvMhMpR23N7HGtMxCFMmzbHzDH61_oWjI3hSt6wbiXMWtwfGU9_6vy_fhbgs42d5ihjyANdc8hDsrNISP4Ph4MqPcymt8YwgI2RhnQogUmF-xqWcHRGr98_sP8ng1Swbskzv91uYsNYxOctmHSYMCVN6YIXwNAbdXj2Fcvv28fxi19RYiKwohI2PQm_u0lj4Rnhe-QOeNiKSohEljZXCjaLiv0OpFWnmrKhW7hDulDGIOk6WV2IJeM23cE2AqFrnBNd1yBFxCicrIqiqk9XFmJS6SfdjtRl3bloycamJ81d2mBIdKh6Hqw8ul6NmCgeOPQqi65X_izD7cG2r6hniHbv-SS96HbdKsRmxBBLmWIonsHDc_PFci7sNOp3Dd2vFMc6LPVyLj2Hg3qPbvfdD7B2V4ePrvoi_g9tGg1MN3o_fbsJkQZAgnPDvQm59fuGdwy17OJ7Pz5-3U_gWxQ_ou |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Visualizing+the+Uncertainty+of+Graph%E2%80%90based+2D+Segmentation+with+Min%E2%80%90path+Stability&rft.jtitle=Computer+graphics+forum&rft.au=Summa%2C+B.&rft.au=Tierny%2C+J.&rft.au=Pascucci%2C+V.&rft.date=2017-06-01&rft.issn=0167-7055&rft.eissn=1467-8659&rft.volume=36&rft.issue=3&rft.spage=133&rft.epage=143&rft_id=info:doi/10.1111%2Fcgf.13174&rft.externalDBID=10.1111%252Fcgf.13174&rft.externalDocID=CGF13174 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-7055&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-7055&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-7055&client=summon |