Mei-Heng Yueh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Mei-Heng Yueh has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Shu-Yung Liu
Department of Mathematics, National Taiwan Normal University, Taipei, Taiwan
8 shared publications Shing-Tung Yau
Yau Mathematical Sciences Center, Tsinghua University, Beijing, 100084, China
7 shared publicationsWen-Wei Lin
Nanjing Center for Applied Mathematics, Nanjing 211135, People’s Republic of China; Department of Applied Mathematics, National Yang Ming Chiao Tung University, Hsinchu 300, Taiwan
7 shared publications- Wen-Wei Lin
Natl Yang Ming Chiao Tung Univ, Dept Appl Math, Hsinchu 300, Taiwan
6 shared publications - Shing-Tung Yau
Beijing Institute of Mathematical Sciences and Applications, Beijing, China
4 shared publications - Tsung-Ming Huang
Department of Mathematics, National Taiwan Normal University, Taipei, Taiwan
4 shared publications
Latest Publications
- Open Access
- 19 May 2026
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 209 (3) , 68
Volume-Preserving Parameterizations via Preconditioned Nonlinear Conjugate Gradient Method
A volume-preserving parameterization is a bijective mapping that maps a 3-manifold onto a canonical domain while preserving local volume. We formulate this problem as an unconstrained nonlinear optimization problem by introducing an isovolumetric energy that quantifies volumetric distortion. This energy is minimized using a preconditioned nonlinear conjugate gradient method, which is globally convergent when the line search satisfies the strong Wolfe conditions. Numerical experiments demonstrate that the proposed method achieves improved accuracy and efficiency, and it supports applications in shape registration and volumetric deformation.
- 19 May 2026
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 209 (3) , 68
Open AccessVolume-Preserving Parameterizations via Preconditioned Nonlinear Conjugate Gradient Method
A volume-preserving parameterization is a bijective mapping that maps a 3-manifold onto a canonical domain while preserving local volume. We formulate this problem as an unconstrained nonlinear optimization problem by introducing an isovolumetric energy that quantifies volumetric distortion. This energy is minimized using a preconditioned nonlinear conjugate gradient method, which is globally convergent when the line search satisfies the strong Wolfe conditions. Numerical experiments demonstrate that the proposed method achieves improved accuracy and efficiency, and it supports applications in shape registration and volumetric deformation.
- 7 January 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Imaging Sciences
- Vol. 19 (1) , 207-235
Spherical Area-Preserving Parameterization via Energy Minimization
We propose a novel method, called spherical authalic energy minimization (SAEM), for computing spherical area-preserving parameterizations of genus-zero closed surfaces with strong theoretical foundations. The global convergence of the associated computational algorithm is theoretically guaranteed. In addition, we introduce a Riemannian bijective correction method that ensures the bijectivity of the resulting mapping under mild assumptions. Numerical experiments show that SAEM effectively minimizes area distortion and achieves bijective mappings, outperforming state-of-the-art methods. Finally, we demonstrate the practical utility of SAEM in shape description.
- 7 January 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Imaging Sciences
- Vol. 19 (1) , 207-235
Spherical Area-Preserving Parameterization via Energy Minimization
We propose a novel method, called spherical authalic energy minimization (SAEM), for computing spherical area-preserving parameterizations of genus-zero closed surfaces with strong theoretical foundations. The global convergence of the associated computational algorithm is theoretically guaranteed. In addition, we introduce a Riemannian bijective correction method that ensures the bijectivity of the resulting mapping under mild assumptions. Numerical experiments show that SAEM effectively minimizes area distortion and achieves bijective mappings, outperforming state-of-the-art methods. Finally, we demonstrate the practical utility of SAEM in shape description.
- 3 October 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Imaging Sciences
- Vol. 18 (4) , 2059-2093
Energy-Based Distortion-Balancing Parameterization for Open Surfaces
Surface parameterization is a fundamental concept in fields such as differential geometry and computer graphics. It involves mapping a surface in three-dimensional space onto a two-dimensional parameter space. This process allows for the systematic representation and manipulation of surfaces of complicated shapes by simplifying them into a manageable planar domain. In this paper, we propose a new iterative algorithm for computing the parameterization of simply connected open surfaces that achieves an optimal balance between angle and area distortions. We rigorously prove the global convergence of the iteration in our algorithm. Numerical experiments demonstrate that the resulting mappings are bijective and effectively balance angular and area accuracy across various triangular meshes. Additionally, we present the practical usefulness of the proposed algorithm by applying it to represent surfaces as geometry images.
- 3 October 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Imaging Sciences
- Vol. 18 (4) , 2059-2093
Energy-Based Distortion-Balancing Parameterization for Open Surfaces
Surface parameterization is a fundamental concept in fields such as differential geometry and computer graphics. It involves mapping a surface in three-dimensional space onto a two-dimensional parameter space. This process allows for the systematic representation and manipulation of surfaces of complicated shapes by simplifying them into a manageable planar domain. In this paper, we propose a new iterative algorithm for computing the parameterization of simply connected open surfaces that achieves an optimal balance between angle and area distortions. We rigorously prove the global convergence of the iteration in our algorithm. Numerical experiments demonstrate that the resulting mappings are bijective and effectively balance angular and area accuracy across various triangular meshes. Additionally, we present the practical usefulness of the proposed algorithm by applying it to represent surfaces as geometry images.
- Open Access
Square-Domain Area-Preserving Parameterization for Genus-Zero and Genus-One Closed Surfaces
The parameterization of closed surfaces typically requires either multiple charts or a non-planar domain to achieve a seamless global mapping. In this paper, we propose a numerical framework for the seamless parameterization of genus-zero and genus-one closed simplicial surfaces onto a unit square domain. The process begins by slicing the surface with either the shortest-path or the Reeb graph method. The sliced surface is then mapped onto the unit square using a globally convergent algorithm that minimizes the weighted variance of per-triangle area ratios to achieve area preservation. Numerical experiments on benchmark models demonstrate that our method achieves high accuracy and efficiency. Furthermore, the proposed method enables applications such as geometry images, producing accurate and high-quality surface reconstructions.
Open AccessSquare-Domain Area-Preserving Parameterization for Genus-Zero and Genus-One Closed Surfaces
The parameterization of closed surfaces typically requires either multiple charts or a non-planar domain to achieve a seamless global mapping. In this paper, we propose a numerical framework for the seamless parameterization of genus-zero and genus-one closed simplicial surfaces onto a unit square domain. The process begins by slicing the surface with either the shortest-path or the Reeb graph method. The sliced surface is then mapped onto the unit square using a globally convergent algorithm that minimizes the weighted variance of per-triangle area ratios to achieve area preservation. Numerical experiments on benchmark models demonstrate that our method achieves high accuracy and efficiency. Furthermore, the proposed method enables applications such as geometry images, producing accurate and high-quality surface reconstructions.
- Open Access
Toroidal area-preserving parameterizations of genus-one closed surfaces
We consider the problem of computing toroidal area-preserving parameterizations of genus-one closed surfaces. We propose four algorithms based on Riemannian geometry: the projected gradient descent method, the projected conjugate gradient method, the Riemannian gradient method, and the Riemannian conjugate gradient method. Our objective function is based on the stretch energy functional, and the minimization is constrained on a power manifold of ring tori embedded in three-dimensional Euclidean space. Numerical experiments on several mesh models demonstrate the effectiveness of the proposed framework. Finally, we show how to use the proposed algorithms in the context of surface registration and texture mapping applications.
Open AccessToroidal area-preserving parameterizations of genus-one closed surfaces
We consider the problem of computing toroidal area-preserving parameterizations of genus-one closed surfaces. We propose four algorithms based on Riemannian geometry: the projected gradient descent method, the projected conjugate gradient method, the Riemannian gradient method, and the Riemannian conjugate gradient method. Our objective function is based on the stretch energy functional, and the minimization is constrained on a power manifold of ring tori embedded in three-dimensional Euclidean space. Numerical experiments on several mesh models demonstrate the effectiveness of the proposed framework. Finally, we show how to use the proposed algorithms in the context of surface registration and texture mapping applications.
- Open Access
Spherical Authalic Energy Minimization for Area-Preserving Parameterization
We propose a new effective method called spherical authalic energy minimization (SAEM) for computing spherical area-preserving parameterizations of genus-zero surfaces. The proposed SAEM has solid theoretical support and guaranteed convergence. In addition, we develop a Riemannian bijective correction method to ensure the bijectivity of the produced mapping under mild assumptions. Numerical experiments showed that the SAEM effectively minimized area distortion with improved bijectivity compared to other state-of-the-art methods.
Open AccessSpherical Authalic Energy Minimization for Area-Preserving Parameterization
We propose a new effective method called spherical authalic energy minimization (SAEM) for computing spherical area-preserving parameterizations of genus-zero surfaces. The proposed SAEM has solid theoretical support and guaranteed convergence. In addition, we develop a Riemannian bijective correction method to ensure the bijectivity of the produced mapping under mild assumptions. Numerical experiments showed that the SAEM effectively minimized area distortion with improved bijectivity compared to other state-of-the-art methods.
- Open Access
Energy-Based Distortion-Balancing Parameterization for Open Surfaces
Surface parameterization is a fundamental concept in fields such as differential geometry and computer graphics. It involves mapping a surface in three-dimensional space onto a two-dimensional parameter space. This process allows for the systematic representation and manipulation of surfaces of complicated shapes by simplifying them into a manageable planar domain. In this paper, we propose a new iterative algorithm for computing the parameterization of simply connected open surfaces that achieves an optimal balance between angle and area distortions. We rigorously prove that the iteration in our algorithm converges globally, and numerical results demonstrate that the resulting mappings are bijective and effectively balance angular and area accuracy across various triangular meshes. Additionally, we present the practical usefulness of the proposed algorithm by applying it to represent surfaces as geometry images.
Open AccessEnergy-Based Distortion-Balancing Parameterization for Open Surfaces
Surface parameterization is a fundamental concept in fields such as differential geometry and computer graphics. It involves mapping a surface in three-dimensional space onto a two-dimensional parameter space. This process allows for the systematic representation and manipulation of surfaces of complicated shapes by simplifying them into a manageable planar domain. In this paper, we propose a new iterative algorithm for computing the parameterization of simply connected open surfaces that achieves an optimal balance between angle and area distortions. We rigorously prove that the iteration in our algorithm converges globally, and numerical results demonstrate that the resulting mappings are bijective and effectively balance angular and area accuracy across various triangular meshes. Additionally, we present the practical usefulness of the proposed algorithm by applying it to represent surfaces as geometry images.
- Open Access
An Improved Variational Method for Image Denoising
The total variation (TV) method is an image denoising technique that aims to reduce noise by minimizing the total variation of the image, which measures the variation in pixel intensities. The TV method has been widely applied in image processing and computer vision for its ability to preserve edges and enhance image quality. In this paper, we propose an improved TV model for image denoising and the associated numerical algorithm to carry out the procedure, which is particularly effective in removing several types of noises and their combinations. Our improved model admits a unique solution and the associated numerical algorithm guarantees the convergence. Numerical experiments are demonstrated to show improved effectiveness and denoising quality compared to other TV models. Such encouraging results further enhance the utility of the TV method in image processing.
Open AccessAn Improved Variational Method for Image Denoising
The total variation (TV) method is an image denoising technique that aims to reduce noise by minimizing the total variation of the image, which measures the variation in pixel intensities. The TV method has been widely applied in image processing and computer vision for its ability to preserve edges and enhance image quality. In this paper, we propose an improved TV model for image denoising and the associated numerical algorithm to carry out the procedure, which is particularly effective in removing several types of noises and their combinations. Our improved model admits a unique solution and the associated numerical algorithm guarantees the convergence. Numerical experiments are demonstrated to show improved effectiveness and denoising quality compared to other TV models. Such encouraging results further enhance the utility of the TV method in image processing.
- 25 June 2024
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 100 (2) , 1-27
Convergent Authalic Energy Minimization for Disk Area-Preserving Parameterizations
- 25 June 2024
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 100 (2) , 1-27
Convergent Authalic Energy Minimization for Disk Area-Preserving Parameterizations
- Open Access
Riemannian gradient descent for spherical area-preserving mappings
We propose a new Riemannian gradient descent method for computing spherical area-preserving mappings of topological spheres using a Riemannian retraction-based framework with theoretically guaranteed convergence. The objective function is based on the stretch energy functional, and the minimization is constrained on a power manifold of unit spheres embedded in 3-dimensional Euclidean space. Numerical experiments on several mesh models demonstrate the accuracy and stability of the proposed framework. Comparisons with two existing state-of-the-art methods for computing area-preserving mappings demonstrate that our algorithm is both competitive and more efficient. Finally, we present a concrete application to the problem of landmark-aligned surface registration of two brain models.
Open AccessRiemannian gradient descent for spherical area-preserving mappings
We propose a new Riemannian gradient descent method for computing spherical area-preserving mappings of topological spheres using a Riemannian retraction-based framework with theoretically guaranteed convergence. The objective function is based on the stretch energy functional, and the minimization is constrained on a power manifold of unit spheres embedded in 3-dimensional Euclidean space. Numerical experiments on several mesh models demonstrate the accuracy and stability of the proposed framework. Comparisons with two existing state-of-the-art methods for computing area-preserving mappings demonstrate that our algorithm is both competitive and more efficient. Finally, we present a concrete application to the problem of landmark-aligned surface registration of two brain models.