Scaling Theorems for Zero Crossings
IEEE Transactions on Pattern Analysis and Machine Intelligence
Scale-Based Description and Recognition of Planar Curves and Two-Dimensional Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimum Uniform Piecewise Linear Approximation of Planar Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Shape Discrimination Using Fourier Descriptors
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special memorial issue for Professor King-Sun Fu
International Journal of Robotics Research
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Adaptive Reduction Procedure for the Piecewise Linear Approximation of Digitized Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Partial Shape Classification Using Contour Matching in Distance Transformation
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Efficiently Computable Metric for Comparing Polygonal Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern Recognition
Optimum polygonal approximation of digitized curves
Pattern Recognition Letters
Arithmetic coding for data compression
Communications of the ACM
Geometric heat equation and nonlinear diffusion of shapes and images
Computer Vision and Image Understanding
Invariant geometric evolutions of surfaces and volumetric smoothing
SIAM Journal on Applied Mathematics
Shape Similarity Measure Based on Correspondence of Visual Parts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multi-Scale Contour Segmentation
SCALE-SPACE '97 Proceedings of the First International Conference on Scale-Space Theory in Computer Vision
Analysis of Planar Shapes Using Geodesic Paths on Shape Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
A rate-distortion optimal scalable vertex based shape coding algorithm
ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04
Disconnected Skeleton: Shape at Its Absolute Scale
IEEE Transactions on Pattern Analysis and Machine Intelligence
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
IBM Journal of Research and Development
An introduction to arithmetic coding
IBM Journal of Research and Development
An optimal polygonal boundary encoding scheme in the rate distortion sense
IEEE Transactions on Image Processing
Invariant matching and identification of curves using B-splines curve representation
IEEE Transactions on Image Processing
Object-adaptive vertex-based shape coding method
IEEE Transactions on Circuits and Systems for Video Technology
ε-Isometry based shape approximation for image content representation
Signal Processing
Hi-index | 0.01 |
This paper describes a method of approximating a shape contour with a polygon. The polygon vertices are extracted from the curvature extremes, through a scale-space description of the contour, via linear diffusion. These vertices are located on the contour points where the sharper changes of the contour directions occur. Using a proper strategy, a set of extremes that result in a given approximation level is chosen. By adding new vertices, the approximation level can be improved, and a scalable representation of the contour is identified. This method results in an approximation that discriminates local from global geometric features and provides a good visual representation of the original contour. This polygonal approximation method is used for scalable encoding of the shape contours. In this regard, an encoding technique suitable for scalable polygonal approximation has been developed. We show that encoding the approximated polygons result in a good relation between the distortion and the bitrate. Finally, we show that in addition to coding this method can be efficiently used for shape comparison and shape retrieval.