• 제목/요약/키워드: Computation time

검색결과 3,145건 처리시간 0.031초

Real-time small target detection method Using multiple filters and IPP Libraries in Infrared Images

  • Kim, Chul Joong;Kim, Jae Hyup;Jang, Kyung Hyun
    • 한국컴퓨터정보학회논문지
    • /
    • 제21권8호
    • /
    • pp.21-28
    • /
    • 2016
  • In this paper, we propose a fast small target detection method using multiple filters, and describe system implementation using IPP libraries. To detect small targets in Infra-Red images, it is mandatory that you should apply a filter to eliminate a background and identify the target information. Moreover, by using a suitable algorithm for the environments and characteristics of the target, the filter must remove the background information while maintaining the target information as possible. For this reason, in the proposed method we have detected small targets by applying multi area(spatial) filters in a low luminous environment. In order to apply the multi spatial filters, the computation time can be increased exponentially in case of the sequential operation. To build this algorithm in real-time systems, we have applied IPP library to secure a software optimization and reduce the computation time. As a result of applying real environments, we have confirmed a detection rate more than 90%, also the computation time of the proposed algorithm have been improved about 90% than a typical sequential computation time.

Real-time implementation and performance evaluation of speech classifiers in speech analysis-synthesis

  • Kumar, Sandeep
    • ETRI Journal
    • /
    • 제43권1호
    • /
    • pp.82-94
    • /
    • 2021
  • In this work, six voiced/unvoiced speech classifiers based on the autocorrelation function (ACF), average magnitude difference function (AMDF), cepstrum, weighted ACF (WACF), zero crossing rate and energy of the signal (ZCR-E), and neural networks (NNs) have been simulated and implemented in real time using the TMS320C6713 DSP starter kit. These speech classifiers have been integrated into a linear-predictive-coding-based speech analysis-synthesis system and their performance has been compared in terms of the percentage of the voiced/unvoiced classification accuracy, speech quality, and computation time. The results of the percentage of the voiced/unvoiced classification accuracy and speech quality show that the NN-based speech classifier performs better than the ACF-, AMDF-, cepstrum-, WACF- and ZCR-E-based speech classifiers for both clean and noisy environments. The computation time results show that the AMDF-based speech classifier is computationally simple, and thus its computation time is less than that of other speech classifiers, while that of the NN-based speech classifier is greater compared with other classifiers.

근사적 확률을 이용한 표적 탐색 (A Faster Algorithm for Target Search)

  • 정성진;홍성필;조성진;박명주
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2006년도 추계학술대회
    • /
    • pp.57-59
    • /
    • 2006
  • The purpose of search problem is to maximize the probability of target detection as limited search capability. Especially, as elapsing of time at a point of time of initial information received the target detection rate for searching an expected location due to a moving target such that wrecked ship or submarine decrease in these problems. The algorithm of search problem to a moving target having similar property of above targets should solve the search route as quickly as possible. In existing studies, they have a limit of applying in practice due to increasing computation time required by problem size (i.e., number of search area, search time). In this study, we provide that it takes more reasonable computation time than preceding studies even though extending a problem size practically using an approximate computation of probability.

  • PDF

6×6 자율주행 차량의 실시간 해석을 위한 연구 (A Study on the Real-Time Analysis of a 6×6 Autonomous Vehicle)

  • 조두호;이정한;이기창;유완석
    • 대한기계학회논문집A
    • /
    • 제33권12호
    • /
    • pp.1433-1441
    • /
    • 2009
  • In multibody dynamic analysis, one of the most important problems is to reduce computation times for real-time simulation. This paper presents the derivation procedure of equations of motion of a 6${\times}$6 autonomous vehicle in terms of chassis local coordinates which do not require coordinates transformation matrix to enhance efficiency for real-time dynamic analysis. Also, equations of motion are derived using the VT(velocity transformation) technique and symbolic computation method coded by MATLAB. The Jacobian matrix of the equations of motion of a system is derived from symbolic operations to apply the implicit integration method. The analysis results were compared with ADAMS results to verify the accuracy and approve the feasibility of real time analysis.

G.723.1 보코더에서 주파수 간격 정보조절을 통한 계산량 감소에 관한 연구 (A Study on Reduction of Computation Time through Adjustment the Frequency Interval Information in the G.723.1 Vocoder)

  • 민소연;김영규;배명진
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 하계종합학술대회 논문집(4)
    • /
    • pp.405-408
    • /
    • 2002
  • LSP(Line Spectrum Pairs) Parameter is used for speech analysis in vocoders or recognizers since it has advantages of constant spectrum sensitivity. low spectrum distortion and easy linear interpolation. However the method of transforming LPC(Linear Predictive Coding) into LSP is so complex that it takes much time to compute. Among conventional methods, the real root method is considerably simpler than others, but nevertheless, it still suffers from its jndeterministic computation time because the root searching is processed sequentially in frequency region. We suggest a method of reducing the LSP transformation time using voice characteristics The proposed method is to apply search order and interval differently according to the distribution of LSP parameters. in comparison with the conventional real root method, the proposed method results in about 46.5% reduction. And, the total computation time is reduce to about 5% in the G.723.1 vocoder.

  • PDF

