Search

This paper examines the application of a bootstrap test error estimation of radial basis functions, specifically thin-plate spline fitting, in surface smoothing. The presence of noisy data is a common issue of the point set model that is generated from 3D scanning devices, and hence, point set denoising is one of the main concerns in point set modelling. Bootstrap test error estimation, which is applied when searching for the smoothing parameters of radial basis functions, is revisited. The main contribution of this paper is a smoothing algorithm that relies on a bootstrap-based radial basis function. The proposed method incorporates a k-nearest neighbour search and then projects the point set to the approximated thin-plate spline surface. Therefore, the denoising process is achieved, and the features are well preserved. A comparison of the proposed method with other smoothing methods is also carried out in this study. [ABSTRACT FROM AUTHOR]

Let F be a compact set of a Banach space X. This paper analyzes the "generalized empirical interpolation method," which, given a function f ∊ F, builds an interpolant Jn[f] in an n dimensional subspace Xn ⊂ X with the knowledge of n outputs (σi(f))ni=1, where σi ∊ X' and X' is the dual space of X. The space Xn is built with a greedy algorithm that is adapted to F in the sense that it is generated by elements of F itself. The algorithm also selects the linear functionals (σi)ni=1 from a dictionary Σ ⊂ X'. In this paper, we study the interpolation error maxf∊F ‖f - Jn[f]‖X by comparing it with the best possible performance on an n dimensional space, i.e., the Kolmogorov n-width of F in X, dn(F,X). For polynomial or exponential decay rates of dn(F,X), we prove that the interpolation error has the same behavior modulo the norm of the interpolation operator. Sharper results are obtained in the case where X is a Hilbert space. [ABSTRACT FROM AUTHOR]

A typical interpolation strategy for line segments consists of a transition scheme, a Look-ahead ACC/DEC scheduling, and an interpolation algorithm. In these three parts, the main computation occurs in the first and second part. Some research work has been carried out to decrease the computation in the previous literatures, but these methods occupy a lot of computing resources for the optimization process during the calculation of transition curve parameters and feed rates. Consequently, the computational efficiency of interpolation strategy is greatly reduced. To deal with the issue, a real-time interpolation strategy is proposed in this paper. In the transition scheme, a Bézier curve is utilized to smooth the line segments. Based on the relationship among the approximation error, the approximation radius, and the transition curve, the curve can be directly generated when the approximation error is given. In the ACC/DEC scheduling, a 3-segment feed rate profile with jerk continuity is constructed. Meanwhile, a Look-ahead planning based on Backward Scanning and Forward Revision (BSFR) algorithm is utilized to eliminate redundant computation. Compared with Zhao’s and Shi’s strategy, the proposed strategy has the merits of C2 and G2 continuity for the tool path, jerk continuity for the tool movement, and distinguished real-time performance for interpolation. The experiments of 3D pentagram and 2D butterfly are carried out with different strategies and their results demonstrate that the interpolation efficiency can be greatly improved with the proposed strategy. [ABSTRACT FROM AUTHOR]

Sparse spectral clustering (SSC) has become one of the most popular clustering approaches in recent years. However, its high computational complexity prevents its application to large-scale datasets such as hyperspectral images (HSIs). In this paper, we propose two efficient approximate sparse spectral clustering methods for HSIs clustering in which clustering performance is improved by utilizing local information among the data. Firstly, we construct a smaller representative dataset on which sparse spectral clustering is performed. Then the labels of ground object are extending to whole dataset based on the local information according to two extending strategies. The first one is that the local interpolation is utilized to improve the extension of the clustering result. The other one is that the label extension is turned to a problem of subspace embedding, and is fulfilled by locally linear embedding (LLE). Several experiments on HSIs demonstrated that the proposed algorithms are effective for HSIs clustering. [ABSTRACT FROM AUTHOR]

