English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 15229438      Online Users : 141
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    National Tsing Hua University Institutional Repository > 電機資訊學院 > 資訊工程學系 > 期刊論文 >  Accelerating Fractal Compression With a Real-time Decoder

    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/42079

    Title: Accelerating Fractal Compression With a Real-time Decoder
    Authors: Hsueh-Ting Chu;Chaur-Chin Chen
    教師: 陳朝欽
    Date: 2001
    Publisher: Institute of Information Science Academia Sinica
    Relation: Journal of Inforamtion Science and Engineering, Vol.17 No.3,May 2001, pp.417-427
    Keywords: simple decoder
    collage theorem
    maximum gradient
    fast encoder
    Abstract: ©2001 IIS SINICA-Image data compression by fractal techniques has been widely investigated. Although its high compression ratio and resolution-independent decoding properties are attractive, the encoding process is computationally demanding in order to achieve an optimal compression. A variety of speed-up algorithms have been proposed since Jacquin published a novel fractal coding algorithm. Unfortunately, the quantization strategy of scaling coefficients and the programming techniques lead to the results reported by different researchers are various even on the same image data which causes the speed-up of compression is incomparable. This paper proposes a real-time fractal decoder as a standard. We report the implementation results of a nearly optimal encoding algorithm OPT on commonly used images: Jet, Lenna, Mandrill, and Peppers of size 512?512. An accelerating compression algorithm using maximum gradient MG is shown to be 1300 times faster than OPT with a slight drop of PSNR value when encoding a 512?512 image.
    URI: http://www.iis.sinica.edu.tw/page/jise/2001/200105_04.html
    Appears in Collections:[資訊工程學系] 期刊論文

    Files in This Item:

    File SizeFormat


    SFX Query


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback