1. A Fast No Search Fractal Image Coding Method
Source: Signal Processing: Image Communication,
Vol. 19, 2004, pp
Authors: Shen Furao and Osamu Hasegawa
Speaker: Yung-Chen Chou
Date: July 15, 2004

2. Outline Introduction Fractal image compression The problems
The solutions
Experiment and results
Conclusion
Yung-Chen Chou

3. Introduction Speed up parameters calculation Fractal image compression
Reduce domain block searching
Fractal image
compression
Affine translation
function
Compressed image data
Iterated function
system (IFS)
Original image
Yung-Chen Chou

4. Fractal Image Compression
Original
image
Special
Photostat
Output
image
Yung-Chen Chou

5. Fractal Image Compression (cont.)
Range block
(BXB; e.g. 8X8) R1 R2 Rn
Domain block
(2BX2B; e.g. 16X16)
Domain
Pool (Ω)
Original image f
Yung-Chen Chou

6. Fractal Image Compression (cont.)
Mean value Dj
a XDj(p,q)+b
Dj’
ak XDj(p,q)+bl Ri
Error = ||akDj+bl-Ri||2
Output:
ak, bl and Dj’ position
Domain block
from f
Yung-Chen Chou

7. The Problems Parameter search Error calculation Number of range blocks
ak and bl
Error calculation
|| akDj + bl - Ri ||2
Number of range blocks
Domain search
Yung-Chen Chou

8. The Solutions Parameter search: Error calculation:
Φien and LepsΦy (1995)
Error calculation:
set threshold
not influence the compression results
akDj + bl  ak(Dj + d) + r
Yung-Chen Chou

9. The Solutions (cont.) Number of range block: Using large range block
Quadtree
Tn+1 = 2Tn + 1
Yung-Chen Chou

10. The Solutions (cont.)
Similar degree
Yung-Chen Chou

11. The Solutions (cont.)
Domain search:
No search scheme
Yung-Chen Chou

12. Experiment and results
Original image
Decoded image
Yung-Chen Chou

13. Conclusion
Using the no search scheme to eliminate the search of domain pool
Feature work:
Combine DCT or wavelet
Yung-Chen Chou