Hung-Tsai Huang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hung-Tsai Huang has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Zi-Cai Li
Natl Sun Yat Sen Univ, Dept Appl Math, Kaohsiung 80424, Taiwan
9 shared publications - Liping Zhang
School of Mathematical Sciences, Qufu Normal University, Qufu 273165, China
8 shared publications Zi-Cai Li
8 shared publications- Ming-Gong Lee
Department of Leisure and Tourism/PhD Program in Engineering Science, Chung Hua University, Hsin-Chu, Taiwan
7 shared publications - Yimin Wei
School of Mathematical Sciences and Shanghai Key Laboratory of Contemporary Applied Mathematics, Fudan University, Shanghai, P. R. of China
7 shared publications - Zi-Cai Li
Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung 80424, Taiwan
5 shared publications
Latest Publications
- Open Access
- 26 May 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (11) , 1773
Improved Splitting-Integrating Methods for Image Geometric Transformations: Error Analysis and Applications
Geometric image transformations are fundamental to image processing, computer vision and graphics, with critical applications to pattern recognition and facial identification. The splitting-integrating method (SIM) is well suited to the inverse transformation of digital images and patterns, but it encounters difficulties in nonlinear solutions for the forward transformation T. We propose improved techniques that entirely bypass nonlinear solutions for T, simplify numerical algorithms and reduce computational costs. Another significant advantage is the greater flexibility for general and complicated transformations T. In this paper, we apply the improved techniques to the harmonic, Poisson and blending models, which transform the original shapes of images and patterns into arbitrary target shapes. These models are, essentially, the Dirichlet boundary value problems of elliptic equations. In this paper, we choose the simple finite difference method (FDM) to seek their approximate transformations. We focus significantly on analyzing errors of image greyness. Under the improved techniques, we derive the greyness errors of images under T. We obtain the optimal convergence rates for the piecewise bilinear interpolations () and smooth images, where denotes the mesh resolution of an optical scanner, and N is the division number of a pixel split into sub-pixels. Beyond smooth images, we address practical challenges posed by discontinuous images. We also derive the error bounds , as . For piecewise continuous images with interior and exterior greyness jumps, we have . Compared with the error analysis in our previous study, where the image greyness is often assumed to be smooth enough, this error analysis is significant for geometric image transformations. Hence, the improved algorithms supported by rigorous error analysis of image greyness may enhance their wide applications in pattern recognition, facial identification and artificial intelligence (AI).- 26 May 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (11) , 1773
Open AccessImproved Splitting-Integrating Methods for Image Geometric Transformations: Error Analysis and Applications
Geometric image transformations are fundamental to image processing, computer vision and graphics, with critical applications to pattern recognition and facial identification. The splitting-integrating method (SIM) is well suited to the inverse transformation of digital images and patterns, but it encounters difficulties in nonlinear solutions for the forward transformation T. We propose improved techniques that entirely bypass nonlinear solutions for T, simplify numerical algorithms and reduce computational costs. Another significant advantage is the greater flexibility for general and complicated transformations T. In this paper, we apply the improved techniques to the harmonic, Poisson and blending models, which transform the original shapes of images and patterns into arbitrary target shapes. These models are, essentially, the Dirichlet boundary value problems of elliptic equations. In this paper, we choose the simple finite difference method (FDM) to seek their approximate transformations. We focus significantly on analyzing errors of image greyness. Under the improved techniques, we derive the greyness errors of images under T. We obtain the optimal convergence rates for the piecewise bilinear interpolations () and smooth images, where denotes the mesh resolution of an optical scanner, and N is the division number of a pixel split into sub-pixels. Beyond smooth images, we address practical challenges posed by discontinuous images. We also derive the error bounds , as . For piecewise continuous images with interior and exterior greyness jumps, we have . Compared with the error analysis in our previous study, where the image greyness is often assumed to be smooth enough, this error analysis is significant for geometric image transformations. Hence, the improved algorithms supported by rigorous error analysis of image greyness may enhance their wide applications in pattern recognition, facial identification and artificial intelligence (AI). - Open Access
- 8 January 2025
- Published by MDPI AG in Journal of Imaging
- Vol. 11 (1) , 14
Face Boundary Formulation for Harmonic Models: Face Image Resembling
This paper is devoted to numerical algorithms based on harmonic transformations with two goals: (1) face boundary formulation by blending techniques based on the known characteristic nodes and (2) some challenging examples of face resembling. The formulation of the face boundary is imperative for face recognition, transformation, and combination. Mapping between the source and target face boundaries with constituent pixels is explored by two approaches: cubic spline interpolation and ordinary differential equation (ODE) using Hermite interpolation. The ODE approach is more flexible and suitable for handling different boundary conditions, such as the clamped and simple support conditions. The intrinsic relations between the cubic spline and ODE methods are explored for different face boundaries, and their combinations are developed. Face combination and resembling are performed by employing blending curves for generating the face boundary, and face images are converted by numerical methods for harmonic models, such as the finite difference method (FDM), the finite element method (FEM) and the finite volume method (FVM) for harmonic models, and the splitting–integrating method (SIM) for the resampling of constituent pixels. For the second goal, the age effects of facial appearance are explored to discover that different ages of face images can be produced by integrating the photos and images of the old and the young. Then, the following challenging task is targeted. Based on the photos and images of parents and their children, can we obtain an integrated image to resemble his/her current image as closely as possible? Amazing examples of face combination and resembling are reported in this paper to give a positive answer. Furthermore, an optimal combination of face images of parents and their children in the least-squares sense is introduced to greatly facilitate face resembling. Face combination and resembling may also be used for plastic surgery, finding missing children, and identifying criminals. The boundary and numerical techniques of face images in this paper can be used not only for pattern recognition but also for face morphing, morphing attack detection (MAD), and computer animation as Sora to greatly enhance further developments in AI.
- 8 January 2025
- Published by MDPI AG in Journal of Imaging
- Vol. 11 (1) , 14
Open AccessFace Boundary Formulation for Harmonic Models: Face Image Resembling
This paper is devoted to numerical algorithms based on harmonic transformations with two goals: (1) face boundary formulation by blending techniques based on the known characteristic nodes and (2) some challenging examples of face resembling. The formulation of the face boundary is imperative for face recognition, transformation, and combination. Mapping between the source and target face boundaries with constituent pixels is explored by two approaches: cubic spline interpolation and ordinary differential equation (ODE) using Hermite interpolation. The ODE approach is more flexible and suitable for handling different boundary conditions, such as the clamped and simple support conditions. The intrinsic relations between the cubic spline and ODE methods are explored for different face boundaries, and their combinations are developed. Face combination and resembling are performed by employing blending curves for generating the face boundary, and face images are converted by numerical methods for harmonic models, such as the finite difference method (FDM), the finite element method (FEM) and the finite volume method (FVM) for harmonic models, and the splitting–integrating method (SIM) for the resampling of constituent pixels. For the second goal, the age effects of facial appearance are explored to discover that different ages of face images can be produced by integrating the photos and images of the old and the young. Then, the following challenging task is targeted. Based on the photos and images of parents and their children, can we obtain an integrated image to resemble his/her current image as closely as possible? Amazing examples of face combination and resembling are reported in this paper to give a positive answer. Furthermore, an optimal combination of face images of parents and their children in the least-squares sense is introduced to greatly facilitate face resembling. Face combination and resembling may also be used for plastic surgery, finding missing children, and identifying criminals. The boundary and numerical techniques of face images in this paper can be used not only for pattern recognition but also for face morphing, morphing attack detection (MAD), and computer animation as Sora to greatly enhance further developments in AI.
- 1 January 2025
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 65 (1) , 161-179
Error Analysis of the Null Field Method for Laplace’s Equation on Circular Domains with Circular Holes: Source Nodes Just on Domain Boundaries
The null field method (NFM) has been applied successfully to Laplace’s equation in circular/elliptic domains with multiple circular/elliptic holes. There are many papers published; but no strict error analysis exists so far. In this paper, we describe the NFM as the Galerkin methods involving the trapezoidal rule. For the NFM, the pseudo-boundaries can be just located on the domain boundary \(\Gamma \); this is the most intriguing and important characteristic in applications. In such a case, the error bounds are derived for the Dirichlet problems. Polynomial convergence rates are obtained, and exponential convergence rates can be achieved for infinite smooth solutions. Although the error analysis in this paper is made for the source nodes on \(\Gamma \), it can be extended for the source nodes outside \(\Gamma \). The error analysis in this paper is essential to the NFM because it provides some important theoretical foundation, thus to enhance its application.- 1 January 2025
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 65 (1) , 161-179
Error Analysis of the Null Field Method for Laplace’s Equation on Circular Domains with Circular Holes: Source Nodes Just on Domain Boundaries
The null field method (NFM) has been applied successfully to Laplace’s equation in circular/elliptic domains with multiple circular/elliptic holes. There are many papers published; but no strict error analysis exists so far. In this paper, we describe the NFM as the Galerkin methods involving the trapezoidal rule. For the NFM, the pseudo-boundaries can be just located on the domain boundary \(\Gamma \); this is the most intriguing and important characteristic in applications. In such a case, the error bounds are derived for the Dirichlet problems. Polynomial convergence rates are obtained, and exponential convergence rates can be achieved for infinite smooth solutions. Although the error analysis in this paper is made for the source nodes on \(\Gamma \), it can be extended for the source nodes outside \(\Gamma \). The error analysis in this paper is essential to the NFM because it provides some important theoretical foundation, thus to enhance its application.- Open Access
- 31 December 2024
- Published by MDPI AG in Mathematics
- Vol. 13 (1) , 131
Study on Discrete Null-Field Equation Methods for Bounded Simply Connected Domains: Better Locations of Source Nodes
The discrete null-field equation method (DNFEM) was proposed based on the null-field equation (NFE) of Green’s representation formulation, where only disk domains were discussed. However, the study of the DNFEM for bounded simply connected domains S is essential for practical applications. Since the source nodes must be located outside of a solution domain S, the first issue in computations is how to locate them. It includes two topics—Topic I: The source nodes must be located not only outside S but also outside the exterior boundary layers. The width of the exterior boundary layers is derived as , where N is the number of unknowns in the DNFEM. Topic II: There are numerous locations for source nodes outside the exterior boundary layers. Based on the sensitivity index, several better choices of pseudo-boundaries are studied for bounded simply connected domains. The advanced study of Topics I and II needs stability and error analysis. The bounds of condition numbers (Cond) are derived for bounded simply connected domains, and they are similar to those of the method of fundamental solutions (MFS). New error bounds are also provided for bounded simply connected domains. The thorough study of determining better locations of source nodes is also valid for the MFS and the discrete boundary integral equation method (DBIEM). The development of algorithms based on the NFE lags far behind that of the traditional boundary element method (BEM). Some progress has been made by following the MFS, and reported in this paper. From the theory and computations in this paper, the DNFEM may become a competent boundary method in scientific/engineering computing.- 31 December 2024
- Published by MDPI AG in Mathematics
- Vol. 13 (1) , 131
Open AccessStudy on Discrete Null-Field Equation Methods for Bounded Simply Connected Domains: Better Locations of Source Nodes
The discrete null-field equation method (DNFEM) was proposed based on the null-field equation (NFE) of Green’s representation formulation, where only disk domains were discussed. However, the study of the DNFEM for bounded simply connected domains S is essential for practical applications. Since the source nodes must be located outside of a solution domain S, the first issue in computations is how to locate them. It includes two topics—Topic I: The source nodes must be located not only outside S but also outside the exterior boundary layers. The width of the exterior boundary layers is derived as , where N is the number of unknowns in the DNFEM. Topic II: There are numerous locations for source nodes outside the exterior boundary layers. Based on the sensitivity index, several better choices of pseudo-boundaries are studied for bounded simply connected domains. The advanced study of Topics I and II needs stability and error analysis. The bounds of condition numbers (Cond) are derived for bounded simply connected domains, and they are similar to those of the method of fundamental solutions (MFS). New error bounds are also provided for bounded simply connected domains. The thorough study of determining better locations of source nodes is also valid for the MFS and the discrete boundary integral equation method (DBIEM). The development of algorithms based on the NFE lags far behind that of the traditional boundary element method (BEM). Some progress has been made by following the MFS, and reported in this paper. From the theory and computations in this paper, the DNFEM may become a competent boundary method in scientific/engineering computing. - 14 February 2024
- Published by Wiley in Numerical Methods for Partial Differential Equations
- Vol. 40 (4)
Discrete null field equation methods for solving Laplace's equation: Boundary layer computations
Consider Dirichlet problems of Laplace's equation in a bounded simply‐connected domain , and use the null field equation (NFE) of Green's representation formulation, where the source nodes are located on a pseudo‐boundary outside but not close to its boundary . Simple algorithms are proposed in this article by using the central rule for the NFE, and the normal derivatives of the solutions on the boundary can be easily obtained. These algorithms are called the discrete null field equation method (DNFEM) because the collocation equations are, indeed, the direct discrete form of the NFE. The bounds of the condition number are like those by the method of fundamental solutions (MFS) yielding the exponential growth as the number of unknowns increases. One trouble of the DNFEM is the near singularity of integrations for the solutions in boundary layers in Green's representation formulation. The traditional BEM also suffers from the same trouble. To deal with the near singularity, quadrature by expansions and the sinh transformation are often used. To handle this trouble, however, we develop two kinds of new techniques: (I) the interpolation techniques by Taylor's formulas with piecewise ‐degree polynomials and the Fourier series, and (II) the mini‐rules of integrals, such as the mini‐Simpson's and the mini‐Gaussian rules. Error analysis is made for technique I to achieve optimal convergence rates. Numerical experiments are carried out for disk domains to support the theoretical analysis made. The numerical performance of the DNFEM is excellent for disk domains to compete with the MFS. The errors with can be obtained by combination algorithms, which are satisfactory for most engineering problems. In summary, the new simple DNFEM is based on the NFE, which is different from the boundary element method (BEM). The theoretical basis in error and stability has been established in this article. One trouble in seeking the numerical solutions in boundary layers has been handled well; this is also an important contribution to the BEM. Besides, numerical experiments are encouraging. Hence the DNFEM is promising, and it may become a new boundary method for scientific/engineering computing.
- 14 February 2024
- Published by Wiley in Numerical Methods for Partial Differential Equations
- Vol. 40 (4)
Discrete null field equation methods for solving Laplace's equation: Boundary layer computations
Consider Dirichlet problems of Laplace's equation in a bounded simply‐connected domain , and use the null field equation (NFE) of Green's representation formulation, where the source nodes are located on a pseudo‐boundary outside but not close to its boundary . Simple algorithms are proposed in this article by using the central rule for the NFE, and the normal derivatives of the solutions on the boundary can be easily obtained. These algorithms are called the discrete null field equation method (DNFEM) because the collocation equations are, indeed, the direct discrete form of the NFE. The bounds of the condition number are like those by the method of fundamental solutions (MFS) yielding the exponential growth as the number of unknowns increases. One trouble of the DNFEM is the near singularity of integrations for the solutions in boundary layers in Green's representation formulation. The traditional BEM also suffers from the same trouble. To deal with the near singularity, quadrature by expansions and the sinh transformation are often used. To handle this trouble, however, we develop two kinds of new techniques: (I) the interpolation techniques by Taylor's formulas with piecewise ‐degree polynomials and the Fourier series, and (II) the mini‐rules of integrals, such as the mini‐Simpson's and the mini‐Gaussian rules. Error analysis is made for technique I to achieve optimal convergence rates. Numerical experiments are carried out for disk domains to support the theoretical analysis made. The numerical performance of the DNFEM is excellent for disk domains to compete with the MFS. The errors with can be obtained by combination algorithms, which are satisfactory for most engineering problems. In summary, the new simple DNFEM is based on the NFE, which is different from the boundary element method (BEM). The theoretical basis in error and stability has been established in this article. One trouble in seeking the numerical solutions in boundary layers has been handled well; this is also an important contribution to the BEM. Besides, numerical experiments are encouraging. Hence the DNFEM is promising, and it may become a new boundary method for scientific/engineering computing.
- 24 April 2023
- Published by Elsevier in Engineering Analysis with Boundary Elements
- Vol. 152, 347-361
New regularization techniques for ill-conditioning problems and their applications: Choices of regularization parameters
- 24 April 2023
- Published by Elsevier in Engineering Analysis with Boundary Elements
- Vol. 152, 347-361
New regularization techniques for ill-conditioning problems and their applications: Choices of regularization parameters
- 6 September 2022
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 30 (2)
Lower and upper bounds of condition number for Vandermonde‐wise matrices and method of fundamental solutions using pseudo radial‐lines
Consider the method of fundamental solutions (MFS) for 2D Laplace's equation in a bounded simply connected domain . In the standard MFS, the source nodes are located on a closed contour outside the domain boundary , which is called pseudo‐boundary. For circular, elliptic, and general closed pseudo‐boundaries, analysis and computation have been studied extensively. New locations of source nodes are proposed along two pseudo radial‐lines outside . Numerical results are very encouraging and promising. Since the success of the MFS mainly depends on stability, our efforts are focused on deriving the lower and upper bounds of condition number (Cond). The study finds stability properties of new Vandermonde‐wise matrices on nodes with . The Vandermonde‐wise matrix is called in this article if it can be decomposed into the standard Vandermonde matrix. New lower and upper bounds of Cond are first derived for the standard Vandermonde matrix, and then for new algorithms of the MFS using two pseudo radial‐lines. Both lower and upper bounds of Cond are intriguing in the stability study for the MFS. Numerical experiments are carried out to verify the stability analysis made. Since the fundamental solutions (as ) are the basis functions of the MFS, new Vandermonde‐wise matrices are found. Since the nodes with may come from approximations and interpolations by the Laurent polynomials with singular part, the conclusions in this article are important not only to the MFS but also to matrix analysis.
- 6 September 2022
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 30 (2)
Lower and upper bounds of condition number for Vandermonde‐wise matrices and method of fundamental solutions using pseudo radial‐lines
Consider the method of fundamental solutions (MFS) for 2D Laplace's equation in a bounded simply connected domain . In the standard MFS, the source nodes are located on a closed contour outside the domain boundary , which is called pseudo‐boundary. For circular, elliptic, and general closed pseudo‐boundaries, analysis and computation have been studied extensively. New locations of source nodes are proposed along two pseudo radial‐lines outside . Numerical results are very encouraging and promising. Since the success of the MFS mainly depends on stability, our efforts are focused on deriving the lower and upper bounds of condition number (Cond). The study finds stability properties of new Vandermonde‐wise matrices on nodes with . The Vandermonde‐wise matrix is called in this article if it can be decomposed into the standard Vandermonde matrix. New lower and upper bounds of Cond are first derived for the standard Vandermonde matrix, and then for new algorithms of the MFS using two pseudo radial‐lines. Both lower and upper bounds of Cond are intriguing in the stability study for the MFS. Numerical experiments are carried out to verify the stability analysis made. Since the fundamental solutions (as ) are the basis functions of the MFS, new Vandermonde‐wise matrices are found. Since the nodes with may come from approximations and interpolations by the Laurent polynomials with singular part, the conclusions in this article are important not only to the MFS but also to matrix analysis.
- 23 April 2022
- Published by Springer Nature in Numerical Algorithms
- Vol. 91 (2) , 895-932
Spurious eigenvalue-free algorithms of the method of fundamental solutions for solving the Helmholtz equation in bounded multiply connected domains
- 23 April 2022
- Published by Springer Nature in Numerical Algorithms
- Vol. 91 (2) , 895-932
Spurious eigenvalue-free algorithms of the method of fundamental solutions for solving the Helmholtz equation in bounded multiply connected domains
- 10 January 2022
- Published by Elsevier in Engineering Analysis with Boundary Elements
- Vol. 136, 93-115
New locations of source nodes for method of fundamental solutions solving Laplace’s equation; pseudo radial-lines
- 10 January 2022
- Published by Elsevier in Engineering Analysis with Boundary Elements
- Vol. 136, 93-115
New locations of source nodes for method of fundamental solutions solving Laplace’s equation; pseudo radial-lines