This survey reviews the recent development of gradient domain mesh deformation method. Different to other deformation methods, the gradient domain deformation method is a surface-based, variational optimization method...This survey reviews the recent development of gradient domain mesh deformation method. Different to other deformation methods, the gradient domain deformation method is a surface-based, variational optimization method. It directly encodes the geometric details in differential coordinates, which are also called Laplacian coordinates in literature. By preserving the Laplacian coordinates, the mesh details can be well preserved during deformation. Due to the locality of the Laplacian coordinates, the variational optimization problem can be casted into a sparse linear system. Fast sparse linear solver can be adopted to generate deformation result interactively, or even in real-time. The nonlinear nature of gradient domain mesh deformation leads to the development of two categories of deformation methods： linearization methods and nonlinear optimization methods. Basically, the linearization methods only need to solve the linear least-squares system once. They are fast, easy to understand and control, while the deformation result might be suboptimal. Nonlinear optimization methods can reach optimal solution of deformation energy function by iterative updating. Since the computation of nonlinear methods is expensive, reduced deformable models should be adopted to achieve interactive performance. The nonlinear optimization methods avoid the user burden to input transformation at deformation handles, and they can be extended to incorporate various nonlinear constraints, like volume constraint, skeleton constraint, and so on. We review representative methods and related approaches of each category comparatively and hope to help the user understand the motivation behind the algorithms. Finally, we discuss the relation between physical simulation and gradient domain mesh deformation to reveal why it can achieve physically plausible deformation result. Kun Zhou is currently a Cheung Kong professor in the Department of Computer Science, Zhejiang Uni- versity, and a member of the State Key Laboratory of CAD＆CG. He received his B.S. degree and Ph.D. degree from Zhejiang University in 1997 and 2002, respectively. Af- ter graduation, he joined Microsoft Research Asia as an associate re-展开更多
Curvature-driven diffusion (CDD) principles were used to develop a novel gradient based image restora- tion algorithm. The algorithm fills in blocks of missing data in a wireless image after transmission through the n...Curvature-driven diffusion (CDD) principles were used to develop a novel gradient based image restora- tion algorithm. The algorithm fills in blocks of missing data in a wireless image after transmission through the network. When images are transmitted over fading channels, especially in the severe circum- stances of a coal mine, blocks of the image may be destroyed by the effects of noise. Instead of using com- mon retransmission query protocols the lost data is reconstructed by using the adaptive curvature-driven diffusion (ACDD) image restoration algorithm in the gradient domain of the destroyed image. Missing blocks are restored by the method in two steps: In step one, the missing blocks are filled in the gradient domain by the ACDD algorithm; in step two, and the image is reconstructed from the reformed gradients by solving a Poisson equation. The proposed method eliminates the staircase effect and accelerates the convergence rate. This is demonstrated by experimental results.展开更多
Magnetic field gradient tensor technique provides abundant data for delicate inversion of subsurface magnetic susceptibility distribution. Large scale magnetic data inversion imaging requires high speed and accuracy f...Magnetic field gradient tensor technique provides abundant data for delicate inversion of subsurface magnetic susceptibility distribution. Large scale magnetic data inversion imaging requires high speed and accuracy for forward modeling. For arbitrarily distributed susceptibility data on an undulated surface, we propose a fast 3D forward modeling method in the wavenumber domain based on(1) the wavenumber-domain expression of the prism combination model and the Gauss–FFT algorithm and(2) cubic spline interpolation. We apply the proposed 3D forward modeling method to synthetic data and use weighting coefficients in the wavenumber domain to improve the modeling for multiple observation surfaces, and also demonstrate the accuracy and efficiency of the proposed method.展开更多
文摘This survey reviews the recent development of gradient domain mesh deformation method. Different to other deformation methods, the gradient domain deformation method is a surface-based, variational optimization method. It directly encodes the geometric details in differential coordinates, which are also called Laplacian coordinates in literature. By preserving the Laplacian coordinates, the mesh details can be well preserved during deformation. Due to the locality of the Laplacian coordinates, the variational optimization problem can be casted into a sparse linear system. Fast sparse linear solver can be adopted to generate deformation result interactively, or even in real-time. The nonlinear nature of gradient domain mesh deformation leads to the development of two categories of deformation methods： linearization methods and nonlinear optimization methods. Basically, the linearization methods only need to solve the linear least-squares system once. They are fast, easy to understand and control, while the deformation result might be suboptimal. Nonlinear optimization methods can reach optimal solution of deformation energy function by iterative updating. Since the computation of nonlinear methods is expensive, reduced deformable models should be adopted to achieve interactive performance. The nonlinear optimization methods avoid the user burden to input transformation at deformation handles, and they can be extended to incorporate various nonlinear constraints, like volume constraint, skeleton constraint, and so on. We review representative methods and related approaches of each category comparatively and hope to help the user understand the motivation behind the algorithms. Finally, we discuss the relation between physical simulation and gradient domain mesh deformation to reveal why it can achieve physically plausible deformation result. Kun Zhou is currently a Cheung Kong professor in the Department of Computer Science, Zhejiang Uni- versity, and a member of the State Key Laboratory of CAD＆CG. He received his B.S. degree and Ph.D. degree from Zhejiang University in 1997 and 2002, respectively. Af- ter graduation, he joined Microsoft Research Asia as an associate re-
基金supported by the National High-Tech Research and Development Program of China (No. 2008AA062200)the National Natural Science Foundation of China (No.60802077)the Fundamental Research Funds for the Central Universities (No. 2010QNA43)
文摘Curvature-driven diffusion (CDD) principles were used to develop a novel gradient based image restora- tion algorithm. The algorithm fills in blocks of missing data in a wireless image after transmission through the network. When images are transmitted over fading channels, especially in the severe circum- stances of a coal mine, blocks of the image may be destroyed by the effects of noise. Instead of using com- mon retransmission query protocols the lost data is reconstructed by using the adaptive curvature-driven diffusion (ACDD) image restoration algorithm in the gradient domain of the destroyed image. Missing blocks are restored by the method in two steps: In step one, the missing blocks are filled in the gradient domain by the ACDD algorithm; in step two, and the image is reconstructed from the reformed gradients by solving a Poisson equation. The proposed method eliminates the staircase effect and accelerates the convergence rate. This is demonstrated by experimental results.
基金supported by the National Special Plan for the 13th Five-Year Plan of China(No.2017YFC0602204-10)Independent Exploration of the Innovation Project for Graduate Students at Central South University(No.2017zzts176)+3 种基金National Natural Science Foundation of China(Nos.41574127,41404106,and 41674075)Postdoctoral Fund Projects of China(No.2017M622608)National Key R&D Program of China(No.2018YFC0603602)Natural Science Youth Fund Project of the Hunan Province,China(No.2018JJ3642)
文摘Magnetic field gradient tensor technique provides abundant data for delicate inversion of subsurface magnetic susceptibility distribution. Large scale magnetic data inversion imaging requires high speed and accuracy for forward modeling. For arbitrarily distributed susceptibility data on an undulated surface, we propose a fast 3D forward modeling method in the wavenumber domain based on(1) the wavenumber-domain expression of the prism combination model and the Gauss–FFT algorithm and(2) cubic spline interpolation. We apply the proposed 3D forward modeling method to synthetic data and use weighting coefficients in the wavenumber domain to improve the modeling for multiple observation surfaces, and also demonstrate the accuracy and efficiency of the proposed method.
