|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM205592333 |
| 003 |
DE-627 |
| 005 |
20231223234239.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231223s2011 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TIP.2011.2109729
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0685.xml
|
| 035 |
|
|
|a (DE-627)NLM205592333
|
| 035 |
|
|
|a (NLM)21292595
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Deng, Yue
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Graph Laplace for occluded face completion and recognition
|
| 264 |
|
1 |
|c 2011
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 07.11.2011
|
| 500 |
|
|
|a Date Revised 19.07.2011
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status MEDLINE
|
| 520 |
|
|
|a This paper proposes a spectral-graph-based algorithm for face image repairing, which can improve the recognition performance on occluded faces. The face completion algorithm proposed in this paper includes three main procedures: 1) sparse representation for partially occluded face classification; 2) image-based data mining; and 3) graph Laplace (GL) for face image completion. The novel part of the proposed framework is GL, as named from graphical models and the Laplace equation, and can achieve a high-quality repairing of damaged or occluded faces. The relationship between the GL and the traditional Poisson equation is proven. We apply our face repairing algorithm to produce completed faces, and use face recognition to evaluate the performance of the algorithm. Experimental results verify the effectiveness of the GL method for occluded face completion
|
| 650 |
|
4 |
|a Journal Article
|
| 650 |
|
4 |
|a Research Support, Non-U.S. Gov't
|
| 700 |
1 |
|
|a Dai, Qionghai
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Zhang, Zengke
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
|d 1992
|g 20(2011), 8 vom: 01. Aug., Seite 2329-38
|w (DE-627)NLM09821456X
|x 1941-0042
|7 nnns
|
| 773 |
1 |
8 |
|g volume:20
|g year:2011
|g number:8
|g day:01
|g month:08
|g pages:2329-38
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TIP.2011.2109729
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 20
|j 2011
|e 8
|b 01
|c 08
|h 2329-38
|