An improved area open and close algorithm based on neighbor level sets
An improved AOC algorithm aiming at the inefficiency of original AOC operations is proposed in this paper. After extraction of the level set of the lowest gray in foreground, area open (close) operation is carried out, whose result is then compared with the original image, resulting in the level set...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 568 |
|---|---|
| container_issue | |
| container_start_page | 565 |
| container_title | |
| container_volume | 1 |
| creator | Chen Jian Zhou Li-li Shi Hong-gang |
| description | An improved AOC algorithm aiming at the inefficiency of original AOC operations is proposed in this paper. After extraction of the level set of the lowest gray in foreground, area open (close) operation is carried out, whose result is then compared with the original image, resulting in the level set of next gray level. Iterative goes on in an order from low level to high one, until the final result is achieved. Experiment results show that this algorithm can remove lots of small regions earlier. It improved the efficiency obviously, preserving an equal effect of the original method. |
| doi_str_mv | 10.1109/ISCIT.2005.1566918 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1566918</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1566918</ieee_id><sourcerecordid>1566918</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-f8a0d75976a8fa76775390da5c4e426195087d5f3f3e300bb576808feefa1ce23</originalsourceid><addsrcrecordid>eNotj81Kw0AUhQdEUGpeQDfzAol3Mp2_ZQlWAwUX1nW5Se60I_ljJhR8ewP2cODbHD44jD0LKIQA91p_VfWxKAFUIZTWTtg7ljljYa10SlrxwLKUfmCNdNJo8cj2u5GHYY7TlTqOkZBPM40cx463_ZSIY3-eYlguA28wrZtp5COF86WZIu_pSj1PtKQndu-xT5TduGHf-7dj9ZEfPt_ranfIgzBqyb1F6IxyRqP1aLQxSjroULVb2pZaOAXWdMpLL0kCNI0y2oL1RB5FS6XcsJd_byCi0xzDgPH3dHsr_wCM7UpZ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>An improved area open and close algorithm based on neighbor level sets</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Chen Jian ; Zhou Li-li ; Shi Hong-gang</creator><creatorcontrib>Chen Jian ; Zhou Li-li ; Shi Hong-gang</creatorcontrib><description>An improved AOC algorithm aiming at the inefficiency of original AOC operations is proposed in this paper. After extraction of the level set of the lowest gray in foreground, area open (close) operation is carried out, whose result is then compared with the original image, resulting in the level set of next gray level. Iterative goes on in an order from low level to high one, until the final result is achieved. Experiment results show that this algorithm can remove lots of small regions earlier. It improved the efficiency obviously, preserving an equal effect of the original method.</description><identifier>ISBN: 9780780395381</identifier><identifier>ISBN: 0780395387</identifier><identifier>DOI: 10.1109/ISCIT.2005.1566918</identifier><language>eng</language><publisher>IEEE</publisher><subject>Digital images ; Filters ; Image retrieval ; Image segmentation ; Level set ; Morphology ; Noise generators ; Noise level ; Noise shaping ; Shape</subject><ispartof>IEEE International Symposium on Communications and Information Technology, 2005. ISCIT 2005, 2005, Vol.1, p.565-568</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1566918$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,777,781,786,787,2052,4036,4037,27906,54901</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1566918$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Chen Jian</creatorcontrib><creatorcontrib>Zhou Li-li</creatorcontrib><creatorcontrib>Shi Hong-gang</creatorcontrib><title>An improved area open and close algorithm based on neighbor level sets</title><title>IEEE International Symposium on Communications and Information Technology, 2005. ISCIT 2005</title><addtitle>ISCIT</addtitle><description>An improved AOC algorithm aiming at the inefficiency of original AOC operations is proposed in this paper. After extraction of the level set of the lowest gray in foreground, area open (close) operation is carried out, whose result is then compared with the original image, resulting in the level set of next gray level. Iterative goes on in an order from low level to high one, until the final result is achieved. Experiment results show that this algorithm can remove lots of small regions earlier. It improved the efficiency obviously, preserving an equal effect of the original method.</description><subject>Digital images</subject><subject>Filters</subject><subject>Image retrieval</subject><subject>Image segmentation</subject><subject>Level set</subject><subject>Morphology</subject><subject>Noise generators</subject><subject>Noise level</subject><subject>Noise shaping</subject><subject>Shape</subject><isbn>9780780395381</isbn><isbn>0780395387</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj81Kw0AUhQdEUGpeQDfzAol3Mp2_ZQlWAwUX1nW5Se60I_ljJhR8ewP2cODbHD44jD0LKIQA91p_VfWxKAFUIZTWTtg7ljljYa10SlrxwLKUfmCNdNJo8cj2u5GHYY7TlTqOkZBPM40cx463_ZSIY3-eYlguA28wrZtp5COF86WZIu_pSj1PtKQndu-xT5TduGHf-7dj9ZEfPt_ranfIgzBqyb1F6IxyRqP1aLQxSjroULVb2pZaOAXWdMpLL0kCNI0y2oL1RB5FS6XcsJd_byCi0xzDgPH3dHsr_wCM7UpZ</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Chen Jian</creator><creator>Zhou Li-li</creator><creator>Shi Hong-gang</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2005</creationdate><title>An improved area open and close algorithm based on neighbor level sets</title><author>Chen Jian ; Zhou Li-li ; Shi Hong-gang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-f8a0d75976a8fa76775390da5c4e426195087d5f3f3e300bb576808feefa1ce23</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Digital images</topic><topic>Filters</topic><topic>Image retrieval</topic><topic>Image segmentation</topic><topic>Level set</topic><topic>Morphology</topic><topic>Noise generators</topic><topic>Noise level</topic><topic>Noise shaping</topic><topic>Shape</topic><toplevel>online_resources</toplevel><creatorcontrib>Chen Jian</creatorcontrib><creatorcontrib>Zhou Li-li</creatorcontrib><creatorcontrib>Shi Hong-gang</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Chen Jian</au><au>Zhou Li-li</au><au>Shi Hong-gang</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>An improved area open and close algorithm based on neighbor level sets</atitle><btitle>IEEE International Symposium on Communications and Information Technology, 2005. ISCIT 2005</btitle><stitle>ISCIT</stitle><date>2005</date><risdate>2005</risdate><volume>1</volume><spage>565</spage><epage>568</epage><pages>565-568</pages><isbn>9780780395381</isbn><isbn>0780395387</isbn><abstract>An improved AOC algorithm aiming at the inefficiency of original AOC operations is proposed in this paper. After extraction of the level set of the lowest gray in foreground, area open (close) operation is carried out, whose result is then compared with the original image, resulting in the level set of next gray level. Iterative goes on in an order from low level to high one, until the final result is achieved. Experiment results show that this algorithm can remove lots of small regions earlier. It improved the efficiency obviously, preserving an equal effect of the original method.</abstract><pub>IEEE</pub><doi>10.1109/ISCIT.2005.1566918</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 9780780395381 |
| ispartof | IEEE International Symposium on Communications and Information Technology, 2005. ISCIT 2005, 2005, Vol.1, p.565-568 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_1566918 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Digital images Filters Image retrieval Image segmentation Level set Morphology Noise generators Noise level Noise shaping Shape |
| title | An improved area open and close algorithm based on neighbor level sets |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T15%3A22%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=An%20improved%20area%20open%20and%20close%20algorithm%20based%20on%20neighbor%20level%20sets&rft.btitle=IEEE%20International%20Symposium%20on%20Communications%20and%20Information%20Technology,%202005.%20ISCIT%202005&rft.au=Chen%20Jian&rft.date=2005&rft.volume=1&rft.spage=565&rft.epage=568&rft.pages=565-568&rft.isbn=9780780395381&rft.isbn_list=0780395387&rft_id=info:doi/10.1109/ISCIT.2005.1566918&rft_dat=%3Cieee_6IE%3E1566918%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1566918&rfr_iscdi=true |