• Title/Summary/Keyword: Computation amount

Search Result 604, Processing Time 0.034 seconds

Mismatching Refinement with Domain Decomposition and Its Application to the Finite Element Analysis of the Extrusion Process (영역분할에 의한 격자세분화 기법 및 압출공정의 유한요소해석에의 적용)

  • Park, Keun;Yang, Dong-Yol
    • Transactions of Materials Processing
    • /
    • v.8 no.3
    • /
    • pp.284-293
    • /
    • 1999
  • The rigid-plastic finite element analysis requires a large amount of computation time due to its non-linearity. For economic computation, mismatching refinement, and efficient domain decomposition method with different mesh density for each sub domain, is developed. A modified velocity alternating scheme for the interface treatment is proposed in order to obtain good convergence and accuracy. As a numerical example, the axisymmetric extrusion process is analyzed. The results are discussed for the various velocity update schemes form the viewpoint of convergence and accuracy. The three-dimen-sional extrusion process with rectangular section is analyzed in order to verify the effectiveness of the proposed method. Comparing the results with those of the conventional method of full region analysis, the accuracy and the computational efficiency of the proposed method are then discussed.

  • PDF

A Novel Method for Bitrate Control within Macroblocks Using Kalman and FIR Filters

  • Seok, Jin-Wuk;Yoon, Ki-Song;Kim, Bum-Ho;Lee, Jeong-Woo
    • ETRI Journal
    • /
    • v.33 no.4
    • /
    • pp.641-644
    • /
    • 2011
  • In this letter, we propose a novel bitrate control, using both Kalman and FIR filters, based on a Hamiltonian analysis with respect to the amount of bits from each macroblock, in an encoding of a general video codec such as H.264/AVC. Since the proposed bitrate control is based on the simple computation of an optimal control method based on the Hamiltonian analysis, it is not necessary to use additional computation, such as a DCT or quantization, to estimate the bits for bitrate control. As a result, the proposed algorithm can be applied to single-pass encoding and can provide sufficient encoding speed with respect to various applications, even those requiring real-time control.

An Improved Multiple Interval Pixel Sampling based Background Subtraction Algorithm (개선된 다중 구간 샘플링 배경제거 알고리즘)

  • Mahmood, Muhammad Tariq;Choi, Young Kyu
    • Journal of the Semiconductor & Display Technology
    • /
    • v.18 no.3
    • /
    • pp.1-6
    • /
    • 2019
  • Foreground/background segmentation in video sequences is often one of the first tasks in machine vision applications, making it a critical part of the system. In this paper, we present an improved sample-based technique that provides robust background image as well as segmentation mask. The conventional multiple interval sampling (MIS) algorithm have suffer from the unbalance of computation time per frame and the rapid change of confidence factor of background pixel. To balance the computation amount, a random-based pixel update scheme is proposed and a spatial and temporal smoothing technique is adopted to increase reliability of the confidence factor. The proposed method allows the sampling queue to have more dispersed data in time and space, and provides more continuous and reliable confidence factor. Experimental results revealed that our method works well to estimate stable background image and the foreground mask.

Block Matching Algorithm Using Pixels Selected by Image Complexity (영상 복잡도에 따라 선택된 화소들을 이용한 블록 정합 알고리즘)

  • Kim Seong-hee;Oh Jeong-su
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.8
    • /
    • pp.1703-1708
    • /
    • 2005
  • This paper proposes a modified block matching algorithm which reduces an amount of matching computation by using only pixels contributing greatly to block matching. In consideration of algorithm implementation and additional informatirm, the proposed algorithm divides a matching block into sub-blocks, selects some sub-blocks using their complexities, and execute the block mating with them. Simulation results show that the proposed algorithm performs a valid block matching, diminishing computation cost.

Development of Nonlinear Inverter Model for Fast Dynamic Analysis of Electric Power Steering with PMSM Drive System (자동차 전자식 조향장치용 PMSM 구동 시스템의 신속한 동적해석을 위한 비선형 인버터 모델 개발)

  • Choi, Chin-Chul;Lee, Woo-Tiak;Hong, Jeong-Pyo
    • Proceedings of the KIEE Conference
    • /
    • 2007.07a
    • /
    • pp.1132-1133
    • /
    • 2007
  • A circuit-domain model of PWM inverter provides accurate simulation results in consideration of detail switching characteristics. Although, a huge amount of computation time is demanded for the simulation results of several ten seconds, which is the required time to analyze system behaviors or control performances of Electric Power Steering(EPS) on real drive condition. This paper describes the nonlinear inverter model for fast dynamic simulation of EPS without the PWM concept through analyzing the effect of nonlinear switching characteristics like dead time, forward voltage drop and conduction resistance. Some inverter models including proposed model are compared from two standpoints which are computation time and accuracy. The comparison results show the usefulness of the developed model in order to develop the control algorithm through the fast prediction of system behaviors.

  • PDF

