Fractal coding of video sequence by circular prediction mapping

Chang-Su Kim, Sang U. Lee

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

We propose a novel algorithm for fractal video sequence coding, based on the Circular Prediction Mapping (CPM), in which each range block is approximated by a domain block in the circularly previous frame. In our approach, the size of the domain block is set to be same as that of the range block for exploiting the high temporal correlation between the adjacent frames, while most other fractal coders use the domain block larger than the range block. Therefore the domain-range mapping in the CPM becomes similar to the block matching algorithm in the motion compensation techniques, and the advantages from this similarity are discussed. Also the modified collage theorem, which yields better prediction method for the CPM than the conventional collage theorem, is provided by linear systematic analysis. The computer simulation results on real video-conferencing image sequences demonstrate that the average compression ratios ranging from 60 to 70 can be obtained with good subjective quality.

Original languageEnglish
Pages (from-to)75-88
Number of pages14
JournalFractals
Volume5
Issue numberSUPPL. 1
Publication statusPublished - 1997 Apr 1
Externally publishedYes

Fingerprint

Fractals
Fractal
Coding
Prediction
Range of data
Block Algorithm
Video conferencing
Block Matching
Motion Compensation
Temporal Correlation
Motion compensation
Matching Algorithm
Image Sequence
Theorem
Computer Simulation
Compression
Adjacent
Computer simulation
Demonstrate

ASJC Scopus subject areas

  • General
  • Geometry and Topology

Cite this

Fractal coding of video sequence by circular prediction mapping. / Kim, Chang-Su; Lee, Sang U.

In: Fractals, Vol. 5, No. SUPPL. 1, 01.04.1997, p. 75-88.

Research output: Contribution to journalArticle

Kim, C-S & Lee, SU 1997, 'Fractal coding of video sequence by circular prediction mapping', Fractals, vol. 5, no. SUPPL. 1, pp. 75-88.
Kim, Chang-Su ; Lee, Sang U. / Fractal coding of video sequence by circular prediction mapping. In: Fractals. 1997 ; Vol. 5, No. SUPPL. 1. pp. 75-88.
@article{8395b66ebb184f01827870aa3509a9a1,
title = "Fractal coding of video sequence by circular prediction mapping",
abstract = "We propose a novel algorithm for fractal video sequence coding, based on the Circular Prediction Mapping (CPM), in which each range block is approximated by a domain block in the circularly previous frame. In our approach, the size of the domain block is set to be same as that of the range block for exploiting the high temporal correlation between the adjacent frames, while most other fractal coders use the domain block larger than the range block. Therefore the domain-range mapping in the CPM becomes similar to the block matching algorithm in the motion compensation techniques, and the advantages from this similarity are discussed. Also the modified collage theorem, which yields better prediction method for the CPM than the conventional collage theorem, is provided by linear systematic analysis. The computer simulation results on real video-conferencing image sequences demonstrate that the average compression ratios ranging from 60 to 70 can be obtained with good subjective quality.",
author = "Chang-Su Kim and Lee, {Sang U.}",
year = "1997",
month = "4",
day = "1",
language = "English",
volume = "5",
pages = "75--88",
journal = "Fractals",
issn = "0218-348X",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "SUPPL. 1",

}

TY - JOUR

T1 - Fractal coding of video sequence by circular prediction mapping

AU - Kim, Chang-Su

AU - Lee, Sang U.

PY - 1997/4/1

Y1 - 1997/4/1

N2 - We propose a novel algorithm for fractal video sequence coding, based on the Circular Prediction Mapping (CPM), in which each range block is approximated by a domain block in the circularly previous frame. In our approach, the size of the domain block is set to be same as that of the range block for exploiting the high temporal correlation between the adjacent frames, while most other fractal coders use the domain block larger than the range block. Therefore the domain-range mapping in the CPM becomes similar to the block matching algorithm in the motion compensation techniques, and the advantages from this similarity are discussed. Also the modified collage theorem, which yields better prediction method for the CPM than the conventional collage theorem, is provided by linear systematic analysis. The computer simulation results on real video-conferencing image sequences demonstrate that the average compression ratios ranging from 60 to 70 can be obtained with good subjective quality.

AB - We propose a novel algorithm for fractal video sequence coding, based on the Circular Prediction Mapping (CPM), in which each range block is approximated by a domain block in the circularly previous frame. In our approach, the size of the domain block is set to be same as that of the range block for exploiting the high temporal correlation between the adjacent frames, while most other fractal coders use the domain block larger than the range block. Therefore the domain-range mapping in the CPM becomes similar to the block matching algorithm in the motion compensation techniques, and the advantages from this similarity are discussed. Also the modified collage theorem, which yields better prediction method for the CPM than the conventional collage theorem, is provided by linear systematic analysis. The computer simulation results on real video-conferencing image sequences demonstrate that the average compression ratios ranging from 60 to 70 can be obtained with good subjective quality.

UR - http://www.scopus.com/inward/record.url?scp=2742546465&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=2742546465&partnerID=8YFLogxK

M3 - Article

VL - 5

SP - 75

EP - 88

JO - Fractals

JF - Fractals

SN - 0218-348X

IS - SUPPL. 1

ER -