scispace - formally typeset

Author

Tony F. Chan

Bio: Tony F. Chan is an academic researcher from Hong Kong University of Science and Technology. The author has contributed to research in topic(s): Domain decomposition methods & Image restoration. The author has an hindex of 82, co-authored 437 publication(s) receiving 48083 citation(s). Previous affiliations of Tony F. Chan include Kent State University & University of California.
Papers
More filters

Journal ArticleDOI
Tony F. Chan1, Luminita A. Vese1Institutions (1)
TL;DR: A new model for active contours to detect objects in a given image, based on techniques of curve evolution, Mumford-Shah (1989) functional for segmentation and level sets is proposed, which can detect objects whose boundaries are not necessarily defined by the gradient.
Abstract: We propose a new model for active contours to detect objects in a given image, based on techniques of curve evolution, Mumford-Shah (1989) functional for segmentation and level sets. Our model can detect objects whose boundaries are not necessarily defined by the gradient. We minimize an energy which can be seen as a particular case of the minimal partition problem. In the level set formulation, the problem becomes a "mean-curvature flow"-like evolving the active contour, which will stop on the desired boundary. However, the stopping term does not depend on the gradient of the image, as in the classical active contour models, but is instead related to a particular segmentation of the image. We give a numerical algorithm using finite differences. Finally, we present various experimental results and in particular some examples for which the classical snakes methods based on the gradient are not applicable. Also, the initial curve can be anywhere in the image, and interior contours are automatically detected.

9,743 citations


Journal ArticleDOI
Xu-Dong Liu1, Stanley Osher1, Tony F. Chan1Institutions (1)
TL;DR: A new version of ENO (essentially non-oscillatory) shock-capturing schemes which is called weighted ENO, where, instead of choosing the "smoothest" stencil to pick one interpolating polynomial for the ENO reconstruction, a convex combination of all candidates is used.
Abstract: In this paper we introduce a new version of ENO (essentially non-oscillatory) shock-capturing schemes which we call weighted ENO. The main new idea is that, instead of choosing the "smoothest" stencil to pick one interpolating polynomial for the ENO reconstruction, we use a convex combination of all candidates to achieve the essentially non-oscillatory property, while additionally obtaining one order of improvement in accuracy. The resulting weighted ENO schemes are based on cell averages and a TVD Runge-Kutta time discretization. Preliminary encouraging numerical experiments are given.

2,635 citations


