An Energy Minimisation Approach to Attributed Graph Regularisation

In this paper, we propose a novel approach to graph regularisation based on energy minimisation. Our method hinges in the use of a Ginzburg-Landau functional whose extremum is achieved efficiently by a gradient descend optimisation process. As a result of the treatment given in this paper to the reg...

Full description

Saved in:
Bibliographic Details
Published inEnergy Minimization Methods in Computer Vision and Pattern Recognition pp. 71 - 86
Main Authors Fu, Zhouyu, Robles-Kelly, Antonio
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
Computer Vision
Gaussian Smoothing
Graph Regularisation
Image Segmentation
Singular Value Decomposition
Online AccessGet full text

Cover

More Information
Summary:In this paper, we propose a novel approach to graph regularisation based on energy minimisation. Our method hinges in the use of a Ginzburg-Landau functional whose extremum is achieved efficiently by a gradient descend optimisation process. As a result of the treatment given in this paper to the regularisation problem, constraints can be enforced in a straightforward manner. This provides a means to solve a number of problems in computer vision and pattern recognition. To illustrate the general nature of our graph regularisation algorithm, we show results on two application vehicles, photometric stereo and image segmentation. Our experimental results demonstrate the efficacy of our method for both applications under study.
ISBN:354074195X
9783540741954
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-74198-5_6