• Title/Summary/Keyword: Computation amount

Search Result 604, Processing Time 0.025 seconds

A Study on the Crashworthiness for Passenger Compartment of High Speed Train (고속전철 승객 탑승부의 충돌 안전도 평가에 관한 연구)

  • 김상범;김헌영;박제승;한동철
    • Proceedings of the KSR Conference
    • /
    • 2001.10a
    • /
    • pp.198-204
    • /
    • 2001
  • Train crashes involve complex interaction between deformable bodies in multiple collisions. The purpose of this study is to suggest the effective analytical procedure using hybrid model for the crashworthiness of motorized trailer of high speed train. The hybrid approach, with very short modeling times and reduced computation times to extract the global behaviour and to perform a pre-optimization of the considered structure. Firstly, various types of crash events are investigated and the conditions for numerical simulation are defined. In this paper, the structural crashwonhiness of Korean High Speed Train trailer was examined through FE analysis. Crash analyses on energy absorbing part and safety zone were carried out to determine each section force. Rollover analysis was performed to observe the amount of intrusion in the passenger's area in case of rollover accident.

  • PDF

Parametric Macro for Two-Dimensional Layout on the Auto-CAD System

  • Kim, Yunyong;Park, Jewoong
    • Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
    • /
    • 2000.10a
    • /
    • pp.253-260
    • /
    • 2000
  • In recent years, a number of successful nesting approaches have been developed by using the various heuristic algorithms, and due to their application potential several commercial CAD/CAM packages include a nesting module for solving the layout problem. Since a large portion of the complexity of the part nesting problem results from the overlapping computation, the geometric representation is one of the most important factors to reduce the complexity of the problem. The proposed part representation method can easily handle parts and raw materials with widely varying geometrical shape by using the redesigning modules. This considerably reduces the amount of processed data and consequently the run time of the computer. The aim of this research is to develop parametric macro for two-dimensional layout on the Auto-CAD system. Therefore, this research can be called "pre-nesting".

  • PDF

Multi-Pulse Amplitude and Location Estimation by Maximum-Likelihood Estimation in MPE-LPC Speech Synthesis (MPE-LPC음성합성에서 Maximum- Likelihood Estimation에 의한 Multi-Pulse의 크기와 위치 추정)

  • 이기용;최홍섭;안수길
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.9
    • /
    • pp.1436-1443
    • /
    • 1989
  • In this paper, we propose a maximum-likelihood estimation(MLE) method to obtain the location and the amplitude of the pulses in MPE( multi-pulse excitation)-LPC speech synthesis using multi-pulses as excitation source. This MLE method computes the value maximizing the likelihood function with respect to unknown parameters(amplitude and position of the pulses) for the observed data sequence. Thus in the case of overlapped pulses, the method is equivalent to Ozawa's crosscorrelation method, resulting in equal amount of computation and sound quality with the cross-correlation method. We show by computer simulation: the multi-pulses obtained by MLE method are(1) pseudo-periodic in pitch in the case of voicde sound, (2) the pulses are random for unvoiced sound, (3) the pulses change from random to periodic in the interval where the original speech signal changes from unvoiced to voiced. Short time power specta of original speech and syunthesized speech obtained by using multi-pulses as excitation source are quite similar to each other at the formants.

  • PDF

Fast adaptive block matching algorithm for motion vector estimation (움직임 벡터 추정을 위한 고속 적응 블럭 정합 알고리즘)

  • 신용달;이승진;김경규;정원식;김영춘;이봉락;장종국;이건일
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.9
    • /
    • pp.77-83
    • /
    • 1997
  • We present a fast adaptive block matching algorithm using variable search area and subsampling to estimate motion vector more exactly. In the presented method, the block is classified into one of three motion categories: zero motion vector block, medium-motion bolck or high-motion block according to mean absolute difference of the block. By the simulation, the computation amount of the presented methoe comparable to three step search algorithm and new three step search algorithm. In the fast image sequence, the PSNR of our algorithm increased more than TSS and NTSS, because our algorithm estimated motion vector more accurately.

  • PDF

A Study on Speech Recognition using GAVQ(Genetic Algorithms Vector Quantization) (GAVQ를 이용한 음성인식에 관한 연구)

  • Lee, Sang-Hee;Lee, Jae-Kon;Jeong, Ho-Kyoun;Kim, Yong-Yun;Nam, Jae-Sung
    • Journal of Industrial Technology
    • /
    • v.19
    • /
    • pp.209-216
    • /
    • 1999
  • In this paper, we proposed a modofied genetic algorithm to minimize misclassification rate for determining the codebook. Genetic algorithms are adaptive methods which may be used solve search and optimization problems based on the genetic processes of biological organisms. But they generally require a large amount of computation efforts. GAVQ can choose the optimal individuals by genetic operators. The position of individuals are optimized to improve the recognition rate. The technical properties of this study is that prevents us from the local minimum problem, which is not avoidable by conventional VQ algorithms. We compared the simulation result with Matlab using phoneme data. The simulation results show that the recognition rate from GAVQ is improved by comparing the conventional VQ algorithms.

  • PDF

