|
|
|
||
|
|
The Paper's Abstract
of The 3rd |
||
|
|
Adaptive Cluster Truncation Coding of Images Using Hilbert Space Filling Curve |
||
|
May
26-29,1998 |
Yung-Sheng
Chen |
||
| Abstract: | |||
|
To diminish the problem, that increasing the block size in block truncation coding (BTC) can only purchase the bit rate of a near but greater than 1 bpp; and it will produce the highly noticeable blocking effects as well as the promptly increased MSE, a similar work called adaptive cluster truncation coding (ACTC) to the BTC is presented. A Hilbert space filling curve for sequentially scanning a 2n!Q2n image is predetermined, then the ACTC algorithm is performed by adaptively dividing the curve into clusters and transmitting the mean value as well as the cluster size of each cluster along the Hilbert scan. The feasibility of the ACTC algorithm is confirmed by the bit rate, the MSE, the encoded image, and the simple implementation.
|
|||
|
|
|||
|
|
|||
|
中国复印科学与工程学会 |
|||