5 Result(s)
within
Jufu Feng
Computer Science
Algorithm Analysis and Problem Complexity
-
Chapter and Conference Paper
Lighting Coefficients Transfer Based Face Illumination Normalization
In this paper, a linear representation based face illumination normalization method is put forward. According to the Lambertian reflectance model, the specific illumination of a face image is determined linear...
-
Chapter and Conference Paper
Segmentation via NCuts and Lossy Minimum Description Length: A Unified Approach
We investigate a fundamental problem in computer vision: unsupervised image segmentation. During the last decade, the Normalized Cuts has become very popular for image segmentation. NCuts guarantees a globally...
-
Chapter and Conference Paper
Towards Hypothesis Testing and Lossy Minimum Description Length: A Unified Segmentation Framework
We propose a novel algorithm for unsupervised segmentation of images based on statistical hypothesis testing. We model the distribution of the image texture features as a mixture of Gaussian distributions so t...
-
Chapter and Conference Paper
Rademacher Margin Complexity
The Rademacher complexity [1] of a function class F is defined as
-
Chapter and Conference Paper
Classification with the Hybrid of Manifold Learning and Gabor Wavelet
While manifold learning algorithms can discover intrinsic low-dimensional manifold embedded in the high-dimensional Euclidean space, the discriminant ability of the low-dimensional subspaces obtained by the al...
