Search research articles

Search research articles

Related Experiment Videos

Generalized deterministic annealing.

S T Acton¹, A C Bovik

¹Dept. of Electr. and Comput. Eng., Texas Univ., Austin, TX.

IEEE Transactions on Neural Networks

|January 1, 1996

Summary

This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

3D far-field Lidar sensing and computational modeling for human identification.

Applied optics·2024

Same author

Advances in image processing for single-particle analysis by electron cryomicroscopy and challenges ahead.

Current opinion in structural biology·2018

Same author

Automatic segmentation of inorganic nanoparticles in BF TEM micrographs.

Ultramicroscopy·2018

Same author

The effect of median filtering on edge estimation and detection.

IEEE transactions on pattern analysis and machine intelligence·2011

Same author

Robust cardiomyocyte-specific gene expression following systemic injection of AAV: in vivo gene delivery follows a Poisson distribution.

Gene therapy·2010

Same author

Eye movements selective for spatial frequency and orientation during active visual search.

Vision research·2008

Same journal

Universal perceptron and DNA-like learning algorithm for binary neural networks: LSBF and PBF implementations.

IEEE transactions on neural networks·2013

Same journal

Guest editorial: special section on white box nonlinear prediction models.

IEEE transactions on neural networks·2011

Same journal

Data-based fault-tolerant control of high-speed trains with traction/braking notch nonlinearities and actuator failures.

IEEE transactions on neural networks·2011

Same journal

Guest editorial: special section on data-based control, modeling, and optimization.

IEEE transactions on neural networks·2011

Same journal

Neural network-based multiple robot simultaneous localization and mapping.

IEEE transactions on neural networks·2011

Same journal

Data-driven model-free adaptive control for a class of MIMO nonlinear discrete-time systems.

IEEE transactions on neural networks·2011

See all related articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Generalized deterministic annealing (GDA) offers high-quality, low-cost solutions for complex optimization problems. This novel method improves performance without sacrificing accuracy, outperforming current techniques.

Area of Science:

Computer Science
Applied Mathematics
Operations Research

Background:

Nonconvex combinatorial optimization problems with distributed local constraints are computationally challenging.
Existing methods often involve performance trade-offs for solution quality.

Purpose of the Study:

To introduce a general formalism for solving nonconvex combinatorial optimization problems.
To present Generalized Deterministic Annealing (GDA) as a superior alternative to current techniques.

Main Methods:

Developed a formalism utilizing K-state neurons for optimization variables.
Modeled neuron values as probability densities of K-state local Markov chains.
Derived a simplified Markov model from simulated annealing (SA).

Related Experiment Videos

Main Results:

Established convergence properties of GDA through formal theorems.
Provided practical guidelines for selecting annealing temperatures.
Demonstrated significant performance advantages in image enhancement benchmark.

Conclusions:

GDA offers substantial performance benefits over existing combinatorial optimization methods.
The formalism provides a robust framework for high-quality, low-cost optimization solutions.
GDA effectively exploits localized problem structures for improved efficiency.