A graph-theoretic approach for studying the convergence of fractal encoding algorithm

In this paper, we present a graph-theoretic interpretation of convergence of fractal encoding based on partial iterated function system (PIFS). First we have considered a special circumstance, where no spatial contraction has been allowed in the encoding process. The concept leads to the development...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 9(2000), 3 vom: 15., Seite 366-77
1. Verfasser: Mukherjee, J (VerfasserIn)
Weitere Verfasser: Kumar, P, Ghosh, S K
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2000
Zugriff auf das übergeordnete Werk:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM177432624
003 DE-627
005 20231223150214.0
007 cr uuu---uuuuu
008 231223s2000 xx |||||o 00| ||eng c
024 7 |a 10.1109/83.826775  |2 doi 
028 5 2 |a pubmed24n0592.xml 
035 |a (DE-627)NLM177432624 
035 |a (NLM)18255409 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Mukherjee, J  |e verfasserin  |4 aut 
245 1 2 |a A graph-theoretic approach for studying the convergence of fractal encoding algorithm 
264 1 |c 2000 
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 02.10.2012 
500 |a Date Revised 07.02.2008 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a In this paper, we present a graph-theoretic interpretation of convergence of fractal encoding based on partial iterated function system (PIFS). First we have considered a special circumstance, where no spatial contraction has been allowed in the encoding process. The concept leads to the development of a linear time fast decoding algorithm from the compressed image. This concept is extended for the general scheme of fractal compression allowing spatial contraction (on averaging) from larger domains to smaller ranges. A linear time fast decoding algorithm is also proposed in this situation, which produces a decoded image very close to the result obtained by an ordinary iterative decompression algorithm 
650 4 |a Journal Article 
700 1 |a Kumar, P  |e verfasserin  |4 aut 
700 1 |a Ghosh, S K  |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 9(2000), 3 vom: 15., Seite 366-77  |w (DE-627)NLM09821456X  |x 1941-0042  |7 nnns 
773 1 8 |g volume:9  |g year:2000  |g number:3  |g day:15  |g pages:366-77 
856 4 0 |u http://dx.doi.org/10.1109/83.826775  |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 9  |j 2000  |e 3  |b 15  |h 366-77