Abstract: Morphing is an interpolation technique that changes one form into another through a seamless transition, producing, in the process, an infinite number of ‘intermediate’ forms between the original and the target. This paper examines the possibility of using the morphing technique for generating a large number of hull forms rapidly based on a number of target forms, existing or newly generated. The paper discusses the technique developed for applying morphing technique to hull form definition. The algorithm first projects the vertices of the original and target 3D surfaces onto 2D planes. After ‘regularising’ the vertices on 2D, they are projected back on the 3D surfaces. The corresponding vertices of the two surfaces are then used for interpolation. It has been found that the interpolated hull forms can be generated almost instantaneously, allowing the whole algorithm to be embedded in an optimisation program. [Copyright &y& Elsevier]

This paper presents an approach to the interpolation of angular feedrate for bi-parameter curve paths in multi-axis machining. A bi-parameter curve is the intersection of a parametric surface and an implicit surface. A tool path is identified by a position curve and an orientation curve, both of which are generated based on the bi-parameter curve. The angular feedrate interpolator calculates the tool position and orientation at each sampling cycle according to the specified angular feedrates and the given tool path. The paper analytically relates the angular arc-length derivatives to the time derivatives of the parameters along the path making use of both angular feedrates and angular feed acceleration. The results are then used to interpolate the parameters of the bi-parameter curve leading to an accurate calculation of the position and orientation of the cutting tool. A general parametric surface has been used to verify the effectiveness of the algorithm. The bi-parameter curves of the surface have been computed for arbitrarily selected intersecting cylinders. [Copyright &y& Elsevier]

This paper demonstrates the use of asynchronous maximum-likelihood (ML) detection to improve the detection performance of coded servo repeatable run out data. A suboptimal ML algorithm based on an absolute value metric is presented. This paper compares the performance of the ML algorithms with an asynchronous bit by bit (BBB) detection algorithm. Simulation results quantify the performance improvement over the BBB algorithm. A gain correction algorithm is also proposed to allow the asynchronous ML detection performance to be less sensitive to gain errors. The efficacy of the gain correction algorithm is quantified via simulations. [ABSTRACT FROM AUTHOR]

Abstract: In this paper we present a novel fast mesh parameterization algorithm based on subdivision scheme. First, an algorithm of approximating a given triangular mesh by the 4-point interpolatory subdivision is proposed, then a mesh parameterization method is developed based on the subdivision surface approximation algorithm. The novel mesh parameterization method is a generalization of the chordal parameterization to surface case, and it is more computationally efficient than previous methods because it obviates any computation of linear system of equations. Some numerical experiments show the efficiency of the novel algorithm. [Copyright &y& Elsevier]

This work aims to develop a new High Dimensional Model Representation (HDMR) based method which can construct an analytical structure for a given multivariate data modelling problem. Modelling multivariate data through a divide-and-conquer method stands for multivariate data partitioning process in which we deal with a number of less variate data sets instead of a single N dimensional problem. Generalized HDMR is one of these methods used to model a multivariate data set which has a number of scattered nodes with associated function values. However, Generalized HDMR includes a linear equation system with huge number of unknowns and equations to be solved. This equation sometimes has linearly dependent equations in it and this is an undesirable situation. This work offers a new method named Piecewise Generalized HDMR method which bypasses this disadvantage as well as reducing the mathematical complexity and CPU time needed to complete the algorithm of the previous method. Our new method splits the given problem domain into subdomains, applies the Generalized HDMR philosophy to each subdomain and superpositions the information coming from these subdomains. The algorithm of this new method and a number of numerical implementations are given in this paper. [ABSTRACT FROM AUTHOR]

Abstract: Weighted essentially non-oscillatory (WENO) schemes have been mainly used for solving hyperbolic partial differential equations (PDEs). Such schemes are capable of high order approximation in smooth regions and non-oscillatory sharp resolution of discontinuities. The base of the WENO schemes is a non-oscillatory WENO approximation procedure, which is not necessarily related to PDEs. The typical WENO procedures are WENO interpolation and WENO reconstruction. The WENO algorithm has gained much popularity but the basic idea of approximation did not change much over the years. In this paper, we first briefly review the idea of WENO interpolation and propose a modification of the basic algorithm. New approximation should improve basic characteristics of the approximation and provide a more flexible framework for future applications. New WENO procedure involves a binary tree weighted construction that is based on key ideas of WENO algorithm and we refer to it as the binary weighted essentially non-oscillatory (BWENO) approximation. New algorithm comes in a rational and a polynomial version. Furthermore, we describe the WENO reconstruction procedure, which is usually involved in the numerical schemes for hyperbolic PDEs, and propose the new reconstruction procedure based on the described BWENO interpolation. The obtained numerical results show that the newly proposed procedures perform very well on the considered test examples. [Copyright &y& Elsevier]

