Presentation 2003/1/10
Fractal Image Compression using Wilcoxon signed-ranks test
Mayuko MARUYAMA, Hiroshi KANEKO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we show a fractal block compression method using the Wilcoxon signed-rank test. The fractal block coding method based on an iterated function system is in the compressing method which attracts attention as a unique technique from before. This technique can be expected in high coding efficiency, and is excellent in the point of independence resolution. On the other hand, the length of coding time may be pointed out as a problem. This is attributed in the searching time of the domain block in a range block. Then, we tried shortening of coding time by clustering a domain block. Although various clustering techniques were used by past researchers, we adopted the clustering using the Wilcoxon signed-rank test directly to the luminosity value of a picture. Consequently, without reducing the quality of a reproduction picture remarkably, it was succeeded in shortening of coding time.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Iterated Function System / Fractal Block Compression / F. Wilcoxon-signed-ranks test
Paper # PRMU2002-199
Date of Issue

Conference Information
Committee PRMU
Conference Date 2003/1/10(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Pattern Recognition and Media Understanding (PRMU)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Fractal Image Compression using Wilcoxon signed-ranks test
Sub Title (in English)
Keyword(1) Iterated Function System
Keyword(2) Fractal Block Compression
Keyword(3) F. Wilcoxon-signed-ranks test
1st Author's Name Mayuko MARUYAMA
1st Author's Affiliation Department of Information Science, Toho University()
2nd Author's Name Hiroshi KANEKO
2nd Author's Affiliation Department of Information Science, Toho University
Date 2003/1/10
Paper # PRMU2002-199
Volume (vol) vol.102
Number (no) 555
Page pp.pp.-
#Pages 6
Date of Issue