Principal Warps: Thin-Plate Splines and the Decomposition of Deformations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Feature-based image metamorphosis
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Image warping by radial basis functions: applications to facial expressions
CVGIP: Graphical Models and Image Processing
Image metamorphosis using snakes and free-form deformations
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Feature-based volume metamorphosis
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Contour blending using warp-guided distance field interpolation
Proceedings of the 7th conference on Visualization '96
Warping and morphing of graphical objects
Warping and morphing of graphical objects
Graphical Models and Image Processing
Graphical Models and Image Processing
Digital Image Warping
Image Metamorphosis with Scattered Feature Constraints
IEEE Transactions on Visualization and Computer Graphics
Image Warping with Scattered Data Interpolation
IEEE Computer Graphics and Applications
Image Morphing in Frequency Domain
Journal of Mathematical Imaging and Vision
Hi-index | 0.01 |
Image metamorphosis using simple features provides flexible and easy control of visual effect. The feature-based image metamorphosis algorithm proposed by Beier and Neely suffer from two problems; speed and strange effects. This paper presents an optimization technique to recover these problems in a reasonable time. The idea is based on local decomposition of metamorphosis into piecewise approximation and then applying Beier's technique to establishe one-to-one correspondence to recover such effects. The combination of all mapping produces the result of foldover-free as well as dominates the ghost effect. The results show that our implementation is efficient in time complexity, smoothly interpolated metamorphosis images with only a remarkably small number of specified feature points, and the speed of computations makes image metamorphosis animation reliable for interactive machine.