In this paper, we propose a new metal artifacts reduction algorithm based on fractional-order total-variation sinogram inpainting model for X-ray computed tomography (CT). The numerical algorithm for our fractional-order framework is also analyzed. Simulations show that, both quantitatively and qualitatively, our method is superior to conditional interpolation methods and the classic integral-order total variation model. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we present an new approach to construct the so-called shape preserving interpolation curves. The basic idea is first to approximate the set of interpolated points with a class of MQ quasi-interpolation operators and then pass through the set with the use of multivariate interpolation by using compactly supported radial basis functions. This approach possesses the advantages of certain shape preserving and good approximation behaviors. The proposed algorithm is easy to implement. [Copyright &y& Elsevier]

Abstract: This paper presents a high-accuracy method for fine registration of two partially overlapping point clouds that have been coarsely registered. The proposed algorithm, which is named dual interpolating point-to-surface method, is principally a modified variant of point-to-surface Iterative Closest Point (ICP) algorithm. The original correspondences are established by adopting a dual surface fitting approach using B-spline interpolation. A novel auxiliary pair constraint based on the surface fitting approach, together with surface curvature information, is employed to remove unreliable point matches. The combined constraint directly utilizes global rigid motion consistency in conjunction with local geometric invariant to reject false correspondences precisely and efficiently. The experimental results involving a number of realistic point clouds demonstrate that the new method can obtain accurate and robust fine registration for pairwise 3D point clouds. This method addresses highest accuracy alignment with less focus on recovery from poor coarse registrations. [Copyright &y& Elsevier]

Incident Photosynthetically Active Radiation (PAR) is a critical parameter for modelling ecosystem productivity. An algorithm for estimating instantaneous PAR from Moderate Resolution Imaging Spectroradiometer (MODIS) data was developed earlier; however, daily-integrated PAR is more meaningful than instantaneous PAR in many cases because many land surface models require a daily or coarser temporal resolution. This paper compares two different algorithms (adjusted sinusoidal interpolation and look-up table) for estimating daily-integrated PAR from instantaneous PAR values. Statistical analysis of the validation results indicates that the look-up table method more accurately estimates daily-integrated PAR than the use of adjusted sinusoidal interpolation. We also investigated how window size, daytime length and the number of overpass counts per day affect bias and the relative error of estimation. Validation using field measurements, and comparison with the Geostationary Operational Environmental Satellites PAR product, demonstrates that data collected by MODIS can be used to provide reliable estimates of daily-integrated PAR. [ABSTRACT FROM AUTHOR]

Abstract: This paper is devoted to construction interpolatory multiscaling functions with a general dilation factor . We first show two-scale matrix symbol associated with interpolatory multiscaling functions is reduced to a special form. Also, a characterization on approximation order for the multiscaling functions is described in terms of elements of this special two-scale matrix symbol. Then, an algorithm is provided for constructing compactly supported interpolating multiscaling functions with dilation factor and higher approximation order. Finally, the associated several families examples with one-parameter or two-parameters are explicitly presented. The optimal parameter values which make multiscaling functions provide the highest regularity are also computed. [Copyright &y& Elsevier]

In this paper, a motion-compensated de-interlacing algorithm using the Markov random field (MRF) model is proposed. The de-interlacing problem is formulated as a maximum a posteriori (MAP) MRF problem. The MAP solution is the one that minimizes an energy function, which imposes discontinuity-adaptive smoothness (DAS) spatial constraint on the de-interlaced frame. The edge direction information, which is used to formulate the DAS constraint, is implicitly indicated by weight vectors (weights for 16 digitized directions). Generally, large weights are assigned to along-edge directions and relatively small weights are assigned to across-edge directions. As a local statistical-based method, the proposed weighting method should be more robust than traditional edge-directed interpolation methods in deciding local edge directions. The proposed algorithm is implemented by an iterative optimization process, which guarantees convergence. However, a global optimal solution is not guaranteed due to computational complexity concern. Simulation results compare the proposed algorithm to other motion compensated de-interlacing algorithms. Significant improvements of de-interlaced edges are observed. [ABSTRACT FROM AUTHOR]

