Paper
21 April 1995 Two-dimensional split and merge algorithm for image coding
Wai-Fong Lee, Calvin C.K. Chan
Author Affiliations +
Proceedings Volume 2501, Visual Communications and Image Processing '95; (1995) https://doi.org/10.1117/12.206779
Event: Visual Communications and Image Processing '95, 1995, Taipei, Taiwan
Abstract
In this paper, a new 2D split and merge algorithm (2DSM) for image coding is devised. An image is modelled as a 2.5-dimensional surface and approximated by a surface formed by triangular patches. The algorithm iteratively improves the approximated image by splitting the merging of the triangles in order to drive the error under a specified bound. In addition, a new optimal triangulation for image data approximation is proposed. The algorithm is successfully applied for coding monochrome images using Interpolative Vector Quantization (IVQ) technique. Simulation results show that the proposed method can achieve 2.8 dB improvement on the approximated image and 0.68 dB improvement on the decoded image at a bit rate lower than the current schemes. Besides, excellent reconstruction visual quality is observed.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Wai-Fong Lee and Calvin C.K. Chan "Two-dimensional split and merge algorithm for image coding", Proc. SPIE 2501, Visual Communications and Image Processing '95, (21 April 1995); https://doi.org/10.1117/12.206779
Lens.org Logo
CITATIONS
Cited by 6 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image compression

Image quality

Reconstruction algorithms

Quantization

Algorithm development

Lead

Optimization (mathematics)

Back to Top