7.6 Extraction and Analysis of Connected Components and Boundaries

Loomis, R.G.,
Boundary networks,
CACM(8), No. 1, January 1965, pp. 44-48.
WWW Link. BibRef 6501

Rosenfeld, A., Pfaltz, J.L.,
Sequential Operations in Digital Picture Processing,
JACM(13), No. 4, October 1966, pp. 471-494. Connected Components.
WWW Link. The original connected components paper (standard algorithm). BibRef 6610

Rosenfeld, A.,
Connectivity in Digital Pictures,
JACM(17), No. 1, January 1970, pp. 146-160.
See also Thinning Algorithms for Gray-Scale Pictures. BibRef 7001

Rosenfeld, A.,
Arcs and Curves in Digital Pictures,
JACM(20), No. 1, January 1973, pp. 81-87. BibRef 7301

Rosenfeld, A.,
Adjacency in Digital Pictures,
InfoControl(26), September 1974. BibRef 7409 CMetImAly77(69-78). BibRef

Rosenfeld, A.,
On Connectivity Properties of Grayscale Pictures,
PR(16), No. 1, 1983, pp. 47-50.
Elsevier DOI 9611
BibRef

Janos, L., Rosenfeld, A.,
Digital Connectedness: An Algebraic Approach,
PRL(1), 1983, pp. 135-139. BibRef 8300

Melter, R.A., Rosenfeld, A.,
New Views of Linearity and Connectedness in Digital Geometry,
PRL(10), 1989, pp. 9-16. BibRef 8900

Arcelli, C.[Carlo], Levialdi, S.,
Picture Processing and Overlapping Blobs,
TC(20), No. 9, September 1971, pp. 1111. BibRef 7109

Arcelli, C.[Carlo], Levialdi, S.,
On blob reconstruction,
CGIP(2), No. 1, August 1973, pp. 22-38.
Elsevier DOI 0501
BibRef

Shelman, C.B.,
The Application of List Processing Techniques to Picture Processing,
PR(4), No. 2, May 1972, pp. 201-210.
Elsevier DOI BibRef 7205

Hirschberg, D.S., Chandra, A.K., and Sarwate, D.V.,
Computing Connected Components on Parallel Computers,
CACM(22), No. 8, August 1979, pp. 461-464. BibRef 7908

Kameswara Rao, C.V., Danielsson, P.E.[Per-Erik], Kruse, B.,
Checking Connectivity Preservation Properties of Some Types of Picture Processing Operations,
CGIP(8), No. 2, October 1978, pp. 299-309.
Elsevier DOI BibRef 7810

Chassery, J.M.,
Connectivity and Consecutivity in Digital Pictures,
CGIP(9), No. 3, March 1979, pp. 294-300.
Elsevier DOI no topology Z X Z in which the connected sets are exactly the 8-connected sets.
See also Topological Connectedness and 8-Connectedness in Digital Pictures. BibRef 7903

Cordella, L.P., di Paolo, A.,
Contour Filling for Region Extraction,
SP(3), No. 5, July 1981, pp. 247-252. BibRef 8107

Danielsson, P.E.[Per-Erik],
An Improved Segmentation and Coding Algorithm for Binary and Nonbinary Images,
IBMRD(26), No. 6, November 1982, pp. 698-707. Extended to multi-level, but not sequential. BibRef 8211

Distante, A., Veneziani, N.,
A Two-Pass Filling Algorithm for Raster Graphics,
CGIP(20), No. 3, November 1982, pp. 288-295.
Elsevier DOI Polygon filling. BibRef 8211

Montani, C.[Claudio],
Region Representation: Parallel Connected Stripes,
CVGIP(28), No. 2, November 1984, pp. 139-165. (Pisa Italy)
Elsevier DOI Representation of regions by stripes of a given width. This is meant as an alternative to the boundary encoding of the region which requires a lot of work to turn into a region. BibRef 8411

Lumia, R.[Ronald], Shapiro, L.G., Zuniga, O.A.[Oscar A.],
A New Connected Components Algorithm for Virtual Memory Computers,
CVGIP(22), No. 2, May 1983, pp. 287-300.
Elsevier DOI BibRef 8305
Earlier: PRIP82(560-565). The equivalence array is the flaw in using the standard method, it grows too large and causes excessive paging. Uses two passes, first the standard method with the equivalence array only for the given line, then update the line. Second, repeat essentially the same from the bottom up. BibRef

Lumia, R.[Ronald],
A New Three-Dimensional Connected Components Algorithm,
CVGIP(23), No. 2, August 1983, pp. 207-217.
Elsevier DOI BibRef 8308

Guibas, L.J., Stolfi, J.,
On Computing All North-East Nearest Neighbors in the L1 Metric,
IPL(16), 1983, pp. 219-233. BibRef 8300

Hambrusch, S.E.,
VLSI Algorithms for the Connected Component Problem,
SIAM_JC(12), 1983, pp. 354-365. BibRef 8300

Nath, D., Maheswari, S.N.,
Parallel Algorithms for the Connected Components and Minimal Spanning Tree Problems,
IPL(14), 1983, pp. 47-50. BibRef 8300

Imai, H.,
Finding Connected Components of an Intersection Graph of Squares in the Euclidean Plane,
IPL(15), 1983, pp. 125-128. BibRef 8300

Thanisch, P., McNally, B.V., Robin, A.,
Linear Time Algorithm for Finding a Picture's Connected Components,
IVC(2), No. 4, November 1984, pp. 191-197.
Elsevier DOI BibRef 8411

Nakamura, A.[Akira],
Parallel Sigma-erasing array acceptors,
CGIP(14), No. 1, September 1980, pp. 80-86.
Elsevier DOI 0501
BibRef

Inoue, K.[Katsushi], Takanami, I.[Itsuo], Nakamura, A.[Akira],
Connected Pictures Are not Recognizable by Deterministic Two Dimensional On-Line Tessellation Acceptors,
CVGIP(26), No. 1, April 1984, pp. 126-129.
Elsevier DOI BibRef 8404

Dinstein, I., Yen, D.W.L., Flickner, M.D.,
Handling Memory Overflow in Connected Component Labeling Applications,
PAMI(7), No. 1, January 1985, pp. 116-121. BibRef 8501
Earlier:
Eliminating Memory Overflow in Connected Component Labeling Applications,
IBMResearch Report RJ 3937, June 1983. BibRef

Flickner, M.D.[Myron D.], Mohiuddin, K.M.A.[Kottappuram M. Ali],
Method and means for efficiently handling boundary conditions in connected component labeling,
US_Patent4,791,676, Dec 13, 1988
WWW Link. BibRef 8812

Atkinson, H.H., Gargantini, I., Walsh, T.R.S.,
Filling by Quadrants or Octants,
CVGIP(33), No. 2, February 1986, pp. 138-155.
Elsevier DOI Quadtree. BibRef 8602

Ottmann, T.[Thomas], Wood, D.[Derick],
Space-Economical Plane-Sweep Algorithms,
CVGIP(34), No. 1, April 1986, pp. 35-51.
Elsevier DOI VLSI circuit analysis. BibRef 8604

Ferguson, Jr., M.M.[Merl M.],
Matrix method for finding sets of contiguous non-zero elements in a 2-dimensional array,
PR(19), No. 1, 1986, pp. 73.
Elsevier DOI 0309
BibRef

Tang, G.Y.[Gregory Y.], Lien, B.[Brian],
Region Filling with the Use of the Discrete Green Theorem,
CVGIP(42), No. 3, June 1988, pp. 297-305.
Elsevier DOI Region represented by Freeman code. BibRef 8806

Menon, S.[Sudhakar], Smith, T.R.[Terence R.],
Boundary Matching Algorithm for Connected Component Labelling Using Linear Quadtrees,
IVC(6), No. 4, November 1988, pp. 215-224.
Elsevier DOI BibRef 8811

