1996 | ReviewPaper | Buchkapitel
Parallel distributed relaxation labeling
verfasst von : S. Z. Li
Erschienen in: Recent Developments in Computer Vision
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
A parallel distributed relaxation labeling (RL) method, called the Lagrange-Hopfield (LH) method, is presented. RL is treated as a constrained optimization problem. The LH method solves the problem using the augmented Lagrangian multiplier technique and the graded Hopfield network. The LH method effectively overcomes instabilities that are inherent in the penalty method (e.g. Hopfield network) or the Lagrange multiplier method in constrained optimization. Due to the use of Lagrangian multipliers, the normalization operation in traditional RL methods is dispensed with. This makes the LH algorithm fully parallel and distributed and is suitable for analog implementation. Experiments also show that the method is able to produce good solutions in terms of the optimized objective values.