NDLI: Smoothing-based Optimization

Content Provider	IEEE Xplore Digital Library
Author	Leordeanu, M. Hebert, M.
Copyright Year	2008
Description	Author affiliation: Carnegie Mellon Univ., Pittsburgh, PA (Leordeanu, M.; Hebert, M.)
Abstract	We propose an efficient method for complex optimization problems that often arise in computer vision. While our method is general and could be applied to various tasks, it was mainly inspired from problems in computer vision, and it borrows ideas from scale space theory. One of the main motivations for our approach is that searching for the global maximum through the scale space of a function is equivalent to looking for the maximum of the original function, with the advantage of having to handle fewer local optima. Our method works with any non-negative, possibly non-smooth function, and requires only the ability of evaluating the function at any specific point. The algorithm is based on a growth transformation, which is guaranteed to increase the value of the scale space function at every step, unlike gradient methods. To demonstrate its effectiveness we present its performance on a few computer vision applications, and show that in our experiments it is more effective than some well established methods such as MCMC, Simulated Annealing and the more local Nelder-Mead optimization method.
Starting Page	1
Ending Page	8
File Size	4946375
Page Count	8
File Format	PDF
ISBN	9781424422425
ISSN	10636919
DOI	10.1109/CVPR.2008.4587482
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-06-23
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Smoothing methods Optimization methods Computer vision Computational modeling Simulated annealing Kernel Gradient methods Application software Computer simulation Monte Carlo methods
Content Type	Text
Resource Type	Article
Subject	Computer Vision and Pattern Recognition Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Multibody motion segmentation based on simulated annealing

Bayesian body localization using mixture of nonlinear shape models

Applying enhanced fault localization technology to Monte Carlo simulations

Using Ripley's K-function to improve graph-based clustering techniques

Markov Chain Monte Carlo combined with deterministic methods for Markov random field optimization

Optimal linear representations of images for object recognition

Bayesian Inference for Gaussian Process Classifiers with Annealing and Pseudo-Marginal MCMC

A simulated annealing approach to construct optimized prototypes for nearest-neighbor classification

Reduction Methods of Attributes Based on Binary Particle Swam with Simulated Annealing

Smoothing-based Optimization

Similar Documents

Multibody motion segmentation based on simulated annealing

Bayesian body localization using mixture of nonlinear shape models

Applying enhanced fault localization technology to Monte Carlo simulations

Using Ripley's K-function to improve graph-based clustering techniques

Markov Chain Monte Carlo combined with deterministic methods for Markov random field optimization

Optimal linear representations of images for object recognition

Bayesian Inference for Gaussian Process Classifiers with Annealing and Pseudo-Marginal MCMC

A simulated annealing approach to construct optimized prototypes for nearest-neighbor classification

Reduction Methods of Attributes Based on Binary Particle Swam with Simulated Annealing

Smoothing-based Optimization