Journal ArticleDOI
Luminita A. Vese1, Tony F. Chan1Institutions (1)
TL;DR: A new multiphase level set framework for image segmentation using the Mumford and Shah model, for piecewise constant and piecewise smooth optimal approximations, and validated by numerical results for signal and image denoising and segmentation.
Abstract: We propose a new multiphase level set framework for image segmentation using the Mumford and Shah model, for piecewise constant and piecewise smooth optimal approximations. The proposed method is also a generalization of an active contour model without edges based 2-phase segmentation, developed by the authors earlier in T. Chan and L. Vese (1999. In Scale-Space'99, M. Nilsen et al. (Eds.), LNCS, vol. 1682, pp. 141–151) and T. Chan and L. Vese (2001. IEEE-IP, 10(2):266–277). The multiphase level set formulation is new and of interest on its own: by construction, it automatically avoids the problems of vacuum and overlaps it needs only log n level set functions for n phases in the piecewise constant cases it can represent boundaries with complex topologies, including triple junctionss in the piecewise smooth case, only two level set functions formally suffice to represent any partition, based on The Four-Color Theorem. Finally, we validate the proposed models by numerical results for signal and image denoising and segmentation, implemented using the Osher and Sethian level set method.

2,526 citations


Journal ArticleDOI
Tony F. Chan, Jianhong Shen1Institutions (1)
TL;DR: The broad applications of the inpainting models are demonstrated through restoring scratched old photos, disocclusion in vision analysis, text removal, digital zooming, and edge-based image coding.
Abstract: Dedicated to Stanley Osher on the occasion of his 60th birthday. Abstract. Inspired by the recent work of Bertalmio et al. on digital inpaintings (SIGGRAPH 2000), we develop general mathematical models for local inpaintings of nontexture images. On smooth regions, inpaintings are connected to the harmonic and biharmonic extensions, and inpainting orders are analyzed. For inpaintings involving the recovery of edges, we study a variational model that is closely connected to the classical total variation (TV) denoising model of Rudin, Osher, and Fatemi (Phys. D, 60 (1992), pp. 259-268). Other models are also discussed based on the Mumford-Shah regularity (Comm. Pure Appl. Math., XLII (1989), pp. 577-685) and curvature driven diffusions (CDD) of Chan and Shen (J. Visual Comm. Image Rep., 12 (2001)). The broad applications of the inpainting models are demonstrated through restoring scratched old photos, disocclusion in vision analysis, text removal, digital zooming, and edge-based image coding.

1,115 citations


Journal ArticleDOI
Abstract: A coupled level set method for the motion of multiple junctions (of, e.g., solid, liquid, and grain boundaries), which follows the gradient flow for an energy functional consisting of surface tension (proportional to length) and bulk energies (proportional to area), is developed. The approach combines the level set method of S. Osher and J. A. Sethian with a theoretical variational formulation of the motion by F. Reitich and H. M. Soner. The resulting method uses as many level set functions as there are regions and the energy functional is evaluated entirely in terms of level set functions. The gradient projection method leads to a coupled system of perturbed (by curvature terms) Hamilton?Jacobi equations. The coupling is enforced using a single Lagrange multiplier associated with a constraint which essentially prevents (a) regions from overlapping and (b) the development of a vacuum. The numerical implementation is relatively simple and the results agree with (and go beyond) the theory as given in 12. Other applications of this methodology, including the decomposition of a domain into subregions with minimal interface length, are discussed. Finally, some new techniques and results in level set methodology are presented.

1,114 citations


Cited by
More filters

Book
01 Apr 2003
TL;DR: This chapter discusses methods related to the normal equations of linear algebra, and some of the techniques used in this chapter were derived from previous chapters of this book.
Abstract: Preface 1. Background in linear algebra 2. Discretization of partial differential equations 3. Sparse matrices 4. Basic iterative methods 5. Projection methods 6. Krylov subspace methods Part I 7. Krylov subspace methods Part II 8. Methods related to the normal equations 9. Preconditioned iterations 10. Preconditioning techniques 11. Parallel implementations 12. Parallel preconditioners 13. Multigrid methods 14. Domain decomposition methods Bibliography Index.

12,575 citations


Journal ArticleDOI
Tony F. Chan1, Luminita A. Vese1Institutions (1)
TL;DR: A new model for active contours to detect objects in a given image, based on techniques of curve evolution, Mumford-Shah (1989) functional for segmentation and level sets is proposed, which can detect objects whose boundaries are not necessarily defined by the gradient.
Abstract: We propose a new model for active contours to detect objects in a given image, based on techniques of curve evolution, Mumford-Shah (1989) functional for segmentation and level sets. Our model can detect objects whose boundaries are not necessarily defined by the gradient. We minimize an energy which can be seen as a particular case of the minimal partition problem. In the level set formulation, the problem becomes a "mean-curvature flow"-like evolving the active contour, which will stop on the desired boundary. However, the stopping term does not depend on the gradient of the image, as in the classical active contour models, but is instead related to a particular segmentation of the image. We give a numerical algorithm using finite differences. Finally, we present various experimental results and in particular some examples for which the classical snakes methods based on the gradient are not applicable. Also, the initial curve can be anywhere in the image, and interior contours are automatically detected.

9,743 citations



01 Jan 2002

8,563 citations


Journal ArticleDOI
TL;DR: An efficient algorithm is proposed, which allows the computation of the ICA of a data matrix within a polynomial time and may actually be seen as an extension of the principal component analysis (PCA).
Abstract: The independent component analysis (ICA) of a random vector consists of searching for a linear transformation that minimizes the statistical dependence between its components. In order to define suitable search criteria, the expansion of mutual information is utilized as a function of cumulants of increasing orders. An efficient algorithm is proposed, which allows the computation of the ICA of a data matrix within a polynomial time. The concept of ICA may actually be seen as an extension of the principal component analysis (PCA), which can only impose independence up to the second order and, consequently, defines directions that are orthogonal. Potential applications of ICA include data analysis and compression, Bayesian detection, localization of sources, and blind identification and deconvolution.

8,016 citations


Network Information
Related Authors (5)
Jianhong Shen

69 papers, 6.6K citations

87% related
Timothy J. Barth

55 papers, 5.7K citations

80% related
Xue-Cheng Tai

236 papers, 8.9K citations

65% related
Xianfeng Gu

285 papers, 8.5K citations

65% related
Luminita A. Vese

110 papers, 20.1K citations

64% related
Performance
Metrics

Author's H-index: 82

No. of papers from the Author in previous years
YearPapers
20201
20181
20173
20163
20156
20143