Reduced-search dynamic programming for approximation of polygonal curves
Pattern Recognition Letters
Accurate distortion measurement for generic shape coding
Pattern Recognition Letters
Distortion-constrained compression of vector maps
Proceedings of the 2007 ACM symposium on Applied computing
Optimized polygonal approximation by dominant point deletion
Pattern Recognition
Data reduction of large vector graphics
Pattern Recognition
Minimum description length approximation of digital curves
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Piecewise approximation of contours through scale-space selection of dominant points
IEEE Transactions on Image Processing
Linear frequency estimation technique for reducing frequency based signals
Proceedings of the 3rd International Conference on PErvasive Technologies Related to Assistive Environments
An efficient raster font compression for embedded systems
Pattern Recognition
MUSC: multigrid shape codes and their applications to image retrieval
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Optimal encoding of vector data with polygonal approximation and vertex quantization
SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
Superresolution border segmentation and measurement in remote sensing images
Computers & Geosciences
PACE: polygonal approximation of thick digital curves using cellular envelope
ICVGIP'06 Proceedings of the 5th Indian conference on Computer Vision, Graphics and Image Processing
ISE-bounded polygonal approximation of digital curves
Pattern Recognition Letters
Recognition of chain-coded patches with statistical methods
Mathematical and Computer Modelling: An International Journal
Optimal algorithm for lossy vector data compression
ICIAR'07 Proceedings of the 4th international conference on Image Analysis and Recognition
| Hi-index | 0.01 |
In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a polygon, and consider the problem of finding the polygon which leads to the smallest distortion for a given number of bits. We also address the dual problem of finding the polygon which leads to the smallest bit rate for a given distortion. We consider two different classes of distortion measures. The first class is based on the maximum operator and the second class is based on the summation operator. For the first class, we derive a fast and optimal scheme that is based on a shortest path algorithm for a weighted directed acyclic graph. For the second class we propose a solution approach that is based on the Lagrange multiplier method, which uses the above-mentioned shortest path algorithm. Since the Lagrange multiplier method can only find solutions on the convex hull of the operational rate distortion function, we also propose a tree-pruning-based algorithm that can find all the optimal solutions. Finally, we present results of the proposed schemes using objects from the Miss America sequence