Jump to content

Elastic matching

From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by Fadesga (talk | contribs) at 18:29, 26 June 2025 (→See also). The present address (URL) is a permanent link to this version.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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

^ 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

This computer science article is a stub. You can help Wikipedia by expanding it.

This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Elastic_matching&oldid=1297519863"

Hidden categories: