• Title/Summary/Keyword: Computation process

Search Result 1,095, Processing Time 0.029 seconds

Density Adaptive Grid-based k-Nearest Neighbor Regression Model for Large Dataset (대용량 자료에 대한 밀도 적응 격자 기반의 k-NN 회귀 모형)

  • Liu, Yiqi;Uk, Jung
    • Journal of Korean Society for Quality Management
    • /
    • v.49 no.2
    • /
    • pp.201-211
    • /
    • 2021
  • Purpose: This paper proposes a density adaptive grid algorithm for the k-NN regression model to reduce the computation time for large datasets without significant prediction accuracy loss. Methods: The proposed method utilizes the concept of the grid with centroid to reduce the number of reference data points so that the required computation time is much reduced. Since the grid generation process in this paper is based on quantiles of original variables, the proposed method can fully reflect the density information of the original reference data set. Results: Using five real-life datasets, the proposed k-NN regression model is compared with the original k-NN regression model. The results show that the proposed density adaptive grid-based k-NN regression model is superior to the original k-NN regression in terms of data reduction ratio and time efficiency ratio, and provides a similar prediction error if the appropriate number of grids is selected. Conclusion: The proposed density adaptive grid algorithm for the k-NN regression model is a simple and effective model which can help avoid a large loss of prediction accuracy with faster execution speed and fewer memory requirements during the testing phase.

Bayesian Estimation of Uniformly Stochastically Ordered Distributions with Square Loss

  • Oh, Myong-Sik
    • Communications for Statistical Applications and Methods
    • /
    • v.18 no.3
    • /
    • pp.295-300
    • /
    • 2011
  • The Bayesian nonparametric estimation of two uniformly stochastically ordered distributions is studied. We propose a restricted Dirichlet Process. Among many types of restriction we consider only uniformly stochastic ordering in this paper since the computation of integrals is relatively easy. An explicit expression of the posterior distribution is given. When square loss function is used the posterior distribution can be obtained by easy integration using some computer program such as Mathematica.

An overlapping decomposed filter for INS initial alignment (관성항법장치의 초기정렬을 위한 중복 분해 필터)

  • 박찬국;이장규
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1991.10a
    • /
    • pp.136-141
    • /
    • 1991
  • An Overlapping Decomposed Filter(ODF) accomplishing an initial alignment of an INS is proposed in this paper. The proposed filter improves the observable condition and reduces the filtering computation time. Its good performance has been verified by simulation. Completely observable and controllable conditions of INS error model derived from psi-angle approach are introduced under varying sensor characteristics vary. The east components of gyro and accelerometer have to be the first order markov process and the rest of them are the characteristics of the random walk or first order markov process.

  • PDF

Adaptive Formulation of the Transition Matrix of Markovian Mobile Communication Channels

  • Park, Seung-Keun
    • The Journal of the Acoustical Society of Korea
    • /
    • v.16 no.3E
    • /
    • pp.32-36
    • /
    • 1997
  • This study models mobile communication channels as a discrete finite Markovian process, and Markovian jump linear system having parallel Kalman filter type is applied. What is newly proposed in this paper is an equation for obtaining the transition matrix according to sampling time by using a weighted Gaussian sum approximation and its simple calculation process. Experiments show that the proposed method has superior performance and reuires computation compared to the existing MJLS using the ransition matrix given by a statistical method or from priori information.

  • PDF

Shape Optimization of Waveguide Tee Junction in H-plane (자기 평면 도파관 소자의 최적형상설)

  • 이홍배;한송엽;천창열
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.43 no.6
    • /
    • pp.1020-1026
    • /
    • 1994
  • This paper presents a technique to optimize the shape of waveguide components in H-plane. The technique utilizes the numerical optimization process which employs the vector finite element method. In the optimization process, the sensitivity of an objective function with respect to design variables is computed by introducting adjoint variables, which makes the computation easy. The steepest descent method is then employed to update design variables. As a numerical example, an H-plane waveguide teejunction was considered to obtain optimized shape. Comparison between the initial and optimized shape was made.

REGENERATIVE BOOTSTRAP FOR SIMULATION OUTPUT ANALYSIS

  • Kim, Yun-Bae
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2001.05a
    • /
    • pp.169-169
    • /
    • 2001
  • With the aid of fast computing power, resampling techniques are being introduced for simulation output analysis (SOA). Autocorrelation among the output from discrete-event simulation prohibit the direct application of resampling schemes (Threshold bootstrap, Binary bootstrap, Stationary bootstrap, etc) extend its usage to time-series data such as simulation output. We present a new method for inference from a regenerative process, regenerative bootstrap, that equals or exceeds the performance of classical regenerative method and approximation regeneration techniques. Regenerative bootstrap saves computation time and overcomes the problem of scarce regeneration cycles. Computational results are provided using M/M/1 model.

  • PDF

An Enhanced Search Algorithm for Fast Motion Estimation using Sub-Pixel (부화소 단위의 빠른 움직임 예측을 위한 개선된 탐색 알고리즘)

  • Kim, Dae-Gon;Yoo, Cheol-Jung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.12
    • /
    • pp.103-112
    • /
    • 2011
  • Motion estimation (ME) is regarded as an important component in a video encoding process, because it consumes a large computation complexity. H.264/AVC requires additional computation overheads for fractional search and interpolation. This causes a problem that computational complexity is increased. In Motion estimation, SATD(Sum of Transform Difference) has the characteristics of a parabolic based on the minimum point. In this paper, we propose new prediction algorithm to reduce search point in motion estimation by sub-pixel interpolation characteristics. The proposed algorithm reduces the time of encoding process by decreasing computational complexity. Experimental results show that the proposed method reduces 20% of the computation complexity of motion estimation, while the degradation in video quality is negligible.