Cypher, R.E., Sanz, J.L.C., Snyder, L.,
An EREW PRAM Algorithm for Image Component Labeling,
PAMI(11), No. 3, March 1989, pp. 258-262.
IEEE DOI BibRef 8903

Cypher, R.E., Sanz, J.L.C., Snyder, L.,
Algorithms for Image Component Labeling on SIMD Mesh-Connected Computers,
TC(39), No. 2, February 1990, pp. 276-281. Parallel Architectures. BibRef 9002

Manohar, M., Ramapriyan, H.K.,
Connected Component Labeling of Binary Images on a Mesh Connected Massively Parallel Processor,
CVGIP(45), No. 2, February 1989, pp. 133-149.
Elsevier DOI Parallel algorithm BibRef 8902

Ronse, C.[Christian], Devijver, P.A.,
Connected Components in Binary Images: The Detection Problem,
WileyResearch Studies Press, 1984. BibRef 8400

Ronse, C.[Christian],
Axiomatics for oriented connectivity,
PRL(47), No. 1, 2014, pp. 120-128.
Elsevier DOI 1408
Oriented path BibRef

Samet, H.,
Connected Component Labeling Using Quadtrees,
JACM(28), No. 3, July 1981, pp. 487-501. BibRef 8107

Samet, H., Tamminen, M.,
Efficient Component Labeling of Images of Arbitrary Dimension Represented by Linear Bintrees,
PAMI(10), No. 4, July 1988, pp. 579-586.
IEEE DOI BibRef 8807
Earlier:
An Improved Approach to Connected Component Labeling of Images,
CVPR86(312-318). (with correction page). Method to use a small equivalence table, applicable to quad-tree representations (surprise). Programs are included. BibRef

Lunscher, W.H.H.J., Beddoes, M.P.,
Fast Binary-Image Boundary Extraction,
CVGIP(38), No. 3, June 1987, pp. 229-257.
Elsevier DOI
See also Formal Description for Two-Dimensional Patterns, A. which used a 3X2 pixel operator to denote boundaries. This uses a larger operator. BibRef 8706

Lochovsky, A.F.[Amelia Fong],
Algorithms for Realtime Component Labelling of Images,
IVC(6), No. 1, February 1988, pp. 21-28.
Elsevier DOI Feature memory and image size. BibRef 8802

Shih, Z.C.[Zen-Chung], Lee, R.C.T., Yang, S.N.,
A Systolic Algorithm for Extracting Regions from a Planar Graph,
CVGIP(47), No. 2, August 1989, pp. 227-242.
Elsevier DOI O(n) time, O(n) processors, n is edges in graph. BibRef 8908

Han, Y., Wagner, R.A.,
An Efficient and Fast Parallel-Connected Component Algorithm,
JACM(37), No. 3, July 1990, pp. 626-642. BibRef 9007

Hecquard, J.[Jean], Acharya, R.[Raj],
Connected Component Labeling With Linear Octree,
PR(24), No. 6, 1991, pp. 515-531.
Elsevier DOI BibRef 9100

Dillencourt, M.B., Samet, H., Tamminen, M.,
A General Approach to Connected-Component Labeling for Arbitrary Image Representations,
JACM(39), No. 2, April 1992, pp. 253-280. BibRef 9204
And: Correction: JACM(39), No. 4, October 1992, pp. 985-986. BibRef

Alnuweiri, H.M., Prasanna, V.K.,
Parallel Architectures and Algorithms for Image Component Labeling,
PAMI(14), No. 10, October 1992, pp. 1014-1034.
IEEE DOI BibRef 9210

Embrechts, H.[Hugo], Roose, D.[Dirk], Wambacq, P.[Patrick],
Component Labelling on a MIMD Multiprocessor,
CVGIP(57), No. 2, March 1993, pp. 155-165.
DOI Link BibRef 9303

Biswas, P.K.[Prabir K.], Mukherjee, J.[Jayanta], Chatterji, B.N.,
Component Labeling In Pyramid Architecture,
PR(26), No. 7, July 1993, pp. 1099-1115.
Elsevier DOI BibRef 9307

Olariu, S.[Stephan], Schwing, J.L.[James L.], Zhang, J.Y.[Jing-Yuan],
Fast Component Labelling and Convex Hull Computation on Reconfigurable Meshes,
IVC(11), No. 7, September 1993, pp. 447-455.
Elsevier DOI Parallel, run in O(log n). BibRef 9309

Ziavras, S.G.[Sotirios G.],
Connected Component Labelling on the Blitzen Massively Parallel Processor,
IVC(11), No. 10, December 1993, pp. 665-668.
Elsevier DOI BibRef 9312

Chiavetta, F., di Gesu, V., Renda, R.,
A Parallel Algorithm for Analyzing Connected Components in Binary Images,
PRAI(6), 1992, pp. 315-333. BibRef 9200

Chiavetta, F., di Gesu, V.,
Digital connectedness via connectivity graph,
ICPR92(III:646-649).
IEEE DOI 9208
BibRef

di Gesù, V.[Vito], Mantaci, S.[Salvatore], Tortorici, G.[Gaetano],
Compression of binary images based on covering,
CAIP95(568-573).
Springer DOI 9509
BibRef

Yang, X.D.,
An Improved Algorithm for Labeling Connected Components in a Binary Image,
CVIP92(555-569). BibRef 9200
Earlier:
Design of Fast Connected Components Hardware,
CVPR88(937-944).
IEEE DOI BibRef

Thurfjell, L.[Lennart], Hengtsson, E.[Ewert], Nordin, B.[Bo],
A New Three-Dimensional Connected Components Labeling Algorithm with Simultaneous Object Feature Extraction Capability,
GMIP(54), No. 4, July 1992, pp. 357-364. BibRef 9207

Ranganathan, N., Mehrotra, R., Subramanian, S.,
A High-Speed Systolic Architecture for Labeling Connected Components in an Image,
SMC(25), No. 3, March 1995, pp. 415-423. BibRef 9503

Nicol, C.J.,
A Systolic Approach For Real-Time Connected Component Labeling,
CVIU(61), No. 1, January 1995, pp. 17-31.
DOI Link BibRef 9501
Earlier:
A Systolic Architecture for Labeling the Connected Components in Multi-Valued Images in Real Time,
CVPR93(136-141).
IEEE DOI Mostly the hardware implementation. BibRef

Dellepiane, S.G., Fontana, F.,
Extraction of Intensity Connectedness for Image-Processing,
PRL(16), No. 3, March 1995, pp. 313-324. BibRef 9503

Gavankar, P.S., Henderson, M.R.,
Graph-Based Extraction of 2-Connected Morphological Features from Boundary Representations,
JIM(6), No. 6, December 1995, pp. 401-413. BibRef 9512

Suraweera, F., Bhattacharya, P.,
An O(log n) Parallel Algorithm for the Minimum Spanning Tree,
IPL(45), 1993, pp. 159-163. BibRef 9300

Wang, Y.[Yang], Bhattacharya, P.[Prabir],
On Parameter-Dependent Connected Components of Gray Images,
PR(29), No. 8, August 1996, pp. 1359-1368.
Elsevier DOI 9608

See also Hierarchical Stereo Correspondence Using Features of Gray Connected Components. BibRef

Wang, Y.[Yang], Bhattacharya, P.[Prabir],
An Algorithm to Find Parameter Dependent Connected Components of Gray Images,
MGV(6), No. 3, 1997, pp. 325-340. BibRef 9700

Bhattacharya, P.[Prabir],
Connected Component Labeling for Binary Images on a Reconfigurable Mesh Architecture,
JSysArch(42), No. 4, November 10 1996, pp. 309-313. 9612
BibRef

Campbell, D.[Douglas], Higgins, J.[John],
Matrix Method for Finding Sets of Contiguous Non-Zero Elements in a 2-Dimensional Array II,
PR(21), No. 5, 1988, pp. 451-453.
Elsevier DOI BibRef 8800

