• Title/Summary/Keyword: Fast computation

Search Result 750, Processing Time 0.024 seconds

Real-Time Feature Point Matching Using Local Descriptor Derived by Zernike Moments (저니키 모멘트 기반 지역 서술자를 이용한 실시간 특징점 정합)

  • Hwang, Sun-Kyoo;Kim, Whoi-Yul
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.4
    • /
    • pp.116-123
    • /
    • 2009
  • Feature point matching, which is finding the corresponding points from two images with different viewpoint, has been used in various vision-based applications and the demand for the real-time operation of the matching is increasing these days. This paper presents a real-time feature point matching method by using a local descriptor derived by Zernike moments. From an input image, we find a set of feature points by using an existing fast corner detection algorithm and compute a local descriptor derived by Zernike moments at each feature point. The local descriptor based on Zernike moments represents the properties of the image patch around the feature points efficiently and is robust to rotation and illumination changes. In order to speed up the computation of Zernike moments, we compute the Zernike basis functions with fixed size in advance and store them in lookup tables. The initial matching results are acquired by an Approximate Nearest Neighbor (ANN) method and false matchings are eliminated by a RANSAC algorithm. In the experiments we confirmed that the proposed method matches the feature points in images with various transformations in real-time and outperforms existing methods.

Fast Computation of DWT and JPEG2000 using GPU (GPU를 이용한 DWT 및 JPEG2000의 고속 연산)

  • Lee, Man-Hee;Park, In-Kyu;Won, Seok-Jin;Cho, Sung-Dae
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.6
    • /
    • pp.9-15
    • /
    • 2007
  • In this paper, we propose an efficient method for Processing DWT (Discrete Wavelet Transform) on GPU (Graphics Processing Unit). Since the DWT and EBCOT (embedded block coding with optimized truncation) are the most complicated submodules in JPEG2000, we design a high-performance processing framework for performing DWT using the fragment shader of GPU based on the render-to-texture (RTT) architecture. Experimental results show that the performance increases significantly, in which DWT running on modern GPU is more than 10 times faster than on modern CPU. Furthermore, by replacing the DWT part of Jasper which is the JPEG2000 reference software, the overall processing is 2$\sim$16 times faster than the original JasPer. The GPU-driven render-to-texture architecture proposed in this paper can be used in the general image and computer vision processing for high-speed processing.

The PALM system : Architecture and Network Performance (PALM시스템의 구조와 네트웍 성능)

  • Kim, Suk-Il
    • The Transactions of the Korea Information Processing Society
    • /
    • v.1 no.1
    • /
    • pp.105-113
    • /
    • 1994
  • This paper introduces the Parallel Advanced Loosely coupled Multiprocessor (PALM) architecture, which is based on HCH(m,p), where m is number of links per a communication processor (CP) and p is the number of application processors (APs) connected to the CP. communication links between a pair of CPs and/or between a CP and an AP, are made of dual-Port RAMs, which provide fast and reliable word-parallel communication between processors. Among the wide spectrum of HCH networks, HCH(m,2) is also known to be a cost optimal topology, such that HCH(m,2) consists of the largest number of APs retaining the minimal number of CPs and communication links. We also implement a testbed based on HCH(2,2). The experiment result shows that the small communication/computation ratio of the PALM system would realize fine-grain parallelism on message-passing MIMD systems.

  • PDF

A Dual Modeling Method for a Real-Time Palpation Simulator

  • Kim, Sang-Youn;Park, Se-Kil;Park, Jin-Ah
    • Journal of Information Processing Systems
    • /
    • v.8 no.1
    • /
    • pp.55-66
    • /
    • 2012
  • This paper presents a dual modeling method that simulates the graphic and haptic behavior of a volumetric deformable object and conveys the behavior to a human operator. Although conventional modeling methods (a mass-spring model and a finite element method) are suitable for the real-time computation of an object's deformation, it is not easy to compute the haptic behavior of a volumetric deformable object with the conventional modeling method in real-time (within a 1kHz) due to a computational burden. Previously, we proposed a fast volume haptic rendering method based on the S-chain model that can compute the deformation of a volumetric non-rigid object and its haptic feedback in real-time. When the S-chain model represents the object, the haptic feeling is realistic, whereas the graphical results of the deformed shape look linear. In order to improve the graphic and haptic behavior at the same time, we propose a dual modeling framework in which a volumetric haptic model and a surface graphical model coexist. In order to inspect the graphic and haptic behavior of objects represented by the proposed dual model, experiments are conducted with volumetric objects consisting of about 20,000 nodes at a haptic update rate of 1000Hz and a graphic update rate of 30Hz. We also conduct human factor studies to show that the haptic and graphic behavior from our model is realistic. Our experiments verify that our model provides a realistic haptic and graphic feeling to users in real-time.

Static Analysis of Frame Structures Using Transfer of Stiffness Coefficient (강성계수의 전달을 이용한 골조구조물의 정적해석)

  • 최명수;문덕홍;정하용
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.16 no.1
    • /
    • pp.9-18
    • /
    • 2003
  • In static analysis of a variety of structures, the matrix method of structural analysis is the most widely used and powerful analysis method. However, this method has drawback requiring high-performance computers with many memory units and fast processing units in the case of analyzing accurately structures with a large number of degrees-of- freedom. Therefore, it's very difficult to analyze these structures accurately in personal computers. For overcoming the drawback of the matrix method of structural analysis, authors suggest the transfer stiffness coefficient method(TSCM). The TSCM is very suitable to a personal computer because the concept of the TSCM is based on the transfer of the stiffness coefficient for an analytical structure. In this paper, the static analysis algorithm for frame structures is formulated by the TSCM. We confirm the validity of the TSCM through the comparison of computation results by the TSCM, the NASTRAN, the matrix method of structural analysis and the analytical solution.

