Daoping Zhang

Prof. Daoping Zhang


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
19 August 2025 in Journal of Scientific Computing
Verified
Journal Article
Open access
PDF file
DZDaoping Zhang
Daoping Zhang
XTXue-Cheng Tai
Xue-Cheng Tai
LLLok Ming Lui
Lok Ming Lui
Image segmentation plays a crucial role in extracting objects of interest and identifying their boundaries within an image. However, accurate segmentation becomes challenging when dealing with occlusions, obscurities, or noise in corrupted images. To tackle this challenge, prior information is often utilized, with recent attention on star-shape priors. In this paper, we propose a star-shape segmentation model based on the registration framework. By combining the level set representation with the registration framework and imposing constraints on the deformed level set function, our model enables both full and partial star-shape segmentation, accommodating single or multiple centers. Additionally, our approach allows for the enforcement of identified boundaries to pass through specified landmark locations. We tackle the proposed models using the alternating direction method of multipliers. Through numerical experiments conducted on synthetic and real images, we demonstrate the efficacy of our approach in achieving accurate star-shape segmentation.

10 April 2025 in Journal of Scientific Computing
Verified
Journal Article
Closed access
PDF file
MLMauricio S. Louzeiro
Mauricio S. Louzeiro
GSGilson N. Silva
Gilson N. Silva
JYJinyun Yuan
Jinyun Yuan
DZDaoping Zhang
Daoping Zhang

3 November 2025 in Journal of Scientific Computing
Verified
Journal Article
Closed access
PDF file
MLMauricio S. Louzeiro
Mauricio S. Louzeiro
GSGilson N. Silva
Gilson N. Silva
JYJinyun Yuan
Jinyun Yuan
DZDaoping Zhang
Daoping Zhang

19 February 2024 in arXiv
Verified
Preprint
Open access
PDF file
MLMauricio S. Louzeiro
Mauricio S. Louzeiro
GSGilson N. Silva
Gilson N. Silva
JYJinyun Yuan
Jinyun Yuan
DZDaoping Zhang
Daoping Zhang
A quasi-Newton method with cubic regularization is designed for solving Riemannian unconstrained nonconvex optimization problems. The proposed algorithm is fully adaptive with at most ${\cal O} (ε_g^{-3/2})$ iterations to achieve a gradient smaller than $ε_g$ for given $ε_g$, and at most $\mathcal O(\max\{ ε_g^{-\frac{3}{2}}, ε_H^{-3} \})$ iterations to reach a second-order stationary point respectively. Notably, the proposed algorithm remains applicable even in cases of the gradient and Hessian of the objective function unknown. Numerical experiments are performed with gradient and Hessian being approximated by forward finite-differences to illustrate the theoretical results and numerical comparison.

11 August 2025 in arXiv
Verified
Preprint
Open access
PDF file
DZDaoping Zhang
Daoping Zhang
XTXue-Cheng Tai
Xue-Cheng Tai
LLLok Ming Lui
Lok Ming Lui
Image segmentation plays a crucial role in extracting objects of interest and identifying their boundaries within an image. However, accurate segmentation becomes challenging when dealing with occlusions, obscurities, or noise in corrupted images. To tackle this challenge, prior information is often utilized, with recent attention on star-shape priors. In this paper, we propose a star-shape segmentation model based on the registration framework. By combining the level set representation with the registration framework and imposing constraints on the deformed level set function, our model enables both full and partial star-shape segmentation, accommodating single or multiple centers. Additionally, our approach allows for the enforcement of identified boundaries to pass through specified landmark locations. We tackle the proposed models using the alternating direction method of multipliers. Through numerical experiments conducted on synthetic and real images, we demonstrate the efficacy of our approach in achieving accurate star-shape segmentation.

26 March 2022 in arXiv
Verified
Preprint
Open access
PDF file
DZDaoping Zhang
Daoping Zhang
GCGary P. T. Choi
Gary P. T. Choi
JZJian-Ping Zhang
Jian-Ping Zhang
LLLok Ming Lui
Lok Ming Lui
With the advancement of computer technology, there is a surge of interest in effective mapping methods for objects in higher-dimensional spaces. To establish a one-to-one correspondence between objects, higher-dimensional quasi-conformal theory can be utilized for ensuring the bijectivity of the mappings. In addition, it is often desirable for the mappings to satisfy certain prescribed geometric constraints and possess low distortion in conformality or volume. In this work, we develop a unifying framework for computing $n$-dimensional quasi-conformal mappings. More specifically, we propose a variational model that integrates quasi-conformal distortion, volumetric distortion, landmark correspondence, intensity mismatch and volume prior information to handle a large variety of deformation problems. We further prove the existence of a minimizer for the proposed model and devise efficient numerical methods to solve the optimization problem. We demonstrate the effectiveness of the proposed framework using various experiments in two- and three-dimensions, with applications to medical image registration, adaptive remeshing and shape modeling.