Contour coding through stretching of discrete circular arcs by affine transformation

Pattern Recognition

Volumn 34, Issue 1, 2001, Pages 63-77

  Biswas, Sambhunath ^a  

^a INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

Affine; Arc; Coding; Comparison; Contour; Gaussian circle; Line; Stretching

Indexed keywords

BINARY IMAGES; CODES (SYMBOLS); ITERATIVE METHODS; PIXELS; STRETCHING; ALGORITHMS; FEATURE EXTRACTION; IMAGE ANALYSIS; IMAGE QUALITY; MATHEMATICAL TRANSFORMATIONS;

AFFINE; CODING; COMPARISON; CONTOUR; GAUSSIANS; LINE; AFFINE TRANSFORMATIONS; CONTOUR CODING;

IMAGE CODING;

EID: 0035192840     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(99)00208-3     Document Type: Article

References (21)

1. D.E. McClure, Copmutation of approximately optimal compressed representations of discrete plane curves, in: Proceedings of the IEEE Computer Society Conference on Pattern Recognition and Image Processing, 1977, pp. 175-182.
2. T.H. Morrin, Chain link compression of arbitrary black and white images, Comput. Graphics Image Process. 5 (1976) 172-189.
3. M.K. Kundu, B.B. Chaudhuri, D. Dutta Majumder, A generalized digital contour coding scheme, Comput. Vision Graphics and Image Process. 30 (1985) 269-278.
4. M. Eden, M. Kocher, On the performance of a contour coding algorithm in the context of image coding part I: contour segment coding, Signal Process. 8 (1985) 381-386.
5. S.N. Biswas, S.K. Pal, D.D. Majumder, Binary contour coding using Bezier approximation, Pattern Recognition Lett. 8 (1988) 237-249.
6. S. Biswas, S.K. Pal, Approximate coding of digital contours, IEEE Trans. System, Man Cybernet. 18 (1988) 1056-1066.
7. F. Ghorbel, M. Daoudi, A. Mokadem, O. Avaro, H. Sanson, Global planar rigid motion estimation applied to object-oriented coding, Proceedings of the ICPR, Vol. 2, 1996, 641-645.
8. F. Ghorbel, V. Burdin, Invariant approximation of star shaped form for medical application, in: P.J. Laurent, A.L. Mehaute, L.L. Schumaker (Eds.), Curves and Surfaces II, Academic Press, New York, 1994.
9. H. Freeman, Boundary encoding and processing, in: B.S. Lipkin, A. Rosenfeld (Eds.), Picture Processing and Psychopictories, Academic Press, New York, 1970.
10. A. Rosenfeld, Digital straight line segment, IEEE Trans. Comput. 23 (1974) 1264-1269.
11. L.D. Wu, On the chain code of a line, IEEE Trans. Pattern Anal. Mach. Intell. 3 (1982) 347-353.
12. R. Brons, Linguistic methods for description of a straight line on a grid, Comput. Graphics Image Process. 2 (1974) 48-62.
13. L. Hodes, Discrete approximation of continuous convex blobs, SIAM J. Appl. Math. 19 (1970) 477-485.
14. M. Doros, Algorithms for generation of discrete circle rings and disks, Comput. Graphics Image Process. 10 (1979) 366-371.
15. Z. Kulpa, M. Doros, Freeman digitization of integer circles minimizes the radial error, Comput. Graphics Image Process. 17 (1981) 181-184.
16. Z. Kulpa, On the properties of discrete circle rings and disks, Comput. Graphics Image Process. 10 (1979) 348-365.
17. B.W. Jordan, W.J. Lennon, B.D. Holm, An improved algorithm for the generation of nonparametric curves, IEEE Trans. Comput. 22 (1973) 1052-1062.
18. S.N. Biswas, B.B. Chaudhuri, On the generation of discrete circular objects and their properties, Comput. Vision, Graphics Image Process. 32 (1985) 158-170.
19. Z. Kulpa, Area and perimeter measurement of blobs in discrete binary pictures, Comput. Graphics Image Process. 6 (1977) 434-451.
20. J.E. Bresenham, Algorithm for computer control of a digital plotter, IBM System J. 4 (1965) 25-30.
21. C.H. Reinsch, Smoothing by spline functions, Numer. Math. 10 (1967) 177-183.