Open Access Open Access  Restricted Access Subscription or Fee Access

Image Enhancement for Varying Lighting Conditions Using Color and Depth Images

N. Narendra Babu, C. Mohan Rao, L Guru Kumar

Abstract


In this paper, we have a tendency to propose a replacement international distinction improvement algorithmic program exploitation the histograms of color and depth pictures. On the thought of the histogram-change system, the shading and profundity picture histograms region unit starting partitioning into sub interims misuse the Gaussian blend model. The positions partitioning the color histograms area unit adjusted to spatially neighbor pixels with an equivalent intensity and depth values will be sorted into an equivalent interval. By estimating the mapping curve of the distinction improvement for every interval, exploitation this model international distinction improvement will be improved while not over-enhancing the native picture qualification. Test results show the adequacy of the projected algorithmic program.

Keywords


Contrast Enhancement, Depth Image, Histogram Modification, Histogram Partitioning.

Full Text:

PDF

References


Salih Dikbas, Senior Member, IEEE “ A bar chart modification framework and it’s application for image qualification update," IEEE Trans. Picture strategy., Vol. 18, no. 9 , pp. 1920-1934, Sep. 09 .

T.Celik and T.Tjahjadi, ‘” Automatic image equalization and contrast enhancement using using gaussian mixture modeling,”IEEE Trans. Image Process., vol. 21, pp. 145-156, jan.2012.

M. Abdullah-Al-Wadud,Md. H. Kabir, M.A.A.Dewan, and O.Chae, “A dynamic histogram equalization for image contrast enhancement,”IEEE Trans . Consumer Electron. vol. 53, no. 2, pp. 593–600, May2007.

T. Luft, C.Colditz, and O.Dessen, “Image enhancement by unsharp masking the depth buffer,” ACM Trans. Graph., vol . 25, no.3, pp 1206-1213, jul.2006.

J.Kopf, M.F, Chen, D.Lischinski, and M.Uyttendaele, “joint bilateral upsampling,”ACM Trans.graph ., vol.,26,no.3,pp.1-5,jul.2007.

S. W. Jung. “improvement of image and profundity guide utilizing adapative joint trilateral channel ,” IEEE Trans. Circuits Syst. Feature Techo., 21, no. 3, pp. 1191-1199 Mar. 2012

M. M. Subedar and L. J Karan, “Expanded profundity recognition with sharpness Upgrade for stereo feature,” in Proc. SPIE, 2010, Vol.7524, p.75241B

K.Lai, L.Bo, X.Ren,” A Vast scale progressive multiview RGB-D object dataset,” in Proc.IEEE Int. Conf. Apply autonomy and Automation (ICRA),2011, pp. 1817-18

M. Kaaniche, Faouzi Alaya Cheikh, “consolidating profundity knowledge and near edge recognition for stereo image upgrade,” in Proc. Eur. signal process. Conf. (EUSIPCO), 2012, no. 1, Pp. 250-254.

M. M. Subedar and L. J. Karam, “Expanded profundity recognition with sharpness Upgrade for stereo feature,” in Proc. SPIE, 7524 stereoscopic Displays Appl. XXI, 2010, p. 1-8.

Q.Yang,” A non near by price aggregation method for stereo coordinative,” in Proc. IEEE Comput. Vis. Style Recogn., 2012, pp. 1402-1409.

M.Figueredo and A . Jain, “unsupervised learning of restricter mixture models,” IEEE Trans. Patt. Anal. Mach. Intell., vol. 24, no. 3, pp. 381,382,383,385,386-396, Mar. 2002.

Wa James Tam, J Flack, “Smoothing profundity maps for increased photograph quality,” Proc. Int. Soc. Select. Eng. Conf. three-D TV Feature Show III, pp. 162-172 2004.

D. Scharstein and R. Szeliski, “A taxonomy and evaluation of densetwo-frame stereo correspondence algorithms,” Int. J. Comput. Vis., vol. 47, no. 1, pp. 7–42, Apr.–Jun. 2002

J. Delon, A. Desolneux, J.L. Lisani, “A non parametrical apporoach for bar chart division,”IEEE Trans. Image method. vol. 16, no. 253-261, jan. 2007.

S. J. Ko, “Profundity sensation upgrade utilizing the just noticeable profundity distinction,” IEEE Trans. Picture no. 8, pp. 3624-3637 Aug. 2012.

H. Y. Shum , S. B. Kang , “ Review of image based mostly representations and pressure strategies, ” IEEE Trans. Circuits Syst. Feature Technol., vol. 13, pp. 1020-1037 2003


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.