Probabilistic relaxation labeling by Fokker-Planck diffusion on a graph

Authors:
Hong-Fang Wang;Edwin R. Hancock
Affiliations:
Computer Science Department, University of York, York, UK;Computer Science Department, University of York, York, UK
Venue:
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
Year:
2007

Citing 8
Cited 0

Edge-Labeling Using Dictionary-Based Relaxation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning Compatibility Coefficients for Relaxation Labeling Processes

IEEE Transactions on Pattern Analysis and Machine Intelligence
Diffusion Kernels on Graphs and Other Discrete Input Spaces

ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Generating Semantic Descriptions From Drawings of Scenes With Shadows

Generating Semantic Descriptions From Drawings of Scenes With Shadows
Learning kernels from biological networks by maximizing entropy

Bioinformatics
Robust Point Matching for Two-Dimensional Nonrigid Shapes

ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
Diffusion Maps and Coarse-Graining: A Unified Framework for Dimensionality Reduction, Graph Partitioning, and Data Set Parameterization

IEEE Transactions on Pattern Analysis and Machine Intelligence
Nonparametric belief propagation

CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we develop a new formulation of probabilistic relaxation labeling for the task of data classification using the theory of diffusion processes on graphs. The state space of our process as the nodes of a support graph which represent potential object-label assignments. The edge-weights of the support graph encode data-proximity and label consistency information. The state-vector of the diffusion process represents the object-label probabilities. The state vector evolves with time according to the Fokker-Planck equation. We show how the solution state vector can be estimated using the spectrum of the Laplacian matrix for the weighted support graph. Experiments on various data clustering tasks show effectiveness of our new algorithm.