Abstract
In this paper a new formulation of the two-dimensional (2-D) deformable template matching problem is proposed. It uses a lower-dimensional search space than conventional methods by precomputing extensions of the deformable template along orthogonal curves. The reduction in search space allows the use of dynamic programming to obtain globally optimal solutions and reduces the sensitivity of the algorithm to initial placement of the template. Further, the technique guarantees that the result is a curve which does not collapse to a point in the absence of strong image gradients and is always nonself intersecting. Examples of the use of the technique on real-world images and in simulations at low signal-to-noise ratios (SNR's) are also provided.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
