Topic
Illumination problem
About: Illumination problem is a research topic. Over the lifetime, 93 publications have been published within this topic receiving 5859 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: The combination of the dark channel and the atmospheric scattering model along with the k-means segmentation to reduce the effects of non-uniform illumination conditions in image binarization is introduced.
Abstract: Non-uniform illumination is a common issue in images acquired in uncontrolled environments. Elimination or reduction of the non-uniform illumination problem is required in order to get an accurate image binarization. This paper introduces the combination of the dark channel and the atmospheric scattering model along with the k-means segmentation to reduce the effects of non-uniform illumination conditions in image binarization. The results show the effectiveness and robustness of this approach.
Journal Article•
TL;DR: In this article, the authors presented two multiple illumination eigenspaces-based methods, RDEB and BPNNB, for solving the variable illumination problem of face recognition. And the experiment showed that the methods have a high recognition ratio.
Abstract: This paper presents two multiple illumination eigenspaces-based methods, RDEB and BPNNB, for solving the variable illumination problem of face recognition. The experiment shows that the methods have a high recognition ratio. In particular, BPNNB has outperformed the assumptive method which knows the illumination directions of faces and completes recognition in the specific eigenspace using eigenface method[2] for each face subset with a specific illumination direction.
Posted Content•
TL;DR: In this article, a combinatorial version of the classical illumination problem for convex bodies in Euclidean spaces was introduced and solved for a large subfamily of convex body.
Abstract: In this note we introduce the problem of illumination of convex bodies in spherical spaces and solve it for a large subfamily of convex bodies. We derive from it a combinatorial version of the classical illumination problem for convex bodies in Euclidean spaces as well as a solution to that for a large subfamily of convex bodies, which in dimension three leads to special Koebe polyhedra.