Shape Matching Using Relaxation Techniques
IEEE Transactions on Pattern Analysis and Machine IntelligencePublished 1 January 1979
Larry S. Davis
Citations265
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
This approach was tested on a data base consisting of digitized coastlines in various map projections and found that in nearly all cases, all matches except the correct one were eliminated by the relaxation processes.
Abstract
The problem of finding approximate matches of pieces of shapes to parts of larger shapes is investigated. The shapes are represented by polygonal approximations. Initially, figures of merit are assigned to the matches between pairs of angles on the two shapes. Relaxation methods are then used to find acceptable combinations of these matches. This approach was tested on a data base consisting of digitized coastlines in various map projections. In nearly all cases, all matches except the correct one were eliminated by the relaxation processes.
Keywords
Computer ScienceEngineering
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 Electronic ComputersOn the Encoding of Arbitrary Geometric Configurations
1,654 Citations1961Herbert Freeman
It is shown that one can determine through the use of relatively simple numerical techniques whether a given arbitrary plane curve is open or closed, whether it is singly or multiply connected, and what area it encloses.
IEEE Transactions on Systems Man and CyberneticsScene Labeling by Relaxation Operations
1,401 Citations1976Azriel Rosenfeld, Robert A. Hummel +1 more
This paper formulates the ambiguity-reduction process in terms of iterated parallel operations (i.e., relaxation operations) performed on an array of object, identification data.
IEEE Transactions on ComputersThe Representation and Matching of Pictorial Structures
1,313 Citations1973Martin A. Fischler, R.A. Elschlager
The primary problem dealt with in this paper is the specification of a descriptive scheme, and a metric on which to base the decision of "goodness" of matching or detection.
Ecological studiesDigital Picture Processing
1,216 Citations1976P. Hartl
From an analysis point of view an image can be considered as a two-dimensional area of picture elements (pixels), each of which is characterized by a gray level, which are assumed to represent the radiant energy of some electromagnetic spectral range.
IEEE Transactions on Systems Man and CyberneticsShape Discrimination Using Fourier Descriptors
1,067 Citations1977E. Persoon, King‐Sun Fu
A critical review is given of two kinds of Fourier descriptors and a distance measure is proposed, in terms of FD's, that measures the difference between two boundarv curves.
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 ComputersA Corner-Finding Algorithm for Chain-Coded Curves
485 Citations1977Freeman, Davis
A method for detecting sharp "corners" in a chain-coded plane curve is described and a measure for the prominence ("cornerity") of a corner is introduced.
IEEE Transactions on ComputersA Model-Based Vision System for Industrial Parts
285 Citations1978Perkins
A vision system has been developed which can determine the position and orientation of complex curved objects in gray-level noisy scenes and organizes and reduces the image data from a digitized picture to a compact representation having the appearance of a line drawing.
IEEE Transactions on Pattern Analysis and Machine IntelligenceShape Matching Using Relaxation Techniques
265 Citations1979Larry S. Davis
This approach was tested on a data base consisting of digitized coastlines in various map projections and found that in nearly all cases, all matches except the correct one were eliminated by the relaxation processes.
IEEE Transactions on ComputersUnderstanding Shape: Angles and Sides
136 Citations1977Davis
Methods of detecting the angles and sides of a simple closed curve are developed that use approximations to the curve that have varying degrees of coarseness, and construct a hierarchy of angles and side that describes the curve at any desired level of detail.
Artificial IntelligenceA versatile system for computer-controlled assembly
128 Citations1975A.P. Ambler, Harry G. Barrow +3 more
A versatile assembly system, using TV cameras and computer-controlled arm and moving table, is described, which makes simple assemblies such as a peg and rings and a toy car.
International Joint Conference on Artificial IntelligenceA versatile computer-controlled assembly system
122 Citations1973A.P. Ambler, Harry G. Barrow +3 more
A versatile assembly system, using TV cameras and oomputer-controlled arm and moving table, is described, which makes almple assemblies such aa a peg and rings and a toy car.
Defense Technical Information Center (DTIC)MSYS: A System for Reasoning About Scenes.
63 Citations1975Jay M. Tenenbaum, Barrow,H G
MSYS is a system for reasoning with uncertain information and inexact rules of inference that contributes to the interpretation of visual features in scene analysis by repeatedly applying rules until a consistent set of likelihood values is attained.