Abstract
A bit-plane data-reduction scheme based on some characteristics of human image perception is described. This scheme is an information lossy/modifying type. General properties of bit-plane-decomposed images are reviewed. A method of image uniformalization that modifies less important portions on the bit-planes into flat areas is introduced. A hierarchial uniformalization algorithm is presented as the actual strategy. The important features of this algorithm are that it can use the coded data in the depth first (DF) expression and that the data modification is not likely to affect edges and isolated small areas, which are both very important for the image perception.
| Original language | English |
|---|---|
| Pages (from-to) | 208-214 |
| Number of pages | 7 |
| Journal | Proceedings - International Conference on Pattern Recognition |
| Volume | 2 |
| Publication status | Published - 1990 Dec 1 |
| Event | Proceedings of the 10th International Conference on Pattern Recognition - Atlantic City, NJ, USA Duration: 1990 Jun 16 → 1990 Jun 21 |
Fingerprint
ASJC Scopus subject areas
- Computer Vision and Pattern Recognition
Cite this
Kawaguchi, E., & Kamata, S. (1990). Data reductive image coding by bit-plane modifications. Proceedings - International Conference on Pattern Recognition, 2, 208-214.