TY - JOUR
T1 - Depth-First Coding for Multivalued Pictures Using Bit-Plane Decomposition
AU - Eason, Richard Odell
AU - Kamata, Sei ichiro
AU - Kawaguchi, Eiji
N1 - Funding Information:
Paper approved by A. N. Netravali, the Editor for Image Processing of the IEEE Communications Society. Manuscript received June 15, 1990; revised January 20, 1993 and August 10, 1993. This work was supported in part by Grant-in-Aid for Scientific Research by the Ministry of Education, Science and Culture of Japan and by the Inamori Foundation. This paper was presented in part at the 10th Intemational Conference on Pattern Recognition, Atlantic City, NJ, June 1990. S. Kamata and E. Kawaguchi are with the Department of Computer Engineering, Kyushu Institute of Technology, Kitakyushu 804, Japan. R. 0. Eason is with the Department of Electrical Engineering, University of Maine, Orono, ME 04469 USA. IEEE Log Number 9406289.
PY - 1995/5
Y1 - 1995/5
N2 - A data compression technique using a bit-plane decomposition strategy of multivalued images is described. Although the bit-plane decomposition is mainly used for image transmission, our method takes the image expression for image database into consideration. It has two merits which are a hierarchical representation using depth-first (DF) expression and a simple noise reduction algorithm on the DF expression that is similar to human perception. DF expression is useful for image expansion, rotation, etc. We will study what information in an image should be eliminated as a noise reduction. Noise-like patterns in an image are uniformalized and the edge and smooth surfaces remain nearly unchanged. They are not blurred, but instead are a little enhanced. In this paper, we study a property of black-and-white (BAY) boundary points on bit-planes. The algorithm of the uniformalization process with a DF-expression of an image is described for coding. The experiment for real image data is carried out by a comparison to the other methods, and the results are discussed.
AB - A data compression technique using a bit-plane decomposition strategy of multivalued images is described. Although the bit-plane decomposition is mainly used for image transmission, our method takes the image expression for image database into consideration. It has two merits which are a hierarchical representation using depth-first (DF) expression and a simple noise reduction algorithm on the DF expression that is similar to human perception. DF expression is useful for image expansion, rotation, etc. We will study what information in an image should be eliminated as a noise reduction. Noise-like patterns in an image are uniformalized and the edge and smooth surfaces remain nearly unchanged. They are not blurred, but instead are a little enhanced. In this paper, we study a property of black-and-white (BAY) boundary points on bit-planes. The algorithm of the uniformalization process with a DF-expression of an image is described for coding. The experiment for real image data is carried out by a comparison to the other methods, and the results are discussed.
UR - http://www.scopus.com/inward/record.url?scp=0005760019&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0005760019&partnerID=8YFLogxK
U2 - 10.1109/26.387407
DO - 10.1109/26.387407
M3 - Article
AN - SCOPUS:0005760019
SN - 0090-6778
VL - 43
SP - 1961
EP - 1969
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 5
ER -