ISBN-13: 9783639095692 / Angielski / Miękka / 2009 / 140 str.
ISBN-13: 9783639095692 / Angielski / Miękka / 2009 / 140 str.
Fractal image compression is a lossy technique withhigh compression ratios, good quality, and fastdecoding. However, the computational complexity andlong coding time makes it unpractical. This bookintroduces possible solutions for these problems.In the book, A full quadtree and a full binary-treesearchless fractal algorithms introduced in chapter 1and 2. The full quadtree algorithm introduced inchapter 3 has a simpler data structure allowing ahardware implementation. The two-level quadtreealgorithm introduced in chapter 4 is an improvedversion of chapter 3. Chapter 5 gives a two-levelfractal FPGA hardware architecture designcorresponding to chapter 3. Chapter 6 improves theresult of chapter 5 by employing 4 quadtree levels.The most important findings of this book are: 1. Thealgorithms fix the location of domain block. Itreduces the complexity of the fractal encoding. 2.The algorithms can encode smaller range blocks, evensingle pixels. This is unique among current fractalalgorithm implementations. 3. The algorithms arefaster than the traditional methods because of nodomain block searching. 4. The algorithms can betransferred into FPGA hardware architecture.