Suk, M.S.[Min-Soo], Oh, S.J.[Seoung-Jun],
Region Adjacency and Its Application to Object Detection,
PR(19), No. 2, 1986, pp. 161-167.
Elsevier DOI BibRef 8600

Shi, H.,
Image Algebra Techniques for Binary Image Component Labeling with Local Operators,
JMIV(5), No. 2, June 1995, pp. 159-170. BibRef 9506

Lopez, M.A., Thurimella, R.,
On Computing Connected Components of Line Segments,
TC(44), 1995, pp. 597-601. BibRef 9500

Belkhale, K.P., Banerjee, P.,
Parallel Algorithms for Geometric Connected Component Labeling on a Hypercube Multiprocessor,
TC(41), 1992, pp. 699-709. BibRef 9200

Bloch, I.,
Fuzzy Connectivity and Mathematical Morphology,
PRL(14), 1993, pp. 483-488.
See also On fuzzy distances and their use in image processing under imprecision. BibRef 9300

Jiang, X.Y., Bunke, H.,
An Optimal Algorithm for Extracting the Regions of a Plane Graph,
PRL(14), 1993, pp. 553-558. BibRef 9300

Chaudhuri, B.B.,
Concave Fuzzy Set: A Concept Complementary to the Convex Fuzzy Set,
PRL(13), 1992, pp. 103-106. BibRef 9200

Chanda, B.,
Application of Binary Mathematical Morphology to Separate Overlapped Objects,
PRL(13), 1992, pp. 639-645. BibRef 9200

Ong, S.H., Jayasouriah, Yeow, H.H., and Sinniah, R.,
Decomposition of Digital Clumps into Convex Parts by Contour Tracing and Labelling,
PRL(13), 1992, pp. 789-795. BibRef 9200

Nakamura, A., Aizawa, K.,
Some Results Concerning Connected Fuzzy Digital Pictures,
PRL(12), 1991, pp. 335-341. BibRef 9100

Banerjee, S.,
An Optimal Algorithm to Find the Degrees of Connectedness in an Undirected Edge-Weighted Graph,
PRL(12), 1991, pp. 421-424. BibRef 9100

Mukherjee, J., Das, P.P., Chatterjee, B.N.,
On Connectivity Issues of Espta,
PRL(11), 1990, pp. 643-648. BibRef 9000

Saint-Marc, P., Hospital, M., Richetin, M.,
Pattern Recognition by Traversal of Connected Components of a Line Segments Field,
PRL(6), 1987, pp. 163-168. BibRef 8700

Phillips, T.H.,
A Shrinking Technique for Complex Object Decomposition,
PRL(3), 1985, pp. 271-277. BibRef 8500

Helterbrand, J.D., Davidson, J.L.D., Cressie, N.,
Optimal Closed Boundary Identification in Gray-Scale Imagery,
JMIV(5), No. 3, September 1995, pp. 179-205. BibRef 9509

Helterbrand, J.D.,
One-pixel-wide closed boundary identification,
IP(5), No. 5, May 1996, pp. 780-783.
IEEE DOI 0402
Boundary from segmented region. BibRef

Crespo, J., Schafer, R.W.,
Locality and Adjacency Stability Constraints for Morphological Connected Operators,
JMIV(7), No. 1, January 1997, pp. 85-102.
DOI Link 9703
BibRef

Crespo, J.[Jose],
Adjacency stable connected operators and set levelings,
IVC(28), No. 10, October 2010, pp. 1483-1490.
Elsevier DOI 1007
Image processing; Image analysis; Mathematical morphology; Connected operator; Adjacency stable operator; Leveling; Marker-based operator BibRef

Salembier, P., Oliveras, A., Garrido, L.,
Antiextensive Connected Operators for Image And Sequence Processing,
IP(7), No. 4, April 1998, pp. 555-570.
IEEE DOI 9804
Attribute filter Max-Tree approach. BibRef

Salembier, P.[Philippe],
Connected operators based on region-trees,
ICIP08(2176-2179).
IEEE DOI 0810
BibRef

Casasent, D.[David], Cox, W.[Westley],
Ri-Minace Filters to Augment Segmentation of Touching Objects,
PR(31), No. 9, September 1998, pp. 1311-1317.
Elsevier DOI 9808
BibRef

Bykov, A.I.[Alexander I.], Zerkalov, L.G.[Leonid G.],
Algorithms for Homotopy Classification of Binary Images,
PR(29), No. 4, April 1996, pp. 565-574.
Elsevier DOI BibRef 9604

Bykov, A.I.[Alexander I.], Zerkalov, L.G.[Leonid G.], Albores Velasco, F.J.[Francisco J.], Rodríguez Pineda, M.A.[Mario A.],
New Connected Components Algorithms and Invariant Transformations of Digital Images,
PR(31), No. 8, August 1998, pp. 1089-1098.
Elsevier DOI 9807
BibRef

Chen, T.[Tao], Chen, L.H.[Li-Hui],
Fast mapping algorithm for histogram to binary set conversion,
PRL(21), No. 10, October 2000, pp. 899-906. 0008
BibRef

Berengolts, A.[Alexander], Lindenbaum, M.[Michael],
On the Performance of Connected Components Grouping,
IJCV(41), No. 3, February-March 2001, pp. 195-216.
DOI Link Algorithm analysis 0105
BibRef

He, H.[Hao], Chen, Y.Q.[Yan Qiu],
Fuzzy aggregated connectedness for image segmentation,
PR(34), No. 12, December 2001, pp. 2565-2568.
Elsevier DOI 0110
BibRef

Ren, M.W.[Ming-Wu], Yang, J.Y.[Jing-Yu], Sun, H.[Han],
Tracing boundary contours in a binary image,
IVC(20), No. 2, February 2002, pp. 125-131.
Elsevier DOI 0202
Inner boundaries, space connectivity, fast. BibRef

Khanna, V.[Vikrant], Gupta, P.[Phalguni], Hwang, C.J.,
Finding connected components in digital images by aggressive reuse of labels,
IVC(20), No. 8, June 2002, pp. 557-568.
Elsevier DOI 0206
Address efficiency for large images. BibRef

Parker, G.J.M., Wheeler-Kingshott, C.A.M., Barker, G.J.,
Estimating distributed anatomical connectivity using fast marching methods and diffusion tensor imaging,
MedImg(21), No. 5, May 2002, pp. 505-512.
IEEE Top Reference. 0206
BibRef

Regentova, E.[Emma], Latifi, S.[Shahram], Deng, S.[Shulan], Yao, D.S.[Dong-Sheng],
An Algorithm with Reduced Operations for Connected Components Detection in ITU-T Group 3/4 Coded Images,
PAMI(24), No. 8, August 2002, pp. 1039-1047.
IEEE Abstract. 0208
CCITT FAX coding. BibRef

Suzuki, K.[Kenji], Horiba, I.[Isao], Sugie, N.[Noboru],
Linear-time connected-component labeling based on sequential local operations,
CVIU(89), No. 1, January 2003, pp. 1-23.
Elsevier DOI 0301
BibRef
Earlier:
Fast Connected-component Labeling Based on Sequential Local Operations in the Course of Forward Raster Scan Followed by Backward Raster Scan,
ICPR00(Vol II: 434-437).
IEEE DOI 0009
BibRef

Yang, Y.[Yang], Zhang, D.[David],
A novel line scan clustering algorithm for identifying connected components in digital images,
IVC(21), No. 5, 2003, pp. 459-472.
Elsevier DOI 0304
BibRef

Hashimoto, R.F.[Ronaldo Fumio], Barrera, J.[Junior],
A Greedy Algorithm for Decomposing Convex Structuring Elements,
JMIV(18), No. 3, May 2003, pp. 269-289.
DOI Link 0304
BibRef

