Showing papers on "Illumination problem published in 2006"
17 Jun 2006
TL;DR: This paper proposes a system which can handle illumination problem of face recognition systems by using "Retinex and color constancy" algorithm which has been plugged with Elastic Bunch Graph Matching (EBGM).
Abstract: This paper proposes a system which can handle illumination problem of face recognition systems by using "Retinex and color constancy" algorithm. The Retinex and color constancy approach has been plugged with Elastic Bunch Graph Matching (EBGM). The proposed system has been tested on IITK database having more than 1000 face images. The experimental results demonstrate that performance of the proposed system is superior to the known systems. The overall accuracy has shown an increase of 3.14% as compared to the known EBGM based recognition system without using Retinex and Color Constancy method.
24 citations
18 Dec 2006
TL;DR: Experimental results demonstrate that the proposed logarithmic-wavelet transform based method simultaneously achieves singleimage super-resolution and image enhancement especially shadow removing.
Abstract: Most learning-based super-resolution algorithms neglect the illumination problem such as shadows and illumination direction changes. In this paper we propose a logarithmic-wavelet transform (Log-WT) based method to combine super-resolution and shadow removing into a single operation. First intrinsic, illumination invariant features of the image are extracted by exploiting logarithmic-wavelet transform. Then an initial estimation of high resolution image is obtained based on the assumption that small patches in low resolution space and patches in high resolution space share the similar local manifold structure. Finally the target high resolution image is reconstructed by applying the reconstruction constraints in pixel domain. Experimental results demonstrate that the proposed method simultaneously achieves singleimage super-resolution and image enhancement especially shadow removing.
3 citations
20 Aug 2006
TL;DR: This article proposes optimal and quasi optimal solutions to the problem of searching for the maximum lighting point inside a polygon P of n vertices and shows that simulated annealing is very competitive in this application.
Abstract: In this article we propose optimal and quasi optimal solutions to the problem of searching for the maximum lighting point inside a polygon P of n vertices. This problem is solved by using three different techniques: random search, simulated annealing and gradient. Our comparative study shows that simulated annealing is very competitive in this application. To accomplish the study, a new polygon generator has been implemented, which greatly helps in the general validation of our claims on the illumination problem as a new class of optimization task.
3 citations