A Three-Level Graph Based Interactive Volume Segmentation System

We present a new hierarchical graph representation for volume data as well as its associated operations to enable interactive feature segmentation for high-resolution volume data. Our method constructs a low-resolution graph which represents a coarser resolution of the data. This graph enables the u...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Huang, Runzhen, Ma, Kwan-Liu
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 150
container_issue
container_start_page 143
container_title
container_volume
creator Huang, Runzhen
Ma, Kwan-Liu
description We present a new hierarchical graph representation for volume data as well as its associated operations to enable interactive feature segmentation for high-resolution volume data. Our method constructs a low-resolution graph which represents a coarser resolution of the data. This graph enables the user to interactively sample and edit a feature of interest by drawing strokes on data slices. A subgraph representing the feature is derived with a growing process, and is used to extract the high-resolution version of the feature from the original volume data by performing an automatic mapping and refinement procedure. Our three-level, graph-based approach overcomes partial volume effects that are introduced by downsampling the volume data, and enables interactive segmentation of fine features. We demonstrate the effectiveness of this approach with several challenging 3D segmentation applications.
doi_str_mv 10.1007/11595755_18
format Conference Proceeding
fullrecord <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_17413353</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>17413353</sourcerecordid><originalsourceid>FETCH-LOGICAL-p219t-d1cdaa2575fbc258ff577a066621aabd69dd4eb136da9ce5b00ca7f704ae4d5a3</originalsourceid><addsrcrecordid>eNpNUE1Lw0AUXL_AUnvyD-TiwUN0X3Y3m71Zi9ZCwEOr1_CSfWmj-WI3FvrvjVTQuczADMMwjF0DvwPO9T2AMkorlUFywmZGJ0JJLqIokeaUTSAGCIWQ5uzP41pxOGeTUUWh0VJcspn3H3yEgJhrPmEP82Czc0RhSnuqg6XDfhc8oicbrNqBHBZDtafgvau_GgrWtG2oHXCoujZYH_xAzRW7KLH2NPvlKXt7ftosXsL0dblazNOwj8AMoYXCIkbj_jIvIpWUpdIaeRzHESDmNjbWSspBxBZNQSrnvEBdai6RpFUopuzm2NujL7AuHbZF5bPeVQ26QwZaghBKjLnbY86PVrsll-Vd9-kz4NnPi9m_F8U3Vylefg</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A Three-Level Graph Based Interactive Volume Segmentation System</title><source>Springer Books</source><creator>Huang, Runzhen ; Ma, Kwan-Liu</creator><contributor>Boyle, Richard ; Bebis, George ; Parvin, Bahram ; Koracin, Darko</contributor><creatorcontrib>Huang, Runzhen ; Ma, Kwan-Liu ; Boyle, Richard ; Bebis, George ; Parvin, Bahram ; Koracin, Darko</creatorcontrib><description>We present a new hierarchical graph representation for volume data as well as its associated operations to enable interactive feature segmentation for high-resolution volume data. Our method constructs a low-resolution graph which represents a coarser resolution of the data. This graph enables the user to interactively sample and edit a feature of interest by drawing strokes on data slices. A subgraph representing the feature is derived with a growing process, and is used to extract the high-resolution version of the feature from the original volume data by performing an automatic mapping and refinement procedure. Our three-level, graph-based approach overcomes partial volume effects that are introduced by downsampling the volume data, and enables interactive segmentation of fine features. We demonstrate the effectiveness of this approach with several challenging 3D segmentation applications.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540307501</identifier><identifier>ISBN: 3540307508</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540322849</identifier><identifier>EISBN: 3540322841</identifier><identifier>DOI: 10.1007/11595755_18</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Artificial intelligence ; Boundary Voxels ; Computer science; control theory; systems ; Exact sciences and technology ; Feature Segmentation ; Fuzzy Segmentation ; Graph Node ; Interactive Segmentation ; Pattern recognition. Digital image processing. Computational geometry</subject><ispartof>Advances in Visual Computing, 2005, p.143-150</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2006 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11595755_18$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11595755_18$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=17413353$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Boyle, Richard</contributor><contributor>Bebis, George</contributor><contributor>Parvin, Bahram</contributor><contributor>Koracin, Darko</contributor><creatorcontrib>Huang, Runzhen</creatorcontrib><creatorcontrib>Ma, Kwan-Liu</creatorcontrib><title>A Three-Level Graph Based Interactive Volume Segmentation System</title><title>Advances in Visual Computing</title><description>We present a new hierarchical graph representation for volume data as well as its associated operations to enable interactive feature segmentation for high-resolution volume data. Our method constructs a low-resolution graph which represents a coarser resolution of the data. This graph enables the user to interactively sample and edit a feature of interest by drawing strokes on data slices. A subgraph representing the feature is derived with a growing process, and is used to extract the high-resolution version of the feature from the original volume data by performing an automatic mapping and refinement procedure. Our three-level, graph-based approach overcomes partial volume effects that are introduced by downsampling the volume data, and enables interactive segmentation of fine features. We demonstrate the effectiveness of this approach with several challenging 3D segmentation applications.</description><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Boundary Voxels</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Feature Segmentation</subject><subject>Fuzzy Segmentation</subject><subject>Graph Node</subject><subject>Interactive Segmentation</subject><subject>Pattern recognition. Digital image processing. Computational geometry</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540307501</isbn><isbn>3540307508</isbn><isbn>9783540322849</isbn><isbn>3540322841</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNUE1Lw0AUXL_AUnvyD-TiwUN0X3Y3m71Zi9ZCwEOr1_CSfWmj-WI3FvrvjVTQuczADMMwjF0DvwPO9T2AMkorlUFywmZGJ0JJLqIokeaUTSAGCIWQ5uzP41pxOGeTUUWh0VJcspn3H3yEgJhrPmEP82Czc0RhSnuqg6XDfhc8oicbrNqBHBZDtafgvau_GgrWtG2oHXCoujZYH_xAzRW7KLH2NPvlKXt7ftosXsL0dblazNOwj8AMoYXCIkbj_jIvIpWUpdIaeRzHESDmNjbWSspBxBZNQSrnvEBdai6RpFUopuzm2NujL7AuHbZF5bPeVQ26QwZaghBKjLnbY86PVrsll-Vd9-kz4NnPi9m_F8U3Vylefg</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Huang, Runzhen</creator><creator>Ma, Kwan-Liu</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>A Three-Level Graph Based Interactive Volume Segmentation System</title><author>Huang, Runzhen ; Ma, Kwan-Liu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p219t-d1cdaa2575fbc258ff577a066621aabd69dd4eb136da9ce5b00ca7f704ae4d5a3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Boundary Voxels</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Feature Segmentation</topic><topic>Fuzzy Segmentation</topic><topic>Graph Node</topic><topic>Interactive Segmentation</topic><topic>Pattern recognition. Digital image processing. Computational geometry</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Huang, Runzhen</creatorcontrib><creatorcontrib>Ma, Kwan-Liu</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Huang, Runzhen</au><au>Ma, Kwan-Liu</au><au>Boyle, Richard</au><au>Bebis, George</au><au>Parvin, Bahram</au><au>Koracin, Darko</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A Three-Level Graph Based Interactive Volume Segmentation System</atitle><btitle>Advances in Visual Computing</btitle><date>2005</date><risdate>2005</risdate><spage>143</spage><epage>150</epage><pages>143-150</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540307501</isbn><isbn>3540307508</isbn><eisbn>9783540322849</eisbn><eisbn>3540322841</eisbn><abstract>We present a new hierarchical graph representation for volume data as well as its associated operations to enable interactive feature segmentation for high-resolution volume data. Our method constructs a low-resolution graph which represents a coarser resolution of the data. This graph enables the user to interactively sample and edit a feature of interest by drawing strokes on data slices. A subgraph representing the feature is derived with a growing process, and is used to extract the high-resolution version of the feature from the original volume data by performing an automatic mapping and refinement procedure. Our three-level, graph-based approach overcomes partial volume effects that are introduced by downsampling the volume data, and enables interactive segmentation of fine features. We demonstrate the effectiveness of this approach with several challenging 3D segmentation applications.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11595755_18</doi><tpages>8</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Advances in Visual Computing, 2005, p.143-150
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_17413353
source Springer Books
subjects Applied sciences
Artificial intelligence
Boundary Voxels
Computer science
control theory
systems
Exact sciences and technology
Feature Segmentation
Fuzzy Segmentation
Graph Node
Interactive Segmentation
Pattern recognition. Digital image processing. Computational geometry
title A Three-Level Graph Based Interactive Volume Segmentation System
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T11%3A54%3A23IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20Three-Level%20Graph%20Based%20Interactive%20Volume%20Segmentation%20System&rft.btitle=Advances%20in%20Visual%20Computing&rft.au=Huang,%20Runzhen&rft.date=2005&rft.spage=143&rft.epage=150&rft.pages=143-150&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540307501&rft.isbn_list=3540307508&rft_id=info:doi/10.1007/11595755_18&rft_dat=%3Cpascalfrancis_sprin%3E17413353%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540322849&rft.eisbn_list=3540322841&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true