The Digital Elevation Model that has been derived from the February 2000 Shuttle Radar Topography Mission (SRTM) has been one of the most important publicly available new spatial data sets in recent years. However, the 'finished' grade version of the data (also referred to as Version 2) still contains data voids (some 836,000 km2) - and other anomalies - that prevent immediate use in many applications. These voids can be filled using a range of interpolation algorithms in conjunction with other sources of elevation data, but there is little guidance on the most appropriate void-filling method. This paper describes: (i) a method to fill voids using a variety of interpolators, (ii) a method to determine the most appropriate void-filling algorithms using a classification of the voids based on their size and a typology of their surrounding terrain; and (iii) the classification of the most appropriate algorithm for each of the 3,339,913 voids in the SRTM data. Based on a sample of 1304 artificial but realistic voids across six terrain types and eight void size classes, we found that the choice of void-filling algorithm is dependent on both the size and terrain type of the void. Contrary to some previous findings, the best methods can be generalised as: kriging or inverse distance weighting interpolation for small and medium size voids in relatively flat low-lying areas; spline interpolation for small and medium-sized voids in high-altitude and dissected terrain; triangular irregular network or inverse distance weighting interpolation for large voids in very flat areas, and an advanced spline method (ANUDEM) for large voids in other terrains. [ABSTRACT FROM AUTHOR]

In this paper, we present a new approach of-spline curve fitting to a set of ordered points, which is motivated by an insight that properly selected points called dominant points can play an important role in producing better curve approximation. The proposed approach takes four main steps: parameterization, dominant point selection, knot placement, and least-squares minimization. The approach is substantially different from the conventional approaches in knot placement and dominant point selection. In the knot placement, the knots are determined by averaging the parameter values of the dominant points, which basically transforms-spline curve fitting into the problem of dominant point selection. We describe the properties of the knot placement including the property of local modification useful for adaptive curve refinement. We also present an algorithm for dominant point selection based on the adaptive refinement paradigm. The approach adaptively refines a-spline curve by selecting fewer dominant points at flat regions but more at complex regions. For the same number of control points, the proposed approach can generate a-spline curve with less deviation than the conventional approaches. When adopted in error-bounded curve approximation, it can generate a-spline curve with far fewer control points while satisfying the desired shape fidelity. Some experimental results demonstrate its usefulness and quality. [Copyright &y& Elsevier]

Character skeleton plays a significant role in character recognition. The strokes of a character may consist of two regions, i.e., singular and regular regions. The intersections and junctions of the strokes belong to singular region, while the straight and smooth parts of the strokes are categorized to regular region. Therefore, a skeletonization method requires two different processes to treat the skeletons in theses two different regions. All traditional skeletonization algorithms are based on the symmetry analysis technique. The major problems of these methods are as follows. 1) The computation of the primary skeleton in the regular region is indirect, so that its implementation is sophisticated and costly. 2) The extracted skeleton cannot be exactly located on the central line of the stroke. 3) The captured skeleton in the singular region may be distorted by artifacts and branches. To overcome these problems, a novel scheme of extracting the skeleton of character based on wavelet transform is presented in this paper. This scheme consists of two main steps, namely: a) extraction of primary skeleton in the regular region and b) amendment processing of the primary skeletons and connection of them in the singular region. A direct technique is used in the first step, where a new wavelet-based symmetry analysis is developed for finding the central line of the stroke directly. A novel method called smooth interpolation is designed in the second step, where a smooth operation is applied to the primary skeleton, and, thereafter, the interpolation compensation technique is proposed to link the primary skeleton, so that the skeleton in the singular region can be produced. Experiments are conducted and positive results are achieved, which show that the proposed skeletonization scheme is applicable to not only binary image but also gray-level image, and the skeleton is robust against noise and affine transform. [ABSTRACT FROM AUTHOR]

