scispace - formally typeset
X

Xue-Cheng Tai

Researcher at Hong Kong Baptist University

Publications -  248
Citations -  10012

Xue-Cheng Tai is an academic researcher from Hong Kong Baptist University. The author has contributed to research in topics: Image segmentation & Augmented Lagrangian method. The author has an hindex of 44, co-authored 236 publications receiving 8990 citations. Previous affiliations of Xue-Cheng Tai include Henan University & Beijing Normal University.

Papers
More filters
Journal ArticleDOI

Noise removal using fourth-order partial differential equation with applications to medical magnetic resonance images in space and time

TL;DR: A new method for image smoothing based on a fourth-order PDE model that demonstrates good noise suppression without destruction of important anatomical or functional detail, even at poor signal-to-noise ratio is introduced.
Journal ArticleDOI

Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models

TL;DR: The augmented Lagrangian method for the ROF model is reviewed and some convergence analysis and extensions to vectorial TV and high order models are provided.
Journal ArticleDOI

A binary level set model and some applications to Mumford-Shah image segmentation

TL;DR: A PDE-based level set method that needs to minimize a smooth convex functional under a quadratic constraint, and shows numerical results using the method for segmentation of digital images.
Journal ArticleDOI

Iterative Image Restoration Combining Total Variation Minimization and a Second-Order Functional

TL;DR: A noise removal technique using partial differential equations (PDEs) that combines the Total Variational filter with a fourth-order PDE filter that is able to preserve edges and at the same time avoid the staircase effect in smooth regions is proposed.
Proceedings ArticleDOI

A study on continuous max-flow and min-cut approaches

TL;DR: It is proved that the proposed continuous max-flow and min-cut models, with or without supervised constraints, give rise to a series of global binary solutions λ∗(x) ∊ {0,1}, which globally solves the original nonconvex image partitioning problems.