Beier–Neely morphing algorithm
Image morphing is a technique to synthesize a fluid transformation from one image (source image) to another (destination image). Source image can be one or more than one images. There are two parts in the image morphing implementation. The first part is warping and the second part is cross-dissolving.
The algorithm of Beier and Neely[1] is a method to compute a mapping of coordinates between 2 images from a set of lines; i.e., the warp is specified by a set of line pairs where the start-points and end-points are given for both images. The algorithm is widely used within morphing software.
Also noteworthy, this algorithm only discussed about the situation with at most 2 source images as there are other algorithms[2] introducing multiple source images.
See also
[edit]References
[edit]- ↑ Beier, T. & Neely, S. (1992). "Feature-based image metamorphosis" (PDF). Computer Graphics. 26 (2): 35–42. doi:10.1145/133994.134003. S2CID 9124441.
- ↑ Seungyong Lee, Wolberg; G., Sung Yong Shin (1998). "Polymorph: morphing among multiple images". IEEE Computer Graphics and Applications. 18 (1): 58–71. doi:10.1109/38.637304.
External links
[edit]
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by adding missing information. |