Braga-Neto, U.M.[Ulisses M.], Goutsias, J.[John],
A Theoretical Tour of Connectivity in Image Processing and Analysis,
JMIV(19), No. 1, July 2003, pp. 5-31.
DOI Link 0307
BibRef

Braga-Neto, U.M.[Ulisses M.], Goutsias, J.[John],
Grayscale level connectivity: theory and applications,
IP(13), No. 12, December 2004, pp. 1567-1580.
IEEE DOI 0412
BibRef

Braga-Neto, U.M.[Ulisses M.], Goutsias, J.[John],
Connectivity on Complete Lattices: New Results,
CVIU(85), No. 1, January 2002, pp. 22-53.
DOI Link 0210
BibRef

Braga-Neto, U.M.[Ulisses M.], Goutsias, J.[John],
A multiscale approach to connectivity,
CVIU(89), No. 1, January 2003, pp. 70-107.
Elsevier DOI 0301
BibRef

Braga-Neto, U.M.[Ulisses M.], Goutsias, J.[John],
Object-based image analysis using multiscale connectivity,
PAMI(27), No. 6, June 2005, pp. 892-907.
IEEE Abstract. 0506
BibRef

Braga-Neto, U.M.[Ulisses M.],
Multiscale Connected Operators,
JMIV(22), No. 2-3, May 2005, pp. 199-216.
Springer DOI 0505
BibRef

Braga-Neto, U.M.[Ulisses M.], Goutsias, J.[John],
Constructing multiscale connectivities,
CVIU(99), No. 1, July 2005, pp. 126-150.
Elsevier DOI 0506
How to actually do it. BibRef

Goutsias, J.[John],
Stochastic pyramids for multiscale signal synthesis and analysis,
ICIP94(I: 850-854).
IEEE DOI 9411
BibRef

Goutsias, J.[John],
A Comparative Study of Two Useful Discrete-Valued Random Fields for the Statistical Modeling of Images,
CVPR88(310-315).
IEEE DOI BibRef 8800

Chang, F.[Fu], Chen, C.J.[Chun-Jen], Lu, C.J.[Chi-Jen],
A linear-time component-labeling algorithm using contour tracing technique,
CVIU(93), No. 2, February 2004, pp. 206-220.
Elsevier DOI 0402
BibRef
Earlier: A1, A2, Only:
A component-labeling algorithm using contour tracing technique,
ICDAR03(741-745).
IEEE DOI 0311
Include internal contours. BibRef

Hu, Q.M.[Qing-Mao], Qian, G.Y.[Guo-Yu], Nowinski, W.L.[Wieslaw L.],
Fast connected-component labelling in three-dimensional binary images based on iterative recursion,
CVIU(99), No. 3, September 2005, pp. 414-434.
Elsevier DOI 0508
BibRef

Kung, N.[Nina], Albertelli, L.E.[Lawrence E.], Ii, D.L.[David L.],
Grayscale image connected components segmentation,
US_Patent6,898,314, May 24, 2005
WWW Link. BibRef 0505

Martín-Herrero, J.,
Hybrid object labelling in digital images,
MVA(18), No. 1, February 2007, pp. 1-15.
Springer DOI 0702
Recursive connected component labeling. BibRef

Wilkinson, M.H.F.[Michael H.F.],
Attribute-space connectivity and connected filters,
IVC(25), No. 4, April 2007, pp. 426-435.
Elsevier DOI 0702
Mathematical morphology; Connectivity; Hyperconnectivity; Multi-scale analysis; Connected filters; Perceptual grouping BibRef

Wilkinson, M.H.F.[Michael H.F.], Gao, H.[Hui], Hesselink, W.H.[Wim H.], Jonker, J.E.[Jan-Eppo], Meijster, A.[Arnold],
Concurrent Computation of Attribute Filters on Shared Memory Parallel Machines,
PAMI(30), No. 10, October 2008, pp. 1800-1813.
IEEE DOI 0810
Applied to CT angiograms. Morphology implementation.
See also Attribute Openings, Thinnings, and Granulometries.
See also Antiextensive Connected Operators for Image And Sequence Processing. BibRef

Kazemier, J.J.[Jan J.], Ouzounis, G.K.[Georgios K.], Wilkinson, M.H.F.[Michael H. F.],
Connected Morphological Attribute Filters on Distributed Memory Parallel Machines,
ISMM17(357-368).
Springer DOI 1706
BibRef

Gazagnes, S., Wilkinson, M.H.F.[Michael H.F.],
Distributed Connected Component Filtering and Analysis in 2D and 3D Tera-Scale Data Sets,
IP(30), 2021, pp. 3664-3675.
IEEE DOI 2103
Vegetation, Dynamic range, Tools, Distributed databases, Merging, Forestry, Filtering, Mathematical morphology, component-Trees, high-performance computing BibRef

Allili, M.[Madjid], Corriveau, D.[David], Derivière, S.[Sara], Kaczynski, T.[Tomasz], Trahan, A.[Anik],
Discrete Dynamical System Framework for Construction of Connections between Critical Regions in Lattice Height Data,
JMIV(28), No. 2, June 2007, pp. 99-111.
Springer DOI 0710
BibRef

di Maio, G.[Giuseppe], Rodriguez-Lopez, J.[Jesus], Sanchez-Alvarez, J.M.[Jose Manuel],
Weak inclusions and digital spaces,
PRL(30), No. 1, 1 January 2009, pp. 39-45.
Elsevier DOI 0811
Digital space; Weak inclusion; Connectedness; Pretopology Pretopological space can be defined as in terms of either filters or a preclosure operator. BibRef

Soille, P.[Pierre], Vogt, P.[Peter],
Morphological segmentation of binary patterns,
PRL(30), No. 4, 1 March 2009, pp. 456-459.
Elsevier DOI 0903
Morphological image analysis; Pattern segmentation; Connectivity BibRef

Soille, P.[Pierre], Grazzini, J.[Jacopo],
Constrained Connectivity and Transition Regions,
ISMM09(59-69).
Springer DOI 0908
BibRef
Earlier:
Advances in Constrained Connectivity,
DGCI08(xx-yy).
Springer DOI 0804
BibRef

Aizawa, K.[Kunio], Tanaka, S.[Shojiro], Motomura, K.[Koyo], Kadowaki, R.[Ryosuke],
Algorithms for connected component labeling based on quadtrees,
IJIST(19), No. 2, June 2009, pp. 158-166.
DOI Link 0905

See also Constant-Time Algorithm for Finding Neighbors in Quadtrees, A. BibRef

He, L.F.[Li-Feng], Chao, Y.Y.[Yu-Yan], Suzuki, K.J.[Ken-Ji], Wu, K.S.[Ke-Sheng],
Fast connected-component labeling,
PR(42), No. 9, September 2009, pp. 1977-1987.
Elsevier DOI 0905
Labeling algorithm; Label equivalence; Connected component; Linear-time algorithm; Pattern recognition BibRef

Grana, C.[Costantino], Borghesani, D.[Daniele], Cucchiara, R.[Rita],
Optimized Block-Based Connected Components Labeling With Decision Trees,
IP(19), No. 6, June 2010, pp. 1596-1609.
IEEE DOI 1006
BibRef
Earlier:
Fast block based connected components labeling,
ICIP09(4061-4064).
IEEE DOI 0911
BibRef
And:
Connected Component Labeling Techniques on Modern Architectures,
CIAP09(816-824).
Springer DOI 0909

See also Decision Trees for Fast Thinning Algorithms. BibRef

Grana, C.[Costantino], Bolelli, F.[Federico], Baraldi, L.[Lorenzo], Vezzani, R.,
YACCLAB: Yet Another Connected Components Labeling Benchmark,
ICPR16(3109-3114)
IEEE DOI 1705
Algorithm design and analysis, Benchmark testing, Decision trees, Image resolution, Labeling, Licenses, Proposals BibRef

