SEARCHLESS IFS FRACTALIMAGE ENCODING: EFFICIENT SOFTWARE ALGORITHMS AND HARDWARE ARCHITECTURES
5 Angebote vergleichen
| Preise | 2013 | 2014 | 2015 |
|---|---|---|---|
| Schnitt | € 57,22 | € 54,98 | € 57,59 |
| Nachfrage |
1
Symbolbild
SEARCHLESS IFS FRACTALIMAGE ENCODING (2009)
DE PB NW RPISBN: 9783639095692 bzw. 3639095693, in Deutsch, VDM Verlag Mrz 2009, Taschenbuch, neu, Nachdruck.
Von Händler/Antiquariat, AHA-BUCH GmbH [51283250], Einbeck, Germany.
This item is printed on demand - Print on Demand Titel. Neuware - 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 arefaster than the traditional methods because of no domain block searching. 4. The algorithms can be transferred into FPGA hardware architecture. 140 pp. Englisch.
This item is printed on demand - Print on Demand Titel. Neuware - 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 arefaster than the traditional methods because of no domain block searching. 4. The algorithms can be transferred into FPGA hardware architecture. 140 pp. Englisch.
2
SEARCHLESS IFS FRACTALIMAGE ENCODING: EFFICIENT SOFTWARE ALGORITHMS AND HARDWARE ARCHITECTURES (2009)
EN PB NWISBN: 9783639095692 bzw. 3639095693, in Englisch, 140 Seiten, VDM Verlag, Taschenbuch, neu.
Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 1-2 business days.
Von Händler/Antiquariat, Serendipity UnLtd.
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. Paperback, Label: VDM Verlag, VDM Verlag, Produktgruppe: Book, Publiziert: 2009-03-27, Studio: VDM Verlag.
Von Händler/Antiquariat, Serendipity UnLtd.
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. Paperback, Label: VDM Verlag, VDM Verlag, Produktgruppe: Book, Publiziert: 2009-03-27, Studio: VDM Verlag.
3
SEARCHLESS IFS FRACTALIMAGE ENCODING
DE PB NWISBN: 9783639095692 bzw. 3639095693, in Deutsch, Vdm Verlag Dr. Müller, Taschenbuch, neu.
Lieferung aus: Deutschland, Versandkostenfrei.
buecher.de GmbH & Co. KG, [1].
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.2009. 140 S. 220 mmVersandfertig in 3-5 Tagen, Softcover.
buecher.de GmbH & Co. KG, [1].
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.2009. 140 S. 220 mmVersandfertig in 3-5 Tagen, Softcover.
4
Symbolbild
SEARCHLESS IFS FRACTALIMAGE ENCODING (2009)
DE PB NW RPISBN: 9783639095692 bzw. 3639095693, in Deutsch, VDM Verlag Dr. Müller, Saarbrücken, Deutschland, Taschenbuch, neu, Nachdruck.
Von Händler/Antiquariat, English-Book-Service - A Fine Choice [1048135], Waldshut-Tiengen, Germany.
This item is printed on demand for shipment within 3 working days.
This item is printed on demand for shipment within 3 working days.
5
SEARCHLESS IFS FRACTALIMAGE ENCODING: EFFICIENT SOFTWARE ALGORITHMS AND HARDWARE ARCHITECTURES (2009)
EN PB NWISBN: 9783639095692 bzw. 3639095693, in Englisch, 140 Seiten, VDM Verlag, Taschenbuch, neu.
Lieferung aus: Deutschland, Gewöhnlich versandfertig in 24 Stunden.
Von Händler/Antiquariat, Amazon.de.
Taschenbuch, Label: VDM Verlag, VDM Verlag, Produktgruppe: Book, Publiziert: 2009-03-27, Studio: VDM Verlag.
Von Händler/Antiquariat, Amazon.de.
Taschenbuch, Label: VDM Verlag, VDM Verlag, Produktgruppe: Book, Publiziert: 2009-03-27, Studio: VDM Verlag.
Lade…