ceedings of the 14th ACM SIGGRAPH / Eurographics
Symposium on Computer Animation.
Joshi, P., Tien, W. C., Desbrun, M., and Pighin, F. (2003).
Learning controls for blend shape based realistic fa-
cial animation. In Proceedings of the 2003 ACM SIG-
GRAPH/Eurographics Symposium on Computer Ani-
mation, SCA ’03, pages 187–192.
Lewis, J. P. and Anjyo, K. (2010). Direct manipulation
blendshapes. IEEE Comput. Graph. Appl., 30(4):42–
50.
Lewis, J. P., Anjyo, K., Rhee, T., Zhang, M., Pighin, F., and
Deng, Z. (2014). Practice and theory of blendshape
facial models. In Eurographics STAR, pages 199–218.
Lewis, J. P., Cordner, M., and Fong, N. (2000). Pose space
deformation: A unified approach to shape interpola-
tion and skeleton-driven deformation. In Proceedings
of the 27th Annual Conference on Computer Graphics
and Interactive Techniques, SIGGRAPH ’00, pages
165–172, New York, NY, USA. ACM Press/Addison-
Wesley Publishing Co.
Lewis, J. P. and Dragosavac, N. (2010). Stable and efficient
differential inverse kinematics. In ACM SIGGRAPH
ASIA 2010 Sketches, SA ’10, pages 1–2.
Li, H., Weise, T., and Pauly, M. (2010). Example-based
facial rigging. ACM Trans. Graph., 29(4):1–6.
Nakamura, Y. and Hanafusa, H. (1986). Inverse kinematic
solutions with singularity robustness for robot manip-
ulator control. Journal of Dynamic Systems, Measure-
ment and Control, 108:163–171.
Nakamura, Y., Hanafusa, H., and Yoshikawa, T. (1987).
Task-priority based redundancy control of robot ma-
nipulators. Int. J. Rob. Res., 6(2):3–15.
Neumann, T., Varanasi, K., Wenger, S., Wacker, M., Mag-
nor, M., and Theobalt, C. (2013). Sparse local-
ized deformation components. ACM Trans. Graph.,
32(6):179:1–179:10.
Orvalho, V., Bastos, P., Parke, F., Oliveira, B., and X., A.
(2012). A facial rigging survey. In in Proc. of the
33rd Annual Conference of the European Association
for Computer Graphics - Eurographics, pages 10–32.
Pighin, F., Hecker, J., Lischinski, D., Szeliski, R., and
Salesin, D. H. (1998). Synthesizing realistic facial
expressions from photographs. In Proc. 25th Annual
Conference on Computer Graphics and Interactive
Techniques, SIGGRAPH ’98, pages 75–84.
Seo, J., Irving, G., Lewis, J. P., and Noh, J. (2011). Com-
pression and direct manipulation of complex blend-
shape models. In Proceedings of the 2011 SIGGRAPH
Asia Conference, SA ’11, pages 164:1–164:10.
Sloan, P.-P. J., Rose, III, C. F., and Cohen, M. F. (2001).
Shape by example. In Proceedings of the 2001 Sym-
posium on Interactive 3D Graphics, I3D ’01, pages
135–143, New York, NY, USA. ACM.
Sumner, R. W., Zwicker, M., Gotsman, C., and Popovi
´
c, J.
(2005). Mesh-based inverse kinematics. ACM Trans.
Graph., 24(3):488–495.
Tena, J. R., De la Torre, F., and Matthews, I. (2011). In-
teractive region-based linear 3d face models. In ACM
SIGGRAPH 2011 Papers, pages 76:1–76:10.
Tikhonov, A. and Arsenin, V. (1977). Solutions of ill-posed
problems. Wiley, New York.
Tolani, D. and Badler, N. (1996). Real-time inverse kine-
matics of the human arm. Presence, 5(4):393–401.
Welman, C. (1993). Inverse kinematics and geometric con-
straints for articulated figure animation. Master The-
sis, Simon Fraser University.
Yu, H. and Liu, H. (2014). Regression-based facial ex-
pression optimization. IEEE Transactions on Human-
Machine Systems, 44(3):386–394.
Zhang, L., Snavely, N., Curless, B., and Seitz, S. M. (2004).
Spacetime faces: High resolution capture for model-
ing and animation. ACM Trans. Graph., 23(3):548–
558.
Zhao, J. and Badler, N. I. (1994). Inverse kinematics posi-
tioning using nonlinear programming for highly artic-
ulated figures. ACM Trans. Graph., 13(4):313–336.
APPENDIX: Transition from
Pseudo-inverse to Transposition
The transposition algorithm can be motivated by ex-
pressing the pseudoinverse in terms of an orthonor-
malized basis. We orthonormalize the B
T
matrix,
and extract the deformation directions from the blend-
shape matrix, because both share the same vector
spans. Therefore, we apply the Gram-Schmidt pro-
cess (Cheney and Kincaid, 2009), and store the ex-
tracted orthonormal matrix in Q. After, we substitute
the new Q matrix instead of B
T
in Equation 3 with a
scaling step-size matrix R for the point movements.
The new pseudoinverse equation becomes:
w = (QQ
T
)
−1
Q(Rm) (10)
In Equation 10, Q is an orthonormal matrix.
Thereby, QQ
T
becomes an identity matrix. The new
update function turns into w = Q(Rm). According to
Jacobian Transpose suggestion, weight update can be
represented as w = B
T
m. To minimize the scaling
step-size of the point movements we apply the fol-
lowing minimization:
min
R
kB
T
− QRk
2
(11)
The solution of Equation 11 shows us R = Q
T
B
T
.
Alternatively, least square process can be replaced
with a simple qr factorization. Then, R is substituted
to Equation 10 and the final weight update function
becomes:
w = B
T
m (12)
Reviewing these steps, we see that when the basis
is orthogonal, the pseudoinverse can be reduced to the
transposition approach. In turn, the bad behavior of
the pseudoinverse can be understood in terms of the
lack of orthogonality of the basis.
GRAPP 2017 - International Conference on Computer Graphics Theory and Applications
114