Fractal coding of video sequence using circular prediction mapping and noncontractive interframe mapping

We propose a novel algorithm for fractal video sequence coding, based on the circular prediction mapping and the noncontractive interframe mapping. The proposed algorithm can effectively exploit the temporal correlation in real image sequences, since each range block is approximated by the domain bl...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 7(1998), 4 vom: 30., Seite 601-5
1. Verfasser: Kim, C S (VerfasserIn)
Weitere Verfasser: Kim, R C, Lee, S U
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 1998
Zugriff auf das übergeordnete Werk:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Schlagworte:Letter
LEADER 01000naa a22002652 4500
001 NLM177632275
003 DE-627
005 20231223150624.0
007 cr uuu---uuuuu
008 231223s1998 xx |||||o 00| ||eng c
024 7 |a 10.1109/83.663508  |2 doi 
028 5 2 |a pubmed24n0592.xml 
035 |a (DE-627)NLM177632275 
035 |a (NLM)18276277 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Kim, C S  |e verfasserin  |4 aut 
245 1 0 |a Fractal coding of video sequence using circular prediction mapping and noncontractive interframe mapping 
264 1 |c 1998 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 15.12.2009 
500 |a Date Revised 15.02.2008 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a We propose a novel algorithm for fractal video sequence coding, based on the circular prediction mapping and the noncontractive interframe mapping. The proposed algorithm can effectively exploit the temporal correlation in real image sequences, since each range block is approximated by the domain block in the adjacent frame, which is of the same size as the range block. The computer simulation results demonstrate that the proposed algorithm provides very promising performance at low bit rate, ranging from 40-250 kbyte/s 
650 4 |a Letter 
700 1 |a Kim, R C  |e verfasserin  |4 aut 
700 1 |a Lee, S U  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society  |d 1992  |g 7(1998), 4 vom: 30., Seite 601-5  |w (DE-627)NLM09821456X  |x 1941-0042  |7 nnns 
773 1 8 |g volume:7  |g year:1998  |g number:4  |g day:30  |g pages:601-5 
856 4 0 |u http://dx.doi.org/10.1109/83.663508  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 7  |j 1998  |e 4  |b 30  |h 601-5