In this paper, we present an image compression algorithm using two concepts, subdividing an image matrix and stratifying submatrices into FD-submatrices (feature distribution submatrices). According to the feature distribution and the view that an image can be decomposed into some feature layers, we generate a compression tree by setting up a logic process of decomposition and stratification. To get better compression ratios, the set of submatrices having one and zero as elements, including logic flag sequences is compressed by vector space theory.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Tianxing LIU, Hideo KURODA, "An Image Compression Algorithm Based on Dynamically Stratifying Submatrices and Vector Space" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 7, pp. 1973-1976, July 2001, doi: .
Abstract: In this paper, we present an image compression algorithm using two concepts, subdividing an image matrix and stratifying submatrices into FD-submatrices (feature distribution submatrices). According to the feature distribution and the view that an image can be decomposed into some feature layers, we generate a compression tree by setting up a logic process of decomposition and stratification. To get better compression ratios, the set of submatrices having one and zero as elements, including logic flag sequences is compressed by vector space theory.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_7_1973/_p
Copy
@ARTICLE{e84-b_7_1973,
author={Tianxing LIU, Hideo KURODA, },
journal={IEICE TRANSACTIONS on Communications},
title={An Image Compression Algorithm Based on Dynamically Stratifying Submatrices and Vector Space},
year={2001},
volume={E84-B},
number={7},
pages={1973-1976},
abstract={In this paper, we present an image compression algorithm using two concepts, subdividing an image matrix and stratifying submatrices into FD-submatrices (feature distribution submatrices). According to the feature distribution and the view that an image can be decomposed into some feature layers, we generate a compression tree by setting up a logic process of decomposition and stratification. To get better compression ratios, the set of submatrices having one and zero as elements, including logic flag sequences is compressed by vector space theory.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - An Image Compression Algorithm Based on Dynamically Stratifying Submatrices and Vector Space
T2 - IEICE TRANSACTIONS on Communications
SP - 1973
EP - 1976
AU - Tianxing LIU
AU - Hideo KURODA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2001
AB - In this paper, we present an image compression algorithm using two concepts, subdividing an image matrix and stratifying submatrices into FD-submatrices (feature distribution submatrices). According to the feature distribution and the view that an image can be decomposed into some feature layers, we generate a compression tree by setting up a logic process of decomposition and stratification. To get better compression ratios, the set of submatrices having one and zero as elements, including logic flag sequences is compressed by vector space theory.
ER -