Fast Encoding Algorithm Based on Different Contrast Scales
A new fast fractal encoding algorithm for the processes of searching and matching is proposed in fractal image compression in this paper. The number of domain blocks searched to find the best match for each range block and corresponding encoding time are much reduced by elimination domain blocks not...
Uložené v:
| Vydané v: | IEEE 2007 International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications : 14-17 August, 2007, Hangzhou, China s. 1105 - 1108 |
|---|---|
| Hlavný autor: | |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
01.08.2007
|
| Predmet: | |
| ISBN: | 9781424410446, 1424410444 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | A new fast fractal encoding algorithm for the processes of searching and matching is proposed in fractal image compression in this paper. The number of domain blocks searched to find the best match for each range block and corresponding encoding time are much reduced by elimination domain blocks not searching using the current minimum distortion and variance difference between the range block and domain block. The algorithm produces a completely identical fractal encoding to that of the conventional full search in reduced time. |
|---|---|
| ISBN: | 9781424410446 1424410444 |
| DOI: | 10.1109/MAPE.2007.4393462 |