Panoramic Image Stitching Using Feature Extracting and Matching on Embedded System

  • Lee, June-Hwan
    • Transactions on Electrical and Electronic Materials
    • /
    • v.18 no.5
    • /
    • pp.273-278
    • /
    • 2017
  • Recently, one of the areas where research is being actively conducted is the Internet of Things (IoT). The field of using the Internet of Things system is increasing, coupled with a remarkable increase of the use of the camera. However, general cameras used in the Internet of Things have limited viewing angles as compared to those available to the human eye. Also, cameras restrict observation of objects and the performance of observation. Therefore, in this paper, we propose a panoramic image stitching method using feature extraction and matching based on an embedded system. After extracting the feature of the image, the speed of image stitching is improved by reducing the amount of computation using the necessary information so that it can be used in the embedded system. Experimental results show that it is possible to improve the speed of feature matching and panoramic image stitching while generating a smooth image.

Efficiency Enhancement of CFDS Code (CFDS 코드의 효율성 개선)

  • Kim J. G.;Lee J.;Kim C.;Hong S. K.;Lee K. S.;Ahn C. S.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2005.04a
    • /
    • pp.123-127
    • /
    • 2005
  • The numerical analyses of the complicated flows are widely attempted in these days. Because of the enormous demanding memory and calculation time, parallel processing is used for these problems. In order to obtain calculation efficiency, it is important to choose proper domain decomposition technique and numerical algorithm. In this research we enhanced the efficiency of the CFDS code developed by ADD, using parallel computation and newly developed numerical algorithms. For the huge amount of data transfer between blocks non-blocking method is used, and newly developed data transfer algorithm is used for non-aligned block interface. Recently developed RoeM scheme is adpoted as a spatial difference method, and AF-ADI and LU-SGS methods are used as a time integration method to enhance the convergence of the code. Analyses of the flows around the ONERA M6 wing and the high angle of attack missile configuration are performed to show the efficiency improvement.

  • PDF

Integrated Inventory-Distribution Planning in a (1 : N) Supply Chain System with Heterogeneous Vehicles Incorporated

  • Kim, Eun-Seok;Lee, Ik-Sun
    • Management Science and Financial Engineering
    • /
    • v.17 no.2
    • /
    • pp.1-21
    • /
    • 2011
  • This paper considers an integrated inventory-distribution system with a fleet of heterogeneous vehicles employed where a single warehouse distributes a single type of products to many spatially distributed retailers to satisfy their dynamic demands. The problem is to determine order planning at the warehouse, and also vehicle schedules and delivery quantities for the retailers with the objective of minimizing the sum of ordering cost at the warehouse, inventory holding cost at both the warehouse and retailers, and transportation cost. For the problem, we give a Mixed Integer Programming formulation and develop a Lagrangean heuristic procedure for computing lower and upper bounds on the optimal solution value. The Lagrangean dual problem of finding the best Lagrangrean lower bound is solved by subgradient optimization. Computational experiments on randomly generated test problems showed that the suggested algorithm gives relatively good solutions in a reasonable amount of computation time.

Contrast Enhancement Algorithm Using Temporal Decimation Method (영상의 공간적 축소방법을 이용한 콘트라스트 향상 알고리즘)

  • Yun Jong-Ho;Cho Hwa-Hyun;Park Jin-Sung;Choi Myung-Ryul;Choi In-Seok
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.9
    • /
    • pp.1187-1194
    • /
    • 2005
  • In this paper, new contrast enhancement algorithms that use temporal decimation method and approximated CDF(Cumulative Distribution Function) are proposed. They reduce the amount of computation which is required for image contrast enhancement. Simulation results show that the algorithms can achieve significant reduction in the computational cost and the hardware complexity. Visual test and standard deviation of their histogram have been introduced to evaluate the resultant output images of the proposed method and the original ones.

  • PDF

Lip Region Extraction by Gaussian Classifier (가우스 분류기를 이용한 입술영역 추출)

  • Kim, Jeong Yeop
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.2
    • /
    • pp.108-114
    • /
    • 2017
  • Lip reading is a field of image processing to assist the process of sound recognition. In some environment, the capture of sound signal usually has significant noise and therefore, the recognition rate of sound signal decreases. Lip reading can be a good feature for the increase of recognition rates. Conventional lip extraction methods have been proposed widely. Maia et. al. proposed a method by the sum of Cr and Cb. However, there are two problems as follows: the point with maximum saturation is not always regarded as lips region and the inner part of lips such as oral cavity and teeth can be classified as lips. To solve these problems, this paper proposes a method which adopts the histogram-based classifier for the extraction of lips region. The proposed method consists of two stages, learning and test. The amount of computation is minimized because this method has no color conversion. The performance of proposed method gives 66.8% of detection rate compared to 28% of conventional ones.