Grana, C.[Costantino], Baraldi, L.[Lorenzo], Bolelli, F.[Federico],
Optimized Connected Components Labeling with Pixel Prediction,
ACIVS16(431-440).
Springer DOI 1611
BibRef

Grana, C.[Costantino], Montangero, M.[Manulea], Borghesani, D.[Daniele], Cucchiara, R.[Rita],
Optimal Decision Trees Generation from OR-Decision Tables,
CIAP11(I: 443-452).
Springer DOI 1109
BibRef

Biswas, A.[Arindam], Bhowmick, P.[Partha], Bhattacharya, B.B.[Bhargab B.],
Construction of isothetic covers of a digital object: A combinatorial approach,
JVCIR(21), No. 4, May 2010, pp. 295-310.
Elsevier DOI 1006
Connected component; Digital geometry; Digital object; Isothetic cover; Isothetic polygon; Image processing; Pattern recognition; Shape analysis BibRef

Dutt, M.[Mousumi], Biswas, A.[Arindam], Bhowmick, P.[Partha], Bhattacharya, B.B.[Bhargab B.],
On the family of shortest isothetic paths in a digital object: An algorithm with applications,
CVIU(129), No. 1, 2014, pp. 75-88.
Elsevier DOI 1411
Shortest path BibRef

Dutt, M.[Mousumi], Biswas, A.[Arindam], Nagy, B.[Benedek],
Number of Shortest Paths in Triangular Grid for 1- and 2-Neighborhoods,
IWCIA15(115-124).
Springer DOI 1601
BibRef

de Bock, J., Philips, W.,
Fast and Memory Efficient 2-D Connected Components Using Linked Lists of Line Segments,
IP(19), No. 12, December 2010, pp. 3222-3231.
IEEE DOI 1011
BibRef

Thompson, R.J.[Rodney James], van Oosterom, P.[Peter],
Connectivity in the regular polytope representation,
GeoInfo(15), No. 2, April 2011, pp. 223-246.
WWW Link. 1103
BibRef

He, L.F.[Li-Feng], Chao, Y.Y.[Yu-Yan], Suzuki, K.[Kenji],
A Run-Based Two-Scan Labeling Algorithm,
IP(17), No. 5, May 2008, pp. 749-756.
IEEE DOI 0804
BibRef
Earlier: ICIAR07(131-142).
Springer DOI 0708
BibRef
And:
A Linear-Time Two-Scan Labeling Algorithm,
ICIP07(V: 241-244).
IEEE DOI 0709
BibRef

He, L.F.[Li-Feng], Chao, Y.Y.[Yu-Yan], Suzuki, K.[Kenji],
An efficient first-scan method for label-equivalence-based labeling algorithms,
PRL(31), No. 1, 1 January 2010, pp. 28-35.
Elsevier DOI 1001
Connected component; Labeling algorithm; First scan; Mask; Pattern recognition BibRef

He, L.F.[Li-Feng], Chao, Y.Y.[Yu-Yan], Suzuki, K.[Kenji], Itoh, H.[Hidenori],
A fast first-scan algorithm for label-equivalence-based connected-component labeling,
ICIP09(4013-4016).
IEEE DOI 0911
BibRef
And:
A Run-Based One-Scan Labeling Algorithm,
ICIAR09(93-102).
Springer DOI 0907
BibRef

He, L.F.[Li-Feng], Chao, Y.Y.[Yu-Yan], Suzuki, K.[Kenji],
Two Efficient Label-Equivalence-Based Connected-Component Labeling Algorithms for 3-D Binary Images,
IP(20), No. 8, August 2011, pp. 2122-2134.
IEEE DOI 1108
BibRef

He, L.F.[Li-Feng], Chao, Y.Y.[Yu-Yan],
A Very Fast Algorithm for Simultaneously Performing Connected-Component Labeling and Euler Number Computing,
IP(24), No. 9, September 2015, pp. 2725-2735.
IEEE DOI 1506
computational complexity BibRef

He, L.F.[Li-Feng], Zhao, X.[Xiao], Chao, Y.Y.[Yu-Yan], Suzuki, K.[Kenji],
Configuration-Transition-Based Connected-Component Labeling,
IP(23), No. 2, February 2014, pp. 943-951.
IEEE DOI 1402
edge detection BibRef

Lacassagne, L.[Lionel], Zavidovique, B.[Bertrand],
Light speed labeling: efficient connected component labeling on RISC architectures,
RealTimeIP(6), No. 2, June 2011, pp. 117-135.
WWW Link. 1101
Parallel Algorithms. BibRef
Earlier:
Light Speed Labeling for RISC architectures,
ICIP09(3245-3248).
IEEE DOI 0911
BibRef

Cabaret, L.[Laurent], Lacassagne, L.[Lionel],
What is the World's Fastest Connected Component Labeling Algorithm?,
SIPS15(xx-yy). 1505
BibRef

Cabaret, L.[Laurent], Lacassagne, L.[Lionel], Oudni, L.[Louiza],
A Review of World's Fastest Connected Component Labeling Algorithms: Speed and Energy Estimation,
DASIP14(xx-yy). 1505
BibRef

Sutheebanjard, P.[Phaisarn], Premchaiswadi, W.[Wichian],
Efficient scan mask techniques for connected components labeling algorithm,
JIVP(2011), No. 1 2011, pp. xx-yy.
DOI Link 1203
BibRef

Zhao, F.[Fei], Lu, H.Z.[Huan Zhang], Zhang, Z.Y.[Zhi Yong],
Real-time single-pass connected components analysis algorithm,
JIVP(2013), No. 1, 2013, pp. 21.
DOI Link 1305
BibRef

Song, Y.Q.[Yu-Qing],
Computation of level lines of 4-/8-connectedness,
JVCIR(25), No. 2, 2014, pp. 435-444.
Elsevier DOI 1402
Level line BibRef

Coeurjolly, D.[David], Kerautret, B.[Bertrand], Lachaud, J.O.[Jacques-Olivier],
Extraction of Connected Region Boundary in Multidimensional Images,
IPOL(2014), No. 2014, pp. 30-43.
DOI Link 1404
Code, Connected Components. BibRef

Carlinet, E.[Edwin], Géraud, T.[Thierry],
A Comparative Review of Component Tree Computation Algorithms,
IP(23), No. 9, September 2014, pp. 3885-3895.
IEEE DOI 1410
BibRef
Earlier:
A Comparison of Many Max-tree Computation Algorithms,
ISMM13(73-85).
Springer DOI 1305
filtering theory. for connectivity BibRef

Carlinet, E.[Edwin], Géraud, T.[Thierry],
MToS: A Tree of Shapes for Multivariate Images,
IP(24), No. 12, December 2015, pp. 5330-5342.
IEEE DOI 1512
BibRef
Earlier:
A Color Tree of Shapes with Illustrations on Filtering, Simplification, and Segmentation,
ISMM15(363-374).
Springer DOI 1506
BibRef
Earlier:
A Morphological Tree of Shapes for Color Images,
ICPR14(1132-1137)
IEEE DOI 1412
image colour analysis. Color BibRef

Esteban, B.[Baptiste], Tochon, G.[Guillaume], Géraud, T.[Thierry],
Estimating the Noise Level Function with the Tree of Shapes and Non-parametric Statistics,
CAIP19(II:377-388).
Springer DOI 1909
BibRef

Géraud, T.[Thierry], Carlinet, E.[Edwin], Crozet, S.[Sébastien],
Self-duality and Digital Topology: Links Between the Morphological Tree of Shapes and Well-Composed Gray-Level Images,
ISMM15(573-584).
Springer DOI 1506
BibRef

Géraud, T.[Thierry], Carlinet, E.[Edwin], Crozet, S.[Sébastien], Najman, L.[Laurent],
A Quasi-linear Algorithm to Compute the Tree of Shapes of nD Images,
ISMM13(98-110).
Springer DOI 1305
BibRef

