%0 Conference Paper %B Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP '05). IEEE International Conference on %D 2005 %T A method for converting a smiling face to a neutral face with applications to face recognition %A Ramachandran, M. %A Zhou,S. K %A Jhalani, D. %A Chellapa, Rama %K appearance-based %K Expression %K Face %K face; %K feature %K invariant %K motion; %K neutral %K nonrigid %K normalization; %K recognition; %K smiling %X The human face displays a variety of expressions, like smile, sorrow, surprise, etc. All these expressions constitute nonrigid motions of various features of the face. These expressions lead to a significant change in the appearance of a facial image which leads to a drop in the recognition accuracy of a face-recognition system trained with neutral faces. There are other factors like pose and illumination which also lead to performance drops. Researchers have proposed methods to tackle the effects of pose and illumination; however, there has been little work on how to tackle expressions. We attempt to address the issue of expression invariant face-recognition. We present preprocessing steps for converting a smiling face to a neutral face. We expect that this would in turn make the vector in the feature space to be closer to the correct vector in the gallery, in an appearance-based face recognition. This conjecture is supported by our recognition results which demonstrate that the accuracy goes up if we include the expression-normalization block. %B Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP '05). IEEE International Conference on %V 2 %P ii/977 - ii/980 Vol. 2 - ii/977 - ii/980 Vol. 2 %8 2005/03// %G eng %R 10.1109/ICASSP.2005.1415570 %0 Conference Paper %B Image Processing, 2004. ICIP '04. 2004 International Conference on %D 2004 %T Multi-level fast multipole method for thin plate spline evaluation %A Zandifar,A. %A Lim,S. %A Duraiswami, Ramani %A Gumerov, Nail A. %A Davis, Larry S. %K (mathematics); %K Computer %K deformation; %K evaluation; %K fast %K image %K MATCHING %K matching; %K metal %K method; %K multilevel %K multipole %K nonrigid %K pixel; %K plate %K plate; %K processing; %K registration; %K resolution; %K spline %K splines %K thin %K vision; %X Image registration is an important problem in image processing and computer vision. Much recent work in image registration is on matching non-rigid deformations. Thin plate splines are an effective image registration method when the deformation between two images can be modeled as the bending of a thin metal plate on point constraints such that the topology is preserved (non-rigid deformation). However, because evaluating the computed TPS model at all the image pixels is computationally expensive, we need to speed it up. We introduce the use of multi-level fast muitipole method (MLFMM) for this purpose. Our contribution lies in the presentation of a clear and concise MLFMM framework for TPS, which will be useful for future application developments. The achieved speedup using MLFMM is an improvement from O(N2) to O(N log N). We show that the fast evaluation outperforms the brute force method while maintaining acceptable error bound. %B Image Processing, 2004. ICIP '04. 2004 International Conference on %V 3 %P 1683 - 1686 Vol. 3 - 1683 - 1686 Vol. 3 %8 2004/10// %G eng %R 10.1109/ICIP.2004.1421395 %0 Conference Paper %B Computer Vision and Pattern Recognition, 1993. Proceedings CVPR '93., 1993 IEEE Computer Society Conference on %D 1993 %T 2D images of 3-D oriented points %A Jacobs, David W. %K 2D %K 3-D %K database %K derivation; %K image %K images; %K indexing; %K linear %K model %K nonrigid %K oriented %K points; %K processing; %K recovery; %K structure-form-motion %K structure-from-motion %K transformation; %X A number of vision problems have been shown to become simpler when one models projection from 3-D to 2-D as a nonrigid linear transformation. These results have been largely restricted to models and scenes that consist only of 3-D points. It is shown that, with this projection model, several vision tasks become fundamentally more complex in the somewhat more complicated domain of oriented points. More space is required for indexing models in a database, more images are required to derive structure from motion, and new views of an object cannot be synthesized linearly from old views %B Computer Vision and Pattern Recognition, 1993. Proceedings CVPR '93., 1993 IEEE Computer Society Conference on %P 226 - 232 %8 1993/06// %G eng %R 10.1109/CVPR.1993.340985