Multi-model fitting based on minimum spanning tree

Radwa Fathalla, George Vogiatzis

Research output: Chapter in Book/Published conference outputConference publication


This paper presents a novel approach to the computation of primitive geometrical structures, where no prior knowledge about the visual scene is available and a high level of noise is expected. We based our work on the grouping principles of proximity and similarity, of points and preliminary models. The former was realized using Minimum Spanning Trees (MST), on which we apply a stable alignment and goodness of fit criteria. As for the latter, we used spectral clustering of preliminary models. The algorithm can be generalized to various model fitting settings, without tuning of run parameters. Experiments demonstrate the significant improvement in the localization accuracy of models in plane, homography and motion segmentation examples. The efficiency of the algorithm is not dependent on fine tuning of run parameters like most others in the field.

Original languageEnglish
Title of host publicationBMVC 2014 : proceedings of the British Machine Vision Conference 2014
EditorsMichel Valstar, Andrew French, Tony Pridmore
Number of pages12
Publication statusPublished - 30 Sept 2014
Event25th British Machine Vision Conference - Nottingham, United Kingdom
Duration: 1 Sept 20145 Sept 2014


Conference25th British Machine Vision Conference
Abbreviated titleBMVC 2014
Country/TerritoryUnited Kingdom


Dive into the research topics of 'Multi-model fitting based on minimum spanning tree'. Together they form a unique fingerprint.

Cite this