Fast and memory efficient 2-D connected components using linked lists of line segments

In this paper we present a more efficient approach to the problem of finding the connected components in binary images. In conventional connected components algorithms, the main data structure to compute and store the connected components is the region label image. We replace the region label image...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 19(2010), 12 vom: 03. Dez., Seite 3222-31
1. Verfasser: De Bock, Johan (VerfasserIn)
Weitere Verfasser: Philips, Wilfried
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2010
Zugriff auf das übergeordnete Werk:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM198846134
003 DE-627
005 20231223213507.0
007 cr uuu---uuuuu
008 231223s2010 xx |||||o 00| ||eng c
024 7 |a 10.1109/TIP.2010.2052826  |2 doi 
028 5 2 |a pubmed24n0663.xml 
035 |a (DE-627)NLM198846134 
035 |a (NLM)20550991 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a De Bock, Johan  |e verfasserin  |4 aut 
245 1 0 |a Fast and memory efficient 2-D connected components using linked lists of line segments 
264 1 |c 2010 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 21.06.2011 
500 |a Date Revised 16.11.2010 
500 |a published: Print-Electronic 
500 |a Citation Status MEDLINE 
520 |a In this paper we present a more efficient approach to the problem of finding the connected components in binary images. In conventional connected components algorithms, the main data structure to compute and store the connected components is the region label image. We replace the region label image with a singly-linked list of line segments (or runs) for each region. This enables us to design a very fast and memory efficient connected components algorithm. Most conventional algorithms require (at least) two raster scans. Those that only need one raster scan, require irregular and unbounded image access. The proposed algorithm is a single pass regular access algorithm and only requires access to the three most recently processed image lines at any given time. Experimental results demonstrate that our algorithm is considerably faster than the fastest conventional algorithm. Additionally, our novel region coding data structure uses much less memory in typical cases than the traditional region label image. Even in worst case situations the processing time of our algorithm is linear with the number of pixels in an image 
650 4 |a Journal Article 
700 1 |a Philips, Wilfried  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society  |d 1992  |g 19(2010), 12 vom: 03. Dez., Seite 3222-31  |w (DE-627)NLM09821456X  |x 1941-0042  |7 nnns 
773 1 8 |g volume:19  |g year:2010  |g number:12  |g day:03  |g month:12  |g pages:3222-31 
856 4 0 |u http://dx.doi.org/10.1109/TIP.2010.2052826  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 19  |j 2010  |e 12  |b 03  |c 12  |h 3222-31