A linear programming based algorithm for determining corresponding point tuples in multiple vascular images

Details A linear programming based algorithm for determining corresponding point tuples in multiple vascular images A linear programming based algorithm for determining corresponding point tuples in multiple vascular images

Mar 2006

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=2006spie.6144..760s&link_type=abstract

Medical Imaging 2006: Image Processing. Edited by Reinhardt, Joseph M.; Pluim, Josien P. W. Proceedings of the SPIE, Volume 614

Physics

Scientific paper

Multi-view imaging is the primary modality for high-spatial-resolution imaging of the vasculature. The 3D vascular structure can be reconstructed if the imaging geometries are determined using known corresponding point-pairs (or k-tuples) in two or more images. Because the accuracy improves with more input corresponding point-pairs, we propose a new technique to automatically determine corresponding point-pairs in multi-view (k-view) images, from 2D vessel image centerlines. We formulate the problem, first as a multi-partite graph-matching problem. Each 2D centerline point is a vertex; each individual graph contains all vessel-points (vertices) in an image. The weight ('cost') of the edges between vertices (in different graphs) is the shortest distance between the points' respective projection-lines. Using this construction, a universe of mappings (k-tuples) is created, each k-tuple having k vertices (one from each image). A k-tuple's weight is the sum of pair-wise 'costs' of its members. Ideally, a set of such mappings is desired that preserves the ordering of points along the vessel and minimizes an appropriate global cost function, such that all vertices (in all graphs) participate in at least one mapping. We formulate this problem as a special case of the well-studied Set-Cover problem with additional constraints. Then, the equivalent linear program is solved, and randomized-rounding techniques are used to yield a feasible set of mappings. Our algorithm is efficient and yields a theoretical quality guarantee. In simulations, the correct matching is achieved in ~98% cases, even with high input error. In clinical data, apparently correct matching is achieved in >90% cases. This method should provide the basis for improving the calculated 3D vasculature from multi-view data-sets.

Affiliated with

Also associated with

No associations

Rating

A linear programming based algorithm for determining corresponding point tuples in multiple vascular images does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A linear programming based algorithm for determining corresponding point tuples in multiple vascular images, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A linear programming based algorithm for determining corresponding point tuples in multiple vascular images will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-983697