To Boldly Split: Partitioning Space Filling Curves by Markov Chain Monte Carlo Simulation

Authors:
Daniel Valdes;Abhir Bhalerao
Affiliations:
Department of Computer Science, The University of Warwick, Coventry, UK CV4 7AL;Department of Computer Science, The University of Warwick, Coventry, UK CV4 7AL
Venue:
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Year:
2008

Citing 5
Cited 0

The Curvature Primal Sketch

IEEE Transactions on Pattern Analysis and Machine Intelligence
Segmentation of two-dimensional boundaries using the chain code

Pattern Recognition
Robust Contour Decomposition Using a Constant Curvature Criterion

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Theory of Multiscale, Curvature-Based Shape Representation for Planar Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
Visualizing concave and convex partitioning of 2D contours

Pattern Recognition Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Space filling curves are a class of fractals that are important mathematical descriptions of the appearance and shape of natural objects. There is growing interest in the modelling of such curves to measure pathology in medicine and biology. This work presents a method of modelling fractal curves, such as the boundary of brain white matter, and partitioning such curves in to segments having equal fractal dimension. Since the solution space, for a given number of contour points and a required set of partitions is very large, we employ a Bayesian framework of reversible-jump Markov chain Monte Carlo (MCMC) and a sampler based on the Metropolis-Hastings test. We detail the algorithm and present results on both simple contours (animal silhouettes) and space-filling brain contours and show the convergence characteristics of the method. We discuss its use for building compact local statistical shape models.