On the stability of the travelling salesman problem algorithm of Hopfield and Tank
Biological Cybernetics
An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Advances in neural information processing systems 2
Constrained nets for graph matching and other quadratic assignment problems
Neural Computation
A common framework for image segmentation
International Journal of Computer Vision
An introduction to neural and electronic networks
Polyhedral combinatorics and neural networks
Neural Computation
Hierarchical mixtures of experts and the EM algorithm
Neural Computation
Convex potentials and their conjugates in analog mean-field optimization
Neural Computation
Softmax to Softassign: neural network algorithms for combinatorial optimization
Journal of Artificial Neural Networks - Special issue: neural networks for optimization
A Graduated Assignment Algorithm for Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Linear Programming Approach for the Weighted Graph Matching Problem
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimization in model matching and perceptual organization
Neural Computation
Neural Computation
A Graduated Assignment Algorithm for Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
An energy function and continuous edit process for graph matching
Neural Computation
Convergence properties of the softassign quadratic assignment algorithm
Neural Computation
Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Comparing Structures Using a Hopfield-Style Neural Network
Applied Intelligence
A Double-Loop Algorithm to Minimize the Bethe Free Energy
EMMCVPR '01 Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Neural Computation
A Unifying Framework for Relational Structure Matching
ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 2 - Volume 2
Central Clustering of Attributed Graphs
Machine Learning
Replicator Equations, Maximal Cliques, and Graph Isomorphism
Neural Computation
λ-Opt Neural Approaches to Quadratic Assignment Problems
Neural Computation
A competitive winner-takes-all architecture for classification and pattern recognition of structures
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
A novel neural network approach to solve exact and inexact graph isomorphism problems
ICANN/ICONIP'03 Proceedings of the 2003 joint international conference on Artificial neural networks and neural information processing
Smooth simultaneous structural graph matching and point-set registration
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
A new graph matching method for point-set correspondence using the EM algorithm and Softassign
Computer Vision and Image Understanding
| Hi-index | 0.00 |
We present a novel optimizing network architecture with applications in vision, learning, pattern recognition, and combinatorial optimization. This architecture is constructed by combining the following techniques: (1) deterministic annealing, (2) self-amplification, (3) algebraic transformations, (4) clocked objectives, and (5) softassign. Deterministic annealing in conjunction with self-amplification avoids poor local minima and ensures that a vertex of the hypercube is reached. Algebraic transformations and clocked objectives help partition the relaxation into distinct phases. The problems considered have doubly stochastic matrix constraints or minor variations thereof. We introduce a new technique, softassign, which is used to satisfy this constraint. Experimental results on different problems are presented and discussed.