{"title":"Image restoration by minimizing objective functions with nonsmooth data-fidelity terms","authors":"M. Nikolova","doi":"10.1109/VLSM.2001.938876","DOIUrl":"https://doi.org/10.1109/VLSM.2001.938876","url":null,"abstract":"We present a theoretical study of the recovery of images x from noisy data y by minimizing a regularized cost-function F(x,y)=/spl Psi/(x,y)+/spl alpha//spl Phi/(x), where /spl Psi/ is a data-fidelity term, /spl Phi/ is a smooth regularisation term and /spl alpha/>0 is a parameter. Generally /spl Psi/ is a smooth function; only a few papers make an exception. Non-smooth data-fidelity terms are avoided in image processing. In spite of this, we consider both smooth and non-smooth data-fidelity terms. Our ambition is to catch essential features exhibited by the local minimizers of F in relation with the smoothness of /spl Psi/. Cost-functions with non-smooth data-fidelity exhibit a strong mathematical property which can be used in various ways. We then construct a cost-function allowing aberrant data to be detected and selectively smoothed. The obtained results advocate the use of non-smooth data-fidelity terms.","PeriodicalId":445975,"journal":{"name":"Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision","volume":"1 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":"129241028","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}
{"title":"Total variation minimization by the fast level sets transform","authors":"F. Dibos, G. Koepfler","doi":"10.1109/VLSM.2001.938897","DOIUrl":"https://doi.org/10.1109/VLSM.2001.938897","url":null,"abstract":"The minimisation of the total variation is an important tool of image processing. Many authors have addressed the problem and developed algorithms for image denoising. In a previous paper we gave an alternative approach to the total variation minimization problem based on the Coarea formula. The aim of this paper is to present a new efficient algorithm for the Coarea formula approach, based on the fast level sets transform.","PeriodicalId":445975,"journal":{"name":"Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision","volume":"42 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":"120906994","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}
{"title":"Diffusion-snakes: combining statistical shape knowledge and image information in a variational framework","authors":"D. Cremers, C. Schnörr, J. Weickert","doi":"10.1109/VLSM.2001.938892","DOIUrl":"https://doi.org/10.1109/VLSM.2001.938892","url":null,"abstract":"We present a modification of the Mumford-Shah functional and its cartoon limit which allows the incorporation of statistical shape knowledge in a single energy functional. We show segmentation results on artificial and real-world images with and without prior shape information. In the case of occlusion and strongly cluttered background the shape prior significantly improves segmentation. Finally we compare our results to those obtained by a level-set implementation of geodesic active contours.","PeriodicalId":445975,"journal":{"name":"Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision","volume":"35 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":"116327505","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}
{"title":"Regularization of orthonormal vector sets using coupled PDE's","authors":"D. Tschumperlé, R. Deriche","doi":"10.1109/VLSM.2001.938875","DOIUrl":"https://doi.org/10.1109/VLSM.2001.938875","url":null,"abstract":"We address the problem of restoring, while presenting possible discontinuities, fields of noisy orthonormal vector sets, taking the orthonormal constraints explicity into account. We develop a variational solution for the general case where each image feature may correspond to multiple n-D orthogonal vectors of unit norms. We first formulate the problem in a new variational framework, where discontinuities and orthonormal constraints are preserved by means of constrained minimization and /spl Phi/-function regularization, leading to a set of coupled anisotropic diffusion PDE. A geometric interpretation of the resulting equations, coming from the field of solid mechanics, is proposed for the 3D case. Two interesting restrictions of our framework are also tackled: the regularization of 30 rotation matrices and the direction diffusion (the parallel with previous works is made). Finally, we present a number of denoising results and applications.","PeriodicalId":445975,"journal":{"name":"Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision","volume":"75 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":"122888508","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}
{"title":"A new variational image restoration applied to 3D angiographies","authors":"K. Krissian","doi":"10.1109/VLSM.2001.938883","DOIUrl":"https://doi.org/10.1109/VLSM.2001.938883","url":null,"abstract":"We propose a new variational restoration method. We express the energy as the sum of a data attachment term. A contour smoothing term and an enhancement term. The contour smoothing is achieved by minimizing the square of the derivative of the intensity in the contour direction. The enhancement is obtained by minimizing the square of the gradient norm in each estimated region, and acts like shock filters. The minimization of the energy is then done using the conjugate gradient algorithm. We present an algorithm which allows us to compute easily the gradient of the energy in the discrete case, without calculating the Euler-Lagrange equations. Experiments have been carried out on both synthetic and real images applied to 3D angiographies.","PeriodicalId":445975,"journal":{"name":"Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision","volume":"abs/2006.16742 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":"128287993","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}
Yunmei Chen, S. Thiruvenkadam, H. Tagare, F. Huang, D. C. Wilson, E. Geiser
{"title":"On the incorporation of shape priors into geometric active contours","authors":"Yunmei Chen, S. Thiruvenkadam, H. Tagare, F. Huang, D. C. Wilson, E. Geiser","doi":"10.1109/VLSM.2001.938893","DOIUrl":"https://doi.org/10.1109/VLSM.2001.938893","url":null,"abstract":"A novel model for boundary determination that incorporates prior shape information into geometric active contours is presented. The basic idea of this model is to minimize the energy functional depending on the information of the image gradient and the shape of interest, so that the boundary of the object can be captured either by higher magnitude of the image gradient or by the prior knowledge of its shape. The level set form of the proposed model is also provided. We present our experimental results on some synthetic images, functional MR brain images, and ultrasound images for which the existing active contour methods are not applicable. The existence of the solution to the proposed minimization problem is also discussed.","PeriodicalId":445975,"journal":{"name":"Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision","volume":"9 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":"121778045","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}
{"title":"Fast surface reconstruction using the level set method","authors":"Hongkai Zhao, S. Osher, Ronald Fedkiw","doi":"10.1109/VLSM.2001.938900","DOIUrl":"https://doi.org/10.1109/VLSM.2001.938900","url":null,"abstract":"We describe new formulations and develop fast algorithms for implicit surface reconstruction based on variational and partial differential equation (PDE) methods. In particular we use the level set method and fast sweeping and tagging methods to reconstruct surfaces from a scattered data set. The data set might consist of points, curves and/or surface patches. A weighted minimal surface-like model is constructed and its variational level set formulation is implemented with optimal efficiency. The reconstructed surface is smoother than piecewise linear and has a natural scaling in the regularization that allows varying flexibility according to the local sampling density. As is usual with the level set method we can handle complicated topology and deformations, as well as noisy or highly nonuniform data sets easily. The method is based on a simple rectangular grid, although adaptive and triangular grids are also possible. Some consequences, such as hole filling capability, are demonstrated, as well as the viability and convergence of our new fast tagging algorithm.","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":"134400569","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}
{"title":"Variational problems and PDEs on implicit surfaces","authors":"M. Bertalmío, G. Sapiro, Li-Tien Cheng, S. Osher","doi":"10.1109/VLSM.2001.938899","DOIUrl":"https://doi.org/10.1109/VLSM.2001.938899","url":null,"abstract":"A novel framework for solving variational problems and partial differential equations for scalar and vector-valued data defined on surfaces is introduced. The key idea is to implicitly represent the surface as the level set of a higher dimensional function, and solve the surface equations in a fixed Cartesian coordinate system using this new embedding function. The equations are then both intrinsic to the surface and defined in the embedding space. This approach thereby eliminates the need for performing complicated and inaccurate computations on triangulated surfaces, as is commonly done in the literature. We describe the framework and present examples in computer graphics and image processing applications, including texture synthesis, flow field visualization, as well as image and vector field intrinsic regularization for data defined on 3D surfaces.","PeriodicalId":445975,"journal":{"name":"Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision","volume":"104 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":"115372245","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}
{"title":"A level set algorithm for minimizing the Mumford-Shah functional in image processing","authors":"T. Chan, L. Vese","doi":"10.1109/VLSM.2001.938895","DOIUrl":"https://doi.org/10.1109/VLSM.2001.938895","url":null,"abstract":"We show how the piecewise-smooth Mumford-Shah segmentation problem can be solved using the level set method of Osher and Sethian (1988). The obtained algorithm can be simultaneously used to denoise, segment, detect-extract edges, and perform active contours. The proposed model is also a generalisation of a previous active contour model without edges, proposed by the authors in Chan et al., (2001), and of its extension to the case with more than two segments for piecewise-constant segmentation Chan et al., (2000). Based on the four color theorem, we can assume that in general, at most two level set functions are sufficient to detect and represent distinct objects of distinct intensities, with triple junctions, or T-junctions.","PeriodicalId":445975,"journal":{"name":"Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision","volume":"48 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":"116427462","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}
{"title":"Combining total variation and wavelet packet approaches for image deblurring","authors":"F. Malgouyres","doi":"10.1109/VLSM.2001.938882","DOIUrl":"https://doi.org/10.1109/VLSM.2001.938882","url":null,"abstract":"We show two ways to combine wavelet packets and total variation-based deblurring methods. For this purpose, we first recall that it is possible to approximate a convolution by mean of an operator diagonal in a wavelet packet basis. Then, we show two possibilities, which use this property, for combining wavelet packets and total variation approaches. We then show in experiments that, doing this, we can expect to have the advantages of both approaches while avoiding their drawbacks.","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":"115893337","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}