Filters








21,626 Hits in 15.9 sec

Finding a Closed Boundary by Growing Minimal Paths from a Single Point on 2D or 3D Images

Fethallah Benmansour, Stephane Bonneau, Laurent D. Cohen
2007 2007 IEEE 11th International Conference on Computer Vision  
Linking pairs of neighboring keypoints with minimal paths allows us to extract a closed contour from a 2D image. Detection of a variety of objects on real images is demonstrated.  ...  Using a similar same idea, we can extract networks of minimal paths from a 3D image called Geodesic Meshing.  ...  Geodesic meshing of a closed surface from a 3D image The FMMWKD may also be used to mesh a closed surface from a 3D image I and a single surface point.  ... 
doi:10.1109/iccv.2007.4409156 dblp:conf/iccv/BenmansourBC07 fatcat:llanudz4lfgstbjgslxhsbpdlu

Fast Object Segmentation by Growing Minimal Paths from a Single Point on 2D or 3D Images

Fethallah Benmansour, Laurent D. Cohen
2008 Journal of Mathematical Imaging and Vision  
Linking pairs of neighboring keypoints with minimal paths allows us to extract a closed contour from a 2D image.  ...  Using a similar idea, we can extract networks of minimal paths from a 3D image called Geodesic Meshing. The proposed method is applied to 3D data with promising results.  ...  Acknowledgement This work was partially supported by ANR grant SURF-NT05-2-45825.  ... 
doi:10.1007/s10851-008-0131-0 fatcat:v6dscwu47far3htfafvgbtz56y

Interactive seismic interpretation with piecewise global energy minimization

Thomas Hollt, Johanna Beyer, Fritz Gschwantner, Philipp Muigg, Helmut Doleisch, Gabor Heinemann, Markus Hadwiger
2011 2011 IEEE Pacific Visualization Symposium  
We introduce a combination of 2D and 3D minimal cost path and minimal cost surface tracing for extracting horizons with very little user input.  ...  Instead of interpreting the volume slice-by-slice in 2D, we propose 3D seismic interpretation based on well positions.  ...  Thus, lines in 1D are bounded by points, areas in 2D are bounded by closed curves, volumes in 3D are bounded by closed surfaces, and so on.  ... 
doi:10.1109/pacificvis.2011.5742373 dblp:conf/apvis/HolltBGMDHH11 fatcat:f4s5duj5lzdznfly2zusy32vce

Tracking of moving objects under severe and total occlusions

A. Bartesaghi, G. Sapiro
2005 IEEE International Conference on Image Processing 2005  
We adopt an edge based approach and find the segmentation as a minimal surface in 3D space-time, the metric being dictated by the image gradient.  ...  We also avoid explicit estimation of a dynamic model since the problem is regarded as one of static energy minimization.  ...  Acknowledgments: This work is partially supported by the Office of Naval Research, the National Science Foundation, and the National Geospatial-Intelligence Agency.  ... 
doi:10.1109/icip.2005.1529747 dblp:conf/icip/BartesaghiS05 fatcat:pclg2gqh6jg2nogszz2xs5zaam

Interactive Organ Segmentation Using Graph Cuts [chapter]

Yuri Boykov, Marie-Pierre Jolly
2000 Lecture Notes in Computer Science  
We applied this technique to interactively segment organs in various 2D and 3D medical images.  ...  An N-dimensional image is divided into "object" and "background" segments using a graph cut approach. A graph is formed by connecting all pairs of neighboring image pixels (voxels) by weighted edges.  ...  Acknowledgements We would like to thank Bernhard Geiger for providing the 3D visualizations of the segmented volumes. Vladimir Kolmogorov helped us with some of the coding.  ... 
doi:10.1007/978-3-540-40899-4_28 fatcat:ytpdd7s3vvaf5kmkhvrsjbpjw4

An energy-based three-dimensional segmentation approach for the quantitative interpretation of electron tomograms

A. Bartesaghi, G. Sapiro, S. Subramaniam
2005 IEEE Transactions on Image Processing  
Individual features in the tomogram are segmented using a novel robust algorithm that finds their boundaries as global minimal surfaces in a metric space defined by image features.  ...  The optimization is carried out in a transformed spherical domain with center the an interior point of the particle of interest, providing a proper setting for the fast and accurate minimization of the  ...  Orenstein for providing sections from HIV-infected macrophages, and Jonathan Lefman and Stanton Lee for assistance with the tomography.  ... 
doi:10.1109/tip.2005.852467 pmid:16190467 pmcid:PMC1698959 fatcat:i6kyvatlivg43lmsrl2j67fx3y

Dynamic Programming Based Segmentation in Biomedical Imaging

Kathrin Ungru, Xiaoyi Jiang
2017 Computational and Structural Biotechnology Journal  
Many applications in biomedical imaging have a demand on automatic detection of lines, contours, or boundaries of bones, organs, vessels, and cells.  ...  Biomedical images often suffer from noisy data and fuzzy edges. Therefore, there is a need for robust methods for contour and line detection.  ...  Acknowledgements We acknowledge support by Open Access Publication Fund of University of Münster.  ... 
doi:10.1016/j.csbj.2017.02.001 pmid:28289536 pmcid:PMC5338725 fatcat:byd4sfuxtjazxkdfjxj3saq6dm

Interactive skeletonization of intensity volumes