Ôn Vu Ngoc, M.[Minh], Boutry, N.[Nicolas], Fabrizio, J.[Jonathan], Géraud, T.[Thierry],
A minimum barrier distance for multivariate images with applications,
CVIU(197-198), 2020, pp. 102993.
Elsevier DOI 2008
Vectorial Dahu pseudo-distance, Minimum barrier distance, Visual saliency, Object segmentation, Mathematical morphology, Tree of shapes BibRef

Molina-Abril, H.[Helena], Real, P.[Pedro], Nakamura, A.[Akira], Klette, R.[Reinhard],
Connectivity calculus of fractal polyhedrons,
PR(48), No. 4, 2015, pp. 1150-1160.
Elsevier DOI 1502
Connectivity BibRef

Perret, B.[Benjamin],
Inf-structuring Functions: A Unifying Theory of Connections and Connected Operators,
JMIV(51), No. 1, January 2015, pp. 171-194.
WWW Link. 1503
BibRef
Earlier:
Inf-structuring Functions and Self-dual Marked Flattenings in bi-Heyting Algebra,
ISMM13(365-376).
Springer DOI 1305
BibRef

Bejar, H.C.[Hans Ccacyahuillca], Miranda, P.[Paulo],
Oriented relative fuzzy connectedness: theory, algorithms, and its applications in hybrid image segmentation methods,
JIVP(2015), No. 1, 2015, pp. 21.
DOI Link 1508
BibRef

Zhao, X.[Xiao], He, L.F.[Li-Feng], Yao, B.[Bin], Chao, Y.Y.[Yu-Yan],
A New Connected-Component Labeling Algorithm,
IEICE(E98-D), No. 11, November 2015, pp. 2013-2016.
WWW Link. 1512
BibRef

He, L.F.[Li-Feng], Chao, Y.Y.[Yu-Yan], Suzuki, K.[Kenji],
A new algorithm for labeling connected-components and calculating the Euler number, connected-component number, and hole number,
ICPR12(3099-3102).
WWW Link. 1302
BibRef

Wilkinson, M.H.F.[Michael H.F.], Pesaresi, M.[Martino], Ouzounis, G.K.[Georgios K.],
An Efficient Parallel Algorithm for Multi-Scale Analysis of Connected Components in Gigapixel Images,
IJGI(5), No. 3, 2016, pp. 22.
DOI Link 1604
BibRef

Ciesielski, K.C.[Krzysztof Chris], Herman, G.T.[Gabor T.], Kong, T.Y.[T. Yung],
General Theory of Fuzzy Connectedness Segmentations,
JMIV(55), No. 3, July 2016, pp. 304-342.
Springer DOI 1604
BibRef
Earlier: A2, A3, A1:
Fuzzy Connectedness Segmentation: A Brief Presentation of the Literature,
IWCIA15(21-30).
Springer DOI 1601
BibRef

Klaiber, M.J., Bailey, D.G., Baroud, Y.O., Simon, S.,
A Resource-Efficient Hardware Architecture for Connected Component Analysis,
CirSysVideo(26), No. 7, July 2016, pp. 1334-1349.
IEEE DOI 1608
embedded systems BibRef

Guo, S.[Siyu], Zhou, W.F.[Wei-Fang], Wen, H.[He], Liang, M.X.[Meng-Xia],
Fast binary image set operations on a run-based representation,
PRL(80), No. 1, 2016, pp. 216-223.
Elsevier DOI 1609
Set operation BibRef

He, L.F.[Li-Feng], Ren, X.[Xiwei], Gao, Q.H.[Qi-Hang], Zhao, X.[Xiao], Yao, B.[Bin], Chao, Y.Y.[Yu-Yan],
The connected-component labeling problem: A review of state-of-the-art algorithms,
PR(70), No. 1, 2017, pp. 25-43.
Elsevier DOI 1706
Survey, Connected Components. Connected-component, labeling BibRef

He, L.F.[Li-Feng], Zhao, X.[Xiao], Yao, B.[Bin], Yang, Y.[Yun], Chao, Y.Y.[Yu-Yan], Shi, Z.H.[Zheng-Hao], Suzuki, K.[Kenji],
A combinational algorithm for connected-component labeling and Euler number computing,
RealTimeIP(13), No. 4, December 2017, pp. 703-712.
Springer DOI 1712
BibRef

He, L.F.[Li-Feng], Yao, B.[Bin], Zhao, X.[Xiao], Yang, Y.[Yun], Shi, Z.H.[Zheng-Hao], Kasuya, H.[Hideto], Chao, Y.Y.[Yu-Yan],
A fast algorithm for integrating connected-component labeling and euler number computation,
RealTimeIP(15), No. 4, December 2018, pp. 709-723.
Springer DOI
WWW Link. 1812
BibRef

Ohira, N.[Norihiro],
Memory-efficient 3D connected component labeling with parallel computing,
SIViP(12), No. 3, March 2018, pp. 429-436.
WWW Link. 1804
BibRef

Tang, J.W.[Jia Wei], Shaikh-Husin, N.[Nasir], Sheikh, U.U.[Usman Ullah], Marsono, M.N.,
A linked list run-length-based single-pass connected component analysis for real-time embedded hardware,
RealTimeIP(15), No. 1, June 2018, pp. 197-215.
Springer DOI 1806
BibRef

Asad, P.[Pedro], Marroquim, R.[Ricardo], Souza, A.L.E.L.[Andréa L.E.L.],
On GPU Connected Components and Properties: A Systematic Evaluation of Connected Component Labeling Algorithms and Their Extension for Property Extraction,
IP(28), No. 1, January 2019, pp. 17-31.
IEEE DOI 1810
feature extraction, graphics processing units, image segmentation, video signal processing, graphics processors BibRef

Yin, Y.[Yong], Li, C.M.[Cheng-Ming], Wu, P.D.[Peng-Da],
Dot Symbol Auto-Filling Method for Complex Areas Considering Shape Features,
IJGI(8), No. 3, 2019, pp. xx-yy.
DOI Link 1903
BibRef

Zhang, D.Y.[Dan-Yang], Ma, H.D.[Hua-Dong], Pan, L.Q.[Lin-Qiang],
A gamma-signal-regulated connected components labeling algorithm,
PR(91), 2019, pp. 281-290.
Elsevier DOI 1904
Connected components labeling, Object detection, Object recognition, Pattern recognition, Image analysis BibRef

Klaiber, M.J.[Michael J.], Bailey, D.G.[Donald G.], Simon, S.[Sven],
A single-cycle parallel multi-slice connected components analysis hardware architecture,
RealTimeIP(16), No. 4, August 2019, pp. 1165-1175.
WWW Link. 1908
BibRef

Klaiber, M.J.[Michael J.], Bailey, D.G.[Donald G.], Simon, S.[Sven],
Comparative Study and Proof of Single-Pass Connected Components Algorithms,
JMIV(61), No. 8, October 2019, pp. 1112-1134.
Springer DOI 1909
BibRef

Bolelli, F., Allegretti, S., Baraldi, L., Grana, C.,
Spaghetti Labeling: Directed Acyclic Graphs for Block-Based Connected Components Labeling,
IP(29), 2020, pp. 1999-2012.
IEEE DOI 2001
Decision trees, Prediction algorithms, Vegetation, Labeling, Image processing, Task analysis, Forestry, image processing BibRef

Bolelli, F.[Federico], Cancilla, M.[Michele], Baraldi, L.[Lorenzo], Grana, C.[Costantino],
Toward reliable experiments on the performance of Connected Components Labeling algorithms,
RealTimeIP(17), No. 2, April 2020, pp. 229-244.
Springer DOI 2004
BibRef

