نتایج جستجو برای: Histogram Modification
تعداد نتایج: 140204 فیلتر نتایج به سال:
Histogram equalization is widely used in different ways to perform contrast enhancement in images. In this paper, a new Histogram modification algorithm is proposed for contrast enhancement of images. Histogram Equalization (HE) is one of the most popular technique used for digital image enhancement, but it is not suitable to be implemented directly in consumer electronics, such as television, ...
A reversible data hiding scheme based on integer DWT and histogram modification is proposed. In the scheme, the cover media is firstly transformed by Integer DWT (Discrete Wavelet Transformation); then information is embedded through the modification of histograms of the middle and high frequency sub-bands of the DWT coefficients. In order to increase the embedding capacity, a multi-level schem...
A novel approach for shape preserving contrast enhancement is presented in this paper. Contrast enhancement is achieved by means of a local histogram equalization algorithm which preserves the level-sets of the image. This basic property is violated by common local schemes, thereby introducing spurious objects and modifying the image information. The scheme is based on equalizing the histogram ...
This paper presents an optimum histogram pair based image reversible data hiding scheme using integer wavelet transform and adaptive histogram modification. This new scheme is characterized by (1) the selection of best threshold T, which leads to the highest PSNR of marked image for a given payload; (2) the adaptive histogram modification, which aims at avoiding underflow and/or overflow, is ca...
We develop reconfigurable mesh (RMESH) algorithms for window broadcasting, data shifts, and consecutive sum. These are then used to develop efficient algorithms to compute the histogram of an image and to perform histogram modification. The histogram of an N×N image is computed by an N×N RMESH in O (√ B log√ B (N/√ B ) for B < N, Ο(√ N ) for B = N, and Ο(√ B ) for B > N. B is the number of gray...
We consider the following image processing problems: compute the area and perimeter of the components of an image, compute the histogram of an image, and histogram modification. Parallel reconfigurable mesh computer algorithms are developed for these problems. The area and perimeter of the components of an N×N image are computed in O (logN) time by an N×N RMESH; the histogram of an N×N image is...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید