Search

Image enhancement is a crucial pre-processing step for various image processing applications and vision systems. Many enhancement algorithms have been proposed based on different sets of criteria. However, a direct multi-scale image enhancement algorithm capable of independently and/or simultaneously providing adequate contrast enhancement, tonal rendition, dynamic range compression, and accurate edge preservation in a controlled manner has yet to be produced. In this paper, a multi-scale image enhancement algorithm based on a new parametric contrast measure is presented. The parametric contrast measure incorporates not only the luminance masking characteristic, but also the contrast masking characteristic of the human visual system. The formulation of the contrast measure can be adapted for any multi-resolution decomposition scheme in order to yield new human visual system-inspired multi-scale transforms. In this article, it is exemplified using the Laplacian pyramid, discrete wavelet transform, stationary wavelet transform, and dual-tree complex wavelet transform. Consequently, the proposed enhancement procedure is developed. The advantages of the proposed method include: 1) the integration of both the luminance and contrast masking phenomena; 2) the extension of non-linear mapping schemes to human visual system inspired multi-scale contrast coefficients; 3) the extension of human visual system-based image enhancement approaches to the stationary and dual-tree complex wavelet transforms, and a direct means of; 4) adjusting overall brightness; and 5) achieving dynamic range compression for image enhancement within a direct multi-scale enhancement framework. Experimental results demonstrate the ability of the proposed algorithm to achieve simultaneous local and global enhancements.

This paper introduces a new concept of Boolean derivatives as a fusion of partial derivatives of Boolean functions (PDBFs). Three efficient algorithms for the calculation of PDBFs are presented. It is shown that Boolean function derivatives are useful for the application of identifying the location of edge pixels in binary images. The same concept is extended to the development of a new edge detection algorithm for grayscale images, which yields competitive results, compared with those of traditional methods. Furthermore, a new measure is introduced to automatically determine the parameter values used in the thresholding portion of the binarization procedure. Through computer simulations, demonstrations of Boolean derivatives and the effectiveness of the presented edge detection algorithm, compared with traditional edge detection algorithms, are shown using several synthetic and natural test images. In order to make quantitative comparisons, two quantitative measures are used: one based on the recovery of the original image from the output edge map and the Pratt's figure of merit.

Varying scene illumination poses many challenging problems for machine vision systems. One such issue is developing global enhancement methods that work effectively across the varying illumination. In this paper, we introduce two novel image enhancement algorithms: edge-preserving contrast enhancement, which is able to better preserve edge details while enhancing contrast in images with varying illumination, and a novel multihistogram equalization method which utilizes the human visual system (HVS) to segment the image, allowing a fast and efficient correction of nonuniform illumination. We then extend this HVS-based multihistogram equalization approach to create a general enhancement method that can utilize any combination of enhancement algorithms for an improved performance. Additionally, we propose new quantitative measures of image enhancement, called the logarithmic Michelson contrast measure (AME) and the logarithmic AME by entropy. Many image enhancement methods require selection of operating parameters, which are typically chosen using subjective methods, but these new measures allow for automated selection. We present experimental results for these methods and make a comparison against other leading algorithms.

Many applications of histograms for the purposes of image processing are well known. However, applying this process to the transform domain by way of a transform coefficient histogram has not yet been fully explored. This paper proposes three methods of image enhancement: a) logarithmic transform histogram matching, b) logarithmic transform histogram shifting, and c) logarithmic transform histogram shaping using Gaussian distributions. They are based on the properties of the logarithmic transform domain histogram and histogram equalization. The presented algorithms use the fact that the relationship between stimulus and perception is logarithmic and afford a marriage between enhancement qualities and computational efficiency. A human visual system-based quantitative measurement of image contrast improvement is also defined. This helps choose the best parameters and transform for each enhancement. A number of experimental results are presented to illustrate the performance of the proposed algorithms.

This paper presents a new concept of removing impulse noise through primary implicant elimination (PIE) applied to a logical system representation of the data. Applicable to binary and grayscale images, errors are corrected efficiently, in terms of the number of computations and memory requirements, while the fine details of the image are mostly preserved. Three filtering algorithms are presented: a general form in addition to iterative and switching variations. Experimental results on salt-and-pepper impulse noise, as well as on random-valued impulse noise, are compared against the performance of traditional median-based filters (both regular and switching) and are shown to be most successful in the often difficult case of when the original image contains many detailed patterns. [ABSTRACT FROM AUTHOR]

Presents information on a study regarding a class of the frequency domain-based signal/image enhancement algorithms including magnitude reduction, log-magnitude reduction, iterative magnitude and a log-reduction zonal magnitude technique. Description of the sequency-ordered transform used in image enhancement; Definition of sequency ordered orthogonal transform; Evaluation of the enhancement algorithm.

Deals with a study which discussed an effective column-wise algorithm for computing two-dimensional discrete Hadamard transform (DHAT), by using the paired algorithm of the one-dimensional DHAT. Information on the use of DHAT techniques; Application of the proposed algorithm; Conclusion.

Presents information on a study which introduced an algorithm to compute one dimensional unitary transforms by using the special partitioning in the frequency domain. Formulation of the basic problem involved in the study; Definition of the partitions of sets revealing transforms; Application of discrete fourier transforms; Conclusions.