Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision最新文献

筛选
英文 中文
Cortex segmentation - a fast variational geometric approach 皮层分割-一种快速变分几何方法
Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision Pub Date : 2001-07-13 DOI: 10.1109/VLSM.2001.938891
Roman Goldenberg, R. Kimmel, E. Rivlin, M. Rudzsky
{"title":"Cortex segmentation - a fast variational geometric approach","authors":"Roman Goldenberg, R. Kimmel, E. Rivlin, M. Rudzsky","doi":"10.1109/VLSM.2001.938891","DOIUrl":"https://doi.org/10.1109/VLSM.2001.938891","url":null,"abstract":"An automatic cortical gray matter segmentation from three-dimensional brain images (MR or CT) is a well known problem in medical image processing. We formulate it as a geometric variational problem for propagation of two coupled bounding surfaces. An efficient numerical scheme is used to implement the geodesic active surface model. Experimental results of cortex segmentation on real three-dimensional MR data are provided.","PeriodicalId":445975,"journal":{"name":"Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision","volume":"37 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132836183","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 29
Fiber tract mapping from diffusion tensor MRI 磁共振弥散张量成像纤维束
Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision Pub Date : 2001-07-13 DOI: 10.1109/VLSM.2001.938885
Baba C. Vemuri, Yun Chen, M. Rao, Tim McGraw, Zhizhou Wang, T. Mareci
{"title":"Fiber tract mapping from diffusion tensor MRI","authors":"Baba C. Vemuri, Yun Chen, M. Rao, Tim McGraw, Zhizhou Wang, T. Mareci","doi":"10.1109/VLSM.2001.938885","DOIUrl":"https://doi.org/10.1109/VLSM.2001.938885","url":null,"abstract":"To understand evolving pathology in the central nervous system (CNS) and develop effective treatments, it is essential to correlate the nerve fiber connectivity with the visualization of function. Diffusion tensor imaging (DTI) can provide the fundamental information required for viewing structural connectivity. We present a novel algorithm for automatic fiber tract mapping in the CNS specifically, the spinal cord. The automatic fiber tract mapping problem is solved in two phases, namely a data smoothing phase and a fiber tract mapping phase. In the former, smoothing is achieved via a new weighted total variation (TV)-norm minimization (for vector-valued data) which strives to smooth while retaining all relevant detail. For the fiber tract mapping, a smooth 3D vector field indicating the dominant anisotropic direction at each spatial location is computed from the smoothed data. Fiber tracts are then determined as the smooth integral curves of this vector field in a variational framework.","PeriodicalId":445975,"journal":{"name":"Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116959069","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 105
Stability of image restoration by minimizing regularized objective functions 最小化正则化目标函数的图像恢复稳定性
Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision Pub Date : 2001-07-13 DOI: 10.1109/VLSM.2001.938884
S. Durand, M. Nikolova
{"title":"Stability of image restoration by minimizing regularized objective functions","authors":"S. Durand, M. Nikolova","doi":"10.1109/VLSM.2001.938884","DOIUrl":"https://doi.org/10.1109/VLSM.2001.938884","url":null,"abstract":"We address the general problem of the recovery of an unknown image, x/spl isin/R/sup p/, from noisy data, y/spl isin/R/sup q/, by minimizing a regularized objective function /spl epsi/(x,y). We focus on typical situations when the objective function is C/sup m/-smooth and is composed of a quadratic data-fidelity term and a general regularization term: /spl epsi/(x,y)=/spl par/Ax-y/spl par//sup 2/+/spl Phi/(x), where A is a linear operator. Many authors have shown that especially nonconvex regularizers /spl Phi/ allow the restoration of images involving both sharp edges and smoothly varying regions. The main limitation in using such regularizers is that, being highly nonconvex, the resultant objective functions are intricate to minimize. On the other hand since very few facts are known about the minimizers of such functions, the properties and in particular the stability of the resultant solutions are difficult to control. This state of the art limits the practical use of such functions. This work is devoted to the stability of the local and global minimizers x of objective functions /spl epsi/ as specified above, under the assumption that A is injective. We thus have shown that the global minimizers of /spl epsi/ are stable under small perturbations of the data.","PeriodicalId":445975,"journal":{"name":"Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122226741","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
3D automated segmentation and structural analysis of vascular trees using deformable models 三维自动分割和维管树结构分析使用可变形模型
Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision Pub Date : 2001-07-13 DOI: 10.1109/VLSM.2001.938890
Derek R. Magee, A. Bulpitt, E. Berry
{"title":"3D automated segmentation and structural analysis of vascular trees using deformable models","authors":"Derek R. Magee, A. Bulpitt, E. Berry","doi":"10.1109/VLSM.2001.938890","DOIUrl":"https://doi.org/10.1109/VLSM.2001.938890","url":null,"abstract":"This paper describes novel automated methods for the segmentation of complex structures and their subsequent analysis. The methods have been developed as parts of a system to provide decision support in the assessment of patient suitability for endovascular repair of abdominal aortic aneurysms from spiral CT data. Our segmentation technique provides a new method for controlling the deformation: a 3D deformable model using a model of expected structure. This approach introduces knowledge of anatomy into the deformable model through an expected structure model (ESM), mimicking the knowledge of the observer in an interactive system. The expected structure model is used to improve robustness of the deformable model to noise within the image, without globally over-constraining the model. The model also permits the identification of features of interest that can be used for clinical assessment. In order to obtain useful measurements from the segmentations, the geometric structure of the arterial tree is required. Our method automates this procedure using a stochastic growing algorithm based on a particle filter to determine the centre lines and locations of bifurcations of the arterial tree. The results demonstrate how the ESM and stochastic growing algorithm can be used to both identify features and to produce measurements required for patient assessment.","PeriodicalId":445975,"journal":{"name":"Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116229545","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Flame front matching and tracking in PLIF images using geodesic paths and level sets 使用测地线路径和水平集的PLIF图像中的火焰前匹配和跟踪
Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision Pub Date : 2001-07-13 DOI: 10.1109/VLSM.2001.938889
R. Abu-Gharbieh, C. Kaminski, T. Gustavsson, G. Hamarneh
{"title":"Flame front matching and tracking in PLIF images using geodesic paths and level sets","authors":"R. Abu-Gharbieh, C. Kaminski, T. Gustavsson, G. Hamarneh","doi":"10.1109/VLSM.2001.938889","DOIUrl":"https://doi.org/10.1109/VLSM.2001.938889","url":null,"abstract":"This paper treats the problem of tracking contours of flames captured by PLIF imaging using geodesic paths and level sets. Successive images of the combustion process captured in controlled experiments are smoothed by nonlinear diffusion filtering then active contour models are used to obtain the curves that most accurately describe the frame boundary. These curves are matched using the concept of shortest path (geodesic) computation on a cost surface. The level set representation is employed so that complex curve evolutions including those with topological changes in their structures could be handled. A critical point detection algorithm is used to identify important curve landmarks that are then used to modify the cost surface so as to improve the quality and stability of the matching. Accordingly, the propagation of curves representing successive flame contours within a sequence is obtained and used for studying the flame dynamics.","PeriodicalId":445975,"journal":{"name":"Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127508774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Affine invariant edge completion with affine geodesics 仿射测地线的仿射不变边补全
Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision Pub Date : 2001-07-13 DOI: 10.1109/VLSM.2001.938887
A. A. Handzel, T. Flash
{"title":"Affine invariant edge completion with affine geodesics","authors":"A. A. Handzel, T. Flash","doi":"10.1109/VLSM.2001.938887","DOIUrl":"https://doi.org/10.1109/VLSM.2001.938887","url":null,"abstract":"Edge completion is the interpolation of gaps between edge segments which are extracted from an image. We provide a new analytic solution to this problem within equi-affine plane geometry which is the natural framework for the interpolation of pairs of line segments. The desired curves are the geodesics of equi-affine plane geometry, namely parabolic arcs, which generalize the connection of points by straight lines in Euclidean geometry. Whereas most common methods of edge completion are invariant only under the group of Euclidean motions, SE(2), this solution has the advantage of being invariant under the larger group of equi-affine transformations, SA(2), that is more relevant to computer vision. In addition to these geometric qualities, the parabola is a simple algebraic curve which renders it computationally attractive, especially in comparison to the popular elastica curves.","PeriodicalId":445975,"journal":{"name":"Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125148514","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Optimal mass transport and image registration 最佳质量传输和图像配准
Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision Pub Date : 2001-07-13 DOI: 10.1109/VLSM.2001.938878
S. Haker, A. Tannenbaum
{"title":"Optimal mass transport and image registration","authors":"S. Haker, A. Tannenbaum","doi":"10.1109/VLSM.2001.938878","DOIUrl":"https://doi.org/10.1109/VLSM.2001.938878","url":null,"abstract":"Image registration is the process of establishing a common geometric reference frame between two or more data sets from the same or different imaging modalities possibly taken at different times. In the context of medical imaging and in particular image-guided therapy, the registration problem consists of finding automated methods that align multiple data sets with each other and with the patient. We propose a method of elastic registration based on the Monge-Kantorovich problem of optimal mass transport.","PeriodicalId":445975,"journal":{"name":"Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128225135","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
A variational approach to multi-modal image matching 多模态图像匹配的变分方法
Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision Pub Date : 2001-07-13 DOI: 10.1109/VLSM.2001.938877
C. Chefd'Hotel, G. Hermosillo, O. Faugeras
{"title":"A variational approach to multi-modal image matching","authors":"C. Chefd'Hotel, G. Hermosillo, O. Faugeras","doi":"10.1109/VLSM.2001.938877","DOIUrl":"https://doi.org/10.1109/VLSM.2001.938877","url":null,"abstract":"We address the problem of nonparametric multi-modal image matching. We propose a generic framework which relies on a global variational formulation and show its versatility through three different multi-modal registration methods: supervised registration by joint intensity learning, maximization of the mutual information and maximization of the correlation ratio. Regularization is performed by using a functional borrowed from linear elasticity theory. We also consider a geometry-driven regularization method. Experiments on synthetic images and preliminary results on the realignment of MRI datasets are presented.","PeriodicalId":445975,"journal":{"name":"Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127087159","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 125
On affine invariance in the Beltrami framework for vision 视觉Beltrami框架中的仿射不变性
Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision Pub Date : 2001-07-13 DOI: 10.1109/VLSM.2001.938881
N. Sochen
{"title":"On affine invariance in the Beltrami framework for vision","authors":"N. Sochen","doi":"10.1109/VLSM.2001.938881","DOIUrl":"https://doi.org/10.1109/VLSM.2001.938881","url":null,"abstract":"We use the geometric Beltrami framework to incorporate and explain some of the known invariant flows, e.g., the equi-affine invariant flow. It is also demonstrated that the new concepts put forward in this framework enable us to construct new invariant flows for the case where the codimension is greater than one, e.g., for color images and video.","PeriodicalId":445975,"journal":{"name":"Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129998520","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
On smoothness measures of active contours and surfaces 关于活动轮廓和表面的平滑度量
Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision Pub Date : 2001-07-13 DOI: 10.1109/VLSM.2001.938880
Hervé Delingette
{"title":"On smoothness measures of active contours and surfaces","authors":"Hervé Delingette","doi":"10.1109/VLSM.2001.938880","DOIUrl":"https://doi.org/10.1109/VLSM.2001.938880","url":null,"abstract":"We propose to study different smoothness measures of planar contours or surfaces. We first define a smoothness measure as a functional that follows three types of invariance, invariance to changes of contour parameterization, invariance to contour rotations and translations and invariance to the contour sizes. We then introduce different smoothness measures that can be classified into local or global functionals but that can also be of geometric or algebraic nature. We finally discuss their implementation by observing the advantages and disadvantages of explicit and implicit contour representations.","PeriodicalId":445975,"journal":{"name":"Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131187753","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信