HSI based colour image equalization using iterative nth root and nth power
In this paper an equalization technique for colour images is introduced. The method is based on nth root and nth power equalization approach but with optimization of the mean of the image in different colour channels such as RGB and HSI. The performance of the proposed method has been measured by the means of peak signal to noise ratio. The proposed algorithm has been compared with conventional histogram equalization and the visual and quantitative experimental results are showing that the proposed method over perform the histogram equalization.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Underwater Image Enhancement Using Convolutional Neural Network
This work proposes a method for underwater image enhancement using the principle of histogram equalization. Since underwater images have a global strong dominant colour, their colourfulness and contrast are often degrade…
Image EnhancementPatch based Colour Transfer using SIFT Flow
We propose a new colour transfer method with Optimal Transport (OT) to transfer the colour of a sourceimage to match the colour of a target image of the same scene that may exhibit large motion changes betweenimages. By …
Motion EstimationAutomated Switching System for Skin Pixel Segmentation in Varied Lighting
In Computer Vision, colour-based spatial techniquesoften assume a static skin colour model. However, skin colour perceived by a camera can change when lighting changes. In common real environment multiple light sources i…
Iterative Nadaraya-Watson Distribution Transfer for Colour Grading
We propose a new method with Nadaraya-Watson that maps one N-dimensional distribution to another taking into account available information about correspondences. We extend the 2D/3D problem to higher dimensions by encodi…
Sliced $\mathcal{L}_2$ Distance for Colour Grading
We propose a new method with $\mathcal{L}_2$ distance that maps one $N$-dimensional distribution to another, taking into account available information about correspondences. We solve the high-dimensional problem in 1D sp…