Freeman, H.[Herbert],
Davis, L.S.,
A Corner Finding Algorithm for Chain Coded Curves,
TC(26), 1977, pp. 297-303.
BibRef
7700
Freeman, H.[Herbert],
Shape Description via the Use of Critical Points,
PR(10), No. 3, 1978, pp. 159-166.
Elsevier DOI
BibRef
7800
Earlier:
PRIP77(168-177).
BibRef
Anderson, I.M.,
Bezdek, J.C.,
Curvature and Tangential Deflection of Discrete Arcs:
A Theory Based on the Commutator of Scatter Matrix Pairs and Its
Application to Vertex Detection in Planar Shape Data,
PAMI(6), No. 1, January 1984, pp. 27-40.
BibRef
8401
Beus, H.L.[H. Lynn],
Tiu, S.S.H.[Steven S. H.],
An Improved Corner Detection Algorithm Based on
Chain-Coded Plane Curves,
PR(20), No. 3, 1987, pp. 291-296.
Elsevier DOI
0309
BibRef
Baruch, O.[Orit],
Loew, M.H.[Murray H.],
Segmentation of Two-Dimensional Boundaries Using the Chain Code,
PR(21), No. 6, 1988, pp. 581-589.
Elsevier DOI Either straight segment or circular arc.
BibRef
8800
Liu, H.C.,
Srinath, M.D.,
Corner Detection from Chain-Code,
PR(23), No. 1-2, 1990, pp. 51-68.
Elsevier DOI Medioni-Yasumoto
See also Corner Detection and Curve Representation Using Cubic B-Splines. Beus-Tiu:
See also Improved Corner Detection Algorithm Based on Chain-Coded Plane Curves, An.
BibRef
9000
Sarkar, D.,
A Simple Algorithm for Detection of Significant Vertices for
Polygonal-Approximation of Chain-Coded Curves,
PRL(14), No. 12, December 1993, pp. 959-964.
BibRef
9312
Ray, B.K.,
Ray, K.S.,
A New Split-and-Merge Technique for Polygonal-Approximation
of Chain Coded Curves,
PRL(16), No. 2, February 1995, pp. 161-169.
See also New Approach to Polygonal Approximation, A.
BibRef
9502
Yuan, J.X.[Jian-Xing],
Suen, C.Y.[Ching Y.],
An Optimal O(N) Algorithm for Identifying Segments from a
Sequence of Chain Codes,
PR(28), No. 5, May 1995, pp. 635-646.
Elsevier DOI
BibRef
9505
Earlier:
An optimal algorithm for detecting straight lines in chain codes,
ICPR92(III:692-695).
IEEE DOI
9208
BibRef
Legault, R.,
Suen, C.Y.,
Optimal Local Weighted Averaging Methods in Contour Smoothing,
PAMI(19), No. 8, August 1997, pp. 801-817.
IEEE DOI
9709
Smoothing, Contours. Rather then just usnign Gaussian weights, focus on optimal local weights
depending on the goal (slopes, deviation angles, point positions).
BibRef
Koplowitz, J.[Jack],
Plante, S.[Stephen],
Corner Detection for Chain Coded Curves,
PR(28), No. 6, June 1995, pp. 843-852.
Elsevier DOI
BibRef
9506
Iñesta Quereda, J.M.[José Manuel],
Buendía Gómez, M.[Mateo],
Sarti, M.Á.[Mariá-Ángeles],
Local Symmetries of Digital Contours from Their Chain Codes,
PR(29), No. 10, October 1996, pp. 1737-1749.
Elsevier DOI
Curve Description.
Corner Detector.
BibRef
9610
Earlier: A1, A2, Only:
A simple algorithm to evaluate the local symmetry at each point of a
closed contour,
CAIP95(480-487).
Springer DOI
9509
BibRef
Arrebola, F.[Fabián],
Sandoval, F.[Francisco],
Corner detection and curve segmentation by multiresolution chain-code
linking,
PR(38), No. 10, October 2005, pp. 1596-1614.
Elsevier DOI
0508
BibRef
Hasan, H.[Haswadi],
Haron, H.[Habibollah],
Hashim, S.Z.[Siti Zaiton],
Omar, F.S.[Fakhrul Syakirin],
Logical Heuristic Algorithm in Extracting 2D Structure Thinned Binary
Image into Freeman Chain Code (FCC),
IVIC09(770-778).
Springer DOI
0911
BibRef
Pal, S.[Shyamosree],
Bhowmick, P.[Partha],
Estimation of discrete curvature based on chain-code pairing and
digital straightness,
ICIP09(1097-1100).
IEEE DOI
0911
BibRef
Mokhtari, M.[Marielle],
Bergevin, R.[Robert],
Straight Line Segments and Circular Arcs for Significant Description of
2D Contours,
SCIA97(xx-yy)
9705
HTML Version.
BibRef
Melen, T.[Trond],
Ozanian, T.[Takouhi],
A fast algorithm for dominant point detection on chain-coded contours,
CAIP93(245-253).
Springer DOI
9309
BibRef
Chen, Y.X.[Yu-Xin],
Cocquerez, J.P.[Jean Pierre], and
Deriche, R.[Rachid],
Non-Linear Filtering for Chaincoded Contours,
Robust90(xx).
BibRef
9000
Chapter on Edge Detection and Analysis, Lines, Segments, Curves, Corners, Hough Transform continues in
Parallel Algorithms, Curve Partition .