Fractal image compression is a lossy technique with high compression ratios, good quality, and fast decoding. However, the computational complexity and long coding time makes it unpractical. This book introduces possible solutions for these problems. In the book, A full quadtree and a full binary-tree searchless fractal algorithms introduced in chapter 1 and 2. The full quadtree algorithm introduced in chapter 3 has a simpler data structure allowing a hardware implementation. The two-level quadtree algorithm introduced in chapter 4 is an improved version of chapter 3. Chapter 5 gives a two-level fractal FPGA hardware architecture design corresponding to chapter 3. Chapter 6 improves the result of chapter 5 by employing 4 quadtree levels. The most important findings of this book are: 1. The algorithms fix the location of domain block. It reduces the complexity of the fractal encoding. 2. The algorithms can encode smaller range blocks, even single pixels. This is unique among current fractal algorithm implementations. 3. The algorithms are faster than the traditional methods because of no domain block searching. 4. The algorithms can be transferred into FPGA hardware architecture.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Fractal image compression is a lossy technique with high compression ratios, good quality, and fast decoding. However, the computational complexity and long coding time makes it unpractical. This book introduces possible solutions for these problems. In the book, A full quadtree and a full binary-tree searchless fractal algorithms introduced in chapter 1 and 2. The full quadtree algorithm introduced in chapter 3 has a simpler data structure allowing a hardware implementation. The two-level quadtree algorithm introduced in chapter 4 is an improved version of chapter 3. Chapter 5 gives a two-level fractal FPGA hardware architecture design corresponding to chapter 3. Chapter 6 improves the result of chapter 5 by employing 4 quadtree levels. The most important findings of this book are: 1. The algorithms fix the location of domain block. It reduces the complexity of the fractal encoding. 2. The algorithms can encode smaller range blocks, even single pixels. This is unique among current fractal algorithm implementations. 3. The algorithms are faster than the traditional methods because of no domain block searching. 4. The algorithms can be transferred into FPGA hardware architecture.
Xianwei Wu received the B.S. and M.S. in Electrical Engineering from Jilin University of Technology China in 1994 and 2002. He received the Ph.D. in ECE Department at the University of Alabama in 2006. His research interests include image processing, VHDL hardware design, microprocessor and micro-controller based design and embedded system design.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : moluna, Greven, Allemagne
Kartoniert / Broschiert. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: wu xianweiXianwei Wu received the B.S. and M.S. in Electrical Engineeringnfrom Jilin University of Technology China in 1994 and 2002. Henreceived the Ph.D. in ECE Department at the University of Alabamanin 2006. His research interest. N° de réf. du vendeur 4956989
Quantité disponible : Plus de 20 disponibles
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. N° de réf. du vendeur 9783639095692
Quantité disponible : 2 disponible(s)
Vendeur : preigu, Osnabrück, Allemagne
Taschenbuch. Etat : Neu. SEARCHLESS IFS FRACTALIMAGE ENCODING | EFFICIENT SOFTWARE ALGORITHMS AND HARDWARE ARCHITECTURES | Wu Xianwei | Taschenbuch | Englisch | VDM Verlag Dr. Müller | EAN 9783639095692 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. N° de réf. du vendeur 101638181
Quantité disponible : 5 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 140 pages. 8.66x5.91x0.32 inches. In Stock. N° de réf. du vendeur 3639095693
Quantité disponible : 1 disponible(s)