Reconstructing geometrically consistent tree structures from noisy images

Authors:
Engin Türetken;Christian Blum;Germán González;Pascal Fua
Affiliations:
Computer Vision Lab., Ecole Polytechnique Fédérale de Lausanne, Switzerland;ALBCOM, Universitat Politécnica de Catalunya, Barcelona, Spain;Computer Vision Lab., Ecole Polytechnique Fédérale de Lausanne, Switzerland;Computer Vision Lab., Ecole Polytechnique Fédérale de Lausanne, Switzerland
Venue:
MICCAI'10 Proceedings of the 13th international conference on Medical image computing and computer-assisted intervention: Part I
Year:
2010

Citing 6
Cited 0

New metaheuristic approaches for the edge-weighted k-cardinality tree problem

Computers and Operations Research
Tracking of Blood Vessels in Retinal Images Using Kalman Filter

DICTA '08 Proceedings of the 2008 Digital Image Computing: Techniques and Applications
Automated Delineation of Dendritic Networks in Noisy Image Stacks

ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part IV
Obtaining optimal k-cardinality trees fast

Journal of Experimental Algorithmics (JEA)
Marked point process for vascular tree extraction on angiogram

EMMCVPR'07 Proceedings of the 6th international conference on Energy minimization methods in computer vision and pattern recognition
Rapid automated tracing and feature extraction from retinal fundus images using direct exploratory algorithms

IEEE Transactions on Information Technology in Biomedicine

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a novel approach to fully automated reconstruction of tree structures in noisy 2D images. Unlike in earlier approaches, we explicitly handle crossovers and bifurcation points, and impose geometric constraints while optimizing a global cost function. We use manually annotated retinal scans to evaluate our method and demonstrate that it brings about a very substantial improvement.