On the Foundations of Relaxation Labeling Processes
From MaRDI portal
Publication:3037173
DOI10.1109/TPAMI.1983.4767390zbMath0523.90086WikidataQ52707470 ScholiaQ52707470MaRDI QIDQ3037173
Steven W. Zucker, Robert Hummel
Publication date: 1983
Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)
consistencyvariational inequalitylocal convergenceconstraint satisfactioncooperative processesrelaxation labeling processesprobabilistic relaxation
Programming involving graphs or networks (90C35) Numerical optimization and variational techniques (65K10) Programming in abstract spaces (90C48)
Related Items
Sequential combination methods for data clustering analysis ⋮ Morphological probabilistic hierarchies for texture segmentation ⋮ Graph Transduction as a Noncooperative Game ⋮ Massively parallel networks for edge localization and contour integration-adaptable relaxation approach ⋮ Multi-standard quadratic optimization: Interior point methods and cone programming reformulation ⋮ Constraint propagation with interval labels ⋮ On a consistency measure for object labeling problems ⋮ Why Shading Matters along Contours ⋮ A robust hybrid method for nonrigid image registration ⋮ Kronecker product graph matching. ⋮ Iterative multiplicative filters for data labeling ⋮ Probabilistic relaxation method of matching visual landmarks for controlling the accurate positioning of mobile robots ⋮ Image labeling by assignment ⋮ A Competitive-Layer Model for Feature Binding and Sensory Segmentation ⋮ Cost Propagation – Numerical Propagation for Optimization Problems ⋮ Operational research techniques in medical treatment and diagnosis: A review ⋮ A Generalized Approach for Social Network Integration and Analysis with Privacy Preservation ⋮ Copositive-plus Lemke algorithm solves polymatrix games ⋮ Assignment Flows ⋮ Probabilistic relaxation labelling using the Fokker-Planck equation ⋮ Localist Attractor Networks ⋮ Neural network methods in combinatorial optimization ⋮ XML application schema matching using similarity measure and relaxation labeling ⋮ Color image segmentation for bladder cancer diagnosis ⋮ Bayesian object matching ⋮ Interpolation coding: A representation for numbers in neural models ⋮ Stochastic networks for constraint satisfaction and optimization. ⋮ Fuzzy cognitive maps for stereovision matching ⋮ Least-commitment graph matching with genetic algorithms ⋮ Pattern recogniton using Markov random field models ⋮ Constraints in vision. Outline of a set-theoretic approach. ⋮ Smooth Gradient Representations as a Unifying Account of Chevreul's Illusion, Mach Bands, and a Variant of the Ehrenstein Disk ⋮ Fast object recognition using dynamic programming from combination of salient line groups ⋮ Structural pattern recognition using genetic algorithms ⋮ The brain-state-in-a-box neural model is a gradient descent algorithm
