• Journal of Biomedical Engineering Research
• /
• v.22 no.4
• /
• pp.311-319
• /
• 2001

Statistical reconstruction methods in the context of a Bayesian framework have played an important role in emission tomography since they allow to incorporate a priori information into the reconstruction algorithm. Given the ill-posed nature of tomographic inversion and the poor quality of projection data, the Bayesian approach uses regularizers to stabilize solutions by incorporating suitable prior models. In this work we show that, while the quantitative performance of the standard filtered backprojection (FBP) algorithm is not as good as that of Bayesian methods, the application of spline-regularized smoothing to the sinogram space can make the FBP algorithm improve its performance by inheriting the advantages of using the spline priors in Bayesian methods. We first show how to implement the spline-regularized smoothing filter by deriving mathematical relationship between the regularization and the lowpass filtering. We then compare quantitative performance of our new FBP algorithms using the quantitation of bias/variance and the total squared error (TSE) measured over noise trials. Our numerical results show that the second-order spline filter applied to FBP yields the best results in terms of TSE among the three different spline orders considered in our experiments.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.12
• /
• pp.1272-1277
• /
• 2014

This article describes a path planning algorithm for fixed-wing UAVs when a real terrain should be considered. Nowadays, many UAVs are required to perform mission flights near given terrain for surveillance, reconnaissance, and infiltration, as well as flight altitude of many UAVs are relatively lower than typical manned aerial vehicles. Therefore, real terrain should be considered in path planning algorithms of fixed-wing UAVs. In this research, we have extended a spline-$RRT^*$ algorithm to three-dimensional planner. The spline-$RRT^*$ algorithm is a $RRT^*$ based algorithm, and it takes spline method to extend the tree structure over the workspace to generate smooth paths without any post-processing. Direction continuity of the resulting path is guaranteed via this spline technique, and it is essential factor for the paths of fixed-wing UAVs. The proposed algorithm confirm collision check during the tree structure extension, so that generated path is both geometrically and dynamically feasible in addition to direction continuity. To decrease degrees of freedom of a random configuration, we designed a function assigning directions to nodes of the graph. As a result, it increases the execution speed of the algorithm efficiently. In order to investigate the performance of the proposed planning algorithm, several simulations are performed under real terrain environment. Simulation results show that this proposed algorithm can be utilized effectively to path planning applications considering real terrain.

• Communications for Statistical Applications and Methods
• /
• v.28 no.5
• /
• pp.537-551
• /
• 2021

We conducted a study on a regression spline estimator with a few pre-specified auxiliary variables. For the implementation of the proposed estimators, we adapted a coordinate descent algorithm. This was implemented by considering a structure of the sum of the residuals squared objective function determined by the B-spline and the auxiliary coefficients. We also considered an efficient stepwise knot selection algorithm based on the Bayesian information criterion. This was to adaptively select smoothly functioning estimator data. Numerical studies using both simulated and real data sets were conducted to illustrate the proposed method's performance. An R software package psav is available.

• Proceedings of the Society of Korea Industrial and System Engineering Conference
• /
• 2002.05a
• /
• pp.461-466
• /
• 2002

In many applications of computer aided geometric design and computer graphics, B-spline is one of the most popular representation for curves and surfaces, and the evaluation of B-spline curves and surfaces is the most frequently used operation. For the evaluation and others, the power form representation of the curves and surfaces is preferred because it is possible to speed-up the operation using Horner's rule. In this paper, we present a new algorithm for the above-mentioned conversion focusing on a dynamic case. Experiment shows that the proposed algorithm significantly outperforms the conventional approach when one or more control points of a B-spline curve and surface are dynamically moving.

• Journal of the Korean Geophysical Society
• /
• v.8 no.1
• /
• pp.23-33
• /
• 2005

The digital surface model (DSM) is used for several purposes in photogrammetry, remote sensing and laser scanned data such as orthoimage production, contours erivation, extraction of height information. Creation of a surface model from point-clouds (3-D sparse points) that can be derived from stereo imagery and range data (e.g. laser scanned data) can be done with several mathematical interpolation models. In this paper, thin-plate-spline (TPS) is used for digital surface modeling. Determination of suitable weight is an important problem in thin-plate function for a surface. The Voronoi algorithm has been proposed as a method for determination of the weight in thin-plate-spline. In this paper, methods has been tested for different surfaces. The results show that thin-plate-spline can be independent of weight.