Functional Privacy-preserving Outsourcing Scheme with Computation Verifiability in Fog Computing

  • Tang, Wenyi;Qin, Bo;Li, Yanan;Wu, Qianhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권1호
    • /
    • pp.281-298
    • /
    • 2020
  • Fog computing has become a popular concept in the application of internet of things (IoT). With the superiority in better service providing, the edge cloud has become an attractive solution to IoT networks. The data outsourcing scheme of IoT devices demands privacy protection as well as computation verification since the lightweight devices not only outsource their data but also their computation. Existing solutions mainly deal with the operations over encrypted data, but cannot support the computation verification in the same time. In this paper, we propose a data outsourcing scheme based on an encrypted database system with linear computation as well as efficient query ability, and enhance the interlayer program in the original system with homomorphic message authenticators so that the system could perform computational verifying. The tools we use to construct our scheme have been proven secure and valid. With our scheme, the system could check if the cloud provides the correct service as the system asks. The experiment also shows that our scheme could be as effective as the original version, and the extra load in time is neglectable.

디지털 펄스압축기의 연산 양 비교 (Comparison of Computation Complexity for Digital Pulse Compressor)

  • 신현익;김상규;조태훈;김환우
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
    • /
    • pp.2196-2199
    • /
    • 2003
  • With the development of digital signal processor(DSP), digital pulse compressor (DPC) is commonly used in radar systems. A DPC is implemented by using finite impulse response(FIR) filter algorithm in time domain or fast Fourier transform(FFT) algorithm in frequency domain. This paper compares the computation complexity tot these two methods and calculates boundary Fm filter taps that determine which of the two methods is better based on computation amount. Also, it shows that the boundary FIR filter taps for DSP, ADSP21060, and those for computation complexity have similar characteristic.

  • PDF

대형 차체판넬 스템핑공정에서의 동적 외연적 탄소성 유한요소해석 (Dynamic Explicit Elastic-Plastic Finite Element Analysis of Large Auto-body Panel Stamping Process)

  • 정동원;김귀식;양동열
    • 한국해양공학회지
    • /
    • 제12권1호
    • /
    • pp.10-22
    • /
    • 1998
  • In the present work the elastic-plastic FE formulations using dynamic explicit time integration schemes are used for numerical analysis of a large auto-body panel stamping processes. For analyses of more complex cases with larger and more refined meshes, the explicit method is more time effective than implicit method, and has no convergency problem and has the robust nature of contact and friction algorithms while implicit method is widely used because of excellent accuracy and reliability. The elastic-plastic scheme is more reliable and rigorous while the rigid-plastic scheme require small computation time. In finite element simulation of auto-body panel stamping processes, the roobustness and stability of computation are important requirements since the computation time and convergency become major points of consideration besides the solution accuracy due to the complexity of geometry conditions. The performnce of the dynamic explicit algorithms are investigated by comparing the simulation results of formaing of complicate shaped autobody parts, such as a fuel tank and a rear hinge, with the experimental results. It has been shown that the proposed dynamic explicit elastic-plastic finite element method enables an effective computation for complicated auto-body panel stamping processes.

  • PDF

진화연산에 기반한 유전자 발현 데이터로부터의 유전자 상호작용 네트워크 구성 (Construction of Gene Interaction Networks from Gene Expression Data Based on Evolutionary Computation)

  • 정성훈;조광현
    • 제어로봇시스템학회논문지
    • /
    • 제10권12호
    • /
    • pp.1189-1195
    • /
    • 2004
  • This paper investigates construction of gene (interaction) networks from gene expression time-series data based on evolutionary computation. To illustrate the proposed approach in a comprehensive way, we first assume an artificial gene network and then compare it with the reconstructed network from the gene expression time-series data generated by the artificial network. Next, we employ real gene expression time-series data (Spellman's yeast data) to construct a gene network by applying the proposed approach. From these experiments, we find that the proposed approach can be used as a useful tool for discovering the structure of a gene network as well as the corresponding relations among genes. The constructed gene network can further provide biologists with information to generate/test new hypotheses and ultimately to unravel the gene functions.

전사무효전력간시제어의 최적계산 앨고리즘 개발 (Development of the Optimum Computational Algorithm for the Real Time Control of Voltage and Reactive Power)

  • Kil-Yeong Song
    • 대한전기학회논문지
    • /
    • 제31권10호
    • /
    • pp.93-100
    • /
    • 1982
  • This paper presents the optimum computational algorithm for the real time control of system voltage and reactive power on the basis of a improved search method. In particular, special emphasis has been placed on the speed up computation at the first phase, and on the selection of initial state to reduce the transmission losses in the second phase. For the real time control, the new computation is improved and the computation time is very much reduced. And also, this paper discusses the integrated control scheme of system voltage and reactive power from the viewpoint of hierarchical control pattern, and studes the combination of the optimum system operations and controls.