A Gridless Area Router for Multichip Module Design (다중칩 모듈 설계를 위한 Gridless 배선기)

  • Lee, Tae-Sun;Rim, Chong-Suck
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.9
    • /
    • pp.28-43
    • /
    • 1999
  • In this paper, we present a gridless router for MultiChip Modules (MCM). Because our router uses corner stitching data structures, not a routing grid, to represent the routings status, it allows arbitrary location of pins, and routes variable-width wires, without a considerable waste of area from bulky vias. A routing speed is a very important factor because a gridless routing approach is known its computation is hard and complex, and MCM routing problem has so large routing area and layers. Our router completes the routing faster than the most of previously reported grid-based routers, with comparable routing result, by using SEGRAs routing algorithm whose very fast speed is proved, and the characteristics of the effective data structure.

  • PDF

Real-Time Camera Tracking for Virtual Stud (가상스튜디오 구현을 위한 실시간 카메라 추적)

  • Park, Seong-Woo;Seo, Yong-Duek;Hong, Ki-Sang
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.7
    • /
    • pp.90-103
    • /
    • 1999
  • In this paper, we present an overall algorithm for real-time camera parameter extraction which is one of key elements in implementing virtual studio. The prevailing mechanical methode for tracking cameras have several disadvantage such as the price, calibration with the camera and operability. To overcome these disadvantages we calculate camera parameters directly from the input image using computer-vision technique. When using zoom lenses, it requires real time calculation of lens distortion. But in Tsai algorithm, adopted for camera calibration, it can be calculated through nonlinear optimization in triple parameter space, which usually takes long computation time. We proposed a new method, separating lens distortion parameter from the other two parameters, so that it is reduced to nonlinear optimization in one parameter space, which can be computed fast enough for real time application.

  • PDF

ECG-based Biometric Authentication Using Random Forest (랜덤 포레스트를 이용한 심전도 기반 생체 인증)

  • Kim, JeongKyun;Lee, Kang Bok;Hong, Sang Gi
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.6
    • /
    • pp.100-105
    • /
    • 2017
  • This work presents an ECG biometric recognition system for the purpose of biometric authentication. ECG biometric approaches are divided into two major categories, fiducial-based and non-fiducial-based methods. This paper proposes a new non-fiducial framework using discrete cosine transform and a Random Forest classifier. When using DCT, most of the signal information tends to be concentrated in a few low-frequency components. In order to apply feature vector of Random Forest, DCT feature vectors of ECG heartbeats are constructed by using the first 40 DCT coefficients. RF is based on the computation of a large number of decision trees. It is relatively fast, robust and inherently suitable for multi-class problems. Furthermore, it trade-off threshold between admission and rejection of ID inside RF classifier. As a result, proposed method offers 99.9% recognition rates when tested on MIT-BIH NSRDB.

Heat Transfer Analysis of Bi-Material Problem with Interfacial Boundary Using Moving Least Squares Finite Difference Method (이동최소제곱 유한차분법을 이용한 계면경계를 갖는 이종재료의 열전달문제 해석)

  • Yoon, Young-Cheol;Kim, Do-Wan
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.20 no.6
    • /
    • pp.779-787
    • /
    • 2007
  • This paper presents a highly efficient moving least squares finite difference method (MLS FDM) for a heat transfer problem of bi-material with interfacial boundary. The MLS FDM directly discretizes governing differential equations based on a node set without a grid structure. In the method, difference equations are constructed by the Taylor polynomial expanded by moving least squares method. The wedge function is designed on the concept of hyperplane function and is embedded in the derivative approximation formula on the moving least squares sense. Thus interfacial singular behavior like normal derivative jump is naturally modeled and the merit of MLS FDM in fast derivative computation is assured. Numerical experiments for heat transfer problem of bi-material with different heat conductivities show that the developed method achieves high efficiency as well as good accuracy in interface problems.

Evaluation of Axial Buckling Effect in On-Line Axial Power Shape Synthesis (실시간 노심출력분포 합성에서의 축방향 경계조건 영향평가)

  • In, Wang-Kee;Kim, Joon-Sung;Yoon, Tae-Young;Auh, Geun-Sun;Kim, Hee-Cheol
    • Nuclear Engineering and Technology
    • /
    • v.25 no.1
    • /
    • pp.148-153
    • /
    • 1993
  • A fifth-order Fourier series technique is applied in Core Operating Limit Supervisory System (COLSS) to construct the on-line core average axial power shape from in-core detector signals because of its simplicity and fast computation. Such a synthesizing accuracy depends on number of Fourier series modes and axial boundary conditions. COLSS currently uses the five-mode Fourier series technique which utilizes the five axially located fixed in-core detector signals and a constant axial boundary condition. Therefore, the constant axial boundary condition should be appropriately chosen based on the evaluation of its effect on the accuracy of the on-line calculations. The four cases of axial buckling (0.75, 0.8, 0.9 and 1.0) were examined for Yonggwang Nuclear Units 3&4 as the axial boundary conditions in this paper. The core average axial power shapes and the operating margins were compared for each case to determine the optimal constant axial buckling. The axial buckling of 0.9 was found to be the optimal value.

  • PDF