• Title/Summary/Keyword: Computation amount

Search Result 604, Processing Time 0.026 seconds

Directional Particle Filter Using Online Threshold Adaptation for Vehicle Tracking

  • Yildirim, Mustafa Eren;Salman, Yucel Batu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.2
    • /
    • pp.710-726
    • /
    • 2018
  • This paper presents an extended particle filter to increase the accuracy and decrease the computation load of vehicle tracking. Particle filter has been the subject of extensive interest in video-based tracking which is capable of solving nonlinear and non-Gaussian problems. However, there still exist problems such as preventing unnecessary particle consumption, reducing the computational burden, and increasing the accuracy. We aim to increase the accuracy without an increase in computation load. In proposed method, we calculate the direction angle of the target vehicle. The angular difference between the direction of the target vehicle and each particle of the particle filter is observed. Particles are filtered and weighted, based on their angular difference. Particles with angular difference greater than a threshold is eliminated and the remaining are stored with greater weights in order to increase their probability for state estimation. Threshold value is very critical for performance. Thus, instead of having a constant threshold value, proposed algorithm updates it online. The first advantage of our algorithm is that it prevents the system from failures caused by insufficient amount of particles. Second advantage is to reduce the risk of using unnecessary number of particles in tracking which causes computation load. Proposed algorithm is compared against camshift, direction-based particle filter and condensation algorithms. Results show that the proposed algorithm outperforms the other methods in terms of accuracy, tracking duration and particle consumption.

Efficient Sharp Digital Image Detection Scheme

  • Kim, Hyoung-Joong;Tsomko, Elena;Kim, Dong-Hoi
    • Journal of Broadcast Engineering
    • /
    • v.12 no.4
    • /
    • pp.350-359
    • /
    • 2007
  • In this paper we present a simple, efficient method for detection of sharp digital images. Recently many digital cameras are equipped with various autofocusing functions to help users take well-focused pictures as easily as possible. However, acquired digital pictures can be further degraded by motion, limited contrast, and inappropriate amount of exposure, to name a few. In order to decide whether to process the image or not, or whether to delete it or not, reliable measure of image quality to detect sharp images from blurry ones is needed. This paper presents a blurriness/sharpness measure, and demonstrates its feasibility using extensive experiments. This method is fast and easy to implement, and accurate. Regardless of the detection accuracy, existing measures are computation-intensive. However, the proposed measure in this paper is not demanding in computation time. Needless to say, this measure can be used for various imaging applications including autofocusing and astigmatism correction.

A Design of 3D Graphics Geometry Processor for Mobile Applications (휴대 단말기용 3D Graphics Geometry Processor 설계)

  • Lee, Ma-Eum;Kim, Ki-Chul
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.917-920
    • /
    • 2005
  • This paper presents 3D graphics geometry processor for mobile applications. Geometry stage needs to cope with the large amount of computation. Geometry stage consists of transformation process and lighting process. To deal with computation in geometry stage, the vector processor that is based on pipeline chaining is proposed. The performance of proposed 3D graphics geometry processor is up to 4.3M vertex/sec at 100 MHz. Also, the designed processor is compliant with OpenGL ES that is widely used for standard API of embedded system. The proposed structure can be efficiently used in 3D graphics accelerator for mobile applications.

  • PDF

Free Vibration Analysis of Rectangular Plates by the Combined Transfer Stiffness Coefficient Method and Finite Element Method (전달강성계수법과 유한요소법의 조합에 의한 사각평판의 자유진동해석)

  • 문덕홍;최명수
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 1998.04a
    • /
    • pp.353-358
    • /
    • 1998
  • In general, we have used the finite element method(FEM) to find natural frequencies of plates. In this method, however, it is necessary to use a large amount of computer memory and computation time because the FEM requires many degrees of freedom for finding natural frequencies of plates correctly. Therefore it was very difficult to analyze the free vibration of plates correctly on personal computer. For overcoming this disadvantage of the FEM, the authors have developed the finite element-transfer stiffness coefficient method(FE-TSCM) which is based on the concept of modeling techniques in the FEM and the transfer of the stiffness coefficient in the transfer stiffness coefficient method. In this paper, we formulate free vibration analysis algorithm of rectangular plates using the FE-TSCM. Some numerical examples of rectangular plates are proposed, and their results and computation times obtained by the FE-TSCM are compared with those by the FEM and the finite element-transfer matrix method in order to demonstrate the accuracy and efficiency of the FE-TSCM.

  • PDF

Data-Compression-Based Resource Management in Cloud Computing for Biology and Medicine

  • Zhu, Changming
    • Journal of Computing Science and Engineering
    • /
    • v.10 no.1
    • /
    • pp.21-31
    • /
    • 2016
  • With the application and development of biomedical techniques such as next-generation sequencing, mass spectrometry, and medical imaging, the amount of biomedical data have been growing explosively. In terms of processing such data, we face the problems surrounding big data, highly intensive computation, and high dimensionality data. Fortunately, cloud computing represents significant advantages of resource allocation, data storage, computation, and sharing and offers a solution to solve big data problems of biomedical research. In order to improve the efficiency of resource management in cloud computing, this paper proposes a clustering method and adopts Radial Basis Function in order to compress comprehensive data sets found in biology and medicine in high quality, and stores these data with resource management in cloud computing. Experiments have validated that with such a data-compression-based resource management in cloud computing, one can store large data sets from biology and medicine in fewer capacities. Furthermore, with reverse operation of the Radial Basis Function, these compressed data can be reconstructed with high accuracy.