Fast 3D reconstruction method based on UAV photography

  • Wang, Jiang-An;Ma, Huang-Te;Wang, Chun-Mei;He, Yong-Jie
    • ETRI Journal
    • /
    • v.40 no.6
    • /
    • pp.788-793
    • /
    • 2018
  • 3D reconstruction of urban architecture, land, and roads is an important part of building a "digital city." Unmanned aerial vehicles (UAVs) are gradually replacing other platforms, such as satellites and aircraft, in geographical image collection; the reason for this is not only lower cost and higher efficiency, but also higher data accuracy and a larger amount of obtained information. Recent 3D reconstruction algorithms have a high degree of automation, but their computation time is long and the reconstruction models may have many voids. This paper decomposes the object into multiple regional parallel reconstructions using the clustering principle, to reduce the computation time and improve the model quality. It is proposed to detect the planar area under low resolution, and then reduce the number of point clouds in the complex area.

Rapid Calculation of CGH Using the Multiplication of Down-scaled CGH with Shifted Concave Lens Array Function

  • Lee, Chang-Joo;Lee, Seung-Yeol
    • Current Optics and Photonics
    • /
    • v.6 no.1
    • /
    • pp.51-59
    • /
    • 2022
  • Holographic display technology is one of the promising 3D display technologies. However, the large amount of computation time required to generate computer-generated holograms (CGH) is a major obstacle to the commercialization of digital hologram. In various systems such as multi-depth head-up-displays with hologram contents, it is important to transmit hologram data in real time. In this paper, we propose a rapid CGH computation method by applying an arraying of a down-scaled hologram with the multiplication of a shifted concave lens function array. Compared to conventional angular spectrum method (ASM) calculation, we achieved about 39 times faster calculation speed for 3840 × 2160 pixel CGH calculation. Through the numerical investigation and experiments, we verified the degradation of reconstructed hologram image quality made by the proposed method is not so much compared to conventional ASM.

A Study on the Alternative Method of Video Characteristics Using Captioning in Text-Video Retrieval Model (텍스트-비디오 검색 모델에서의 캡션을 활용한 비디오 특성 대체 방안 연구)

  • Dong-hun, Lee;Chan, Hur;Hyeyoung, Park;Sang-hyo, Park
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.17 no.6
    • /
    • pp.347-353
    • /
    • 2022
  • In this paper, we propose a method that performs a text-video retrieval model by replacing video properties using captions. In general, the exisiting embedding-based models consist of both joint embedding space construction and the CNN-based video encoding process, which requires a lot of computation in the training as well as the inference process. To overcome this problem, we introduce a video-captioning module to replace the visual property of video with captions generated by the video-captioning module. To be specific, we adopt the caption generator that converts candidate videos into captions in the inference process, thereby enabling direct comparison between the text given as a query and candidate videos without joint embedding space. Through the experiment, the proposed model successfully reduces the amount of computation and inference time by skipping the visual processing process and joint embedding space construction on two benchmark dataset, MSR-VTT and VATEX.

Computational Cost Reduction Method for HQP-based Hierarchical Controller for Articulated Robot (다관절 로봇의 계층적 제어를 위한 HQP의 연산 비용 감소 방법)

  • Park, Mingyu;Kim, Dongwhan;Oh, Yonghwan;Lee, Yisoo
    • The Journal of Korea Robotics Society
    • /
    • v.17 no.1
    • /
    • pp.16-24
    • /
    • 2022
  • This paper presents a method that can reduce the computational cost of the hierarchical quadratic programming (HQP)-based robot controller. Hierarchical controllers can effectively manage articulated robots with many degrees of freedom (DoFs) to perform multiple tasks. The HQP-based controller is one of the generic hierarchical controllers that can provide a control solution guaranteeing strict task priority while handling numerous equality and inequality constraints. However, according to a large amount of computation, it can be a burden to use it for real-time control. Therefore, for practical use of the HQP, we propose a method to reduce the computational cost by decreasing the size of the decision variable. The computation time and control performance of the proposed method are evaluated by real robot experiments with a 15 DoFs dual-arm manipulator.

A Fast Normalized Cross-Correlation Computation for WSOLA-based Speech Time-Scale Modification (WSOLA 기반의 음성 시간축 변환을 위한 고속의 정규상호상관도 계산)

  • Lim, Sangjun;Kim, Hyung Soon
    • The Journal of the Acoustical Society of Korea
    • /
    • v.31 no.7
    • /
    • pp.427-434
    • /
    • 2012
  • The overlap-add technique based on waveform similarity (WSOLA) method is known to be an efficient high-quality algorithm for time scaling of speech signal. The computational load of WSOLA is concentrated on the repeated normalized cross-correlation (NCC) calculation to evaluate the similarity between two signal waveforms. To reduce the computational complexity of WSOLA, this paper proposes a fast NCC computation method, in which NCC is obtained through pre-calculated sum tables to eliminate redundancy of repeated NCC calculations in the adjacent regions. While the denominator part of NCC has much redundancy irrespective of the time-scale factor, the numerator part of NCC has less redundancy and the amount of redundancy is dependent on both the time-scale factor and optimal shift value, thereby requiring more sophisticated algorithm for fast computation. The simulation results show that the proposed method reduces about 40%, 47% and 52% of the WSOLA execution time for the time-scale compression, 2 and 3 times time-scale expansions, respectively, while maintaining exactly the same speech quality of the conventional WSOLA.