Diaz-del-Rio, F.[Fernando], Sanchez-Cuevas, P.[Pablo], Molina-Abril, H.[Helena], Real, P.[Pedro],
Parallel connected-Component-Labeling based on homotopy trees,
PRL(131), 2020, pp. 71-78.
Elsevier DOI 2004
Connected-Component-Labeling, Computational topology, Adjacency tree, Digital image, Parallelism BibRef

Zhao, C., Gao, W., Nie, F.,
A Memory-Efficient Hardware Architecture for Connected Component Labeling in Embedded System,
CirSysVideo(30), No. 9, September 2020, pp. 3238-3252.
IEEE DOI 2009
Hardware, Labeling, Memory management, Acceleration, System-on-chip, Random access memory, Connected component labeling (CCL), embedded system BibRef

Zhao, C.[Chen], Gao, W.[Wu], Nie, F.P.[Fei-Ping],
A Resource-Efficient Parallel Connected Component Labeling Algorithm and Its Hardware Implementation,
MultMed(23), 2021, pp. 4184-4197.
IEEE DOI 2112
Hardware, Labeling, Random access memory, Memory management, System-on-chip, Registers, Feature extraction, single-scan BibRef

Tao, R.[Rui], Qiao, J.[Jiangang],
Fast Component Tree Computation for Images of Limited Levels,
PAMI(45), No. 3, March 2023, pp. 3059-3071.
IEEE DOI 2302
Shape, Level set, Floods, Image segmentation, Transportation, Transforms, Image filtering, Level line, level set, component tree, image processing BibRef

Gazagnes, S.[Simon], Wilkinson, M.H.F.[Michael H.F.],
Parallel Attribute Computation for Distributed Component Forests,
ICIP22(601-605)
IEEE DOI 2211
Filtering, Buildings, Data visualization, Switches, Forestry, Mathematical morphology, Connected filters, Component trees, Parallel computing BibRef

Bolelli, F.[Federico], Allegretti, S.[Stefano], Grana, C.[Costantino],
Quest for Speed: The Epic Saga of Record-Breaking on OpenCV Connected Components Extraction,
Binary22(107-118).
Springer DOI 2208
BibRef

Lemaitre, F.[Florian], Maurice, N.[Nathan], Lacassagne, L.[Lionel],
An Efficient Run-Based Connected Component Labeling Algorithm for Processing Holes,
Binary22(119-131).
Springer DOI 2208
BibRef

Maurice, N.[Nathan], Lemaitre, F.[Florian], Sopena, J.[Julien], Lacassagne, L.[Lionel],
LSL3D: A Run-Based Connected Component Labeling Algorithm for 3D Volumes,
Binary22(132-142).
Springer DOI 2208
BibRef

Bolelli, F.[Federico], Allegretti, S.[Stefano], Grana, C.[Costantino],
Connected Components Labeling on Bitonal Images,
CIAP22(II:347-357).
Springer DOI 2205
BibRef

Banaeyan, M.[Majid], Kropatsch, W.G.[Walter G.],
Pyramidal Connected Component Labeling by Irregular Graph Pyramid,
IPRIA21(1-5)
IEEE DOI 2201
Image segmentation, Image analysis, Graphics processing units, Gray-scale, Hardware, Complexity theory, Topology, Image Processing, Connected Component Labeling BibRef

Söchting, M.[Maximilian], Allegretti, S.[Stefano], Bolelli, F.[Federico], Grana, C.[Costantino],
A Heuristic-Based Decision Tree for Connected Components Labeling of 3D Volumes,
ICPR21(7751-7758)
IEEE DOI 2105
Image processing, Pipelines, Manuals, Entropy, Partitioning algorithms, Pattern recognition BibRef

Bailey, D.G.,
History and Evolution of Single Pass Connected Component Analysis,
IVCNZ20(1-6)
IEEE DOI 2012
Couplings, Machine vision, Merging, Recycling, History, connected component analysis, feature extraction, stream processing BibRef

Aissou, B., Aissa, A.B.[A. Belhadj],
An Adapted Connected Component Labeling for Clustering Non-planar Objects From Airborne Lidar Point Cloud,
ISPRS20(B2:191-195).
DOI Link 2012
BibRef

Brimkov, B.[Boris], Brimkov, V.E.[Valentin E.],
On Connectedness of Discretized Sets,
IWCIA20(20-28).
Springer DOI 2009
BibRef

Wu, H., Zhang, J., Huang, K.,
SparseMask: Differentiable Connectivity Learning for Dense Image Prediction,
ICCV19(6767-6776)
IEEE DOI 2004
gradient methods, image segmentation, learning (artificial intelligence), neural net architecture, Network architecture BibRef

Allegretti, S.[Stefano], Bolelli, F.[Federico], Cancilla, M.[Michele], Pollastri, F.[Federico], Canalini, L.[Laura], Grana, C.[Costantino],
How Does Connected Components Labeling with Decision Trees Perform on GPUs?,
CAIP19(I:39-51).
Springer DOI 1909
BibRef

Allegretti, S.[Stefano], Bolelli, F.[Federico], Cancilla, M.[Michele], Grana, C.[Costantino],
A Block-Based Union-Find Algorithm to Label Connected Components on GPUs,
CIAP19(II:271-281).
Springer DOI 1909
BibRef

Bolelli, F., Baraldi, L., Cancilla, M., Grana, C.,
Connected Components Labeling on DRAGs,
ICPR18(121-126)
IEEE DOI 1812
Decision trees, Labeling, Task analysis, Computational modeling, Very large scale integration BibRef

Bolelli, F.[Federico], Cancilla, M.[Michele], Grana, C.[Costantino],
Two More Strategies to Speed Up Connected Components Labeling Algorithms,
CIAP17(II:48-58).
Springer DOI 1711
BibRef

Yang, S.[Shuo], Li, J.X.[Jian-Xun], Gu, Z.Y.[Zhang-Yuan],
Nonlocal mathematical morphology and spatially-variant connected operators,
ICVNZ15(1-6)
IEEE DOI 1701
algebra BibRef

Real, P.[Pedro], Díaz-del-Río, F.[Fernando], Onchis, D.M.[Darian M.],
Toward Parallel Computation of Dense Homotopy Skeletons for nD Digital Objects,
IWCIA17(142-155).
Springer DOI 1706
BibRef
Earlier: A2, A1, A3:
A Parallel Implementation for Computing the Region-Adjacency-Tree of a Segmentation of a 2D Digital Image,
GPID15(98-109).
Springer DOI 1603
BibRef

Santiago, D.J.C.[Diego J.C.], Ren, T.I.[Tsang Ing], Cavalcanti, G.D.C.[George D.C.], Jyh, T.I.[Tsang Ing],
Efficient 2X2 block-based connected components labeling algorithms,
ICIP15(4818-4822)
IEEE DOI 1512
Connected components labeling BibRef

Cabaret, L.[Laurent], Lacassagne, L.[Lionel], Etiemble, D.[Daniel],
Parallel Light Speed Labeling: an efficient connected component algorithm for labeling and analysis on multi-core processors,
RealTimeIP(15), No. 1, June 2018, pp. 173-196.
Springer DOI 1806
BibRef
Earlier:
Parallel light speed labeling: An efficient connected component labeling algorithm for multi-core processors,
ICIP15(3486-3489)
IEEE DOI 1512
BibRef
And:
Distanceless label propagation: An efficient direct connected component labeling algorithm for GPUs,
IPTA17(1-6)
IEEE DOI 1804
graphics processing units, multiprocessing systems, parallel architectures, DLP algorithms, DLP-GPU, Shape. Connected component labeling BibRef

Bosilj, P.[Petra], Kijak, E.[Ewa], Wilkinson, M.H.F.[Michael H.F.], Lefèvre, S.[Sébastien],
Short local descriptors from 2D connected pattern spectra,
ICIP15(1548-1552)
IEEE DOI 1512
BibRef
Earlier: A1, A3, A2, A4:
Local 2D Pattern Spectra as Connected Region Descriptors,
ISMM15(182-193).
Springer DOI 1506
CBIR; local region descriptors; max-tree; pattern spectra BibRef

