Jump to content

Elastic matching

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Citation bot (talk | contribs) at 20:12, 28 October 2018 (Add: year, class, title, author pars. 1-3. You can use this bot yourself. Report bugs here. | Headbomb). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

This article needs attention from an expert in Robotics. Please add a reason or a talk parameter to this template to explain the issue with the article. WikiProject Robotics may be able to help recruit an expert. (February 2012)

Elastic matching is one of the pattern recognition techniques in computer science. Elastic matching (EM) is also known as deformable template,^[1] flexible matching, or nonlinear template matching.

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". IEICE Trans. Inf. & Syst. E88-D (8).

See also

Dynamic time warping

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

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

Hidden categories: