CASIA OpenIR  > 类脑智能研究中心
Recognizing Occluded 3D Faces Using an Efficient ICP Variant
Peijiang Liu; Yunhong Wang; Di Huang; Zhaoxiang Zhang
Conference NameInternational Conference on Multimedia and Expo
Source PublicationICME 2012
Conference Date9-13 July 2012
Conference PlaceMelbourne, Australia
AbstractThis paper proposes an efficient variant of the Iterative Closest Point (ICP) algorithm for 3D face recognition in the presence of occlusion. The new ICP variant improves the original one in two aspects: the computational efficiency and the robustness to occlusion changes. For the former one, a facial surface is firstly described as a Spherical Depth Map (SDM), based on which uniform down-sampling can be conveniently applied to remove redundant vertices, aiming to decrease the consumed time of ICP. For the latter one, since occlusions can be considered as face outliers, a rejection strategy is embedded into ICP to eliminate their impacts. The proposed method is validated in face verification and identification scenarios on the Bosphorus database, and the experimental results clearly demonstrate its effectiveness and efficiency.
KeywordOcclusion 3d Face Recognition Surface Registration Shape Representation Iterative Closest Point
Document Type会议论文
Corresponding AuthorZhaoxiang Zhang
Recommended Citation
GB/T 7714
Peijiang Liu,Yunhong Wang,Di Huang,et al. Recognizing Occluded 3D Faces Using an Efficient ICP Variant[C],2012.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Peijiang Liu]'s Articles
[Yunhong Wang]'s Articles
[Di Huang]'s Articles
Baidu academic
Similar articles in Baidu academic
[Peijiang Liu]'s Articles
[Yunhong Wang]'s Articles
[Di Huang]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Peijiang Liu]'s Articles
[Yunhong Wang]'s Articles
[Di Huang]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.