Paravecino, F.N.[Fanny Nina], Kaeli, D.[David],
Accelerated Connected Component Labeling Using CUDA Framework,
ICCVG14(502-509).
Springer DOI 1410
BibRef

Aydogan, D.B.[Dogu Baran], Hyttinen, J.[Jari],
Contour tree connectivity of binary images from algebraic graph theory,
ICIP13(3054-3058)
IEEE DOI 1402
algebraic graph theory BibRef

Rasmusson, A., Sørensen, T.S., Ziegler, G.,
Connected Components Labeling on the GPU with Generalization to Voronoi Diagrams and Signed Distance Fields,
ISVC13(I:206-215).
Springer DOI 1310
BibRef

Brimkov, V.E.[Valentin E.],
On Connectedness of Discretized Objects,
ISVC13(I:246-254).
Springer DOI 1310
BibRef

Moschini, U.[Ugo], Trager, S.C.[Scott C.], Wilkinson, M.H.F.[Michael H. F.],
Mask Connectivity by Viscous Closings: Linking Merging Galaxies without Merging Double Stars,
ISMM13(484-495).
Springer DOI 1305
BibRef

Malmberg, F.[Filip], Strand, R.[Robin],
Faster Fuzzy Connectedness via Precomputation,
ISMM13(476-483).
Springer DOI 1305
BibRef

Berthé, V.[Valérie], Jamet, D.[Damien], Jolivet, T.[Timo], Provençal, X.[Xavier],
Critical Connectedness of Thin Arithmetical Discrete Planes,
DGCI13(107-118).
Springer DOI 1304
BibRef

Lewin, S.[Sergej], Jiang, X.Y.[Xiao-Yi], Clausing, A.[Achim],
Framework for quantitative performance evaluation of shape decomposition algorithms,
ICPR12(3696-3699).
WWW Link. 1302
BibRef

Asano, T.[Tetsuo], Bereg, S.[Sergey],
A New Framework for Connected Components Labeling of Binary Images,
IWCIA12(90-102).
Springer DOI 1211
BibRef

Riha, L.[Lubomir], Mareboyana, M.[Manohar],
GPU accelerated one-pass algorithm for computing minimal rectangles of connected components,
WACV11(479-484).
IEEE DOI 1101
BibRef

Wang, W.S.[Wen-Shan], Hung, Y.F.[Ya-Fei], Yang, J.K.[Jen-Kuei], Tseng, S.Y.[Shau-Yin],
The Dynamic Decision Switch for Multiple Pixel Connected Component Labeling Algorithm,
DICTA09(140-145).
IEEE DOI 0912
BibRef

Chen, L.[Li],
lambda-Connectedness Determination for Image Segmentation,
AIPR07(71-79).
IEEE DOI 0710
BibRef

Crespo, J.[Jose],
Levelings and Geodesic Reconstructions,
ISMM09(82-91).
Springer DOI 0908
BibRef

Roy, P.[Pradipta], Biswas, P.K.[Prabir Kumar],
VLSI Implementation of Fast Connected Component Labeling Using Finite State Machine Based Cell Network,
ICCVGIP08(238-243).
IEEE DOI 0812
BibRef

Matas, P., Dokládalová, E., Akil, M., Grandpierre, T., Najman, L., Poupa, M., Georgiev, V.,
Parallel Algorithm for Concurrent Computation of Connected Component Tree,
ACIVS08(xx-yy).
Springer DOI 0810
BibRef

Damiand, G.[Guillaume], Arrivault, D.[Denis],
A New Contour Filling Algorithm Based on 2D Topological Map,
GbRPR07(319-329).
Springer DOI 0706
BibRef

Yan, P.K.[Ping-Kun], Shah, M.[Mubarak],
Segmentation of Neighboring Structures by Modeling Their Interaction,
MMBIA06(77).
IEEE DOI 0609
BibRef

Herley, C.,
Recursive method to extract rectangular objects from scans,
ICIP03(III: 989-992).
IEEE DOI 0312
BibRef

Sofou, A., Tzafestas, C., Maragos, P.,
Segmentation of Soil Section Images Using Connected Operators,
ICIP01(III: 1087-1090).
IEEE DOI 0108
BibRef

Doulamis, A.D., Doulamis, N.D., Maragos, P.,
Generalized Multiscale Connected Operators with Applications,
ICIP01(III: 684-687).
IEEE DOI 0108
BibRef

Arnaud, G.M., Lamure, M., Terrenoire, M., Tounissoux, D.,
Analysis of the Connectivity of an Object in a Binary Image: Pretopological Approach,
ICPR86(1204-1206). BibRef 8600

di Stefano, L., Bulgarelli, A.,
A simple and efficient connected components labeling algorithm,
CIAP99(322-327).
IEEE DOI 9909
BibRef

Kasvand, T.,
Total 8-connectivity on the square raster,
ICPR88(I: 354-356).
IEEE DOI 8811
BibRef

Kasvand, T., Otsu, N.,
Segmentation of Thinned Binary Scenes with Good Connectivity Algorithms,
ICPR84(297-300). BibRef 8400
And:
Recognition of Line Shapes Based on Thinning, Segmentation with Good Connectivity Algorithms, and Regularization,
ICPR84(497-500). BibRef

Auran, P.G.[Per G.], Malvig, K.E.[Kjell E.],
Realtime Extraction of Connected Component in 3D Sonar Range Images,
CVPR96(580-585).
IEEE DOI BibRef 9600

Biancardi, A., Merigot, A.,
Connected Component Support For Image Analysis Programs,
ICPR96(IV: 620-624).
IEEE DOI 9608
(Univ. Paris Sud, F) BibRef

Mozef, E., Weber, S., Jaber, J., Tisserand, E.,
Parallel Architecture Dedicated to Connected Component Analysis,
ICPR96(IV: 699-703).
IEEE DOI 9608
(Univ. de Nancy I, F) BibRef

Wu, X., Kemeny, J.M.,
A segmentation method for multi-connected particle delineation,
WACV92(240-247).
IEEE DOI 0403
BibRef

Wang, Y.[Yang], Bhattacharya, P.,
A theory of parameter-dependent connected components of gray images and segmentation,
ICIP95(III: 69-72).
IEEE DOI 9510
BibRef

Mandler, E., Oberlander, M.F.,
One-Pass Encoding of Connected Components in Multi-Valued Images,
ICPR90(II: 64-69).
IEEE DOI BibRef 9000

Hattori, T.,
A High-Speed Pipeline Processor for Regional Labelling Based on a New Algorithm,
ICPR90(II: 494-496).
IEEE DOI About the hardware, not the algorithm. BibRef 9000

Shima, Y., Murakami, T., Koga, M., Yashiro, H., Fujisawa, H.,
A high-speed algorithm for propagation-type labeling based on block sorting of runs in binary images,
ICPR90(I: 655-658).
IEEE DOI 9006
BibRef

Maresca, M., Li, H., Lavin, M.,
Connected Component Labeling on Polymorphic Torus Architecture,
CVPR88(951-956).
IEEE DOI
See also Polymorphic-Torus Architecture for Computer Vision. BibRef 8800

Tucker, L.W.,
Labeling Connected Components on a Massively Parallel Tree Machine,
CVPR86(124-129). The algorithm applies only to a tree machine, it uses processors ineffectively. BibRef 8600

Zahn, C.T.,
A Formal Description for Two-Dimensional Patterns,
IJCAI69(621-628). BibRef 6900
And: CMetImAly77(263-270). BibRef

And:
See also Sequential Approach to the Extraction of Shape Features, A.

Chapter on 2-D Feature Analysis, Extraction and Representations, Shape, Skeletons, Texture continues in
Two Dimensional Data Representations, Image Order .