Uniform Resampling of Digitized Contours
- 1 November 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. PAMI-7 (6), 674-681
- https://doi.org/10.1109/tpami.1985.4767723
Abstract
This paper addresses the problem of the nonuniform intersample distance of digital curves obtained as a result of quantization of continuous contours on a square lattice. A resampling algorithm based on variable-factor interpolation and decimation is presented, and its performance is evaluated analytically and by computer simulations assuming the grid-intersect quantization. It is shown that the output of the resampling algorithm outperforms the original digital curve in terms of the average and maximum error in the measurement of length by 50 and 73 percent, respectively. The resampling algorithm can be used as a preprocessing stage in shape analysis systems to enhance their performance by increasing the accuracy and consistency of both local and global features such as curvature and the Fourier shape descriptors.Keywords
This publication has 8 references indexed in Scilit:
- Precision of Digital Vision SystemsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1983
- Chain Coding with a Hexagonal LatticeIEEE Transactions on Pattern Analysis and Machine Intelligence, 1983
- On the Performance of Chain Codes for Quantization of Line DrawingsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1981
- Algorithms for Shape Analysis of Contours and WaveformsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1980
- Comparative analysis of line-drawing modeling schemesComputer Graphics and Image Processing, 1980
- Freeman-code probabilities of object boundary quantized contoursComputer Graphics and Image Processing, 1978
- Computer Recognition of Partial Views of Curved ObjectsIEEE Transactions on Computers, 1977
- Angle Detection on Digital CurvesIEEE Transactions on Computers, 1973