Multi-stage Inverse Finite Element Analysis of Rectangular Cup Drawing considering Sliding Constraint Surfaces with Arbitrary Intermediate Die Shapes (임의 곡면의 금형형상이 고려된 미끄럼 구속면을 이용한 직사각컵의 다단계 유한요소 역해석)

  • Kim S. H.;Kim S. H.;Huh H.
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 2000.10a
    • /
    • pp.158-161
    • /
    • 2000
  • An inverse finite element approach is employed for more capability to design the optimum blank shape from the desired final shape with small amount of computation time and effort. For multi-stage deep-drawing processes, numerical analysis is extremely difficult to carry out due to its complexities and convergence problem as well as tremendous computation time. In this paper, multi-stage finite element inverse analysis is applied to multi-stage rectangular cup drawing processes to calculate intermediate blank shapes and strain distributions in each stages. Finite element patches are used to describe arbitrary intermediate sliding constraint surfaces.

  • PDF

Overlapped Subband-Based Independent Vector Analysis

  • Jang, Gil-Jin;Lee, Te-Won
    • The Journal of the Acoustical Society of Korea
    • /
    • v.27 no.1E
    • /
    • pp.30-34
    • /
    • 2008
  • An improvement to the existing blind signal separation (BSS) method has been made in this paper. The proposed method models the inherent signal dependency observed in acoustic object to separate the real-world convolutive sound mixtures. The frequency domain approach requires solving the well known permutation problem, and the problem had been successfully solved by a vector representation of the sources whose multidimensional joint densities have a certain amount of dependency expressed by non-spherical distributions. Especially for speech signals, we observe strong dependencies across neighboring frequency bins and the decrease of those dependencies as the bins become far apart. The non-spherical joint density model proposed in this paper reflects this property of real-world speech signals. Experimental results show the improved performances over the spherical joint density representations.

An extension of testability analysis for sequential circuits (순차회로를 위한 검사성 분석법의 확장)

  • 김신택;민형복
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.4
    • /
    • pp.75-84
    • /
    • 1995
  • Fault simulators are used for accurate evaluation of fault coverages of digital circuits. But fault simulation becomes time and memory consuming job because computation time is proportional to wquare of size of circuits. Recently, several approximate algorithms for testability analysis have been published to cope with the problems. COP is very fast but cannot be used for sequential circuits, while STAFAN can ve used for sequential circuits but requires large amount of computation because it utilizes logic simulation results. In this paper EXTASEC(An Extension of Testability Analysis for Sequential Circuits) is proposed. It is an extension of COP in the sense that it is the same as COP for combinational circuits, but it can handle sequential circuits, Xicontrollability and backward line analysis are key concept for EXTASEC. Performance of EXTASEC is proven by comparing EXTASEC with a falut simulator, STAFAN, and COP for ISCAS circuits, and the result is demonstated.

  • PDF

Multi-stage Finite Element Inverse Analysis of elliptic Cup Drawing with large aspect ratio considering Intermediate Sliding Constraint Surface (중간 미끄럼 구속면을 고려한 세장비가 큰 타원형 컵 성형 공정의 다단계 유한요소 역해석)

  • 김세호
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 2000.04a
    • /
    • pp.21-25
    • /
    • 2000
  • An inverse finite element approach is employed for more capability to design the optimum blank shape from the desired final shape with small amount of expense and computation time For multi-stage sheet metal forming processes numerical analysis is expense difficult to carry out the to its complexities and convergence problem. It also requires lots of computation time. For the analysis of elliptic cup with large aspect ratio intermediate sliding constraint surfaces are difficult to describe. in this paper multi-stage finite element inverse analysis is applied to multi-stage elliptic cup drawing processes to calculate intermediate blank shapes and strain distributions in each stages. To describe intermediate sliding constraint surfaces an analytic scheme is introduced to deal with merged-arc type sliding surfaces.

  • PDF

Extracting the K-most Critical Paths in Multi-corner Multi-mode for Fast Static Timing Analysis

  • Oh, Deok-Keun;Jin, Myeoung-Woo;Kim, Ju-Ho
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.16 no.6
    • /
    • pp.771-780
    • /
    • 2016
  • Detecting a set of longest paths is one of the crucial steps in static timing analysis and optimization. Recently, the process variation during manufacturing affects performance of the circuit design due to nanometer feature size. Measuring the performance of a circuit prior to its fabrication requires a considerable amount of computation time because it requires multi-corner and multi-mode analysis with process variations. An efficient algorithm of detecting the K-most critical paths in multi-corner multi-mode static timing analysis (MCMM STA) is proposed in this paper. The ISCAS'85 benchmark suite using a 32 nm technology is applied to verify the proposed method. The proposed K-most critical paths detection method reduces about 25% of computation time on average.