Optimum Uniform Piecewise Linear Approximation of Planar Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
A new split-and-merge technique for polygonal approximation of chain coded curves
Pattern Recognition Letters
Arithmetic coding for data compression
Communications of the ACM
Computer Processing of Line-Drawing Images
ACM Computing Surveys (CSUR)
Computer Vision
A Simple and Efficient Binary Shape Coding Technique Based on Bitmap Representation
ICASSP '97 Proceedings of the 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '97) -Volume 4 - Volume 4
A binary shape coding method using modified MMR
ICIP '97 Proceedings of the 1997 International Conference on Image Processing (ICIP '97) 3-Volume Set-Volume 1 - Volume 1
Multi-grid chain coding of binary shapes
ICIP '97 Proceedings of the 1997 International Conference on Image Processing (ICIP '97) 3-Volume Set-Volume 3 - Volume 3
Chain Coding with a Hexagonal Lattice
IEEE Transactions on Pattern Analysis and Machine Intelligence
A universal algorithm for sequential data compression
IEEE Transactions on Information Theory
MPEG-4 standardized methods for the compression of arbitrarily shaped video objects
IEEE Transactions on Circuits and Systems for Video Technology
Relevant shape contour snippet extraction with metadata supported hidden Markov models
Proceedings of the ACM International Conference on Image and Video Retrieval
| Hi-index | 0.00 |
An efficient contour-based method for the coding of binary shape information is described. Conventional chain coding techniques show high coding efficiency for lossless compression, but they exploit the coherence of the contour in only a restricted manner. Higher coding efficiency can be achieved by realising the neighbourhood relation as a Markov chain, and this is exploited in a new coding scheme, the directional grid chain coding (DGCC). The method is computationally efficient and the coding process adapts to the inherent changes in the contour. Two schemes are proposed, a lossless and a quasi-lossless method. The lossless scheme achieves 32% saving in bit rate compared with the conventional differential chain code (DCC). The second, quasi-lossless technique achieves 44% bit reduction compared with the DCC and the distortions present in the reconstructed contour are hardly noticeable to the human eye.