There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximation is provided for the case in which the Hessian matrix is diagonal and positive definite. To deal with the general case where the Hessian is not diagonal, a new efficient projected gradient algorithm is proposed. The basic features of the projected gradient algorithm are: 1) a new formula is used for the stepsize; 2) a recently-established adaptive non-monotone line search is incorporated; and 3) the optimal stepsize is determined by quadratic interpolation if the non-monotone line search criterion fails to be satisfied. Numerical experiments on large-scale random test problems and some medium-scale quadratic programs arising in the training of Support Vector Machines demonstrate the usefulness of these algorithms. [ABSTRACT FROM AUTHOR]

This paper deals with the real-time NURBS interpolation method in which the interpolation error between the ideal curve and the interpolated curve is compensated within the machine basic length unit (BLU). Parametric curve interpolation methods are based on the Taylor series expansion of curve parameters and an approximation. This approach enables effective feed command generation following the target curve. However, the interpolation error caused by the curve segmentation cannot be controlled. In this research, a two-stage interpolation method that compensates for interpolation errors within machine BLU is proposed. The interpolation result was filtered by an acceleration/jerk limitation equation. Through this two-stage interpolation, both the interpolation error condition and the motion dynamics can be satisfied. Using computer simulations in which interpolation results are revaluated by a numerical iteration method, it is shown that the two-stage interpolation algorithm can interpolate target curves precisely with geometric and dynamic contentment. The proposed algorithm was implemented in the CNC simulator system and an experimental run was conducted to identify the real-time adaptation. [ABSTRACT FROM AUTHOR]

This paper presents an algorithm to design jointly interpolation filters and decision feedback equalizers in the sense of minimum mean-square error such that the joint capacity which is neglected in conventional design is explored to improve the receiver performance. The algorithm comprises an iteration of two alternating simple quadratic minimizing operations and ensures convergence. A simulation example for the raised-cosine channel demonstrates that via this approach an improvement over the conventional design can be achieved. [ABSTRACT FROM AUTHOR]

In this paper, a rational interpolation approach is used to approximate the transfer function of passive systems characterized by sampled data. Orthogonal polynomials are used to improve the numerical stability of the ill-conditioned Vandermonde-like interpolation matrix associated with the ordinary power series. First, the poles of the system are obtained by efficiently and accurately transforming the coefficients of the orthogonal polynomials to the ordinary power series using Clenshaw's recurrence algorithm. Then, the residues are solved in real or in complex conjugate pairs to insure a physically realizable system. Finally, the passivity of the system is enforced by applying certain constraints on the poles and residues of the system. The performances of the three most common orthogonal polynomials, Legends and Chebyshev of the first and second kinds, are also compared to that of the power series. [ABSTRACT FROM AUTHOR]

In this paper we study a variational approach for filling in regions of missing data in two-dimensionaland three-dimensionaldigitalimages. Applications of this technique include the restoration of old photographs and removal of superimposed text like dates, subtitles, or publicity, or the zooming of images. The approach presented here, initially introduced in [IEEE Trans. Image Pr cess.,10 (2001), pp. 1200-1211] is based on a joint interpolation of the image gray levels and gradient/isophotes directions, smoothly extending the isophote lines into the holes of missing data. The process underlying this approach can be considered as an interpretation of the Gestaltist's principle of good continuation. We study the existence of minimizers of our functional and its approximation by minima of smoother functionals. Then we present the numerical algorithm used to minimize it and display some numerical experiments. [ABSTRACT FROM AUTHOR]

In this paper we consider a method of adapting Dubuc -Deslauriers subdivision, which is defined for bi-infinite sequences, to accommodate sequences of finite length. After deriving certain useful properties of the Dubuc -Deslauriers refinable function on R, we define a multiscale finite sequence of functions on a bounded interval, which are then proved to be refinable. Using this fact, the resulting adapted interpolatory subdivision scheme for finite sequences is then shown to be convergent. Corresponding interpolation wavelets on an interval are defined, and explicit formulations of the resulting decomposition and reconstruction algorithms are calculated. Finally, we give two numerical examples on signature smoothing and two-dimensional feature extraction of the subdivision and wavelet algorithms. [ABSTRACT FROM AUTHOR]