// Workers AI · dad joke modeWhat did elastic matching say? I'm a stretch.
(Redirected from Elastic Bunch Graph Matching)
Elastic matching is one of the pattern recognition techniques in computer science. Elastic matching (EM) is also known as deformable template, flexible matching, or nonlinear template matching.[1]
Elastic matching can be defined as an optimization problem of two-dimensional warping specifying corresponding pixels between subjected images.
References
[edit]- ↑ Talmi, Itamar; Mechrez, Roey; Zelnik-Manor, Lihi (2016). "Template Matching with Deformable Diversity Similarity". arXiv:1612.02190 [cs.CV].
- Uchida, Seiichi (August 2005). "A Survey of Elastic Matching Techniques for Handwritten Character Recognition" (PDF). IEICE Transactions on Information and Systems. E88-D (8): 1781–1790. Bibcode:2005IEITI..88.1781U. doi:10.1093/ietisy/e88-d.8.1781.
See also
[edit]
 | This computer science article is a stub. You can help Wikipedia by adding missing information. |
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by adding missing information. |