By Topic

Kernelised Relaxation Labelling using Fokker-Planck Diffusion

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hong-Fang Wang ; University of York, UK ; Edwin R. Hancock

This paper shows how the relaxation labelling problem can be formulated as a diffusion process on a support graph using the Fokker-Planck equation. We abstract the labelling problem using a support graph with each graph node representing a possible object-label assignment and the edge weights representing label compatibilities. Initial object-label probabilities are updated using a relaxation-like process. The update equation is the solution of the Fokker-Planck equation, and is governed by an infinitesimal generator matrix computed from the edge-weights of the support graph. Iterative updating of the label probabilities can be effected using the eigenvalues and eigenvectors of the generator matrix. We illustrate the newly developed relaxation process for the applications of data classification.

Published in:

Image Analysis and Processing, 2007. ICIAP 2007. 14th International Conference on

Date of Conference:

10-14 Sept. 2007