Robust face recognition by computing distances from multiple histograms of oriented gradients

M Karaaba, O Surinta, L Schomaker… - 2015 IEEE Symposium …, 2015 - ieeexplore.ieee.org
The Single Sample per Person Problem is a challenging problem for face recognition
algorithms. Patch-based methods have obtained some promising results for this problem. In …
被引用次数：38 相关文章
[PDF] psu.edu

[PDF][PDF] Robust Face Recognition by Computing Distances from Multiple Histograms of Oriented Gradients

MF Karaaba, O Surinta, L Schomaker, MA Wiering - Citeseer
The Single Sample per Person Problem is a challenging problem for face recognition
algorithms. Patch-based methods have obtained some promising results for this problem. In …
[PDF] rug.nl

[PDF][PDF] Robust Face Recognition by Computing Distances from Multiple Histograms of Oriented Gradients

M Karaaba, O Surinta, L Schomaker… - IEEE Symposium Series …, 2015 - research.rug.nl
The Single Sample per Person Problem is a challenging problem for face recognition
algorithms. Patch-based methods have obtained some promising results for this problem. In …
[PDF] archive.org

[PDF][PDF] Robust Face Recognition by Computing Distances from Multiple Histograms of Oriented Gradients

MF Karaaba, O Surinta, L Schomaker, MA Wiering - scholar.archive.org
The Single Sample per Person Problem is a challenging problem for face recognition
algorithms. Patch-based methods have obtained some promising results for this problem. In …
[PDF] rug.nl

[PDF][PDF] Robust Face Recognition by Computing Distances from Multiple Histograms of Oriented Gradients

MF Karaaba, O Surinta, L Schomaker, MA Wiering - ai.rug.nl
The Single Sample per Person Problem is a challenging problem for face recognition
algorithms. Patch-based methods have obtained some promising results for this problem. In …
[PDF] msu.ac.th

[PDF][PDF] Robust Face Recognition by Computing Distances from Multiple Histograms of Oriented Gradients

MF Karaaba, O Surinta, L Schomaker, MA Wiering - olarik.it.msu.ac.th
The Single Sample per Person Problem is a challenging problem for face recognition
algorithms. Patch-based methods have obtained some promising results for this problem. In …
[PDF] researchgate.net

[PDF][PDF] Robust Face Recognition by Computing Distances from Multiple Histograms of Oriented Gradients

MF Karaaba, O Surinta, L Schomaker, MA Wiering - researchgate.net
The Single Sample per Person Problem is a challenging problem for face recognition
algorithms. Patch-based methods have obtained some promising results for this problem. In …
[PDF] rug.nl

[PDF][PDF] Robust Face Recognition by Computing Distances from Multiple Histograms of Oriented Gradients

MF Karaaba, O Surinta, L Schomaker, MA Wiering - ai.rug.nl
The Single Sample per Person Problem is a challenging problem for face recognition
algorithms. Patch-based methods have obtained some promising results for this problem. In …