Robust face recognition via sparse representation
We consider the problem of automatically recognizing human faces from frontal views with
varying expression and illumination, as well as occlusion and disguise. We cast the …
varying expression and illumination, as well as occlusion and disguise. We cast the …
Neuroimaging standards for research into small vessel disease—advances since 2013
Cerebral small vessel disease (SVD) is common during ageing and can present as stroke,
cognitive decline, neurobehavioural symptoms, or functional impairment. SVD frequently …
cognitive decline, neurobehavioural symptoms, or functional impairment. SVD frequently …
[PDF][PDF] Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization
Principal component analysis is a fundamental operation in computational data analysis,
with myriad applications ranging from web search to bioinformatics to computer vision and …
with myriad applications ranging from web search to bioinformatics to computer vision and …
RASL: Robust alignment by sparse and low-rank decomposition for linearly correlated images
This paper studies the problem of simultaneously aligning a batch of linearly correlated images
despite gross corruption (such as occlusion). Our method seeks an optimal set of image …
despite gross corruption (such as occlusion). Our method seeks an optimal set of image …
Toward a practical face recognition system: Robust alignment and illumination by sparse representation
Many classic and contemporary face recognition algorithms work well on public data sets, but
degrade sharply when they are used in a real recognition system. This is mostly due to the …
degrade sharply when they are used in a real recognition system. This is mostly due to the …
[PDF][PDF] Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix
This paper studies algorithms for solving the problem of recovering a low-rank matrix with a
fraction of its entries arbitrarily corrupted. This problem cam be viewed as a robust version of …
fraction of its entries arbitrarily corrupted. This problem cam be viewed as a robust version of …
Fast ℓ1-minimization algorithms and an application in robust face recognition: A review
We provide a comprehensive review of five representative ℓ 1 -minimization methods, ie,
gradient projection, homotopy, iterative shrinkage-thresholding, proximal gradient, and …
gradient projection, homotopy, iterative shrinkage-thresholding, proximal gradient, and …
TILT: Transform invariant low-rank textures
In this paper, we propose a new tool to efficiently extract a class of “low-rank textures” in a
3D scene from user-specified windows in 2D images despite significant corruptions and …
3D scene from user-specified windows in 2D images despite significant corruptions and …
Robust photometric stereo via low-rank matrix completion and recovery
We present a new approach to robustly solve photometric stereo problems. We cast the
problem of recovering surface normals from multiple lighting conditions as a problem of …
problem of recovering surface normals from multiple lighting conditions as a problem of …
Long-term neurological, vascular, and mortality outcomes after stroke
Background Despite improved survival and short-term (90-day) outcomes of ischemic stroke
patients, only sparse data exist describing the sustained benefits of acute stroke care …
patients, only sparse data exist describing the sustained benefits of acute stroke care …