An improved search algorithm for fractal image compression based on intra-block variance distribution

碩士 === 國立中山大學 === 資訊工程學系研究所 === 88 === Fractal image compression is based on the representation of an image by contractive transforms whose xed points are close to the original image. In the encoding of fractal image compression, most of the time is spent on nding the close match between a range b...

Full description

Bibliographic Details
Main Authors: Shin-Si Chen, 陳欣希
Other Authors: Chang-Biau Yang
Format: Others
Language:en_US
Published: 2000
Online Access:http://ndltd.ncl.edu.tw/handle/09495580034367438996
id ndltd-TW-088NSYS5392053
record_format oai_dc
spelling ndltd-TW-088NSYS53920532016-07-08T04:22:57Z http://ndltd.ncl.edu.tw/handle/09495580034367438996 An improved search algorithm for fractal image compression based on intra-block variance distribution 利用區塊內變異數分佈改進碎形影像壓縮 Shin-Si Chen 陳欣希 碩士 國立中山大學 資訊工程學系研究所 88 Fractal image compression is based on the representation of an image by contractive transforms whose xed points are close to the original image. In the encoding of fractal image compression, most of the time is spent on nding the close match between a range block and a large pool of domain blocks. In this thesis, we use the intra-block variances distributions of domain blocks to reduce the searching space. For nding a close match we need only search the domain blocks whose maximal intra-block variance quadrants are the same as that of the range block in nding a close match. The experiment results show that our algorithm can reduce much encoding time with only slight loss of quality. Chang-Biau Yang 楊昌彪 2000 學位論文 ; thesis 52 en_US
collection NDLTD
language en_US
format Others
sources NDLTD
description 碩士 === 國立中山大學 === 資訊工程學系研究所 === 88 === Fractal image compression is based on the representation of an image by contractive transforms whose xed points are close to the original image. In the encoding of fractal image compression, most of the time is spent on nding the close match between a range block and a large pool of domain blocks. In this thesis, we use the intra-block variances distributions of domain blocks to reduce the searching space. For nding a close match we need only search the domain blocks whose maximal intra-block variance quadrants are the same as that of the range block in nding a close match. The experiment results show that our algorithm can reduce much encoding time with only slight loss of quality.
author2 Chang-Biau Yang
author_facet Chang-Biau Yang
Shin-Si Chen
陳欣希
author Shin-Si Chen
陳欣希
spellingShingle Shin-Si Chen
陳欣希
An improved search algorithm for fractal image compression based on intra-block variance distribution
author_sort Shin-Si Chen
title An improved search algorithm for fractal image compression based on intra-block variance distribution
title_short An improved search algorithm for fractal image compression based on intra-block variance distribution
title_full An improved search algorithm for fractal image compression based on intra-block variance distribution
title_fullStr An improved search algorithm for fractal image compression based on intra-block variance distribution
title_full_unstemmed An improved search algorithm for fractal image compression based on intra-block variance distribution
title_sort improved search algorithm for fractal image compression based on intra-block variance distribution
publishDate 2000
url http://ndltd.ncl.edu.tw/handle/09495580034367438996
work_keys_str_mv AT shinsichen animprovedsearchalgorithmforfractalimagecompressionbasedonintrablockvariancedistribution
AT chénxīnxī animprovedsearchalgorithmforfractalimagecompressionbasedonintrablockvariancedistribution
AT shinsichen lìyòngqūkuàinèibiànyìshùfēnbùgǎijìnsuìxíngyǐngxiàngyāsuō
AT chénxīnxī lìyòngqūkuàinèibiànyìshùfēnbùgǎijìnsuìxíngyǐngxiàngyāsuō
AT shinsichen improvedsearchalgorithmforfractalimagecompressionbasedonintrablockvariancedistribution
AT chénxīnxī improvedsearchalgorithmforfractalimagecompressionbasedonintrablockvariancedistribution
_version_ 1718340880400646144