TY - GEN
T1 - Registration of 3D facial surfaces using covariance matrix pyramids
AU - Kaiser, Moritz
AU - Kwolek, Bogdan
AU - Staub, Christoph
AU - Rigoll, Gerhard
PY - 2010
Y1 - 2010
N2 - Registration of 3D facial surfaces means establishing point-to-point correspondence between two 3D facial surfaces. Difficulties typical for the registration of 3D facial surfaces are varying illumination, pose or viewpoint changes, varying facial expressions, and different appearance of individuals. In this work we propose to use a covariance matrix as descriptor for the neighborhood of a salient point in a face. It encodes the variance of the channels, such as red, green, blue, depth, etc., their correlations with each other, and spatial layout, while filtering out the influence of the disturbing effects mentioned above. A pyramidal approach is applied where first the location of a corresponding point is computed roughly and then the position is gradually refined. The method does not require any training. Particle Swarm Optimization makes the search for corresponding points more efficient. Results with a challenging dataset confirm that the approach works greatly for a variety of disturbing effects.
AB - Registration of 3D facial surfaces means establishing point-to-point correspondence between two 3D facial surfaces. Difficulties typical for the registration of 3D facial surfaces are varying illumination, pose or viewpoint changes, varying facial expressions, and different appearance of individuals. In this work we propose to use a covariance matrix as descriptor for the neighborhood of a salient point in a face. It encodes the variance of the channels, such as red, green, blue, depth, etc., their correlations with each other, and spatial layout, while filtering out the influence of the disturbing effects mentioned above. A pyramidal approach is applied where first the location of a corresponding point is computed roughly and then the position is gradually refined. The method does not require any training. Particle Swarm Optimization makes the search for corresponding points more efficient. Results with a challenging dataset confirm that the approach works greatly for a variety of disturbing effects.
UR - http://www.scopus.com/inward/record.url?scp=77955797800&partnerID=8YFLogxK
U2 - 10.1109/ROBOT.2010.5509629
DO - 10.1109/ROBOT.2010.5509629
M3 - Conference contribution
AN - SCOPUS:77955797800
SN - 9781424450381
T3 - Proceedings - IEEE International Conference on Robotics and Automation
SP - 1002
EP - 1007
BT - 2010 IEEE International Conference on Robotics and Automation, ICRA 2010
T2 - 2010 IEEE International Conference on Robotics and Automation, ICRA 2010
Y2 - 3 May 2010 through 7 May 2010
ER -