• Journal of Advanced Navigation Technology
• /
• v.4 no.1
• /
• pp.45-49
• /
• 2000

A GPS measurement solution, in general, is obtained as a least squares solution since the measurement includes errors such as clock errors, ionospheric and tropospheric delays, multipath effect etc. Because of the nonlinearity of the measurement equation, we utilize the nonlinear Newton algorithm to obtain a least squares solution, or mostly, use its linearized algorithm which is more convenient and effective. In this study we developed a fixed point algorithm and proved its availability to replace the nonlinear Newton algorithm and the linearized algorithm. A nonlinear Newton algorithm and a linearized algorithm have the advantage of fast convergence, while their initial values have to be near the unknown solution. On the contrary, the fixed point algorithm provides more reliable but slower convergence even if the initial values are quite far from the solution. Therefore, two types of algorithms may be combined to achieve better performance.

• Journal of Korea Multimedia Society
• /
• v.10 no.10
• /
• pp.1271-1283
• /
• 2007

To detect defect of FPD(flat panel displays) is very difficult due to uneven illumination on FPD panel image. This paper presents a method to detect various types of defects using the approximated image of the uneven illumination by B-spline. To construct a approximated surface, corresponding to uneven illumination background intensity, while reducing random noises and small defect signal, only the lowest smooth subband is used by wavelet decomposition, resulting in reducing the computation time of taking B-spline approximation and enhancing detection accuracy. The approximated image in lowest LL subband is expanded as the same size as original one by wavelet reconstruction, and the difference between original image and reconstructed one becomes a flat image of compensating the uneven illumination background. A simple binary thresholding is then used to separate the defective regions from the subtracted image. Finally, blob analysis as post-processing is carried out to get rid of false defects. For applying in-line system, the wavelet transform by lifting based fast algorithm is implemented to deal with a huge size data such as film and the processing time is highly reduced.

• The Journal of the Korea Contents Association
• /
• v.14 no.10
• /
• pp.1-9
• /
• 2014

Generally, integral image used for autostereoscopic 3d display is generated for flat lens array, but flat lens array cannot provide a wide range of view for generated integral image because of narrow range of view. To make up for this flat lens array's weak point, curved lens array has been proposed, and due to technical and cost problem, approximate surface lens array composed of several flat lens array is used instead of ideal curved lens array. In this paper, we constructed an approximate surface lens array arranged for $20{\times}8$ square flat lens in 100mm radius sphere, and we could get about twice angle of view compared to flat lens array. Specially, unlike existing researches which manually generate integral image, we propose an OpenCL GPU parallel process algorithm for generating real-time integral image. As a result, we could get 12-20 frame/sec speed about various 3D volume data from $15{\times}15$ approximate surface lens array.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.635-642
• /
• 2003

Reinforcement learning got successful results in a lot of applications such as control and scheduling. Various function approximation methods have been studied in order to improve the learning speed and to solve the shortage of storage in the standard reinforcement learning algorithm of Q-Learning. Most function approximation methods remove some special quality of reinforcement learning and need prior knowledge and preprocessing. Fuzzy Q-Learning needs preprocessing to define fuzzy variables and Local Weighted Regression uses training examples. In this paper, we propose a function approximation method, Fuzzy Q-Map that is based on on-line fuzzy clustering. Fuzzy Q-Map classifies a query state and predicts a suitable action according to the membership degree. We applied the Fuzzy Q-Map, CMAC and LWR to the mountain car problem. Fuzzy Q-Map reached the optimal prediction rate faster than CMAC and the lower prediction rate was seen than LWR that uses training example.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.5
• /
• pp.64-73
• /
• 2011

The problem of Euclidean minimum spanning tree (EMST) is to connect given nodes in a plane with minimum cost. There are many algorithms for the polynomial time problem as EMST. However, for numerous nodes, the algorithms consume an enormous amount of time to find an optimal solution. In this paper, an approximation scheme using a polynomial time approximation scheme (PTAS) algorithm with dividing and parallel processing for the problem is suggested. This scheme enables to construct a large, approximate EMST within a short duration. Although initially devised for the non-polynomial problem, we employ naive PTAS to construct a vast EMST with dynamic programming. In an experiment, the approximate EMST constructed by the proposed scheme with 15,000 input terminal nodes and 16 partition cells shows 89% and 99% saving in execution time for the serial processing and parallel processing methods, respectively. Therefore, our scheme can be applied to obtain an approximate EMST quickly for numerous input terminal nodes.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.5
• /
• pp.917-922
• /
• 2018

