• Title/Summary/Keyword: computation time reduction

Search Result 221, Processing Time 0.033 seconds

A Study On Memory Optimization for Applying Deep Learning to PC (딥러닝을 PC에 적용하기 위한 메모리 최적화에 관한 연구)

  • Lee, Hee-Yeol;Lee, Seung-Ho
    • Journal of IKEEE
    • /
    • v.21 no.2
    • /
    • pp.136-141
    • /
    • 2017
  • In this paper, we propose an algorithm for memory optimization to apply deep learning to PC. The proposed algorithm minimizes the memory and computation processing time by reducing the amount of computation processing and data required in the conventional deep learning structure in a general PC. The algorithm proposed in this paper consists of three steps: a convolution layer configuration process using a random filter with discriminating power, a data reduction process using PCA, and a CNN structure creation using SVM. The learning process is not necessary in the convolution layer construction process using the discriminating random filter, thereby shortening the learning time of the overall deep learning. PCA reduces the amount of memory and computation throughput. The creation of the CNN structure using SVM maximizes the effect of reducing the amount of memory and computational throughput required. In order to evaluate the performance of the proposed algorithm, we experimented with Yale University's Extended Yale B face database. The results show that the algorithm proposed in this paper has a similar performance recognition rate compared with the existing CNN algorithm. And it was confirmed to be excellent. Based on the algorithm proposed in this paper, it is expected that a deep learning algorithm with many data and computation processes can be implemented in a general PC.

A Study on the Frequency Scaling Methods Using LSP Parameters Distribution Characteristics (LSP 파라미터 분포특성을 이용한 주파수대역 조절법에 관한 연구)

  • 민소연;배명진
    • The Journal of the Acoustical Society of Korea
    • /
    • v.21 no.3
    • /
    • pp.304-309
    • /
    • 2002
  • We propose the computation reduction method of real root method that is mainly used in the CELP (Code Excited Linear Prediction) vocoder. The real root method is that if polynomial equations have the real roots, we are able to find those and transform them into LSP. However, this method takes much time to compute, because the root searching is processed sequentially in frequency region. In this paper, to reduce the computation time of real root, we compare the real root method with two methods. In first method, we use the mal scale of searching frequency region that is linear below 1 kHz and logarithmic above. In second method, The searching frequency region and searching interval are ordered by each coefficient's distribution. In order to compare real root method with proposed methods, we measured the following two. First, we compared the position of transformed LSP (Line Spectrum Pairs) parameters in the proposed methods with these of real root method. Second, we measured how long computation time is reduced. The experimental results of both methods that the searching time was reduced by about 47% in average without the change of LSP parameters.

Fast and Efficient FDTD Analysis for Microstrip Structures (마이크로스트립 구조에 대한 빠르고 효율적인 FDTD 해석)

  • 우종우;윤현보
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.11 no.8
    • /
    • pp.1297-1304
    • /
    • 2000
  • The full wave method requires a great number of computer memory and lasting long CPU time for the calculation of the discontinuity problems in microstrip structures. While the computation only for the transverse field components at those structures causes the both of time and memory reduction. For the case of the calculating only transverse components for the most of microstrip structures such as low-pass filter, branch coupler and patch antenna the computer memory and running time can be reduced to about 50% and 33%, comparing to the full wave computation. Consequently, the proposed method than that of TEM-mode has an advantages of higher speed and less memory than that of conventional FDTD analysis.

  • PDF

An Application of VRS-RTK Surveying in Construction Site (건설현장에서의 VRS-RTK측량 적용성 검토)

  • Kim, In-Seup;Joo, Hyun-Seung
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.26 no.6
    • /
    • pp.625-631
    • /
    • 2008
  • Correct evaluation of cut and fill volume of soil is one of the most important factors which controls construction cost in enormous construction sites. To achieve accurate computation of soil volume in construction site precise surveying is required, however most of construction sites adopt existing optical surveying instruments such as Total Station. The problem when using these optical instruments in construction sites is that these instruments take longer time in data acquisition. Due to insufficiency of computation time accurate and precise observation cannot be accomplished with these equipments. As a result roughly calculated earthwork volume may cause arguments between contractors and supervisors in the matter of reduction or increasement of total construction cost. In this study VRS-RTK Surveying is adopted to perform fast and accurate in-situ surveying for rapid computation of soil volume. This VRS-RTK Surveying system is proved to have more accurate three dimensional coordinates with high density and better economical solution with less manpower.

A STUDY ON THERMAL MODEL REDUCTION ALGORITHM FOR SATELLITE PANEL (인공위성 패널 열해석모델 간소화 알고리즘 연구)

  • Kim, Jung-Hoon;Jun, Hyoung Yoll;Kim, Seung Jo
    • Journal of computational fluids engineering
    • /
    • v.17 no.4
    • /
    • pp.9-15
    • /
    • 2012
  • Thermal model reduction algorithms and techniques are introduced to condense a huge satellite panel thermal model into the simplified model on the purpose of calculating the thermal responses of a satellite on orbit. Guyan condensation algorithm with the substitution matrix manipulation is developed and the mathematical procedure is depicted step by step. A block-form LU decomposition method is also invited to compare the developed algorithm. The constructed reduced thermal model induced from the detailed model based on a real satellite panel is satisfying the correlation criterion of ${\pm}2^{\circ}C$ for the validity accuracy. Guyan condensation algorithm is superior to the block-form LU decomposition method on computation time.

