This document summarizes a research article about developing a rational cubic spline function to preserve the convex shape of data during visualization. The authors construct a rational cubic function with three free parameters, where one parameter is constrained to preserve convexity, while the other two are left free for the user to modify the curve. Sufficient constraints are derived on the constrained parameter to guarantee convexity. The error of the rational cubic interpolant is analyzed and shown to be O(h^3). The proposed method is compared to previous work, demonstrating advantages such as flexibility, simplicity, smoothness, and good error bounds.
Fault diagnosis using genetic algorithms and principal curveseSAT Journals
Abstract Several applications of nonlinear principal component analysis (NPCA) have appeared recently in process monitoring and fault diagnosis. In this paper a new approach is proposed for fault detection based on principal curves and genetic algorithms. The principal curve is a generation of linear principal component (PCA) introduced by Hastie as a parametric curve passes satisfactorily through the middle of data. The existing principal curves algorithms employ the first component of the data as an initial estimation of principal curve. However the dependence on initial line leads to a lack of flexibility and the final curve is only satisfactory for specific problems. In this paper we extend this work in two ways. First, we propose a new method based on genetic algorithms to find the principal curve. Here, lines are fitted and connected to form polygonal lines (PL). Second, potential application of principal curves is discussed. An example is used to illustrate fault diagnosis of nonlinear process using the proposed approach. Index Terms: Principal curve, Genetic Algorithm, Nonlinear principal component analysis, Fault detection.
Shape Preserving Interpolation Using C2 Rational Cubic SplineAdarshaDhakal
Linear interpolation, cubic interpolation, rational cubic spline with positivity, monotony and convexity preserving technique and shape preserving interpolation.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
This document discusses stiffness analysis of flexible parallel manipulators. It presents the forward kinematics analysis of a 3-RRR planar parallel manipulator using genetic algorithms and neural networks to minimize positional errors. The Jacobian and platform stiffness matrices are evaluated within the defined workspace. A pseudo-rigid body model with frame and plate elements is used to analyze the flexible link configuration and compliant joints. Stiffness indices are obtained and validated using commercial finite element software. The methodology is illustrated for a 3-RRR flexible parallel manipulator to study the effects of link flexibility and joint compliance on stiffness.
Study on Reconstruction Accuracy using shapiness index of morphological trans...ijcseit
Basin, lakes, and pore-grain space are important geophysical shapes, which can fit with the several
classical and fractal binary shapes, are processed by employing morphological transformations, and
methods. The decomposition of skeleton network (minimum morphological information) using various
classical structures like square, octagon and rhombus. Then derive the dilated subsets respective degree by
the structures for reconstruct the original image. Through shapiness index of pattern spectrum procedure,
we try test the reconstruction accuracy in a quantitative manner. It gives some general procedure to
characterise the shape-size complexity of surface water body. The reconstruction accuracy is against the
size of water bodies with which we produce the some example of different shapiness index for different
structuring element of shapes. In which quantitative manner approach yields better reconstruction level.
The complexity of water bodies are compared with the surfaces.
A Survey Of Deformable Modeling In Computer GraphicsMartha Brown
This document summarizes research on deformable modeling techniques in computer graphics. It organizes the diverse research approaches by technique rather than application. The summary focuses on physically-based approaches including mass-spring models, finite element models, and continuum models. Mass-spring models represent objects as connected point masses and springs and have been widely used for facial animation. Finite element models offer the greatest accuracy but have seen limited use in computer graphics.
Clustering using kernel entropy principal component analysis and variable ker...IJECEIAES
Clustering as unsupervised learning method is the mission of dividing data objects into clusters with common characteristics. In the present paper, we introduce an enhanced technique of the existing EPCA data transformation method. Incorporating the kernel function into the EPCA, the input space can be mapped implicitly into a high-dimensional of feature space. Then, the Shannon’s entropy estimated via the inertia provided by the contribution of every mapped object in data is the key measure to determine the optimal extracted features space. Our proposed method performs very well the clustering algorithm of the fast search of clusters’ centers based on the local densities’ computing. Experimental results disclose that the approach is feasible and efficient on the performance query.
A Weighted Duality based Formulation of MIMO SystemsIJERA Editor
This work is based on the modeling and analysis of multiple-input multiple-output (MIMO) system in downlink communication system. We take into account a recent work on the ratio of quadratic forms to formulate the weight matrices of quadratic norm in a duality structure. This enables us to achieve exact solutions for MIMO system operating under Rayleigh fading channels. We outline couple of scenarios dependent on the structure of eigenvalues to investigate the system behavior. The results obtained are validated by means of Monte Carlo simulations.
Fault diagnosis using genetic algorithms and principal curveseSAT Journals
Abstract Several applications of nonlinear principal component analysis (NPCA) have appeared recently in process monitoring and fault diagnosis. In this paper a new approach is proposed for fault detection based on principal curves and genetic algorithms. The principal curve is a generation of linear principal component (PCA) introduced by Hastie as a parametric curve passes satisfactorily through the middle of data. The existing principal curves algorithms employ the first component of the data as an initial estimation of principal curve. However the dependence on initial line leads to a lack of flexibility and the final curve is only satisfactory for specific problems. In this paper we extend this work in two ways. First, we propose a new method based on genetic algorithms to find the principal curve. Here, lines are fitted and connected to form polygonal lines (PL). Second, potential application of principal curves is discussed. An example is used to illustrate fault diagnosis of nonlinear process using the proposed approach. Index Terms: Principal curve, Genetic Algorithm, Nonlinear principal component analysis, Fault detection.
Shape Preserving Interpolation Using C2 Rational Cubic SplineAdarshaDhakal
Linear interpolation, cubic interpolation, rational cubic spline with positivity, monotony and convexity preserving technique and shape preserving interpolation.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
This document discusses stiffness analysis of flexible parallel manipulators. It presents the forward kinematics analysis of a 3-RRR planar parallel manipulator using genetic algorithms and neural networks to minimize positional errors. The Jacobian and platform stiffness matrices are evaluated within the defined workspace. A pseudo-rigid body model with frame and plate elements is used to analyze the flexible link configuration and compliant joints. Stiffness indices are obtained and validated using commercial finite element software. The methodology is illustrated for a 3-RRR flexible parallel manipulator to study the effects of link flexibility and joint compliance on stiffness.
Study on Reconstruction Accuracy using shapiness index of morphological trans...ijcseit
Basin, lakes, and pore-grain space are important geophysical shapes, which can fit with the several
classical and fractal binary shapes, are processed by employing morphological transformations, and
methods. The decomposition of skeleton network (minimum morphological information) using various
classical structures like square, octagon and rhombus. Then derive the dilated subsets respective degree by
the structures for reconstruct the original image. Through shapiness index of pattern spectrum procedure,
we try test the reconstruction accuracy in a quantitative manner. It gives some general procedure to
characterise the shape-size complexity of surface water body. The reconstruction accuracy is against the
size of water bodies with which we produce the some example of different shapiness index for different
structuring element of shapes. In which quantitative manner approach yields better reconstruction level.
The complexity of water bodies are compared with the surfaces.
A Survey Of Deformable Modeling In Computer GraphicsMartha Brown
This document summarizes research on deformable modeling techniques in computer graphics. It organizes the diverse research approaches by technique rather than application. The summary focuses on physically-based approaches including mass-spring models, finite element models, and continuum models. Mass-spring models represent objects as connected point masses and springs and have been widely used for facial animation. Finite element models offer the greatest accuracy but have seen limited use in computer graphics.
Clustering using kernel entropy principal component analysis and variable ker...IJECEIAES
Clustering as unsupervised learning method is the mission of dividing data objects into clusters with common characteristics. In the present paper, we introduce an enhanced technique of the existing EPCA data transformation method. Incorporating the kernel function into the EPCA, the input space can be mapped implicitly into a high-dimensional of feature space. Then, the Shannon’s entropy estimated via the inertia provided by the contribution of every mapped object in data is the key measure to determine the optimal extracted features space. Our proposed method performs very well the clustering algorithm of the fast search of clusters’ centers based on the local densities’ computing. Experimental results disclose that the approach is feasible and efficient on the performance query.
A Weighted Duality based Formulation of MIMO SystemsIJERA Editor
This work is based on the modeling and analysis of multiple-input multiple-output (MIMO) system in downlink communication system. We take into account a recent work on the ratio of quadratic forms to formulate the weight matrices of quadratic norm in a duality structure. This enables us to achieve exact solutions for MIMO system operating under Rayleigh fading channels. We outline couple of scenarios dependent on the structure of eigenvalues to investigate the system behavior. The results obtained are validated by means of Monte Carlo simulations.
This document discusses different ways to mathematically represent curves, including polynomial representations and parametric forms. It focuses on cubic polynomials and parametric representations, explaining that parametric form solves problems with explicit and implicit forms by allowing representation of curves with infinite slopes or multiple y-values for a given x-value. Parametric form also makes it easier to combine curve segments continuously. The document then discusses spline curves, which use piecewise cubic polynomial functions to fit smooth curves through points, and cubic splines specifically, providing the equations used to define cubic splines.
A MORPHOLOGICAL MULTIPHASE ACTIVE CONTOUR FOR VASCULAR SEGMENTATIONijbbjournal
This paper presents a morphological active contour ideal for vascular segmentation in biomedical images.
The unenhanced images of vessels and background are successfully segmented using a two-step
morphological active contour based upon Chan and Vese’s Active Contour without Edges. Using dilation
and erosion as an approximation of curve evolution, the contour provides an efficient, simple, and robust
alternative to solving partial differential equations used by traditional level-set Active Contour models. The
proposed method is demonstrated with segmented data set images and compared to results garnered from
multiphase Active Contour without Edges, morphological watershed, and Fuzzy C-means segmentations.
Energy Efficient Modeling of Wireless Sensor Networks using Random Graph Theoryidescitation
This paper deals with the discussion of an innovative and a design for the
efficient power management and power failure diagnosis in the area of wireless sensors
networks. A Wireless Network consists of a web of networks where hundreds of pairs are
connected to each other wirelessly. A critical issue in the wireless sensor networks in the
present scenario is the limited availability of energy within network nodes. Therefore,
making good use of energy is necessary in modeling a sensor network. In this paper we have
tried to propose a new model of wireless sensors networks on a three-dimensional plane
using the percolation model, a kind of random graph in which edges are formed between the
neighbouring nodes. An algorithm has been described in which the power failure diagnosis
is made and solved. The concepts of Electromagnetics, Wave Duality, Energy model of an
atom is linked with wireless networks. A model is prepared in which the positioning of
nodes of sensors are decided. Also the model is made more efficient regarding the energy
consumption, power delivery etc. using the concepts of graph theory concepts, probability
distribution.
Here in this presentation we will be getting to know about Implicit Interpolation Analytical Curves related to Manufacturing and Designing, Design criteria, we'll be going through interpolating Curves and Equations, interpolating Matrices and Blending Functions
Data models are a set of rules and/or constructs used to describe and represent aspects of the real world in a computer. GIS can handle four data models for various applications. This module explains those four.
A NEW METHOD OF CENTRAL DIFFERENCE INTERPOLATIONmathsjournal
In Numerical analysis, interpolation is a manner of calculating the unknown values of a function for any conferred value of argument within the limit of the arguments. It provides basically a concept of estimating unknown data with the aid of relating acquainted data. The main goal of this research is to constitute a central difference interpolation method which is derived from the combination of Gauss’s third formula, Gauss’s Backward formula and Gauss’s forward formula. We have also demonstrated the graphical presentations as well as comparison through all the existing interpolation formulas with our propound method of central difference interpolation. By the comparison and graphical presentation, the new method gives the best result with the lowest error from another existing interpolationformula.
A NEW METHOD OF CENTRAL DIFFERENCE INTERPOLATIONmathsjournal
In Numerical analysis, interpolation is a manner of calculating the unknown values of a function for any
conferred value of argument within the limit of the arguments. It provides basically a concept of
estimating unknown data with the aid of relating acquainted data. The main goal of this research is to
constitute a central difference interpolation method which is derived from the combination of Gauss’s
third formula, Gauss’s Backward formula and Gauss’s forward formula. We have also demonstrated the
graphical presentations as well as comparison through all the existing interpolation formulas with our
propound method of central difference interpolation. By the comparison and graphical presentation, the
new method gives the best result with the lowest error from another existing interpolationformula.
A NEW METHOD OF CENTRAL DIFFERENCE INTERPOLATIONmathsjournal
The document presents a new method of central difference interpolation that is derived from Gauss's third formula and another existing formula. It compares the new method to other common interpolation formulas through two example problems. For both examples, the new method is shown to provide results that are very close to the exact values and have lower error than the other existing interpolation formulas.
A NEW METHOD OF CENTRAL DIFFERENCE INTERPOLATIONmathsjournal
The document presents a new method of central difference interpolation that is derived from Gauss's third formula and another existing formula. It compares the new method to other common interpolation formulas through two example problems. For both examples, the new method is shown to provide results that are very close to the exact values and have lower error than the other existing interpolation formulas.
This document summarizes research on using particle swarm optimization to reconstruct microwave images of two-dimensional dielectric scatterers. It formulates the inverse scattering problem as an optimization problem to find the dielectric parameter distribution that minimizes the difference between measured and simulated scattered field data. Numerical results show that a particle swarm optimization approach can accurately reconstruct the shape and dielectric properties of a test cylindrical scatterer, with lower background reconstruction error than a genetic algorithm approach. The research demonstrates that particle swarm optimization is a suitable technique for high-dimensional microwave imaging problems.
2D Shape Reconstruction Based on Combined Skeleton-Boundary FeaturesCSCJournals
This paper proposes a new method for 2D shape reconstruction based on combining skeleton and boundary features. The method aims to mimic human perceptual processes by using both curvature properties of the shape boundary and structural properties of the shape skeleton. Junction points on the skeleton are used to identify likely protrusions, while boundary features like curvature, length and width are used to determine the strength of protrusions. Experiments show the reconstructed shapes match human perceptual judgments better than existing methods. The approach gives a stable reconstruction and is robust to noise.
CONCURRENT TERNARY GALOIS-BASED COMPUTATION USING NANO-APEX MULTIPLEXING NIBS...VLSICS Design
Novel layout realizations for congestion-free three-dimensional lattice networks using the corresponding
carbon-based field emission controlled switching is introduced in this article. The developed nano-based
implementations are performed in three dimensions to perform the required concurrent computations for
which two-dimensional implementations are a special case. The introduced realizations for congestion-free
concurrent computations utilize the field-emission controlled switching devices that were presented in the
first and second parts of the article for the solution of synthesis congestion and by utilizing field-emission
from carbon nanotubes and nanotips. Since the concept of symmetry indices has been related to regular
logic design, a more general method called Iterative Symmetry Indices Decomposition that produces
regular three-dimensional lattice networks via carbon field-emission multiplexing is presented, where one
obtains multi-stage decompositions whenever volume-specific layout constraints have to be satisfied. The
introduced congestion-free nano-based lattice computations form new and important paths in regular
lattice realizations, where applications include low-power IC design for the control of autonomous robots
and for signal processing implementations.
A HYBRID MORPHOLOGICAL ACTIVE CONTOUR FOR NATURAL IMAGESIJCSEA Journal
Morphological active contours for image segmentation have become popular due to their low
computational complexity coupled with their accurate approximation of the partial differential equations
involved in the energy minimization of the segmentation process. In this paper, a morphological active
contour which mimics the energy minimization of the popular Chan-Vese Active Contour without Edges is
coupled with a morphological edge-driven segmentation term to accurately segment natural images. By
using morphological approximations of the energy minimization steps, the algorithm has a low
computational complexity. Additionally, the coupling of the edge-based and region-based segmentation
techniques allows the proposed method to be robust and accurate. We will demonstrate the accuracy and
robustness of the algorithm using images from the Weizmann Segmentation Evaluation Database and
report on the segmentation results using the Sorensen-Dice similarity coefficient
A HYBRID MORPHOLOGICAL ACTIVE CONTOUR FOR NATURAL IMAGESIJCSEA Journal
Morphological active contours for image segmentation have become popular due to their low computational complexity coupled with their accurate approximation of the partial differential equations involved in the energy minimization of the segmentation process. In this paper, a morphological active contour which mimics the energy minimization of the popular Chan-Vese Active Contour without Edges is coupled with a morphological edge-driven segmentation term to accurately segment natural images. By using morphological approximations of the energy minimization steps, the algorithm has a low computational complexity. Additionally, the coupling of the edge-based and region-based segmentation techniques allows the proposed method to be robust and accurate. We will demonstrate the accuracy and robustness of the algorithm using images from the Weizmann Segmentation Evaluation Database and report on the segmentation results using the Sorensen-Dice similarity coefficient.
A HYBRID MORPHOLOGICAL ACTIVE CONTOUR FOR NATURAL IMAGESIJCSEA Journal
Morphological active contours for image segmentation have become popular due to their low computational complexity coupled with their accurate approximation of the partial differential equations
involved in the energy minimization of the segmentation process. In this paper, a morphological active contour which mimics the energy minimization of the popular Chan-Vese Active Contour without Edges is coupled with a morphological edge-driven segmentation term to accurately segment natural images. By using morphological approximations of the energy minimization steps, the algorithm has a low computational complexity. Additionally, the coupling of the edge-based and region-based segmentation techniques allows the proposed method to be robust and accurate. We will demonstrate the accuracy and robustness of the algorithm using images from the Weizmann Segmentation Evaluation Database and report on the segmentation results using the Sorensen-Dice similarity coefficient.
The step construction of penalized spline in electrical power load dataTELKOMNIKA JOURNAL
Electricity is one of the most pressing needs for human life. Electricity is required not only for lighting but also to carry out activities of daily life related to activities Social and economic community. The problems is currently a limited supply of electricity resulting in an energy crisis. Electrical power is not storable therefore it is a vital need to make a good electricity demand forecast. According to this, we conducted an analysis based on power load. Given a baseline to this research, we applied penalized splines (P-splines) which led to a powerful and applicable smoothing technique. In this paper, we revealed penalized spline degree 1 (linear) with 8 knots is the best model since it has the lowest GCV (Generelized Cross Validation). This model have become a compelling model to predict electric power load evidenced by of Mean Absolute Percentage Error (MAPE=0.013) less than 10%.
RADIAL BASIS FUNCTION PROCESS NEURAL NETWORK TRAINING BASED ON GENERALIZED FR...cseij
For learning problem of Radial Basis Function Process Neural Network (RBF-PNN), an optimization
training method based on GA combined with SA is proposed in this paper. Through building generalized
Fréchet distance to measure similarity between time-varying function samples, the learning problem of
radial basis centre functions and connection weights is converted into the training on corresponding
discrete sequence coefficients. Network training objective function is constructed according to the least
square error criterion, and global optimization solving of network parameters is implemented in feasible
solution space by use of global optimization feature of GA and probabilistic jumping property of SA . The
experiment results illustrate that the training algorithm improves the network training efficiency and
stability.
AN EFFICIENT LINE CLIPPING ALGORITHM FOR CIRCULAR WINDOWS USING VECTOR CALCUL...ijcga
With the advent of digitization and growing abundance of graphic and image processing tools, use cases
for clipping using circular windows have grown considerably. This paper presents an efficient clipping
algorithm for line segments using geometrical features of circle and vector calculus. Building upon the
research with rectangular windows, this method is proposed with the belief that computations are more
expensive (heavy) than other computations. Execution time can be drastically improved if we replace
expensive computations with cheaper computations. The cheaper computations can be computed even more
efficiently using parallelization thus improving time complexity.
An Efficient Line Clipping Algorithm for Circular Windows Using Vector Calcul...ijcga
With the advent of digitization and growing abundance of graphic and image processing tools, use cases for clipping using circular windows have grown considerably. This paper presents an efficient clipping algorithm for line segments using geometrical features of circle and vector calculus. Building upon the research with rectangular windows, this method is proposed with the belief that computations are more expensive (heavy) than other computations. Execution time can be drastically improved if we replace expensive computations with cheaper computations. The cheaper computations can be computed even more efficiently using parallelization thus improving time complexity.
AN EFFICIENT LINE CLIPPING ALGORITHM FOR CIRCULAR WINDOWS USING VECTOR CALCUL...ijcga
With the advent of digitization and growing abundance of graphic and image processing tools, use cases
for clipping using circular windows have grown considerably. This paper presents an efficient clipping
algorithm for line segments using geometrical features of circle and vector calculus. Building upon the
research with rectangular windows, this method is proposed with the belief that computations are more
expensive (heavy) than other computations. Execution time can be drastically improved if we replace
expensive computations with cheaper computations. The cheaper computations can be computed even more
efficiently using parallelization thus improving time complexity.
Cleades Robinson, a respected leader in Philadelphia's police force, is known for his diplomatic and tactful approach, fostering a strong community rapport.
UnityNet World Environment Day Abraham Project 2024 Press ReleaseLHelferty
June 12, 2024 UnityNet International (#UNI) World Environment Day Abraham Project 2024 Press Release from Markham / Mississauga, Ontario in the, Greater Tkaronto Bioregion, Canada in the North American Great Lakes Watersheds of North America (Turtle Island).
More Related Content
Similar to local-convexity-shape-preserving-data-visualization-by-spline-function.pdf
This document discusses different ways to mathematically represent curves, including polynomial representations and parametric forms. It focuses on cubic polynomials and parametric representations, explaining that parametric form solves problems with explicit and implicit forms by allowing representation of curves with infinite slopes or multiple y-values for a given x-value. Parametric form also makes it easier to combine curve segments continuously. The document then discusses spline curves, which use piecewise cubic polynomial functions to fit smooth curves through points, and cubic splines specifically, providing the equations used to define cubic splines.
A MORPHOLOGICAL MULTIPHASE ACTIVE CONTOUR FOR VASCULAR SEGMENTATIONijbbjournal
This paper presents a morphological active contour ideal for vascular segmentation in biomedical images.
The unenhanced images of vessels and background are successfully segmented using a two-step
morphological active contour based upon Chan and Vese’s Active Contour without Edges. Using dilation
and erosion as an approximation of curve evolution, the contour provides an efficient, simple, and robust
alternative to solving partial differential equations used by traditional level-set Active Contour models. The
proposed method is demonstrated with segmented data set images and compared to results garnered from
multiphase Active Contour without Edges, morphological watershed, and Fuzzy C-means segmentations.
Energy Efficient Modeling of Wireless Sensor Networks using Random Graph Theoryidescitation
This paper deals with the discussion of an innovative and a design for the
efficient power management and power failure diagnosis in the area of wireless sensors
networks. A Wireless Network consists of a web of networks where hundreds of pairs are
connected to each other wirelessly. A critical issue in the wireless sensor networks in the
present scenario is the limited availability of energy within network nodes. Therefore,
making good use of energy is necessary in modeling a sensor network. In this paper we have
tried to propose a new model of wireless sensors networks on a three-dimensional plane
using the percolation model, a kind of random graph in which edges are formed between the
neighbouring nodes. An algorithm has been described in which the power failure diagnosis
is made and solved. The concepts of Electromagnetics, Wave Duality, Energy model of an
atom is linked with wireless networks. A model is prepared in which the positioning of
nodes of sensors are decided. Also the model is made more efficient regarding the energy
consumption, power delivery etc. using the concepts of graph theory concepts, probability
distribution.
Here in this presentation we will be getting to know about Implicit Interpolation Analytical Curves related to Manufacturing and Designing, Design criteria, we'll be going through interpolating Curves and Equations, interpolating Matrices and Blending Functions
Data models are a set of rules and/or constructs used to describe and represent aspects of the real world in a computer. GIS can handle four data models for various applications. This module explains those four.
A NEW METHOD OF CENTRAL DIFFERENCE INTERPOLATIONmathsjournal
In Numerical analysis, interpolation is a manner of calculating the unknown values of a function for any conferred value of argument within the limit of the arguments. It provides basically a concept of estimating unknown data with the aid of relating acquainted data. The main goal of this research is to constitute a central difference interpolation method which is derived from the combination of Gauss’s third formula, Gauss’s Backward formula and Gauss’s forward formula. We have also demonstrated the graphical presentations as well as comparison through all the existing interpolation formulas with our propound method of central difference interpolation. By the comparison and graphical presentation, the new method gives the best result with the lowest error from another existing interpolationformula.
A NEW METHOD OF CENTRAL DIFFERENCE INTERPOLATIONmathsjournal
In Numerical analysis, interpolation is a manner of calculating the unknown values of a function for any
conferred value of argument within the limit of the arguments. It provides basically a concept of
estimating unknown data with the aid of relating acquainted data. The main goal of this research is to
constitute a central difference interpolation method which is derived from the combination of Gauss’s
third formula, Gauss’s Backward formula and Gauss’s forward formula. We have also demonstrated the
graphical presentations as well as comparison through all the existing interpolation formulas with our
propound method of central difference interpolation. By the comparison and graphical presentation, the
new method gives the best result with the lowest error from another existing interpolationformula.
A NEW METHOD OF CENTRAL DIFFERENCE INTERPOLATIONmathsjournal
The document presents a new method of central difference interpolation that is derived from Gauss's third formula and another existing formula. It compares the new method to other common interpolation formulas through two example problems. For both examples, the new method is shown to provide results that are very close to the exact values and have lower error than the other existing interpolation formulas.
A NEW METHOD OF CENTRAL DIFFERENCE INTERPOLATIONmathsjournal
The document presents a new method of central difference interpolation that is derived from Gauss's third formula and another existing formula. It compares the new method to other common interpolation formulas through two example problems. For both examples, the new method is shown to provide results that are very close to the exact values and have lower error than the other existing interpolation formulas.
This document summarizes research on using particle swarm optimization to reconstruct microwave images of two-dimensional dielectric scatterers. It formulates the inverse scattering problem as an optimization problem to find the dielectric parameter distribution that minimizes the difference between measured and simulated scattered field data. Numerical results show that a particle swarm optimization approach can accurately reconstruct the shape and dielectric properties of a test cylindrical scatterer, with lower background reconstruction error than a genetic algorithm approach. The research demonstrates that particle swarm optimization is a suitable technique for high-dimensional microwave imaging problems.
2D Shape Reconstruction Based on Combined Skeleton-Boundary FeaturesCSCJournals
This paper proposes a new method for 2D shape reconstruction based on combining skeleton and boundary features. The method aims to mimic human perceptual processes by using both curvature properties of the shape boundary and structural properties of the shape skeleton. Junction points on the skeleton are used to identify likely protrusions, while boundary features like curvature, length and width are used to determine the strength of protrusions. Experiments show the reconstructed shapes match human perceptual judgments better than existing methods. The approach gives a stable reconstruction and is robust to noise.
CONCURRENT TERNARY GALOIS-BASED COMPUTATION USING NANO-APEX MULTIPLEXING NIBS...VLSICS Design
Novel layout realizations for congestion-free three-dimensional lattice networks using the corresponding
carbon-based field emission controlled switching is introduced in this article. The developed nano-based
implementations are performed in three dimensions to perform the required concurrent computations for
which two-dimensional implementations are a special case. The introduced realizations for congestion-free
concurrent computations utilize the field-emission controlled switching devices that were presented in the
first and second parts of the article for the solution of synthesis congestion and by utilizing field-emission
from carbon nanotubes and nanotips. Since the concept of symmetry indices has been related to regular
logic design, a more general method called Iterative Symmetry Indices Decomposition that produces
regular three-dimensional lattice networks via carbon field-emission multiplexing is presented, where one
obtains multi-stage decompositions whenever volume-specific layout constraints have to be satisfied. The
introduced congestion-free nano-based lattice computations form new and important paths in regular
lattice realizations, where applications include low-power IC design for the control of autonomous robots
and for signal processing implementations.
A HYBRID MORPHOLOGICAL ACTIVE CONTOUR FOR NATURAL IMAGESIJCSEA Journal
Morphological active contours for image segmentation have become popular due to their low
computational complexity coupled with their accurate approximation of the partial differential equations
involved in the energy minimization of the segmentation process. In this paper, a morphological active
contour which mimics the energy minimization of the popular Chan-Vese Active Contour without Edges is
coupled with a morphological edge-driven segmentation term to accurately segment natural images. By
using morphological approximations of the energy minimization steps, the algorithm has a low
computational complexity. Additionally, the coupling of the edge-based and region-based segmentation
techniques allows the proposed method to be robust and accurate. We will demonstrate the accuracy and
robustness of the algorithm using images from the Weizmann Segmentation Evaluation Database and
report on the segmentation results using the Sorensen-Dice similarity coefficient
A HYBRID MORPHOLOGICAL ACTIVE CONTOUR FOR NATURAL IMAGESIJCSEA Journal
Morphological active contours for image segmentation have become popular due to their low computational complexity coupled with their accurate approximation of the partial differential equations involved in the energy minimization of the segmentation process. In this paper, a morphological active contour which mimics the energy minimization of the popular Chan-Vese Active Contour without Edges is coupled with a morphological edge-driven segmentation term to accurately segment natural images. By using morphological approximations of the energy minimization steps, the algorithm has a low computational complexity. Additionally, the coupling of the edge-based and region-based segmentation techniques allows the proposed method to be robust and accurate. We will demonstrate the accuracy and robustness of the algorithm using images from the Weizmann Segmentation Evaluation Database and report on the segmentation results using the Sorensen-Dice similarity coefficient.
A HYBRID MORPHOLOGICAL ACTIVE CONTOUR FOR NATURAL IMAGESIJCSEA Journal
Morphological active contours for image segmentation have become popular due to their low computational complexity coupled with their accurate approximation of the partial differential equations
involved in the energy minimization of the segmentation process. In this paper, a morphological active contour which mimics the energy minimization of the popular Chan-Vese Active Contour without Edges is coupled with a morphological edge-driven segmentation term to accurately segment natural images. By using morphological approximations of the energy minimization steps, the algorithm has a low computational complexity. Additionally, the coupling of the edge-based and region-based segmentation techniques allows the proposed method to be robust and accurate. We will demonstrate the accuracy and robustness of the algorithm using images from the Weizmann Segmentation Evaluation Database and report on the segmentation results using the Sorensen-Dice similarity coefficient.
The step construction of penalized spline in electrical power load dataTELKOMNIKA JOURNAL
Electricity is one of the most pressing needs for human life. Electricity is required not only for lighting but also to carry out activities of daily life related to activities Social and economic community. The problems is currently a limited supply of electricity resulting in an energy crisis. Electrical power is not storable therefore it is a vital need to make a good electricity demand forecast. According to this, we conducted an analysis based on power load. Given a baseline to this research, we applied penalized splines (P-splines) which led to a powerful and applicable smoothing technique. In this paper, we revealed penalized spline degree 1 (linear) with 8 knots is the best model since it has the lowest GCV (Generelized Cross Validation). This model have become a compelling model to predict electric power load evidenced by of Mean Absolute Percentage Error (MAPE=0.013) less than 10%.
RADIAL BASIS FUNCTION PROCESS NEURAL NETWORK TRAINING BASED ON GENERALIZED FR...cseij
For learning problem of Radial Basis Function Process Neural Network (RBF-PNN), an optimization
training method based on GA combined with SA is proposed in this paper. Through building generalized
Fréchet distance to measure similarity between time-varying function samples, the learning problem of
radial basis centre functions and connection weights is converted into the training on corresponding
discrete sequence coefficients. Network training objective function is constructed according to the least
square error criterion, and global optimization solving of network parameters is implemented in feasible
solution space by use of global optimization feature of GA and probabilistic jumping property of SA . The
experiment results illustrate that the training algorithm improves the network training efficiency and
stability.
AN EFFICIENT LINE CLIPPING ALGORITHM FOR CIRCULAR WINDOWS USING VECTOR CALCUL...ijcga
With the advent of digitization and growing abundance of graphic and image processing tools, use cases
for clipping using circular windows have grown considerably. This paper presents an efficient clipping
algorithm for line segments using geometrical features of circle and vector calculus. Building upon the
research with rectangular windows, this method is proposed with the belief that computations are more
expensive (heavy) than other computations. Execution time can be drastically improved if we replace
expensive computations with cheaper computations. The cheaper computations can be computed even more
efficiently using parallelization thus improving time complexity.
An Efficient Line Clipping Algorithm for Circular Windows Using Vector Calcul...ijcga
With the advent of digitization and growing abundance of graphic and image processing tools, use cases for clipping using circular windows have grown considerably. This paper presents an efficient clipping algorithm for line segments using geometrical features of circle and vector calculus. Building upon the research with rectangular windows, this method is proposed with the belief that computations are more expensive (heavy) than other computations. Execution time can be drastically improved if we replace expensive computations with cheaper computations. The cheaper computations can be computed even more efficiently using parallelization thus improving time complexity.
AN EFFICIENT LINE CLIPPING ALGORITHM FOR CIRCULAR WINDOWS USING VECTOR CALCUL...ijcga
With the advent of digitization and growing abundance of graphic and image processing tools, use cases
for clipping using circular windows have grown considerably. This paper presents an efficient clipping
algorithm for line segments using geometrical features of circle and vector calculus. Building upon the
research with rectangular windows, this method is proposed with the belief that computations are more
expensive (heavy) than other computations. Execution time can be drastically improved if we replace
expensive computations with cheaper computations. The cheaper computations can be computed even more
efficiently using parallelization thus improving time complexity.
Similar to local-convexity-shape-preserving-data-visualization-by-spline-function.pdf (20)
Cleades Robinson, a respected leader in Philadelphia's police force, is known for his diplomatic and tactful approach, fostering a strong community rapport.
UnityNet World Environment Day Abraham Project 2024 Press ReleaseLHelferty
June 12, 2024 UnityNet International (#UNI) World Environment Day Abraham Project 2024 Press Release from Markham / Mississauga, Ontario in the, Greater Tkaronto Bioregion, Canada in the North American Great Lakes Watersheds of North America (Turtle Island).
Methanex is the world's largest producer and supplier of methanol. We create value through our leadership in the global production, marketing and delivery of methanol to customers. View our latest Investor Presentation for more details.
ZKsync airdrop of 3.6 billion ZK tokens is scheduled by ZKsync for next week.pdfSOFTTECHHUB
The world of blockchain and decentralized technologies is about to witness a groundbreaking event. ZKsync, the pioneering Ethereum Layer 2 network, has announced the highly anticipated airdrop of its native token, ZK. This move marks a significant milestone in the protocol's journey, empowering the community to take the reins and shape the future of this revolutionary ecosystem.
1. International Scholarly Research Network
ISRN Mathematical Analysis
Volume 2012, Article ID 174048, 14 pages
doi:10.5402/2012/174048
Research Article
Local Convexity Shape-Preserving Data
Visualization by Spline Function
Muhammad Abbas,1, 2
Ahmad Abd Majid,1
Mohd Nain Hj Awang,3
and Jamaludin Md Ali1
1
School of Mathematical Sciences, Universiti Sains Malaysia, 11800 Penang, Malaysia
2
Department of Mathematics, University of Sargodha, 40100 Sargodha, Pakistan
3
School of Distance Education, Universiti Sains Malaysia, 11800 Penang, Malaysia
Correspondence should be addressed to Muhammad Abbas, m.abbas@uos.edu.pk
Received 16 November 2011; Accepted 21 December 2011
Academic Editor: R. Barrio
Copyright q 2012 Muhammad Abbas et al. This is an open access article distributed under the
Creative Commons Attribution License, which permits unrestricted use, distribution, and
reproduction in any medium, provided the original work is properly cited.
The main purpose of this paper is the visualization of convex data that results in a smooth,
pleasant, and interactive convexity-preserving curve. The rational cubic function with three free
parameters is constructed to preserve the shape of convex data. The free parameters are arranged
in a way that two of them are left free for user choice to refine the convex curve as desired, and
the remaining one free parameter is constrained to preserve the convexity everywhere. Simple
data-dependent constraints are derived on one free parameter, which guarantee to preserve the
convexity of curve. Moreover, the scheme under discussion is, C1
flexible, simple, local, and
economical as compared to existing schemes. The error bound for the rational cubic function is
Oh3
.
1. Introduction
Spline interpolation is a significant tool in computer graphics, computer-aided geometric
design and engineering as well. Convexity is prevalent shape feature of data. Therefore,
the need for convexity preserving interpolating curves and surfaces according to the given
data becomes inevitable. The aspiration of this paper is to preserve the hereditary attribute
that is the convexity of data. There are many applications of convexity preserving of data,
for instance, in the design of telecommunication systems, nonlinear programming arising in
engineering, approximation of functions, optimal control, and parameter estimation.
The problem of convexity-preserving interpolation has been considered by a number
of authors 1–21 and references therein. Bao et al. 1 used function values and first
2. 2 ISRN Mathematical Analysis
derivatives of function to introduce a rational cubic spline cubic/cubic. A method for
value control, inflection-point control and convexity control of the interpolation at a point
was developed to be used in practical curve design. Asaturyan et al. 3 constructed a six-
degree piecewise polynomial interpolant for the space curves to satisfy the shape-preserving
properties for collinear and coplanar data.
Brodlie and Butt 4 developed a piecewise rational cubic function to preserve the
shape of convex data. In 4, the authors inserted extra knots in the interval where the
interpolation loses the convexity of convex data which is the drawback of this scheme.
Carnicer et al. 5 analyzed the convexity-preserving properties of rational Bézier and non-
uniform rational B-spline curves from a geometric point of view and also characterize totally
positive systems of functions in terms of geometric convexity-preserving properties of the
rational curves.
Clements 6 developed a C2
parametric rational cubic interpolant with tension
parameter to preserve the convexity. Sufficient conditions were derived to preserve the
convexity of the function on strictly left/right winding polygonal line segments. Costantini
and Fontanella 8 preserved the convexity of data by semi-global method. The scheme has
some research gaps like the degree of rectangular patches in the interpolant that was too
large; the resulting surfaces were not visually pleasing and smooth.
Delbourgo and Gregory 9 developed an explicit representation of rational cubic
function with one free parameter which can be used to preserve the convexity of convex data.
Meng and Shi Long 11 also developed an explicit representation of rational cubic function
with two free parameters which can be used to preserve the convexity of convex data. In the
schemes 9, 11, there was no choice for user to refine the convexity curve as desired. The
rational spline was represented in terms of first derivative values at the knots and provided
an alternative to the spline under tension to preserve the shape of monotone and convex data
by Gregory 10.
McAllister 12, Passow 13, and Roulier 14 considered the problem of interpolating
monotonic and convex data in the sense of monotonicity and convexity preserving. They
used a piecewise polynomial Bernstein-Bézier function and introduce additional knots into
their schemes. Such a scheme for quadratic spline interpolation was described by McAllister
12 and was further developed by Schumaker 15 using piecewise quadratic polynomial
which was very economical, but the method generally inserts an extra knot in each interval
to interpolate.
Sarfraz and Hussain 17 used the rational cubic function with two shape parameters
to solve the problem of convexity preserving of convex data. Data-dependent sufficient
constraints were derived to preserve the shape of convex data. Sarfraz 18 developed a
piecewise rational cubic function with two families of parameters. In 18, the authors derived
the sufficient conditions on shape parameters to preserve the physical shape properties of
data. Sarfraz 19–21 used piecewise rational cubic interpolant in parametric context for
shape preserving of plane curves and scalar curves with planar data. The schemes 17–21
are local, but, unfortunately, they have no flexibility in the convexity-preserving curves.
In this paper, we construct a rational cubic function with three free parameters. One
of the free parameter is used as a constrained to preserve the convexity of convex data while
the other two are left free for the user to modify the convex curve. Sufficient data-dependent
constraints are derived. Our scheme has a number of attributes over the existing schemes.
i In this paper, the shape-preserving of convex data is achieved by simply imposing
the conditions subject to data on the shape parameters used in the description of
3. ISRN Mathematical Analysis 3
rational cubic function. The proposed scheme works evenly good for both equally
and unequally spaced data. In contrast 1 assumed certain function values and
derivative values to control the shape of the data.
ii In 12, 15, the smoothness of interpolant is C0
while in this work the degree of
smoothness is C1
.
iii The developed scheme has been demonstrated through different numerical
examples and observed that the scheme is not only local, computationally
economical, and easy to compute, time saving but also visually pleasant as
compared to existing schemes 17–21.
iv In 9–11, 17–21, the schemes do not allow to user to refine the convex curve
as desired while for more pleasing curve and still having the convex shape
preserved an additional modification is required, and this task is more easily done
in this paper by simply adjustment of free parameters in the rational cubic function
interpolation on user choice.
v In 17–21, the authors did not provide the error analysis of the interpolants while
a very good Oh3
error bound is achieved in this paper.
vi In 4, 12–15, the authors developed the schemes to achieve the desired shape
of data by inserting extra knots between any two knots in the interval while we
preserve the shape of convex data by only imposing constraints on free parameters
without any extra knots.
The remaining part of this paper is organized as follows. A rational cubic function is defined
in Section 2. The error of the rational cubic interpolant is discussed in Section 3. The problem
of shape preserving convexity curve is discussed in Section 4. Derivatives approximation
method is given in Section 5. Some numerical results are given in Section 6. Finally, the
conclusion of this work is discussed in Section 7.
2. Rational Cubic Spline Function
Let {xi, fi, i 0, 1, 2, . . . , n} be the given set of data points such as x0 x1 x2 · · · xn.
The rational cubic function with three free parameters introduced by Abbas et al. 2, in each
subinterval Ii xi, xi 1, i 0, 1, 2, . . . , n − 1, is defined as
Six
piθ
qiθ
, 2.1
with
piθ uifi1 − θ3
wifi uihidi
θ1 − θ2
wifi 1 − vihidi 1
θ2
1 − θ vifi 1θ3
,
qiθ ui1 − θ3
wiθ1 − θ viθ3
,
2.2
where θ x − xi/hi, hi xi 1 − xi, and ui, vi, wi are the positive free parameters. It is worth
noting that when we use the values of these free parameters as ui 1, vi 1 and wi 3, then
the C1
piecewise rational cubic function 2.1 reduces to standard cubic Hermite spline
discussed in Schultz 16.
4. 4 ISRN Mathematical Analysis
The piecewise rational cubic function has the following interpolatory conditions:
Sixi fi, Sixi 1 fi 1, S
ixi di, S
ixi 1 di 1, 2.3
where S
ix denotes the derivative with respect to “x,” and di denotes the derivative values
at knots.
3. Interpolation Error Analysis
The error analysis of piecewise rational cubic function 2.1 is estimated, without loss of
generality, in the subinterval Ii xi, xi 1. It is to mention that the scheme constructed
in Section 2 is local. We suppose that fx ∈ C3
x0, xn, and Six is the interpolation of
function fx over arbitrary subinterval Ii xi, xi 1. The Peano Kernel Theorem, Schultz
16 is used to obtain the error analysis of piecewise rational cubic interpolation in each
subinterval Ii xi, xi 1, and it is defined as
R
f
fx − Six
1
2
xi 1
xi
f3
τRx
x − τ2
dτ. 3.1
In each subinterval, the absolute value of error is
fx − Six ≤
1
2
f3
τ
xi 1
xi
Rx
x − τ2
dτ, 3.2
where
Rx
x − τ2
⎧
⎪
⎪
⎪
⎪
⎪
⎨
⎪
⎪
⎪
⎪
⎪
⎩
x − τ2
−
wixi 1 − τ2
− 2hivixi 1 − τ
θ2
1 − θ vixi 1 − τ2
θ3
qiθ
xi τ x,
wixi 1 − τ2
− 2hivixi 1 − τ
θ2
1 − θ vixi 1 − τ2
θ3
qiθ
x τ xi 1,
⎧
⎨
⎩
aτ, x xi τ x,
bτ, x x τ xi 1,
3.3
where Rxx − τ2
is called the Peano Kernel of integral. To derive the error analysis, first of
all we need to examine the properties of the kernel functions aτ, x and bτ, x, and then to
find the values of following integrals:
xi 1
xi
Rx
x − τ2
dτ
x
xi
|aτ, x|dτ
xi 1
x
|bτ, x|dτ. 3.4
5. ISRN Mathematical Analysis 5
So, we calculate these values in two parts. The proof of Theorem will be completed by
combining these two parts.
3.1. Part 1
By simple computation, the roots of ax, x θ2
1 − θ2
wi − νiθ 2νi −
wih2
i /qiθ in 0, 1 are θ 0, θ 1 and θ∗
1 − νi/wi − νi. It is easy to show that
when θ ≤ θ∗
, ax, x ≤ 0 and θ ≥ θ∗
, ax, x ≥ 0. The roots of quadratic function aτ, x 0
are
τ∗
1 x −
θhiθwi − νi A
1 − θui θwi
, τ∗∗
1 x −
θhiθwi − νi − A
1 − θui θwi
, 3.5
where A
νiwi − 2νi 3θ wiwi − 4νiθ.
So, when θ θ∗
, xi τ∗∗
1 x and when θ θ∗
, τ∗∗
1 x. Thus, θ θ∗
, aτ, x
0 for all τ ∈ xi, x,
x
xi
|aτ, x|dτ
x
xi
−aτ, xdτ
νi3 − θ − wi1 − θ1 − θ3
θ2
h3
i
3qiθ
wi − 3vi1 − θθ2
h3
i
3qiθ
viθ3
h3
i
3qiθ
−
θ3
h3
i
3
.
3.6
The value of aτ, x varies from negative to positive on the root τ∗∗
1 when θ θ∗
,
x
xi
|aτ, x|dτ
τ∗∗
1
xi
−aτ, xdτ
x
τ∗∗
1
aτ, xdτ
2wi − νiθ − A3
θ3
h3
i
31 − θui θwi3
−
θ3
h3
i
3
−
2h3
i
3qiθ
1 − θ
θwi − νiθ − A
1 − θui θwi
3
× 1 − θwi θνi
2h3
i νiθ2
1 − θ
qiθ
1 − θ
θwi − νiθ − A
1 − θui θwi
2
.
3.7
3.2. Part 2
In this part, we discuss the properties of function bτ, x. Consider bτ, x, τ ∈ x, xi 1 as
function of τ. The roots of function bτ, x are similar as aτ, x in Section 3.1 at τ x. It is
easy to show that when θ ≤ θ∗
, bx, x ≤ 0 and θ ≥ θ∗
, bx, x ≥ 0. The roots of quadratic
function bτ, x 0 are
τ∗
2 xi 1, τ∗∗
2 xi 1 −
21 − θνihi
1 − θwi θνi
. 3.8
6. 6 ISRN Mathematical Analysis
The function bτ, x varies from negative to positive on the root τ∗∗
2 when θ ≤ θ∗
. Thus,
xi 1
x
|bτ, x|dτ
τ∗∗
2
x
−bτ, xdτ
xi 1
τ∗∗
2
bτ, xdτ
8θ2
1 − θ3
νi
3
h3
i
3qiθ1 − θui θwi2
h3
i θ2
1 − θ3
3qiθ
wi1 − θ − νi3 − θ,
3.9
when θ ≥ θ∗
,
xi 1
x
|bτ, x|dτ
xi 1
x
bτ, xdτ
h3
i θ2
1 − θ3
3qiθ
νi3 − θ − wi1 − θ.
3.10
Thus, from 3.6 and 3.9, it can be shown that when 0 ≤ θ ≤ θ∗
,
fx − Six ≤
1
2
f3
τ
xi 1
xi
Rx
x − τx − τ2
dτ f3
τ h3
i p1ui, vi, wi, θ,
3.11
where
p1ui, νi, wi, θ
νi3 − θ − wi1 − θ1 − θ3
θ2
6 qiθ
wi − 3νi1 − θθ2
6 qiθ
νiθ3
6 qiθ
−
θ3
6
8θ2
1 − θ3
νi
3
6 qiθ1 − θui θwi2
θ2
1 − θ3
6 qiθ
wi1 − θ − νi3 − θ,
3.12
and, from 3.7 and 3.10, it can be shown that when θ∗
≤ θ ≤ 1,
fx − Six ≤
1
2
f3
τ
xi 1
xi
Rx
x − τ2
dτ f3
τ h3
i p2ui, νi, wi, θ, 3.13
where
p2ui, νi, wi, θ
2wi − νiθ − A3
θ3
61 − θui θwi3
−
θ3
6
−
2
6qiθ
1 − θ
θwi − νiθ − A
1 − θui θwi
3
× 1 − θwi θνi
νiθ2
1 − θ
qiθ
1 − θ
θwi − νiθ − A
1 − θui θwi
2
θ2
1 − θ3
6qiθ
νi3 − θ − wi1 − θ.
3.14
7. ISRN Mathematical Analysis 7
Theorem 3.1. For the positive free parameters ui, νi, and wi, the error of interpolating rational cubic
function Six, for fx ∈ C3
x0, xn, in each subinterval Ii xi, xi 1 is
fx − Six ≤
1
2
f3
τ
xi 1
xi
Rx
x − τ2
dτ f3
τ h3
i ci, ci max
0≤θ≤1
pui, νi, wi, θ,
3.15
where
pui, νi, wi, θ
⎧
⎨
⎩
max p1ui, νi, wi, θ, 0 ≤ θ ≤ θ∗
max p2ui, νi, wi, θ, θ∗
≤ θ ≤ 1.
3.16
Remark 3.2. It is interesting to note that the rational cubic interpolation 2.1 reduces to
standard cubic Hermite interpolation when we adjust the values of parameters as ui 1, νi
1 and wi 3. In this special case, the functions p1ui, νi, wi, θ and p2ui, νi, wi, θ are
p1ui, vi, wi, θ
4θ2
1 − θ3
33 − 2θ2
, 0 ≤ θ ≤
1
2
, 3.17
p2ui, νi, wi, θ
4θ3
1 − θ2
31 2θ2
,
1
2
≤ θ ≤ 0, 3.18
respectively. Since ci max{max0≤θ≤0.5p1ui, νi, wi, θ, max0.5≤θ≤0 p2ui, νi, wi, θ} 1/96. This
is the standard result for standard cubic Hemite spline interpolation.
4. Shape Preserving 2D Convex Data Rational
Cubic Spline Interpolation
The piecewise rational cubic function 2.1 does not guarantee to preserve the shape of
convex data. So, it is required to assign suitable constraints on the free parameters by some
mathematical treatment to preserve the convexity of convex data.
Theorem 4.1. The C1
piecewise rational cubic function 2.1 preserves the convexity of convex data if
in each subinterval Ii xi, xi 1, i 0, 1, 2, . . . , n, the free parameters satisfy the following sufficient
conditions:
wi max
0,
di 1νi
di 1 − Δi
,
di 1νi
Δi − di
,
2uiνidi 1 − Δi
di 1νi − Δiui
,
2uiνiΔi − di
Δiνi − diui
,
uiνidi 1 − di
Δiui νi
,
ui, νi 0.
4.1
8. 8 ISRN Mathematical Analysis
The above constraints are rearranged as
wi li max
0,
di 1νi
di 1 − Δi
,
di 1νi
Δi − di
,
2uiνidi 1 − Δi
di 1νi − Δiui
,
2uiνiΔi − di
Δiνi − diui
,
uiνidi 1 − di
Δiui νi
,
li ≥ 0, ui, νi 0.
4.2
Proof. Let {xi, fi, i 0, 1, 2, . . . , n} be the given set of convex data. For the strictly convex
set of data, so
Δ1 Δ2 Δ3 · · · Δn−1. 4.3
In similar way for the concave set of data, we have
Δ1 Δ2 Δ3 · · · Δn−1. 4.4
Now, for a convex interpolation Six, necessary conditions on derivatives parameters di
should be in the form such that
d1 Δ1 · · · Δi−1 di Δi · · · Δn−1 dn. 4.5
Similarly, for concave interpolation,
d1 Δ1 · · · Δi−1 di Δi · · · Δn−1 dn. 4.6
The necessary conditions for the convexity of data are
Δi − di ≥ 0, di 1 − Δi ≥ 0. 4.7
Now a piecewise rational cubic interpolation Six is convex if and only if S
2
i x ≥ 0, ∀x ∈
x1, xn, for x ∈ xi, xi 1 after some simplification it can be shown that;
S
2
i x
8
k1 θk−1
1 − θ8−k
Cik
hi
qiθ
3
, 4.8
9. ISRN Mathematical Analysis 9
where
C i1 2ν2
i widi 1 − Δi diui − di 1νi, Ci2 4 Ci1 6ν2
i di 1νi − Δiui,
Ci3 Ci2 − C i1 6νi{widi 1νi − Δiui − 2uiνidi 1 − Δi},
Ci4 Ci3 C i1 − Ci2 2wi{wiΔiui νi − uiνidi 1 − di} 14uiνidi 1νi − diui,
Ci5 Ci6 Ci8 − Ci7 2wi{wiΔiui νi − uiνidi 1 − di} 14uiνidi 1νi − diui,
Ci6 Ci7 − Ci8 6ui{wiΔiνi − diui − 2uiνiΔi − di},
Ci7 4 Ci8 6u2
i Δiνi − diui, Ci8 2u2
i wiΔi − di diui − di 1νi.
4.9
All Cik’s are the expression involving the parameters d
is, Δ
is, u
is, v
is, and w
is.
A C1
piecewise rational cubic interpolant 2.1 preserves the convexity of data
if S
2
i x ≥ 0.
S
2
i x 0 if both
8
k1 θk−1
1 − θ8−k
Ci k 0 and hiqiθ3
0.
Since ui, νi, wi are positive free parameters, so hiqiθ3
0 must be positive
8
k1
θk−1
1 − θ8−k
Cik 0 if Cik 0, k 1, 2, 3, 4, 5, 6, 7, 8. 4.10
Hence, Cik 0, k 1, 2, 3, 4, 5, 6, 7, 8 if we have the following sufficient conditions on
parameter wi:
wi max
0,
di 1νi
di 1 − Δi
,
di 1νi
Δi − di
,
2uiνidi 1 − Δi
di 1νi − Δiui
,
2uiνiΔi − di
Δiνi − diui
,
uiνidi 1 − di
Δiui νi
.
4.11
The above constraints are rearranged as
wi li max
0,
di 1νi
di 1 −Δi
,
di 1νi
Δi −di
,
2uiνidi 1 −Δi
di 1νi −Δiui
,
2uiνiΔi −di
Δiνi −diui
,
uiνidi 1 −di
Δiui νi
, li ≥ 0,
4.12
where Δi fi 1 − fi/hi.
5. Determination of Derivatives
Usually, the derivative values at the knots are not given. These values are derived either at
the given data set {xi, fi, i 0, 1, 2, . . . , n} or by some other means. In this paper, these
values are determined by following arithmetic mean method for data in such a way that the
smoothness of the interpolant 2.1 is maintained.
10. 10 ISRN Mathematical Analysis
0 2 4 6 8 10 12 14 16
0
2
4
6
8
10
12
14
16
18
y-axis
x-axis
Figure 1: Cubic Hermite spline scheme.
Table 1: Convex data set.
i 1 2 3 4 5 6 7 8 9 10
x 1.2 1.4 1.8 2 6 12 13 14.4 14.8 15
y fx 18 16 12 10 2.2 2.23 3.5 7.2 14 18
5.1. Arithmetic Mean Method
This method is the three point difference approximation with
di
⎧
⎪
⎨
⎪
⎩
0 if Δi−1 0 or Δi 0,
hiΔi−1 hi−1Δi
hi hi−1
otherwise, i 2, 3, . . . n − 1,
5.1
and the end conditions are given as
d1
⎧
⎪
⎨
⎪
⎩
0 if Δ1 0 or sgnd1 /
sgnΔ1,
Δ1 Δ1 − Δ2h1
h1 h2
otherwise,
dn
⎧
⎪
⎨
⎪
⎩
0 if Δn−1 0 or sgndn /
sgnΔn−1,
Δn−1 Δn−1 − Δn−2hn−1
hn−1 hn−2
otherwise.
5.2
6. Numerical Examples
In this section, a numerical demonstration of convexity-preserving scheme given in Section 4
is presented.
12. 12 ISRN Mathematical Analysis
Table 3: Convex data set 11.
i 1 2 3 4 5 6 7 8 9
x 1 1.1 1.4 2 2.2 4 5 10 10.22
y fx 10 5.5 4.2 2.5 2 0.625 0.4 1 1.8
1 2 3 4 5 6 7 8 9 10 11
0
2
4
6
8
10
−2
y-axis
x-axis
Figure 4: Convexity shape-preserving rational cubic Interpolation.
Example 6.1. Consider convex data set taken in Table 1. Figure 1 is produced by cubic Hermite
spline. We remark that Figure 1 does not preserve the shape of convex data. To overcome
this flaw, Figure 2 is produced by the convexity-preserving rational cubic spline interpolation
developed in Section 4 with the values of free parameters ui 0.02, νi 0.02 to preserve the
shape of convex data. Numerical results of Figure 2 are determined by developed convexity
preserving rational cubic spline interpolation shown in Table 2.
Example 6.2. Consider convex data set taken in Table 3. Figure 3 is produced by cubic
Hermite spline, and it is easy to see that Figure 3 does not preserve the shape of convex
data. Figure 4 is produced by the convexity-preserving rational cubic spline interpolation
developed in Section 4 with the values of free parameters ui 0.02, νi 0.02 to preserve the
shape of convex data. Numerical results of Figure 4 are determined by developed convexity
preserving rational cubic spline interpolation shown in Table 4.
7. Conclusion
In this paper, we have constructed a C1
piecewise rational cubic function with three free
parameters. Data-dependent constraints are derived to preserve the shape of convex data.
Remaining two free parameters are left free for user’s choice to refine the convexity-
preserving shape of the convex data as desired. No extra knots are inserted in the interval
when the curve loses the convexity. The developed curve scheme has been tested through
different numerical examples, and it is shown that the scheme is not only local and
computationally economical but also visually pleasant.
13. ISRN Mathematical Analysis 13
Table 4: Numerical results of Figure 4.
i 1 2 3 4 5 6 7 8 9
di −55.16 −34.83 −3.83 −2.58 −2.32 −0.41 −0.16 3.48 3.78
Δi −45 −4.33 −2.83 −2.5 −0.76 −0.22 0.12 3.63 —
ui 0.02 0.02 0.02 0.02 0.02 0.02 0.02 0.02 0.02
vi 0.02 0.02 0.02 0.02 0.02 0.02 0.02 0.02 0.02
wi 0.14279 0.87 0.38 0.4368 0.11125 0.15086 0.26265 0.74 0.14279
Acknowledgments
The authors are highly obliged to the anonymous referees for the inspiring comments and
the precious suggestions which improved our manuscript significantly. This work was fully
supported by USM-RU-PRGS 1001/PMATHS/844031 from the Universiti Sains Malaysia
and Malaysian Government is gratefully acknowledged. The first author does acknowledge
University of Sargodha, Sargodha-Pakistan for the financial support.
References
1 F. Bao, Q. Sun, J. Pan, and Q. Duan, “Point control of rational interpolating curves using parameters,”
Mathematical and Computer Modelling, vol. 52, no. 1-2, pp. 143–151, 2010.
2 M. Abbas, A. A. Majid, M. N. H. Awang, and J. M. Ali, “Monotonicity preserving interpolation using
rational spline,” in Proceedings of the International MultiConference of Engineers and Computer Scientists
(IMECS ’11), vol. 1, pp. 278–282, Hong Kong, March 2011.
3 S. Asaturyan, P. Costantini, and C. Manni, “Local shape-preserving interpolation by space curves,”
IMA Journal of Numerical Analysis, vol. 21, no. 1, pp. 301–325, 2001.
4 K. W. Brodlie and S. Butt, “Preserving convexity using piecewise cubic interpolation,” Computers and
Graphics, vol. 15, no. 1, pp. 15–23, 1991.
5 J. M. Carnicer, M. Garcia-Esnaola, and J. M. Peña, “Convexity of rational curves and total positivity,”
Journal of Computational and Applied Mathematics, vol. 71, no. 2, pp. 365–382, 1996.
6 J. C. Clements, “A convexity-preserving C2
parametric rational cubic interpolation,” Numerische
Mathematik, vol. 63, no. 2, pp. 165–171, 1992.
7 P. Costantini, “On monotone and convex spline interpolation,” Mathematics of Computation, vol. 46,
no. 173, pp. 203–214, 1986.
8 P. Costantini and F. Fontanella, “Shape-preserving bivariate interpolation,” SIAM Journal on Numerical
Analysis, vol. 27, no. 2, pp. 488–506, 1990.
9 R. Delbourgo and J. A. Gregory, “Shape preserving piecewise rational interpolation,” SIAM Journal
on Scientific and Statistical Computing, vol. 6, no. 4, pp. 967–976, 1985.
10 J. A. Gregory, “Shape preserving spline interpolation,” Computer-Aided Design, vol. 18, no. 1, pp. 53–
57, 1986.
11 M. Tian and S. L. Li, “Convexity-preserving piecewise rational cubic interpolation,” Journal of
Shandong University, vol. 42, no. 10, pp. 1–5, 2007.
12 D. F. McAllister and J. A. Roulier, “An algorithm for computing a shape-preserving osculatory
quadratic spline,” ACM Transactions on Mathematical Software, vol. 7, no. 3, pp. 331–347, 1981.
13 E. Passow and J. A. Roulier, “Monotone and convex spline interpolation,” SIAM Journal on Numerical
Analysis, vol. 14, no. 5, pp. 904–909, 1977.
14 J. A. Roulier, “A convexity preserving grid refinement algorithm for interpolation of bivariate
functions,” IEEE Computer Graphics and Applications, vol. 7, no. 1, pp. 57–62, 1987.
15 L. L. Schumaker, “On shape preserving quadratic spline interpolation,” SIAM Journal on Numerical
Analysis, vol. 20, no. 4, pp. 854–864, 1983.
16 M. H. Schultz, Spline Analysis, Prentice-Hall, Englewood Cliffs, NJ, USA, 1973.
14. 14 ISRN Mathematical Analysis
17 M. Sarfraz and M. Z. Hussain, “Data visualization using rational spline interpolation,” Journal of
Computational and Applied Mathematics, vol. 189, no. 1-2, pp. 513–525, 2006.
18 M. Sarfraz, “Visualization of positive and convex data by a rational cubic spline interpolation,”
Information Sciences, vol. 146, no. 1–4, pp. 239–254, 2002.
19 M. Sarfraz, M. Hussain, and Z. Habib, “Local convexity preserving rational cubic spline curves,” in
Proceedings of the IEEE Conference on Information Visualization (IV ’97), pp. 211–218, 1997.
20 M. Sarfraz, “Convexity preserving piecewise rational interpolation for planar curves,” Bulletin of the
Korean Mathematical Society, vol. 29, no. 2, pp. 193–200, 1992.
21 M. Sarfraz, “Interpolatory rational cubic spline with biased, point and interval tension,” Computers
and Graphics, vol. 16, no. 4, pp. 427–430, 1992.
15. Copyright of ISRN Mathematical Analysis is the property of Hindawi Publishing Corporation and its content
may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express
written permission. However, users may print, download, or email articles for individual use.