Sasakthi S. Abeysinghe, Tao Ju
2009 The Visual Computer  
Our contributions include formulating the task of drawing 3D centerlines given 2D user inputs as a constrained optimization problem, solving this problem on a discrete graph using a shortest-path algorithm  ...  While skeletons are very useful for a range of image analysis tasks, it is extremely difficult to obtain skeletons with correct connectivity and shape from noisy inputs using automatic skeletonization  ...  This work is supported in part by NSF grant IIS-0705538.  ... 
doi:10.1007/s00371-009-0325-5 fatcat:3xhxas4tc5g7lefm77ssvjhpfi

New Vessel Analysis Tool for Morphometric Quantification and Visualization of Vessels in CT and MR Imaging Data Sets

Tobias Boskamp, Daniel Rinck, Florian Link, Bernd Kümmerlen, Georg Stamm, Peter Mildenberger
2004 Radiographics  
structures close to the vessels of interest, (c) distance transformbased skeletonization, (d) multiplanar reformation orthogonal to the vessel path, (e) identification of the lumen boundary on the orthogonal  ...  The software is based on a sequence of processing steps, which are as follows: (a) vessel segmentation based on a region growing algorithm, (b) interactive "premasking" to optionally exclude interfering  ...  We thank all of the partners who made this article possible by their continuous support. For their fruitful collaboration, we express our special gratitude to Hoen-oh  ... 
doi:10.1148/rg.241035073 pmid:14730052 fatcat:5cglk7umtfb75kzxchxvb6gg2e

Geometric modeling of tubular structures

M. Akif Gulsun, Huseyin Tek
2008 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops  
The method extracts centerlines by computing minimum-cost paths from a graph based optimization algorithm which minimizes responses obtained from multi-scale medialness filters.  ...  The proposed algorithm can produce a local centerline segment between two points as well as a centerline tree from a single seed, which can be detected automatically.  ...  It is obvious that most of these paths are redundant, i.e., a single vessel branch should represented by a single centerline or a single front point.  ... 
doi:10.1109/cvprw.2008.4562994 dblp:conf/cvpr/GulsunT08 fatcat:kc3nab64ebcappwhdi47ccjvvm

3D Reconstruction of blood vessels

Ali Al Moussawi, Cedric Galusinski, Christian Nguyen
2014 Engineering with Computers  
The aim of this paper is to achieve the 3D reconstruction of blood vessels from a limited number of 2D transversal cuts obtained from scanners. This is motivated by the fact that data can be missing.  ...  At this stage, we are able to reconstruct a 3D level set function by using the 2D level set functions given by the transversal cuts and the graph information.  ...  A large ν will result in fewer boundaries. The goal is to find u and Γ so that F is minimized.  ... 
doi:10.1007/s00366-014-0389-3 fatcat:ykx7h7sdynfj5msdpn3b7b4ffe

Efficient Globally Optimal 2D-to-3D Deformable Shape Matching [article]

Zorah Lähner, Emanuele Rodolà, Frank R. Schmidt, Michael M. Bronstein, Daniel Cremers
2022 arXiv   pre-print
We cast the problem as finding the shortest circular path on the product 3-manifold of the surface and the curve.  ...  We propose the first algorithm for non-rigid 2D-to-3D shape matching, where the input is a 2D shape represented as a planar curve and a 3D shape represented as a surface; the output is a continuous curve  ...  We gratefully acknowledge the support of an Alexander von Humboldt Fellowship, the ERC Starting Grant No. 307047 (COMET), the ERC Starting Grant 'ConvexVision' and the ERC Consolidator Grant '3D Reloaded  ... 
arXiv:1601.06070v3 fatcat:koeomual5ff4zd2a3it6whd5te

Globally minimal surfaces by continuous maximal flows

B. Appleton, H. Talbot
2006 IEEE Transactions on Pattern Analysis and Machine Intelligence  
The new algorithm is applied to segmentation in 2D and 3D medical images and to 3D reconstruction from a stereo image pair.  ...  The results in 2D agree remarkably well with an existing planar minimal contour algorithm and the results in 3D segmentation and reconstruction demonstrate that the new algorithm is free from grid bias  ...  The new algorithm has been applied to segmentation in 2D and 3D medical images and to 3D reconstruction from a stereo image pair.  ... 
doi:10.1109/tpami.2006.12 pmid:16402623 fatcat:6ankpqdbarewnfrthmh6vx3osu

Shortest Paths with Curvature and Torsion

Petter Strandmark, Johannes Ulen, Fredrik Kahl, Leo Grady
2013 2013 IEEE International Conference on Computer Vision  
This paper describes a method of finding thin, elongated structures in images and volumes.  ...  Our globally optimal method uses line graphs and its runtime is polynomial in the size of the discretization, often in the order of seconds on a single computer.  ...  We iteratively computed shortest paths from a user-provided start point to any point on the image boundary.  ... 
doi:10.1109/iccv.2013.253 dblp:conf/iccv/StrandmarkUKG13 fatcat:4dfdgzmplzhy7oasjamvt3ai4e

Skeleton-based three-dimensional geometric morphing

Robert L. Blanding, George M. Turkiyyah, Duane W. Storti, Mark A. Ganter
2000 Computational geometry  
The skeleton also establishes a correspondence between points on the boundaries of the source and target objects.  ...  The intermediate shape is a valid solid model whose boundary does not self-intersect and is everywhere equidistant from the boundaries of the source shapes.  ...  minimally equidistant from one boundary point on A and one boundary point on B.  ... 
doi:10.1016/s0925-7721(99)00050-4 fatcat:om3dqlu2rvarpnnlcemutvdydi
« Previous Showing results 1 — 15 out of 21,626 results