Efficient fractal video coding algorithm using intercube correlation search

Chou-Chen Wang; Chaur-Heh Hsieh

doi:10.1117/1.1304837

1 August 2000 Efficient fractal video coding algorithm using intercube correlation search

Chou-Chen Wang, Chaur-Heh Hsieh

Optical Engineering, Vol. 39, Issue 8, (August 2000). https://doi.org/10.1117/1.1304837

We propose an efficient fractal video coding algorithm that exploits the correlation between range cubes. Four domain cubes mapped by the previous neighboring range cubes are considered as the good candidates for the input range cube. Two search methods, which take advantage of the correlation between intercubes in the spatial and spatial-temporal directions, are developed to reduce the computational complexity in the encoding phase. In order to raise the compression efficiency, a search-order coding technique is applied to encode the candidate domain cubes. Simulation results show that when the proposed method is implemented with a fast fractal video coding algorithm, it can further reduce the encoding times and bit rate with insignificant loss of video quality.

Citation Download Citation

Chou-Chen Wang and Chaur-Heh Hsieh "Efficient fractal video coding algorithm using intercube correlation search," Optical Engineering 39(8), (1 August 2000). https://doi.org/10.1117/1.1304837

Published: 1 August 2000

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available