Tony F. Chan

Tony F. Chan

Auto-generated profile, based on publicly available information

Tony F. Chan

Office of the President Hong Kong University of Science and Technology

Research Focus & Metrics

Academic Career Length

47Years (1980-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2001 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
TCT.F. Chan
T.F. Chan
LVL.A. Vese
L.A. Vese
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.

1 November 1994 in Journal of Computational Physics
Verified
Journal Article
Closed access
XLXu-Dong Liu
Xu-Dong Liu
SOStanley Osher
Stanley Osher
TCTony Chan
Tony Chan

1 December 2002 in International Journal of Computer Vision
Verified
Journal Article
Closed access
PDF file
LVLuminita A. Vese
Luminita A. Vese
TCTony F. Chan
Tony F. Chan

1 March 1998 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
TCT.F. Chan
T.F. Chan
CWChiu-Kwong Wong
Chiu-Kwong Wong
In this paper, we present a blind deconvolution algorithm based on the total variational (TV) minimization method proposed. The motivation for regularizing with the TV norm is that it is extremely effective for recovering edges of images as well as some blurring functions, e.g., motion blur and out-of-focus blur. An alternating minimization (AM)implicit iterative scheme is devised to recover the image and simultaneously identify the point spread function (psf). Numerical results indicate that the iterative scheme is quite robust, converges very fast (especially for discontinuous blur), and both the image and the psf can be recovered under the presence of high noise level. Finally, we remark that psf's without sharp edges, e.g., Gaussian blur, can also be identified through the TV approach.

1 January 2006 in SIAM Journal on Applied Mathematics
Verified
Journal Article
Closed access
TCTony F. Chan
Tony F. Chan
SESelim Esedoglu
Selim Esedoglu
MNMila Nikolova
Mila Nikolova
We show how certain nonconvex optimization problems that arise in image processing and computer vision can be restated as convex minimization problems. This allows, in particular, the finding of global minimizers via standard convex minimization schemes.

1 January 2010 in SIAM Journal on Imaging Sciences
Verified
Journal Article
Closed access
EEErnie Esser
Ernie Esser
XZXiaoqun Zhang
Xiaoqun Zhang
TCTony F. Chan
Tony F. Chan
We generalize the primal-dual hybrid gradient (PDHG) algorithm proposed by Zhu and Chan in [An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Variation Image Restoration, CAM Report 08-34, UCLA, Los Angeles, CA, 2008] to a broader class of convex optimization problems. In addition, we survey several closely related methods and explain the connections to PDHG. We point out convergence results for a modified version of PDHG that has a similarly good empirical convergence rate for total variation (TV) minimization problems. We also prove a convergence result for PDHG applied to TV denoising with some restrictions on the PDHG step size parameters. We show how to interpret this special case as a projected averaged gradient method applied to the dual functional. We discuss the range of parameters for which these methods can be shown to converge. We also present some numerical comparisons of these algorithms applied to TV denoising, TV deblurring, and constrained $l_1$ minimization problems.