Description and Discrimination of Planar Shapes Using Shape Matrices
IEEE Transactions on Pattern Analysis and Machine IntelligencePublished 1 November 1985
Ardeshir Goshtasby
Citations144
SJR quartileQ1
SJR score3.91
SNIP5.99
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A shape descriptor has been developed which can describe a shape independent of its translation, rotation, and scaling and, in this technique, shape discrimination is possible by a simple EXCLUSIVE-OR operation on shape descriptions.
Abstract
A shape descriptor has been developed which can describe a shape independent of its translation, rotation, and scaling. The description is in the form of a matrix and it is obtained by a polar quantization of a shape. The quantization process takes into consideration not only a shape's outer geometry but its inner geometry as well. The descriptor is information preserving and if the quantization parameters are selected properly, it is possible to reconstruct an original shape from its description. In this technique, shape discrimination is possible by a simple EXCLUSIVE-OR operation on shape descriptions.
Keywords
Computer Science
IRE Transactions on Information TheoryVisual pattern recognition by moment invariants
7,528 Citations1962Ming-Kuei Hu
It is shown that recognition of geometrical patterns and alphabetical characters independently of position, size and orientation can be accomplished and it is indicated that generalization is possible to include invariance with parallel projection.
Proceedings of the Royal Society of London. Series B, Biological sciencesRepresentation and recognition of the spatial organization of three-dimensional shapes
2,183 Citations1978David Marr, H. K. Nishihara
The human visual process can be studied by examining the computational problems associated with deriving useful information from retinal images by applying the approach to the problem of representing three-dimensional shapes for the purpose of recognition.
IEEE Transactions on ComputersFourier Descriptors for Plane Closed Curves
1,849 Citations1972C. T. Zahn, Ralph Roskies
It is established that the Fourier series expansion is optimal and unique with respect to obtaining coefficients insensitive to starting point and the amplitudes are pure form invariants as well as are certain simple functions of phase angles.
IEEE Transactions on ComputersAircraft Identification by Moment Invariants
754 Citations1977Sahibsingh A. Dudani, Kenneth J. Breeding +1 more
An experimental system is described in which certain features called moment invariants are extracted from binary television images and are used for automatic classification of aircraft types from optical images, exhibiting a significantly lower error rate than human observers.
IEEE Transactions on Pattern Analysis and Machine IntelligenceAlgorithms for Shape Analysis of Contours and Waveforms
339 Citations1980Theodosios Pavlidis
Algorithms for shape analysis are reviewed and classified under various criteria, whether they examine the boundary only or the whole area and whether they describe the original picture in terms of scalar measurements or through structural descriptions.
Computer Graphics and Image ProcessingAn efficient three-dimensional aircraft recognition algorithm using normalized fourier descriptors
337 Citations1980Timothy P. Wallace, P. A. Wintz
This paper presents a technique for normalizing Fourier descriptors which retains all shape information, and is computationally efficient, and combined with certain others relating to accurate contour representation in a complete three-dimensional aircraft recognition algorithm.
Computer Graphics and Image ProcessingLogarithmic spiral grids for image processing and display
169 Citations1979Carl F. R. Weiman, George M. Chaikin
A picture digitization grid based on logarithmic spirals rather than Cartesian coordinates is presented, and the exponential mapping induces a computational simplification that suggests parallel architectures in which most geometric transformations are effected by data shifting in memory rather than arithmetic on coordinates.
Pattern RecognitionShape description via the use of critical points
157 Citations1978Herbert Freeman
Algorithms are described for extracting critical points of shape description in the presence of noise and an illustration is given showing how the critical points may be used in the development of a shape description system.
IEEE Transactions on Pattern Analysis and Machine IntelligenceTemplate Matching in Rotated Images
137 Citations1985Ardeshir Goshtasby
A rotationally invariant template matching using normalized invariant moments and a speedup technique based on the idea of two-stage template matching are described.
Proceedings of the IEEEAn algorithm for recognition and localization of rotated and scaled objects
24 Citations1981Tamar Peli
This letter extends the algorithm to recognition and localization of objects that are scaled, rotated and displaced, while retaining the order of the number of computations.