𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast binary-image boundary extraction

✍ Scribed by W.H.H.J. Lunscher


Publisher
Elsevier Science
Year
1986
Weight
93 KB
Volume
34
Category
Article
ISSN
0734-189X

No coin nor oath required. For personal study only.

✦ Synopsis


Color displays used in image processing systems consist of a refresh memory buffer storing digital image data which are converted into analog signals to display an image by driving the primary color channels (Red, Green, and Blue) of a color television monitor. The color cathode ray tube (CRT) of the monitor is unable to reproduce colors exactly because of phosphor limitations, exponential luminance response of the tube to the applied signal, and limitations imposed by the digital-to-analog conversion. In this paper we describe some computer simulation studies (using the I!/* V* W* color space) carried out to measure these reproduction errors. Further, a procedure to correct for color reproduction error resulting from the exponential luminance response (gamma) of the picture tube is proposed, using a video-lookup table and a higher resolution digital-to-analog converter. It is found, on the basis of computer simulation studies, that the proposed gamma correction scheme is effective and robust with respect to variations in the assumed value of the gamma.


πŸ“œ SIMILAR VOLUMES


Fast Binary Image Processing Using Binar
✍ L. Robert; G. Malandain πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 284 KB

Many classical image processing tasks can be realized as evaluations of a boolean function over subsets of an image. For instance, the simplicity test used in 3D thinning requires examining the 26 neighbors of each voxel and computing a single boolean function of these inputs. In this article, we sh

Methods for fast morphological image tra
✍ Rein van den Boomgaard; Richard van Balen πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science βš– 727 KB

In this paper we present new implementations for morphological binary image processing on a general-purpose computer, using a bitmap representation of binary images instead of representing binary images as bitplanes inserted in gray value images. The bitmap data representation is a very efficient on

A fast and efficient compression method
✍ Pasi FrΓ€nti πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 815 KB

The use of arithmetic coding for binary image compression achieves a high compression ratio while the running time remains rather slow. A composite modelling method presented in this paper reduces the size of the data to be coded by arithmetic coding. The method is to code the uniform areas with les