Loomis, R.G.,
Boundary networks,
CACM(8), No. 1, January 1965, pp. 44-48.
WWW Version.
BibRef
6501
Rosenfeld, A., and
Pfaltz, J.L.,
Sequential Operations in Digital Picture Processing,
JACM(13), No. 4, October 1966, pp. 471-494.
Connected Components.
WWW Version. 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.
WWW Version.
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., and
Levialdi, S.,
Picture Processing and Overlapping Blobs,
TC(20), No. 9, September 1971, pp. 1111.
BibRef
7109
Arcelli, C.,
Levialdi, S.,
On blob reconstruction,
CGIP(2), No. 1, August 1973, pp. 22-38.
WWW Version.
0501
BibRef
Shelman, C.B.,
The Application of List Processing Techniques to Picture Processing,
PR(4), No. 2, May 1972, pp. 201-210.
WWW Version.
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.,
Kruse, B.,
Checking Connectivity Preservation Properties of Some Types
of Picture Processing Operations,
CGIP(8), No. 2, October 1978, pp. 299-309.
WWW Version.
BibRef
7810
Chassery, J.M.,
Connectivity and Consecutivity in Digital Pictures,
CGIP(9), No. 3, March 1979, pp. 294-300.
WWW Version.
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.,
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.
WWW Version.
BibRef
8211
Montani, C.,
Region Representation: Parallel Connected Stripes,
CVGIP(28), No. 2, November 1984, pp. 139-165. (Pisa Italy)
WWW Version. 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., and
Zuniga, O.A.[Oscar A.],
A New Connected Components Algorithm for Virtual Memory Computers,
CVGIP(22), No. 2, May 1983, pp. 287-300.
WWW Version.
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.
WWW Version.
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., and
Robin, A.,
Linear Time Algorithm for Finding a Picture's
Connected Components,
IVC(2), No. 4, November 1984, pp. 191-197.
WWW Version.
BibRef
8411
Nakamura, A.[Akira],
Parallel Sigma-erasing array acceptors,
CGIP(14), No. 1, September 1980, pp. 80-86.
WWW Version.
0501
BibRef
Inoue, K.,
Takanami, I.,
Nakamura, A.,
Connected Pictures Are not Recognizable by Deterministic Two
Dimensional On-Line Tessellation Acceptors,
CVGIP(26), No. 1, April 1984, pp. 126-129.
WWW Version.
BibRef
8404
Dinstein, I.,
Yen, D.W.L., and
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
Atkinson, H.H.,
Gargantini, I.,
Walsh, T.R.S.,
Filling by Quadrants or Octants,
CVGIP(33), No. 2, February 1986, pp. 138-155.
WWW Version.
BibRef
8602
Ottmann, T.,
Wood, D.,
Space-Economical Plane-Sweep Algorithms,
CVGIP(34), No. 1, April 1986, pp. 35-51.
WWW Version.
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.
WWW Version.
0309
BibRef
Tang, G.Y.,
Lien, B.,
Region Filling with the Use of the Discrete Green Theorem,
CVGIP(42), No. 3, June 1988, pp. 297-305.
WWW Version.
BibRef
8806
Menon, S., and
Smith, T.R.,
Boundary Matching Algorithm for Connected Component Labelling
Using Linear Quadtrees,
IVC(6), No. 4, November 1988, pp. 215-224.
WWW Version.
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 Abstract. IEEE Top Reference.
WWW Version.
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., and
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.
WWW Version.
BibRef
8902
Ronse, C.,
Devijver, P.A.,
Connected Components in Binary Images: The Detection Problem,
WileyResearch Studies Press, 1984.
BibRef
8400
Samet, H.,
Connected Component Labeling Using Quadtrees,
JACM(28), No. 3, July 1981, pp. 487-501.
BibRef
8107
Samet, H., and
Tamminen, M.,
Efficient Component Labeling of Images of Arbitrary Dimension
Represented by Linear Bintrees,
PAMI(10), No. 4, July 1988, pp. 579-586.
IEEE Abstract. IEEE Top Reference.
WWW Version.
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., and
Beddoes, M.P.,
Fast Binary-Image Boundary Extraction,
CVGIP(38), No. 3, June 1987, pp. 229-257.
WWW Version. 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.,
Algorithms for Realtime Component Labelling of Images,
IVC(6), No. 1, February 1988, pp. 21-28.
WWW Version.
BibRef
8802
Shih, Z.C.,
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.
WWW Version.
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.,
Acharya, R.,
Connected Component Labeling With Linear Octree,
PR(24), No. 6, 1991, pp. 515-531.
WWW Version.
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 Abstract. IEEE Top Reference.
WWW Version.
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.
WWW Version.
BibRef
9303
Biswas, P.K.,
Mukherjee, J.,
Chatterji, B.N.,
Component Labeling In Pyramid Architecture,
PR(26), No. 7, July 1993, pp. 1099-1115.
WWW Version.
BibRef
9307
Olariu, S.,
Schwing, J.L.,
Zhang, J.,
Fast Component Labelling and Convex Hull Computation on
Reconfigurable Meshes,
IVC(11), No. 7, September 1993, pp. 447-455.
WWW Version.
BibRef
9309
Ziavras, S.G.,
Connected Component Labelling on the Blitzen
Massively Parallel Processor,
IVC(11), No. 10, December 1993, pp. 665-668.
WWW Version.
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).
WWW Version.
9208
BibRef
di Gesů, V.[Vito],
Mantaci, S.[Salvatore],
Tortorici, G.[Gaetano],
Compression of binary images based on covering,
CAIP95(568-573).
WWW Version.
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 Abstract. IEEE Top Reference.
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.
WWW Version.
BibRef
9501
Earlier:
A Systolic Architecture for Labeling the Connected
Components in Multi-Valued Images in Real Time,
CVPR93(136-141).
IEEE Abstract. IEEE Top Reference. 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., and
Bhattacharya, P.,
An O(log n) Parallel Algorithm for the Minimum Spanning Tree,
IPL(45), 1993, pp. 159-163.
BibRef
9300
Wang, Y.,
Bhattacharya, P.,
On Parameter-Dependent Connected Components of Gray Images,
PR(29), No. 8, August 1996, pp. 1359-1368.
WWW Version.
9608
See also Hierarchical Stereo Correspondence Using Features of Gray Connected Components.
BibRef
Wang, Y.,
Bhattacharya, P.,
An Algorithm to Find Parameter Dependent
Connected Components of Gray Images,
MGV(6), No. 3, 1997, pp. 325-340.
BibRef
9700
Bhattacharya, P.,
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.,
Higgins, J.,
Matrix Method for Finding Sets of Contiguous Non-Zero Elements
in a 2-Dimensional Array II,
PR(21), No. 5, 1988, pp. 451-453.
WWW Version.
BibRef
8800
Suk, M.,
Oh, S.,
Region Adjacency and Its Application to Object Detection,
PR(19), No. 2, 1986, pp. 161-167.
WWW Version.
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., and
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., and
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.
WWW Version.
0402Boundary 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.
WWW Version.
9703
BibRef
Salembier, P.,
Oliveras, A.,
Garrido, L.,
Antiextensive Connected Operators for Image And Sequence Processing,
IP(7), No. 4, April 1998, pp. 555-570.
WWW Version.
9804
BibRef
Casasent, D.,
Cox, W.,
Ri-Minace Filters to Augment Segmentation of Touching Objects,
PR(31), No. 9, September 1998, pp. 1311-1317.
WWW Version.
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.
WWW Version.
BibRef
9604
Bykov, A.I.[Alexander I.],
Zerkalov, L.G.[Leonid G.],
Velasco, F.J.A.,
Pineda, M.A.R.,
New Connected Components Algorithms and Invariant Transformations
of Digital Images,
PR(31), No. 8, August 1998, pp. 1089-1098.
WWW Version.
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.
WWW Version. 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.
WWW Version.
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.
WWW Version.
0202
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.
WWW Version.
0206
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. IEEE Top Reference.
0208CCITT 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.
WWW Version.
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).
WWW Version.
HTML Version.
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.
WWW Version.
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.
WWW Version.
0304
BibRef
Braga-Neto, U.[Ulisses],
Goutsias, J.[John],
A Theoretical Tour of Connectivity in Image Processing and Analysis,
JMIV(19), No. 1, July 2003, pp. 5-31.
WWW Version.
0307
BibRef
Braga-Neto, U.[Ulisses],
Goutsias, J.[John],
Grayscale level connectivity: theory and applications,
IP(13), No. 12, December 2004, pp. 1567-1580.
WWW Version.
0412
BibRef
Braga-Neto, U.[Ulisses],
Goutsias, J.[John],
Connectivity on Complete Lattices: New Results,
CVIU(85), No. 1, January 2002, pp. 22-53.
WWW Version.
0210
BibRef
Braga-Neto, U.[Ulisses],
Goutsias, J.[John],
A multiscale approach to connectivity,
CVIU(89), No. 1, January 2003, pp. 70-107.
WWW Version.
0301
BibRef
Braga-Neto, U.[Ulisses],
Goutsias, J.[John],
Object-based image analysis using multiscale connectivity,
PAMI(27), No. 6, June 2005, pp. 892-907.
IEEE Abstract. IEEE Top Reference.
0506
BibRef
Braga-Neto, U.[Ulisses],
Multiscale Connected Operators,
JMIV(22), No. 2-3, May 2005, pp. 199-216.
WWW Version.
0505
BibRef
Goutsias, J.,
Stochastic pyramids for multiscale signal synthesis and analysis,
ICIP94(I: 850-854).
WWW Version.
9411
BibRef
Goutsias, J.,
A Comparative Study of Two Useful Discrete-Valued Random Fields for the
Statistical Modeling of Images,
CVPR88(310-315).
IEEE Abstract. IEEE Top Reference.
BibRef
8800
Braga-Neto, U.[Ulisses],
Goutsias, J.[John],
Constructing multiscale connectivities,
CVIU(99), No. 1, July 2005, pp. 126-150.
WWW Version.
0506
BibRef
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.
WWW Version.
0402
BibRef
Chang, F.[Fu],
Chen, C.J.[Chun-Jen],
A component-labeling algorithm using contour tracing technique,
ICDAR03(741-745).
IEEE Abstract. IEEE Top Reference.
0311
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.
WWW Version.
0508
BibRef
Martín-Herrero, J.,
Hybrid object labelling in digital images,
MVA(18), No. 1, February 2007, pp. 1-15.
WWW Version.
0702Recursive 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.
WWW Version.
0702Mathematical 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.
WWW Version.
0810
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.
WWW Version.
0710
BibRef
Damiand, G.[Guillaume],
Arrivault, D.[Denis],
A New Contour Filling Algorithm Based on 2D Topological Map,
GbRPR07(319-329).
WWW Version.
0706
BibRef
Yan, P.K.[Ping-Kun],
Shah, M.[Mubarak],
Segmentation of Neighboring Structures by Modeling Their Interaction,
MMBIA06(77).
WWW Version.
0609
BibRef
Herley, C.,
Recursive method to extract rectangular objects from scans,
ICIP03(III: 989-992).
IEEE Abstract. IEEE Top Reference.
0312
BibRef
Sofou, A.,
Tzafestas, C.,
Maragos, P.,
Segmentation of Soil Section Images Using Connected Operators,
ICIP01(III: 1087-1090).
IEEE Abstract. IEEE Top Reference.
0108
BibRef
Doulamis, A.D.,
Doulamis, N.D.,
Maragos, P.,
Generalized Multiscale Connected Operators with Applications,
ICIP01(III: 684-687).
IEEE Abstract. IEEE Top Reference.
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).
WWW Version.
9909
BibRef
Kasvand, T.,
Total 8-connectivity on the square raster,
ICPR88(I: 354-356).
WWW Version.
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 Abstract. IEEE Top Reference.
WWW Version.
BibRef
9600
Biancardi, A.,
Merigot, A.,
Connected Component Support For Image Analysis Programs,
ICPR96(IV: 620-624).
WWW Version.
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).
WWW Version.
9608(Univ. de Nancy I, F)
BibRef
Wu, X.,
Kemeny, J.M.,
A segmentation method for multi-connected particle delineation,
WACV92(240-247).
IEEE Abstract. IEEE Top Reference.
0403
BibRef
Wang, Y.[Yang],
Bhattacharya, P.,
A theory of parameter-dependent connected components of gray images and
segmentation,
ICIP95(III: 69-72).
WWW Version.
9510
BibRef
Mandler, E., and
Oberlander, M.F.,
One-Pass Encoding of Connected Components in
Multi-Valued Images,
ICPR90(II: 64-69).
WWW Version.
BibRef
9000
Hattori, T.,
A High-Speed Pipeline Processor for Regional Labelling Based
on a New Algorithm,
ICPR90(II: 494-496).
WWW Version. 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).
WWW Version.
9006
BibRef
Maresca, M.,
Li, H.,
Lavin, M.,
Connected Component Labeling on Polymorphic Torus Architecture,
CVPR88(951-956).
IEEE Abstract. IEEE Top Reference. See also Polymorphic-Torus Architecture for Computer Vision.
BibRef
8800
Cortopassi, P.P.,
Rearick, T.C.,
A Computationally Efficient Algorithm for Shape Decomposition,
CVPR88(597-601).
IEEE Abstract. IEEE Top Reference.
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 .