By Topic

Pyramid implementation of optimal-step conjugate-search algorithms for some low-level vision problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
T. Simchony ; Signal & Image Process. Inst., Univ. of Southern California, Los Angeles, CA, USA ; R. Chellappa ; Z. Lichtenstein

The authors present a parallel pyramid implementation of the line search conjugate gradient algorithm for minimizing the cost function in low-level vision problems. By viewing the global cost function as a Gibbs energy function, it is possible to compute the gradients, inner products, and optimal-step size efficiently using the pyramid. Implementation of this algorithm for shape-from-shading results in a multiresolution conjugate gradient algorithm. The robustness and efficiency of the algorithm are demonstrated for edge detection using the graduated nonconvexity (GNC) algorithm. This formulation is also applied to image estimation based on Markov models. A compound model for the original image is defined that consists of a 2D noncausal Gauss-Markov random field to represent the homogeneous regions and a line process to represent the discontinuities. A deterministic algorithm based on the GNC formulation is derived to obtain a near-optimal maximum a posteriori probability estimate of images corrupted by additive Gaussian noise

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:19 ,  Issue: 6 )