21 April 1995 Statistical split and polynomial merge algorithm for image representation
Author Affiliations +
Proceedings Volume 2501, Visual Communications and Image Processing '95; (1995) https://doi.org/10.1117/12.206696
Event: Visual Communications and Image Processing '95, 1995, Taipei, Taiwan
Abstract
Since polynomials fit the geometrical forms of images harmoniously and well represent slowly varying surfaces in images, there were many split and merge algorithms which used a polynomial function to represent each homogeneous region. Even though very low-bit rate can be achieved using their algorithms, it takes too much time for both split process and merging process. Furthermore, the splitted result is not quite well matched to HVS, either. In this paper, a new split and merge algorithm is designed. In this algorithm the split process uses a statistical hypothesis test called ShortCut method as a measurement of region homogeneity, and the merge process uses a polynomial function. The computation time for the split process can be significantly reduced using the new algorithm, and the new scheme reflects HVS more than any other scheme. To justify the algorithm proposed here, it is compared with other algorithms including Kunt's algorithm.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Seoung-Jun Oh, Keun-Heum Park, "Statistical split and polynomial merge algorithm for image representation", Proc. SPIE 2501, Visual Communications and Image Processing '95, (21 April 1995); doi: 10.1117/12.206696; https://doi.org/10.1117/12.206696
PROCEEDINGS
10 PAGES


SHARE
Back to Top