Study on a data compression method for multivalued images through bit-plane decomposition technique

Seiichiro Kamata, Eiji Kawaguchi

Research output: Contribution to journalArticle

Abstract

A bit-plane decomposition method of multivalued images has the advantage in an interactive image retrieving system whereby users obtain a quick overview of an entire picture and a detailed local configuration simultaneously. The simplicity and feasibility of this method have attracted many researchers to produce numerous works in this field. Yet no one has been quite successful in reducing data amounts very effectively. The reason is that they tried to preserve all image information without paying much attention to the relative importance of each local information to the entire image. This paper proposes a data reduction strategy which incorporates a part of the property of human vision systems. Fine and exact data of a region where discontinuous points are very dense are neglected and abolished. On the other hand, all information about a region where discontinuous points are sparse is preserved. First, the properties of black-and-white (B/W) boundary points on image bitplanes are studied and a new data compression method is presented. The highlight of this method is the computation of a measure for the density of the discontinuous points. Then an alternative measure is shown which is based on an image complexicity of B/W pictures, and is less complicated to compute. It provides a data compression strategy which can be followed on coded data of the image. The experimental study supported this new idea, namely, most of the edge parts were enhanced and nonedge areas were noise-cleaned, and a good data compression was obtained.

Original languageEnglish
Pages (from-to)51-62
Number of pages12
JournalSystems and Computers in Japan
Volume21
Issue number7
Publication statusPublished - 1990
Externally publishedYes

Fingerprint

Decomposition Techniques
Data compression
Data Compression
Multivalued
Decomposition
Data reduction
Entire
Human Vision
Data Reduction
Vision System
Decomposition Method
Experimental Study
Simplicity
Configuration
Alternatives

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Hardware and Architecture
  • Information Systems
  • Theoretical Computer Science

Cite this

Study on a data compression method for multivalued images through bit-plane decomposition technique. / Kamata, Seiichiro; Kawaguchi, Eiji.

In: Systems and Computers in Japan, Vol. 21, No. 7, 1990, p. 51-62.

Research output: Contribution to journalArticle

@article{625875c147f54770b357b3f5b825df81,
title = "Study on a data compression method for multivalued images through bit-plane decomposition technique",
abstract = "A bit-plane decomposition method of multivalued images has the advantage in an interactive image retrieving system whereby users obtain a quick overview of an entire picture and a detailed local configuration simultaneously. The simplicity and feasibility of this method have attracted many researchers to produce numerous works in this field. Yet no one has been quite successful in reducing data amounts very effectively. The reason is that they tried to preserve all image information without paying much attention to the relative importance of each local information to the entire image. This paper proposes a data reduction strategy which incorporates a part of the property of human vision systems. Fine and exact data of a region where discontinuous points are very dense are neglected and abolished. On the other hand, all information about a region where discontinuous points are sparse is preserved. First, the properties of black-and-white (B/W) boundary points on image bitplanes are studied and a new data compression method is presented. The highlight of this method is the computation of a measure for the density of the discontinuous points. Then an alternative measure is shown which is based on an image complexicity of B/W pictures, and is less complicated to compute. It provides a data compression strategy which can be followed on coded data of the image. The experimental study supported this new idea, namely, most of the edge parts were enhanced and nonedge areas were noise-cleaned, and a good data compression was obtained.",
author = "Seiichiro Kamata and Eiji Kawaguchi",
year = "1990",
language = "English",
volume = "21",
pages = "51--62",
journal = "Systems and Computers in Japan",
issn = "0882-1666",
publisher = "John Wiley and Sons Inc.",
number = "7",

}

TY - JOUR

T1 - Study on a data compression method for multivalued images through bit-plane decomposition technique

AU - Kamata, Seiichiro

AU - Kawaguchi, Eiji

PY - 1990

Y1 - 1990

N2 - A bit-plane decomposition method of multivalued images has the advantage in an interactive image retrieving system whereby users obtain a quick overview of an entire picture and a detailed local configuration simultaneously. The simplicity and feasibility of this method have attracted many researchers to produce numerous works in this field. Yet no one has been quite successful in reducing data amounts very effectively. The reason is that they tried to preserve all image information without paying much attention to the relative importance of each local information to the entire image. This paper proposes a data reduction strategy which incorporates a part of the property of human vision systems. Fine and exact data of a region where discontinuous points are very dense are neglected and abolished. On the other hand, all information about a region where discontinuous points are sparse is preserved. First, the properties of black-and-white (B/W) boundary points on image bitplanes are studied and a new data compression method is presented. The highlight of this method is the computation of a measure for the density of the discontinuous points. Then an alternative measure is shown which is based on an image complexicity of B/W pictures, and is less complicated to compute. It provides a data compression strategy which can be followed on coded data of the image. The experimental study supported this new idea, namely, most of the edge parts were enhanced and nonedge areas were noise-cleaned, and a good data compression was obtained.

AB - A bit-plane decomposition method of multivalued images has the advantage in an interactive image retrieving system whereby users obtain a quick overview of an entire picture and a detailed local configuration simultaneously. The simplicity and feasibility of this method have attracted many researchers to produce numerous works in this field. Yet no one has been quite successful in reducing data amounts very effectively. The reason is that they tried to preserve all image information without paying much attention to the relative importance of each local information to the entire image. This paper proposes a data reduction strategy which incorporates a part of the property of human vision systems. Fine and exact data of a region where discontinuous points are very dense are neglected and abolished. On the other hand, all information about a region where discontinuous points are sparse is preserved. First, the properties of black-and-white (B/W) boundary points on image bitplanes are studied and a new data compression method is presented. The highlight of this method is the computation of a measure for the density of the discontinuous points. Then an alternative measure is shown which is based on an image complexicity of B/W pictures, and is less complicated to compute. It provides a data compression strategy which can be followed on coded data of the image. The experimental study supported this new idea, namely, most of the edge parts were enhanced and nonedge areas were noise-cleaned, and a good data compression was obtained.

UR - http://www.scopus.com/inward/record.url?scp=0025603582&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025603582&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0025603582

VL - 21

SP - 51

EP - 62

JO - Systems and Computers in Japan

JF - Systems and Computers in Japan

SN - 0882-1666

IS - 7

ER -