This paper presents the Approximate Incrtial Manifold ∑ and its successive approximate incrtial manifold ∑i and ∑ij . We give the estimates of thickness of neighborhood of ∑, ∑j, Ejt respectively in which the eve...This paper presents the Approximate Incrtial Manifold ∑ and its successive approximate incrtial manifold ∑i and ∑ij . We give the estimates of thickness of neighborhood of ∑, ∑j, Ejt respectively in which the every solution of Navier-Stokcs equation enters.Another part of this paper presents construction method for A.I.M. by multilevel finite clement method and give error estimates of the approximate solution of incrtial form.展开更多
An intensity-based non-rigid registration algorithm is discussed, which uses Gaussian smoothing to constrain the transformation to be smooth, and thus preserves the topology of images. In view of the insufficiency of ...An intensity-based non-rigid registration algorithm is discussed, which uses Gaussian smoothing to constrain the transformation to be smooth, and thus preserves the topology of images. In view of the insufficiency of the uniform Gaussian filtering of the deformation field, an automatic and accurate non-rigid image registration method based on B-splines approximation is proposed. The regularization strategy is adopted by using multi-level B-splines approximation to regularize the displacement fields in a coarse-to-fine manner. Moreover, it assigns the different weights to the estimated displacements according to their reliabilities. In this way, the level of regularity can be adapted locally. Experiments were performed on both synthetic and real medical images of brain, and the results show that the proposed method improves the registration accuracy and robustness.展开更多
We consider the problem of a ship advancing in waves. In this method, the zone of free surface in the vicinity of body is discretized. On the discretized surface, the first-order and second-order derivatives of ship w...We consider the problem of a ship advancing in waves. In this method, the zone of free surface in the vicinity of body is discretized. On the discretized surface, the first-order and second-order derivatives of ship waves are represented by the B-Spline formulae. Different ship waves are approximated by cubic B-spline and the first and second order derivates of incident waves are calculated and compared with analytical value. It approves that this numerical method has sufficient accuracy and can be also applied to approximate the velocity potential on the free surface.展开更多
Applying the distance function between two B-spline curves with respect to the L2 norm as the approximate error, we investigate the problem of approximate merging of two adjacent B-spline curves into one B-spline curv...Applying the distance function between two B-spline curves with respect to the L2 norm as the approximate error, we investigate the problem of approximate merging of two adjacent B-spline curves into one B-spline curve. Then this method can be easily extended to the approximate merging problem of multiple B-spline curves and of two adjacent surfaces. After minimizing the approximate error between curves or surfaces, the approximate merging problem can be transformed into equations solving. We express both the new control points and the precise error of approximation explicitly in matrix form. Based on homogeneous coordinates and quadratic programming, we also introduce a new framework for approximate merging of two adjacent NURBS curves. Finally, several numerical examples demonstrate the effectiveness and validity of the algorithm.展开更多
In this paper, we study on the application of radical B-spline wavelet scaling function in fractal function approximation system. The paper proposes a wavelet-based fractal function approximation algorithm in which th...In this paper, we study on the application of radical B-spline wavelet scaling function in fractal function approximation system. The paper proposes a wavelet-based fractal function approximation algorithm in which the coefficients can be determined by solving a convex quadraticprogramming problem. And the experiment result shows that the approximation error of this algorithm is smaller than that of the polynomial-based fractal function approximation. This newalgorithm exploits the consistency between fractal and scaling function in multi-scale and multiresolution, has a better approximation effect and high potential in data compression, especially inimage compression.展开更多
An adaptive B-spline active contour model for planar curve approximation is proposed. Starting with an initial B-spline curve, the finite element method is adopted to make the active B-spline curve converge towards th...An adaptive B-spline active contour model for planar curve approximation is proposed. Starting with an initial B-spline curve, the finite element method is adopted to make the active B-spline curve converge towards the target curve without the need of data points parameterization. A strategy of automatic control point insertion during the B-spline active contour deformation, adaptive to the shape of the planar curve, is also given. Experimental results show that this method is efficient and accurate in planar curve approximation.展开更多
In this paper, we present an algorithm for reconstruction of B-spline surface such that it interpolates the four given bound- ary curves and simultaneously approximates some given inner points. The main idea of our me...In this paper, we present an algorithm for reconstruction of B-spline surface such that it interpolates the four given bound- ary curves and simultaneously approximates some given inner points. The main idea of our method is: first, we construct an initial surface which interpolates the four given boundary curves; then, while keeping the boundary control points of the initial surface un- changed, we reposition the inner control points of the surface with energy optimization method. Examples show that our algorithm is practicable and effective.展开更多
For an arbitrary tensor(multi-index array) with linear constraints at each direction,it is proved that the factors of any minimal canonical tensor approximation to this tensor satisfy the same linear constraints for t...For an arbitrary tensor(multi-index array) with linear constraints at each direction,it is proved that the factors of any minimal canonical tensor approximation to this tensor satisfy the same linear constraints for the corresponding directions.展开更多
In this paper, a model averaging method is proposed for varying-coefficient models with response missing at random by establishing a weight selection criterion based on cross-validation. Under certain regularity condi...In this paper, a model averaging method is proposed for varying-coefficient models with response missing at random by establishing a weight selection criterion based on cross-validation. Under certain regularity conditions, it is proved that the proposed method is asymptotically optimal in the sense of achieving the minimum squared error.展开更多
A full-wave analysis of the electromagnetic problem of a three-dimensional (3-D) antenna radiating through a 3-D dielectric radome is preserued. The problem is formulated using the Poggio-Miller-Chang-Harrington- Wu...A full-wave analysis of the electromagnetic problem of a three-dimensional (3-D) antenna radiating through a 3-D dielectric radome is preserued. The problem is formulated using the Poggio-Miller-Chang-Harrington- Wu(PMCHW) approach for homogeneous dielectric objects and the electric field integral equation for conducting objects. The integral equations are discretized by the method of moment (MoM), in which the conducting and dielectric surface/interfaces are represented by curvilinear triangular patches and the unknown equivalent electric and magnetic currents are expanded using curvilinear RWG basis functions. The resultant matrix equation is then solved by the multilevel fast multipole algorithm (MLFMA) and fast far-field approximation (FAFFA) is used to further accelerate the computation. The radiation patterns of dipole arrays in the presence of radomes are presented. The numerical results demonstrate the accuracy and versatility of this method.展开更多
The multilevel characteristic basis function method(MLCBFM)with the adaptive cross approximation(ACA)algorithm for accelerated solution of electrically large scattering problems is studied in this paper.In the convent...The multilevel characteristic basis function method(MLCBFM)with the adaptive cross approximation(ACA)algorithm for accelerated solution of electrically large scattering problems is studied in this paper.In the conventional MLCBFM based on Foldy-Lax multiple scattering equations,the improvement is only made in the generation of characteristic basis functions(CBFs).However,it does not provide a change in impedance matrix filling and reducing matrix calculation procedure,which is time-consuming.In reality,all the impedance and reduced matrix of each level of the MLCBFM have low-rank property and can be calculated efficiently.Therefore,ACA is used for the efficient generation of two-level CBFs and the fast calculation of reduced matrix in this study.Numerical results are given to demonstrate the accuracy and efficiency of the method.展开更多
ωB-splines have many optimal properties and can reproduce plentiful commonly-used analytical curves.In this paper,we further propose a non-stationary subdivision method of hierarchically and efficiently generatingωB...ωB-splines have many optimal properties and can reproduce plentiful commonly-used analytical curves.In this paper,we further propose a non-stationary subdivision method of hierarchically and efficiently generatingωB-spline curves of arbitrary order ofωB-spline curves and prove its C^k?2-continuity by two kinds of methods.The first method directly prove that the sequence of control polygons of subdivision of order k converges to a C^k?2-continuousωB-spline curve of order k.The second one is based on the theories upon subdivision masks and asymptotic equivalence etc.,which is more convenient to be further extended to the case of surface subdivision.And the problem of approximation order of this non-stationary subdivision scheme is also discussed.Then a uniform ωB-spline curve has both perfect mathematical representation and efficient generation method,which will benefit the application ofωB-splines.展开更多
Finding optimal knots is a challenging problem in spline fitting due to a lack of prior knowledge regarding optimal knots.The unimodality of initial B-spline approximations associated with given data is a promising ch...Finding optimal knots is a challenging problem in spline fitting due to a lack of prior knowledge regarding optimal knots.The unimodality of initial B-spline approximations associated with given data is a promising characteristic of locating optimal knots and has been applied successfully.The initial B-spline approximations herein are required to approximate given data well enough and characterized by the unimodality if jumps from the highest-order derivatives of the approximations at some interior knots are local maxima.In this paper,we prove the unimodality of the initial B-spline approximations that are constructed under two assumptions:Data points are sampled uniformly and sufficiently from B-spline functions,and initial knots are chosen as the parameters of sampling points.Our work establishes the theoretical basis of the unimodality of initial B-spline approximations and pioneers the theoretical study of locating optimal knots.展开更多
In this paper,we consider the knot placement problem in B-spline curve approximation.A novel two-stage framework is proposed for addressing this problem.In the first step,the l_(∞,1)-norm model is introduced for the ...In this paper,we consider the knot placement problem in B-spline curve approximation.A novel two-stage framework is proposed for addressing this problem.In the first step,the l_(∞,1)-norm model is introduced for the sparse selection of candidate knots from an initial knot vector.By this step,the knot number is determined.In the second step,knot positions are formulated into a nonlinear optimization problem and optimized by a global optimization algorithm—the differential evolution algorithm(DE).The candidate knots selected in the first step are served for initial values of the DE algorithm.Since the candidate knots provide a good guess of knot positions,the DE algorithm can quickly converge.One advantage of the proposed algorithm is that the knot number and knot positions are determined automatically.Compared with the current existing algorithms,the proposed algorithm finds approximations with smaller fitting error when the knot number is fixed in advance.Furthermore,the proposed algorithm is robust to noisy data and can handle with few data points.We illustrate with some examples and applications.展开更多
文摘This paper presents the Approximate Incrtial Manifold ∑ and its successive approximate incrtial manifold ∑i and ∑ij . We give the estimates of thickness of neighborhood of ∑, ∑j, Ejt respectively in which the every solution of Navier-Stokcs equation enters.Another part of this paper presents construction method for A.I.M. by multilevel finite clement method and give error estimates of the approximate solution of incrtial form.
基金Supported by National Natural Science Foundation of China (No60373061)Joint Programof National Natural Science Foundation of ChinaGeneral Administration of Civil Aviation of China (No60672168)
文摘An intensity-based non-rigid registration algorithm is discussed, which uses Gaussian smoothing to constrain the transformation to be smooth, and thus preserves the topology of images. In view of the insufficiency of the uniform Gaussian filtering of the deformation field, an automatic and accurate non-rigid image registration method based on B-splines approximation is proposed. The regularization strategy is adopted by using multi-level B-splines approximation to regularize the displacement fields in a coarse-to-fine manner. Moreover, it assigns the different weights to the estimated displacements according to their reliabilities. In this way, the level of regularity can be adapted locally. Experiments were performed on both synthetic and real medical images of brain, and the results show that the proposed method improves the registration accuracy and robustness.
文摘We consider the problem of a ship advancing in waves. In this method, the zone of free surface in the vicinity of body is discretized. On the discretized surface, the first-order and second-order derivatives of ship waves are represented by the B-Spline formulae. Different ship waves are approximated by cubic B-spline and the first and second order derivates of incident waves are calculated and compared with analytical value. It approves that this numerical method has sufficient accuracy and can be also applied to approximate the velocity potential on the free surface.
基金Supported by the National Natural Science Foundation of China (60873111, 60933007)
文摘Applying the distance function between two B-spline curves with respect to the L2 norm as the approximate error, we investigate the problem of approximate merging of two adjacent B-spline curves into one B-spline curve. Then this method can be easily extended to the approximate merging problem of multiple B-spline curves and of two adjacent surfaces. After minimizing the approximate error between curves or surfaces, the approximate merging problem can be transformed into equations solving. We express both the new control points and the precise error of approximation explicitly in matrix form. Based on homogeneous coordinates and quadratic programming, we also introduce a new framework for approximate merging of two adjacent NURBS curves. Finally, several numerical examples demonstrate the effectiveness and validity of the algorithm.
文摘In this paper, we study on the application of radical B-spline wavelet scaling function in fractal function approximation system. The paper proposes a wavelet-based fractal function approximation algorithm in which the coefficients can be determined by solving a convex quadraticprogramming problem. And the experiment result shows that the approximation error of this algorithm is smaller than that of the polynomial-based fractal function approximation. This newalgorithm exploits the consistency between fractal and scaling function in multi-scale and multiresolution, has a better approximation effect and high potential in data compression, especially inimage compression.
基金Funded by the Natural Science Foundation of Guangdong Province (No. 04105386,5300090).
文摘An adaptive B-spline active contour model for planar curve approximation is proposed. Starting with an initial B-spline curve, the finite element method is adopted to make the active B-spline curve converge towards the target curve without the need of data points parameterization. A strategy of automatic control point insertion during the B-spline active contour deformation, adaptive to the shape of the planar curve, is also given. Experimental results show that this method is efficient and accurate in planar curve approximation.
基金Supported by the Natural Science Foundation of Hebei Province
文摘In this paper, we present an algorithm for reconstruction of B-spline surface such that it interpolates the four given bound- ary curves and simultaneously approximates some given inner points. The main idea of our method is: first, we construct an initial surface which interpolates the four given boundary curves; then, while keeping the boundary control points of the initial surface un- changed, we reposition the inner control points of the surface with energy optimization method. Examples show that our algorithm is practicable and effective.
基金supported by the Russian Fund for Basic Research (RFBR grant 08-01-00115,RFBR/DFG grant 09-01-91332,RFBR grant 09-01-12058)Priority Research Programme of Department of Mathematical Sciences of Russian Academy of Sciences
文摘For an arbitrary tensor(multi-index array) with linear constraints at each direction,it is proved that the factors of any minimal canonical tensor approximation to this tensor satisfy the same linear constraints for the corresponding directions.
文摘In this paper, a model averaging method is proposed for varying-coefficient models with response missing at random by establishing a weight selection criterion based on cross-validation. Under certain regularity conditions, it is proved that the proposed method is asymptotically optimal in the sense of achieving the minimum squared error.
基金the National Natural Science Foundation of China (60431010)
文摘A full-wave analysis of the electromagnetic problem of a three-dimensional (3-D) antenna radiating through a 3-D dielectric radome is preserued. The problem is formulated using the Poggio-Miller-Chang-Harrington- Wu(PMCHW) approach for homogeneous dielectric objects and the electric field integral equation for conducting objects. The integral equations are discretized by the method of moment (MoM), in which the conducting and dielectric surface/interfaces are represented by curvilinear triangular patches and the unknown equivalent electric and magnetic currents are expanded using curvilinear RWG basis functions. The resultant matrix equation is then solved by the multilevel fast multipole algorithm (MLFMA) and fast far-field approximation (FAFFA) is used to further accelerate the computation. The radiation patterns of dipole arrays in the presence of radomes are presented. The numerical results demonstrate the accuracy and versatility of this method.
基金supported by the National Natural Science Foundation of China (No.61401003)the Specialized Research Fund for the Doctoral Program of Higher Education of China (No.20123401110006)the Natural Science Research Project of Anhui Education ( No. KJ2015A436)
文摘The multilevel characteristic basis function method(MLCBFM)with the adaptive cross approximation(ACA)algorithm for accelerated solution of electrically large scattering problems is studied in this paper.In the conventional MLCBFM based on Foldy-Lax multiple scattering equations,the improvement is only made in the generation of characteristic basis functions(CBFs).However,it does not provide a change in impedance matrix filling and reducing matrix calculation procedure,which is time-consuming.In reality,all the impedance and reduced matrix of each level of the MLCBFM have low-rank property and can be calculated efficiently.Therefore,ACA is used for the efficient generation of two-level CBFs and the fast calculation of reduced matrix in this study.Numerical results are given to demonstrate the accuracy and efficiency of the method.
基金the National Natural Science Foundation of China(61772164,61761136010)the Natural Science Foundation of Zhejiang Province(LY17F020025).
文摘ωB-splines have many optimal properties and can reproduce plentiful commonly-used analytical curves.In this paper,we further propose a non-stationary subdivision method of hierarchically and efficiently generatingωB-spline curves of arbitrary order ofωB-spline curves and prove its C^k?2-continuity by two kinds of methods.The first method directly prove that the sequence of control polygons of subdivision of order k converges to a C^k?2-continuousωB-spline curve of order k.The second one is based on the theories upon subdivision masks and asymptotic equivalence etc.,which is more convenient to be further extended to the case of surface subdivision.And the problem of approximation order of this non-stationary subdivision scheme is also discussed.Then a uniform ωB-spline curve has both perfect mathematical representation and efficient generation method,which will benefit the application ofωB-splines.
基金supported by the National Natural Science Foundation of China(No.11801393)the Natural Science Foundation of Jiangsu Province(No.BK20180831).
文摘Finding optimal knots is a challenging problem in spline fitting due to a lack of prior knowledge regarding optimal knots.The unimodality of initial B-spline approximations associated with given data is a promising characteristic of locating optimal knots and has been applied successfully.The initial B-spline approximations herein are required to approximate given data well enough and characterized by the unimodality if jumps from the highest-order derivatives of the approximations at some interior knots are local maxima.In this paper,we prove the unimodality of the initial B-spline approximations that are constructed under two assumptions:Data points are sampled uniformly and sufficiently from B-spline functions,and initial knots are chosen as the parameters of sampling points.Our work establishes the theoretical basis of the unimodality of initial B-spline approximations and pioneers the theoretical study of locating optimal knots.
基金supported by the National Natural Science Foundation of China(Nos.11871447,11801393)the Natural Science Foundation of Jiangsu Province(No.BK20180831).
文摘In this paper,we consider the knot placement problem in B-spline curve approximation.A novel two-stage framework is proposed for addressing this problem.In the first step,the l_(∞,1)-norm model is introduced for the sparse selection of candidate knots from an initial knot vector.By this step,the knot number is determined.In the second step,knot positions are formulated into a nonlinear optimization problem and optimized by a global optimization algorithm—the differential evolution algorithm(DE).The candidate knots selected in the first step are served for initial values of the DE algorithm.Since the candidate knots provide a good guess of knot positions,the DE algorithm can quickly converge.One advantage of the proposed algorithm is that the knot number and knot positions are determined automatically.Compared with the current existing algorithms,the proposed algorithm finds approximations with smaller fitting error when the knot number is fixed in advance.Furthermore,the proposed algorithm is robust to noisy data and can handle with few data points.We illustrate with some examples and applications.