Numerical Simulation of Natural Convection in Annuli with Internal Fins

  • Ha, Man-Yeong;Kim, Joo-Goo
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.4
    • /
    • pp.718-730
    • /
    • 2004
  • The solution for the natural convection in internally finned horizontal annuli is obtained by using a numerical simulation of time-dependent and two-dimensional governing equations. The fins existing in annuli influence the flow pattern, temperature distribution and heat transfer rate. The variations of the On configuration suppress or accelerate the free convective effects compared to those of the smooth tubes. The effects of fin configuration, number of fins and ratio of annulus gap width to the inner cylinder radius on the fluid flow and heat transfer in annuli are demonstrated by the distribution of the velocity vector, isotherms and streamlines. The governing equations are solved efficiently by using a parallel implementation. The technique is adopted for reduction of the computation cost. The parallelization is performed with the domain decomposition technique and message passing between sub-domains on the basis of the MPI library. The results from parallel computation reveal in consistency with those of the sequential program. Moreover, the speed-up ratio shows linearity with the number of processor.

Efficient Computations for Evaluating Extended Stochastic Petri Nets using Algebraic Operations

  • Kim, Dong-Sung;Moon, Hong-Ju;Bahk, Je-Hyeong;Kwon, Wook-Hyun;Zygmunt J. Haas
    • International Journal of Control, Automation, and Systems
    • /
    • v.1 no.4
    • /
    • pp.431-443
    • /
    • 2003
  • This paper presents an efficient method to evaluate the performance of an extended stochastic Petri net by simple algebraic operations. The reachability graph is derived from an extended stochastic Petri net, and then converted to a timed stochastic state machine, using a semi-Markov process. The n-th moments of the performance index are derived by algebraic manipulations with each of the n-th moments of transition time and transition probability. For the derivation, three reduction rules are introduced on the transition trajectories in a well-formed regular expression. Efficient computation algorithms are provided to automate the suggested method. The presented method provides a proficient means to derive both the numerical and the symbolic solutions for the performance of an extended stochastic Petri net by simple algebraic manipulations.

Robust and Efficient 3D Model of an Electromagnetic Induction (EMI) Sensor

  • Antoun, Chafic Abu;Perriard, Yves
    • Journal of international Conference on Electrical Machines and Systems
    • /
    • v.3 no.3
    • /
    • pp.325-330
    • /
    • 2014
  • Eddy current induction is used in a wide range of electronic devices, for example in detection sensors. Due to the advances in computer hardware and software, the need for 3D computation and system comprehension is a requirement to develop and optimize such devices nowadays. Pure theoretical models are mostly limited to special cases. On the other hand, the classical use of commercial Finite Element (FE) electromagnetic 3D models is not computationally efficient and lacks modeling flexibility or robustness. The proposed approach focuses on: (1) implementing theoretical formulations in 3D (FE) model of a detection device as well as (2) an automatic Volumetric Estimation Method (VEM) developed to selectively model the target finite elements. Due to these two approaches, this model is suitable for parametric studies and optimization of the number, location, shape, and size of PCB receivers in order to get the desired target discrimination information preserving high accuracy with tenfold reduction in computation time compared to commercial FE software.

Reactor State Estimation and Control using Kalman Filter (칼만필터를 이용한 원자로 상태 추정 및 제어)

  • Chung, Dae-Won;Kim, Kern-Joong
    • Proceedings of the KIEE Conference
    • /
    • 1997.07b
    • /
    • pp.600-602
    • /
    • 1997
  • The kalman filter which has good estimating capabilities by means of the recursive computation from the previously known of obtained data is usually used for the system estimation in the case of not being directly measurable. The best estimating technique is still open issues on the PWR reactor control system to increase operating contingencies and to predict the safety margins for safer reactor operation. This paper addressed its estimating technique using kalman filter for the more flexible reactor control and showed the reasonable approach for discretization of the continuos-time system for reduction of computation errors.

  • PDF

Context-free Marker-controlled Watershed Transform for Over-segmentation Reduction

  • Seo, Kyung-Seok;Cho, Sang-Hyun;Park, Chang-Joon;Park, Heung-Moon
    • Proceedings of the IEEK Conference
    • /
    • 2000.07a
    • /
    • pp.482-485
    • /
    • 2000
  • A modified watershed transform is proposed which is context-free marker-controlled and minima imposition-free to reduce the over-segmentation and to speedup the transform. In contrast to the conventional methods in which a priori knowledge, such as flat zones, zones of homogeneous texture, and morphological distance, is required for marker extraction, context-free marker extraction is proposed by using the attention operator based on the GST (generalized symmetry transform). By using the context-free marker, the proposed watershed transform exploit marker-constrained labeling to speedup the computation and to reduce the over-segmentation by eliminating the unnecessary geodesic reconstruction such as the minima imposition and thereby eliminating the necessity of the post-processing of region merging. The simulation results show that the proposed method can extract context-free markers inside the objects from the complex background that includes multiple objects and efficiently reduces over-segmentation and computation time.

  • PDF