In the conventional interchannel interference self-cancellation (ICI-SC) schemes, the length of sampling window is the same as the symbol length of orthogonal frequency division multiplexing (OFDM). Thus, the number of complex operations to compute the interference coefficient of each subchannel is significantly increased. To solve this problem, we present an approximated mathematical model for the coefficients of ICI-SC schemes. Based on the proposed approximation, we analyze mean squared error (MSE) and computational complexity of the ICI-SC schemes with the length of sampling window. As a result, the presented approximation has an error of less than 0.01% on the MSE compared to the original equation. When the number of subchannels is 1024, the number of complex computations for the interference coefficients is reduced by 98% or more. Since the computational complexity can be remarkably reduced without sacrificing the self-cancellation capability, it is considered that the proposed approximation is very useful to develop an algorithm for the ICI-SC scheme.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.199-207
• /
• 2001

In this paper, we suggest an edge-based surface segmentation algorithm of 3D image using curvature. For the first, in this proposed method, we approximate 3D depth data to second order curves by each scan line and decide splitting points of 3D edges by curvature of the approximated curves. And finally make a group as 3D surface with the region of input image by the 3D edges. In the conventional algorithms, there are some difficulties in detecting 3D edge with the separated processes for the jump edge and the crease edge and especially, in deciding the ambiguous discontinuity of surface directions about the crease edge. The proposed algorithm decides curvature discontinuity using curvature which is simply calculated by a geometrical approximation. Furthermore, the algorithm has a cooperated process to calculate the jump and crease edges. The results of computer simulations with several 3D images show that the proposed method yields better performance as comparing with the conventional methods.

• Journal of Korean Society for Geospatial Information Science
• /
• v.13 no.3 s.33
• /
• pp.87-94
• /
• 2005

3D positional information of lane can be automatically calculated tv combining GPS data, IMU data if coordinates of lane centers are given. The Road Safety Survey and Analysis Vehicle(RoSSAV) is currently under development to analyze three dimensional safety and stability of roads. RoSSAV has GPS and IMU sensors to get positional information of the vehicle and two road-facing CCD cameras for extraction of lane coordinates. In this paper, we develop technology that automatically detects centers of lanes from the road-facing cameras of RoSSAV. The proposed algorithm defines line-support regions by grouping pixels with similar edge orientation and magnitude together and extracts a line from each line support region by planar fitting. Then if extracted lines and the region in-between satisfy the criteria of brightness and width, we decide this region as lane. The proposed algorithm was more precise and stable than the previously proposed algorithm based on brightness threshold method. Experiments with real road scenes confirmed that lane was effectively extracted by the proposed algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3710-3717
• /
• 1999

For the development of unmanned autonomous vehicle, it is essential to detect obstacles, especially vehicles, in the forward direction of navigation. In order to reliably exclude regions that do not contain obstacles and save a considerable amount of computational effort, it is often necessary to confine computation only to ROI(region of interest)s. A ROI is usually chosen as the interior region of the lane. We propose a computationally simple and efficient method for the detection of lanes based on Hough transform and quadratic curve fitting. The proposed method first employs Hough transform to get approximate locations of lanes, and then applies quadratic curve fitting to the locations computed by Hough transform. We have experimented the proposed method on real outdoor road scene. Experimental results show that our method gives accurate detection of straight and curve lanes, and is computationally very efficient.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.1
• /
• pp.1-6
• /
• 2014

Most of the previous algorithms focus on computing the convex hull for a set of points. In this paper, we present a method for approximating the convex hull for a set of spheres with various radii in discrete space. Computing the convex hull for a set of spheres is a base technology for many applications that study structural properties of molecules. We present a voxel map data structures, where the molecule is represented as a set of spheres, and corresponding algorithms. Based on CUDA programming for using the parallel architecture of GPU, our algorithm takes less than 40ms for computing the convex hull of 6,400 spheres in average.