• Journal of the Society of Naval Architects of Korea
• /
• v.35 no.4
• /
• pp.118-125
• /
• 1998

This paper presents the hybrid curve approximation with geometric boundary conditions as position vector and tangent vector of start and end point using a B-spline approximation and a genetic algorithm First, H-spline approximation generates control points to fit B-spline curries through specified data points. Second, these control points are modified by genetic algorithm(with floating point representation) under geometric boundary conditions. This method would be able to execute the efficient design work without fairing.

• Journal of Welding and Joining
• /
• v.34 no.1
• /
• pp.54-58
• /
• 2016

In this research paper, suggest method of generate same bead as an actual measurement data in virtual welding conditions, exploit morphology information of the bead that acquired through robot welding. It has many multiple risk factors to Beginners welding training, by we make possible to train welding in virtual reality, we can reduce welding training risk and welding material to exploit bead visualization algorithm that we suggest so it will be expected to achieve educational, environmental and economical effect. The proposed method is acquire data to each case performing robot welding by set the voltage, current, working angle, process angle, speed and arc length of welding condition value. As Welding condition value is most important thing in decide bead form, we would selected one of baseline each item and then acquired metal followed another factors change. Welding type is FCAW, SMAW and TIG. When welding trainee perform the training, it's difficult to save all of changed information into database likewise working angle, process angle, speed and arc length. So not saving data into database are applying the method to infer the form of bead using a neural network algorithm. The way of bead's visualization is applying the spline algorithm. To accurately represent Morphological information of the bead, requires much of morphological information, so it can occur problem to save into database that is why we using the spline algorithm. By applying the spline algorithm, it can make simplified data and generate accurate bead shape. Through the research paper, the shape of bead generated by the virtual reality was able to improve the accuracy when compared using the form of bead generated by the robot welding to using the morphological information of the bead generated through the robot welding. By express the accurate shape of bead and so can reduce the difference of the actual welding training and virtual welding, it was confirmed that it can be performed safety and high effective virtual welding education.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.2
• /
• pp.50-55
• /
• 2002

The standard approach of image resampling is to fit the original image with continuous model and resample the function at a desired rate. We used the B-spline function as the continuous model because it oscillates less than the others. The main purpose of this paper is the derivation of a nonuniform optimal resampling algorithm. To derive it, needing approximation can be computed in three steps: 1) determining the I-spline coefficients by matrix inverse process, 2) obtaining the transformed-spline coefficients by the optimal resampling algorithm derived from the orthogonal projection theorem, 3) converting of the result back into the signal domain by indirect B-spline transformation. With these methods, we can use B-spline in the non-uniform resampling, which is proved to be a good kernel in uniform resampling, and can also verify the applicability from our experiments.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.659-662
• /
• 2000

다양한 보간 기법을 정리해 보고 이를 통해서 기존의 보간 기법의 한계를 고찰해 본다. 보간의 효율성과 보간 결과 영상의 화질과는 Trade off 관계가 있으며, 이를 적절한 수준에서 결정하는 것은 중요한 문제이다. 본 논문에서는 Quadratic B-spline을 기저 함수로 하는 윤곽보존형 보간 필터를 사용한 영상확대 알고리즘을 제안한다. Unser의 Cardinal Cubic spline함수에 비해 적은 하드웨어만으로도 이상적인 저역 통과 필터의 특성을 가지며, 입력영상의 윤곽의 방향성을 고려한 적응적인 보간 기법의 적용으로 화질이 우수한 영상확대 알고리즘을 제안한다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.358-363
• /
• 1998

An algorithm for representing the cubic spline interpolation of differentiable functions by a fuzzy system is presented in this paper. The cubic B-spline functions which form a basis for the interpolation function are used as the fuzzy sets for input fuzzification. The ordinal number of the coefficient cKL in the list of the coefficient cij's as sorted in increasing order, is taken to be the output fuzzy set number in the (k, l) th entry of the fuzzy rule table. Spike functions are used for the output fuzzy sets, with cij's as support boundaries after they are sorted. An algorithm to compute the support boundaries explicitly without solving the matrix equation involved is included, along with a few properties of the fuzzy rule matrix for the designed fuzzy system.