Open AccessDissertation
Object localization using deformable templates
Jonathan Michael Spiller
- 12 Mar 2008
TL;DR: A new algorithm is presented for localizing objects in images, using deformable templates, using a prototype template, which consists of shape-representative contours and edges, as well as a set of control points for image warping.
read more
Abstract: A new algorithm is presented for localizing objects in images, using deformable templates. Prior knowledge of object shape is described by a prototype template, which consists of shape-representative contours and edges, as well as a set of control points for image warping. Computational efficiency is achieved using a multistage approach to find a match between the deformed template and objects in the image, by minimizing a cost function between the template and object boundary. The first stage of the algorithm reduces the physical search space size by determining the regions of interest using cross-correlation between the template and the edges of the image. A multiresolution paradigm is adopted for the second and third stages. In the second stage, an adapted hierarchical Chamfer matching scheme is used to find approximate matches between the template and the image using directional Edge Potential Fields (EPFs) of progressively higher resolutions. In the third stage, an innovative method using Particle Swarm Optimization is employed to find optimal control point placement at each resolution. A Local Weighted Mean (LWM) warp is also employed at this stage to facilitate a registration that iteratively deforms the template to fit these optimized points. The dimensionality of possible warp transformations is overcome by minimizing a cost function that penalizes extreme warps. The algorithm is succesfully applied to a number of images and the localization results are given, with each test set highlighting a different aspect of the algorithm.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Volume dimensioning systems and methods
Jeffrey Mark Hunt,Edward J. Jennings,Nancy Wojack,Scott Xavier Houle +3 more
- 03 May 2013
TL;DR: In this paper, a method for volume dimensioning packages is described, which can determine from the received image data a number of features in three dimensions of the first 3D object.
362
References
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
46.9K
Particle Swarm Optimization.
James Kennedy
- 01 Jan 2017
TL;DR: A concept for the optimization of nonlinear functions using particle swarm methodology is introduced, and the evolution of several paradigms is outlined, and an implementation of one of the paradigm is discussed.
35K
A Computational Approach to Edge Detection
TL;DR: There is a natural uncertainty principle between detection and localization performance, which are the two main goals, and with this principle a single operator shape is derived which is optimal at any scale.
29.9K
Particle swarm optimization
TL;DR: A snapshot of particle swarming from the authors’ perspective, including variations in the algorithm, current and ongoing research, applications and open problems, is included.
Snakes : Active Contour Models
TL;DR: This work uses snakes for interactive interpretation, in which user-imposed constraint forces guide the snake near features of interest, and uses scale-space continuation to enlarge the capture region surrounding a feature.