Forging Defects Analysis by Full 3-Dimensional Simulation based on F.V.M. (단조품 결함에 대한삼차원 단조 공정 해석)

  • 박승희;제정신
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 2003.05a
    • /
    • pp.216-220
    • /
    • 2003
  • Most important for meaningful forging simulation is the determination of correct process parameters. In addition a check and a compensation of the data base after the comparison between experiments and the computation of the developed process is necessary. The existence of a systematic process parameter data bank for special kinds of forming process in combination with forging specific simulation lifts the value of the products. Finite volume method is applied to simulate the hot forging process to investigate the defects for the automobile product. Three typical forging processes have been investigated; Extrusion by hydrolic press, Upsetting by crank press and Inclined upsetting by hammer press. Simulated result has compared with the experiment and provided a direction to improve the process.

  • PDF

A hybrid algorithm for the synthesis of computer-generated holograms

  • Nguyen The Anh;An Jun Won;Choe Jae Gwang;Kim Nam
    • Proceedings of the Optical Society of Korea Conference
    • /
    • 2003.07a
    • /
    • pp.60-61
    • /
    • 2003
  • A new approach to reduce the computation time of genetic algorithm (GA) for making binary phase holograms is described. Synthesized holograms having diffraction efficiency of 75.8% and uniformity of 5.8% are proven in computer simulation and experimentally demonstrated. Recently, computer-generated holograms (CGHs) having high diffraction efficiency and flexibility of design have been widely developed in many applications such as optical information processing, optical computing, optical interconnection, etc. Among proposed optimization methods, GA has become popular due to its capability of reaching nearly global. However, there exits a drawback to consider when we use the genetic algorithm. It is the large amount of computation time to construct desired holograms. One of the major reasons that the GA' s operation may be time intensive results from the expense of computing the cost function that must Fourier transform the parameters encoded on the hologram into the fitness value. In trying to remedy this drawback, Artificial Neural Network (ANN) has been put forward, allowing CGHs to be created easily and quickly (1), but the quality of reconstructed images is not high enough to use in applications of high preciseness. For that, we are in attempt to find a new approach of combiningthe good properties and performance of both the GA and ANN to make CGHs of high diffraction efficiency in a short time. The optimization of CGH using the genetic algorithm is merely a process of iteration, including selection, crossover, and mutation operators [2]. It is worth noting that the evaluation of the cost function with the aim of selecting better holograms plays an important role in the implementation of the GA. However, this evaluation process wastes much time for Fourier transforming the encoded parameters on the hologram into the value to be solved. Depending on the speed of computer, this process can even last up to ten minutes. It will be more effective if instead of merely generating random holograms in the initial process, a set of approximately desired holograms is employed. By doing so, the initial population will contain less trial holograms equivalent to the reduction of the computation time of GA's. Accordingly, a hybrid algorithm that utilizes a trained neural network to initiate the GA's procedure is proposed. Consequently, the initial population contains less random holograms and is compensated by approximately desired holograms. Figure 1 is the flowchart of the hybrid algorithm in comparison with the classical GA. The procedure of synthesizing a hologram on computer is divided into two steps. First the simulation of holograms based on ANN method [1] to acquire approximately desired holograms is carried. With a teaching data set of 9 characters obtained from the classical GA, the number of layer is 3, the number of hidden node is 100, learning rate is 0.3, and momentum is 0.5, the artificial neural network trained enables us to attain the approximately desired holograms, which are fairly good agreement with what we suggested in the theory. The second step, effect of several parameters on the operation of the hybrid algorithm is investigated. In principle, the operation of the hybrid algorithm and GA are the same except the modification of the initial step. Hence, the verified results in Ref [2] of the parameters such as the probability of crossover and mutation, the tournament size, and the crossover block size are remained unchanged, beside of the reduced population size. The reconstructed image of 76.4% diffraction efficiency and 5.4% uniformity is achieved when the population size is 30, the iteration number is 2000, the probability of crossover is 0.75, and the probability of mutation is 0.001. A comparison between the hybrid algorithm and GA in term of diffraction efficiency and computation time is also evaluated as shown in Fig. 2. With a 66.7% reduction in computation time and a 2% increase in diffraction efficiency compared to the GA method, the hybrid algorithm demonstrates its efficient performance. In the optical experiment, the phase holograms were displayed on a programmable phase modulator (model XGA). Figures 3 are pictures of diffracted patterns of the letter "0" from the holograms generated using the hybrid algorithm. Diffraction efficiency of 75.8% and uniformity of 5.8% are measured. We see that the simulation and experiment results are fairly good agreement with each other. In this paper, Genetic Algorithm and Neural Network have been successfully combined in designing CGHs. This method gives a significant reduction in computation time compared to the GA method while still allowing holograms of high diffraction efficiency and uniformity to be achieved. This work was supported by No.mOl-2001-000-00324-0 (2002)) from the Korea Science & Engineering Foundation.

  • PDF

Hologram Generation Acceleration Method Using GPGPU (GPGPU를 이용한 홀로그램 생성 가속화 방법)

  • Lee, Yoon-Hyuk;Kim, Dong-Wook;Seo, Young-Ho
    • Journal of Broadcast Engineering
    • /
    • v.22 no.6
    • /
    • pp.800-807
    • /
    • 2017
  • A large amount of computation is required to generate a hologram using a computer. In order to accelerate the computation, many methods of acceleration by parallel programming using GPGPU(General Purpose computing on Graphic Process Unit) have been researched. In this paper, we propose a method of reducing the bottleneck caused by hologram pixel based parallel processing and using the shareable variables. We also propose how to optimize using Visual Profiler supported by nVidia's CUDA to make threads work optimally. The experimental results show that the proposed method reduces the calculation time by up to 40% compared with the existing research.