Stochastic models for closed boundary analysis: Representation and reconstruction

The analysis of closed boundaries of arbitrary shapes on a plane is discussed. Specifically, the problems of representation and reconstruction are considered. A one-to-one correspondence between the given closed boundary and a univariate or multivariate sequence of real numbers is set up. Univariate or multivariate circular autoregressive models are suggested for the representation of the sequence of numbers derived from the closed boundary. The stochastic model representing the closed boundary is invariant to transformations like sealing, translation, choice of starting point, and rotation over angles that are multiples of 2\pi/N , where N is the number of observations. Methods for estimating the unknown parameters of the model are given and a decision rule for choosing the appropriate number of coefficients is included. Constraints on the estimates are derived so that the estimates are invariant to the transformations of the boundaries. The stochastic model enables the reconstruction of a dosed boundary using FFT algorithms. Results of simulations are included and the application to contour coding is discussed.

[1]  D. N. Graham.  Image transmission by two-dimensional contour coding , 1967 .

[2]  Rangasami L. Kashyap,et al.  Optimal feature selection and decision rules in classification problems with time series , 1978, IEEE Trans. Inf. Theory.

[3]  Harry Wechsler,et al.  Finding the rib cage in chest radiographs , 1977, Pattern Recognit..

[4]  King-Sun Fu,et al.  Shape Discrimination Using Fourier Descriptors , 1977, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Ian T. Young,et al.  An Analysis Technique for Biological Shape. I , 1974, Inf. Control..

[6]  Robert B. McGhee,et al.  Aircraft Identification by Moment Invariants , 1977, IEEE Transactions on Computers.

[7]  Harry G. Barrow,et al.  A Versatile System for Computer-Controlled Assembly , 1975, Artif. Intell..

[8]  Ming-Kuei Hu,et al.  Visual pattern recognition by moment invariants , 1962, IRE Trans. Inf. Theory.

[9]  Herbert Freeman,et al.  Computer Processing of Line-Drawing Images , 1974, CSUR.

[10]  André Oosterlinck,et al.  Evaluation of different profile description and decomposition methods for banded chromosomes , 1976 .

[11]  Theodosios Pavlidis,et al.  Structural pattern recognition , 1977 .

[12]  R. Kashyap.  A Bayesian comparison of different classes of dynamic models using empirical data , 1977 .

[13]  Hooshang Hemami,et al.  Identification of Three-Dimensional Objects Using Fourier Descriptors of the Boundary Curve , 1974, IEEE Trans. Syst. Man Cybern..

[14]  Ralph Roskies,et al.  Fourier Descriptors for Plane Closed Curves , 1972, IEEE Transactions on Computers.

[15]  Theodosios Pavlidis,et al.  A review of algorithms for shape analysis , 1978 .

[16]  Joel Max,et al.  Quantizing for minimum distortion , 1960, IRE Trans. Inf. Theory.

[17]  Theodosios Pavlidis,et al.  Algorithms for Shape Analysis of Contours and Waveforms , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  Gösta H. Granlund,et al.  Fourier Preprocessing for Hand Print Character Recognition , 1972, IEEE Transactions on Computers.

[19]  R. Kashyap.  Consistent estimation of the order of autoregressive models , 1980, 1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.