Using Dynamic Programming For Minimizing The Energy Of Active Contours In The Presence Of Hard Constraints

Amini, Amir A.; Tehrani, Saeid; Weymouth, Terry E.

doi:10.1109/ccv.1988.589976

Cited by 172 publications

(80 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Furthermore, it was difficult to use snakes for recognition because of differences in sampling and parameterization in comparing recovered descriptions. This led to the development of algorithms that enforce a priori constraints on the types of allowable deformations for motion tracking [1,8,49], deformable templates [25,55,65], trainable snakes [3,12], and deformable prototypes [46]. Such approaches provide a low-dimensional characterization of shape that enables recognition and comparison of nonrigid motions.…”

Section: Related Workmentioning

confidence: 99%

“…By taking advantage of texture mapping hardware commonly available in PCs, the active blobs system has achieved peak rates of over 20 frames/s. 1 Nonrigidity is modeled by a set of global, parametric shape warping functions that control the blobÕs deformation during registration. In this paper the warping functions are defined by the 2D affine transformations and the 2D free-vibration modes.…”

Section: Overview Of Our Approachmentioning

confidence: 99%

See 1 more Smart Citation

Active blobs: region-based, deformable appearance models

Sclaroff

Isidoro

2003

Computer Vision and Image Understanding

View full text Add to dashboard Cite

A region-based approach to nonrigid motion tracking is described. Shape is defined in terms of a deformable triangular mesh that captures object shape plus a color texture map that captures object appearance. Photometric variations are also modeled. Nonrigid shape registration and motion tracking are achieved by posing the problem as an energy-based, robust minimization procedure. The approach provides robustness to occlusions, wrinkles, shadows, and specular highlights. The formulation is tailored to take advantage of texture mapping hardware available in many workstations, PCs, and game consoles. This enables nonrigid tracking at speeds approaching video rate. Ó 2003 Published by Elsevier Science (USA).

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Overview Of Our Approachmentioning

confidence: 99%

Active blobs: region-based, deformable appearance models

Sclaroff

Isidoro

2003

Computer Vision and Image Understanding

View full text Add to dashboard Cite

show abstract

“…Li & Acton 2007). Several works (Amini et al 1988;Mun et al 2004;Bresson et al 2007) have tried to address the snake model limitations in regard to noise tolerance, local minima sensitivity, and stability. Very few have succeeded in proposing an alternative that would solve the snake model's limitations without compromising its performance, flexibility, and simplicity.…”

Section: Introductionmentioning

confidence: 99%

An evolutionary computation based algorithm for calculating solar differential rotation by automatic tracking of coronal bright points

Shahamatnia

Dorotovič

Fonseca

et al. 2016

J. Space Weather Space Clim.

View full text Add to dashboard Cite

Developing specialized software tools is essential to support studies of solar activity evolution. With new space missions such as Solar Dynamics Observatory (SDO), solar images are being produced in unprecedented volumes. To capitalize on that huge data availability, the scientific community needs a new generation of software tools for automatic and efficient data processing. In this paper a prototype of a modular framework for solar feature detection, characterization, and tracking is presented. To develop an efficient system capable of automatic solar feature tracking and measuring, a hybrid approach combining specialized image processing, evolutionary optimization, and soft computing algorithms is being followed. The specialized hybrid algorithm for tracking solar features allows automatic feature tracking while gathering characterization details about the tracked features. The hybrid algorithm takes advantages of the snake model, a specialized image processing algorithm widely used in applications such as boundary delineation, image segmentation, and object tracking. Further, it exploits the flexibility and efficiency of Particle Swarm Optimization (PSO), a stochastic population based optimization algorithm. PSO has been used successfully in a wide range of applications including combinatorial optimization, control, clustering, robotics, scheduling, and image processing and video analysis applications. The proposed tool, denoted PSO-Snake model, was already successfully tested in other works for tracking sunspots and coronal bright points. In this work, we discuss the application of the PSO-Snake algorithm for calculating the sidereal rotational angular velocity of the solar corona. To validate the results we compare them with published manual results performed by an expert.

show abstract

“…The solution proposed in [17] can be derived by incorporating variational calculus techniques. However it has been shown in [19] that these techniques present several problems such as: (A) the solution can reveal numerical instabilities and (B) points show a tendency to pile up on strong portions at an edge contour. Amini et al [19] proposed an algorithm for the active contour model using dynamic programming, an approach that is more stable and allows the inclusion of hard constraints in addition to the soft constraints inherent in the formulation of the functional.…”

Section: Greedy Algorithm: a Fast Approach Towards Active Contour Conmentioning

confidence: 99%

“…However it has been shown in [19] that these techniques present several problems such as: (A) the solution can reveal numerical instabilities and (B) points show a tendency to pile up on strong portions at an edge contour. Amini et al [19] proposed an algorithm for the active contour model using dynamic programming, an approach that is more stable and allows the inclusion of hard constraints in addition to the soft constraints inherent in the formulation of the functional. This method though is slow having complexity O(nm 3 ), where n is the number of points of the active contour while m is the size of the region, inside which a point can move during a single iteration.…”

Section: Greedy Algorithm: a Fast Approach Towards Active Contour Conmentioning

confidence: 99%

Unsupervised segmentation of stereoscopic video objects: investigation of two depth-based approaches

Ntalianis

Doulamis

et al.

2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)

View full text Add to dashboard Cite

In this paper two efficient unsupervised video object segmentation approaches are proposed and thoroughly compared in terms of computational cost and quality of segmentation results. Both methods are based on the exploitation of depth information, estimated for stereoscopic pairs of frames. In particular, in both schemes an occlusion compensated disparity field is initially computed and a depth map is generated. Then a depth segments map is produced by incorporating a modified version of the multiresolution Recursive Shortest Spanning Tree segmentation algorithm (M-RSST). Next considering the first "Constrained Fusion

show abstract

Using Dynamic Programming For Minimizing The Energy Of Active Contours In The Presence Of Hard Constraints

Cited by 172 publications

References 6 publications

Active blobs: region-based, deformable appearance models

Active blobs: region-based, deformable appearance models

An evolutionary computation based algorithm for calculating solar differential rotation by automatic tracking of coronal bright points

Unsupervised segmentation of stereoscopic video objects: investigation of two depth-based approaches

Contact Info

Product

Resources

About