Quadtree Decomposition And A New Scheme For Quadtree Code
碩士 === 國立清華大學 === 資訊工程學系 === 88 === Tzung-ruen Yeh Many lossy image compression algorithms have been developed for low bit rate applications. Among them, quadtree decomposition is a simple technique for image representation at different resolution levels that adapts spatially, allocating...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2000
|
Online Access: | http://ndltd.ncl.edu.tw/handle/76418003859421169121 |
id |
ndltd-TW-088NTHU0392047 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-088NTHU03920472016-07-08T04:23:16Z http://ndltd.ncl.edu.tw/handle/76418003859421169121 Quadtree Decomposition And A New Scheme For Quadtree Code 四分樹分解與四分樹碼的新架構 Tzung-ruen Yeh 葉宗倫 碩士 國立清華大學 資訊工程學系 88 Tzung-ruen Yeh Many lossy image compression algorithms have been developed for low bit rate applications. Among them, quadtree decomposition is a simple technique for image representation at different resolution levels that adapts spatially, allocating more bits to those complicated areas in the image. Its simplicity and potential for relatively good performance for low bit rates makes quadtree a desirable choice for a compression scheme. A new scheme for quadtree code is proposed in this thesis. This scheme combines a new developed quadtree code with regular quadtree code. This new quadtree code is complemental to the regular one. Its usage and limitation is also discussed. The algorithms and experimental results are given. Experimental results show that the new algorithm requires about 1.8 seconds to encode a 512x512 gray level image and requires about 0.3 seconds to decode it while maintains a satisfactory image fidelity. Chaur-Chin Chen 陳朝欽 2000 學位論文 ; thesis 33 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立清華大學 === 資訊工程學系 === 88 === Tzung-ruen Yeh
Many lossy image compression algorithms have been developed for low bit rate applications. Among them, quadtree decomposition is a simple technique for image representation at different resolution levels that adapts spatially, allocating more bits to those complicated areas in the image. Its simplicity and potential for relatively good performance for low bit rates makes quadtree a desirable choice for a compression scheme. A new scheme for quadtree code is proposed in this thesis. This scheme combines a new developed quadtree code with regular quadtree code. This new quadtree code is complemental to the regular one. Its usage and limitation is also discussed. The algorithms and experimental results are given. Experimental results show that the new algorithm requires about 1.8 seconds to encode a 512x512 gray level image and requires about 0.3 seconds to decode it while maintains a satisfactory image fidelity.
|
author2 |
Chaur-Chin Chen |
author_facet |
Chaur-Chin Chen Tzung-ruen Yeh 葉宗倫 |
author |
Tzung-ruen Yeh 葉宗倫 |
spellingShingle |
Tzung-ruen Yeh 葉宗倫 Quadtree Decomposition And A New Scheme For Quadtree Code |
author_sort |
Tzung-ruen Yeh |
title |
Quadtree Decomposition And A New Scheme For Quadtree Code |
title_short |
Quadtree Decomposition And A New Scheme For Quadtree Code |
title_full |
Quadtree Decomposition And A New Scheme For Quadtree Code |
title_fullStr |
Quadtree Decomposition And A New Scheme For Quadtree Code |
title_full_unstemmed |
Quadtree Decomposition And A New Scheme For Quadtree Code |
title_sort |
quadtree decomposition and a new scheme for quadtree code |
publishDate |
2000 |
url |
http://ndltd.ncl.edu.tw/handle/76418003859421169121 |
work_keys_str_mv |
AT tzungruenyeh quadtreedecompositionandanewschemeforquadtreecode AT yèzōnglún quadtreedecompositionandanewschemeforquadtreecode AT tzungruenyeh sìfēnshùfēnjiěyǔsìfēnshùmǎdexīnjiàgòu AT yèzōnglún sìfēnshùfēnjiěyǔsìfēnshùmǎdexīnjiàgòu |
_version_ |
1718341478798852096 |