Fourier Coding of Image Boundaries

Authors:
R. Chellappa;R. Bagdazian
Affiliations:
Department of Electrical Engineering and the Image Processing Institute, University of Southern California, Los Angeles, CA 90089.;Radar Systems Group, Advanced Projects Division, Hughes Aircraft Company, El Segundo, CA.
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1984

Citing 0
Cited 3

Shape modeling via local curvature scale

Pattern Recognition Letters
Classification and numbering of teeth in dental bitewing images

Pattern Recognition
Bag-of-GraphPaths descriptors for symbol recognition and spotting in line drawings

GREC'11 Proceedings of the 9th international conference on Graphics Recognition: new trends and challenges

Quantified Score

Hi-index	0.14

Visualization

Abstract

A transform coding scheme for closed image boundaries on a plane is described. The given boundary is approximated by a series of straight line segments. Depending on the shape, the boundary is represented by the (x-y) coordinates of the endpoints of the line segments or by the magnitude of the successive radii vectors that are equispaced in angle around the given boundary. Due to the circularity present in the data, the discrete Fourier transform is used to exactly decorrelate the finite boundary data. By fitting a Gaussian circular autoregressive model to represent the boundary data, estimates of the variances of the Fourier coefficients are obtained. Using the variances of the Fourier coefficients and the MAX quantizer, the coding scheme is implemented. The scheme is illustrated by an example.