• Title/Summary/Keyword: Accelerated Algorithms

Search Result 49, Processing Time 0.019 seconds

Development of Riding Robot System and Body State Index for Healthcare Service (승마용 헬스 케어 로봇 시스템과 신체 상태 지수 관리기술)

  • Lim, Mee-Seub;Lim, Joon-Hong
    • The Journal of Korea Robotics Society
    • /
    • v.4 no.4
    • /
    • pp.327-333
    • /
    • 2009
  • This paper describe the riding robot system named by "RideBot" which is a riding robot like as a horse. In order to simulate the riding motions, we develope the saddle mechanism which can generate 3 DOF motions including pitch, roll, and bounce movement, and also we controlled the riding motions and the intention of horseman. To generate the riding motions with the bodily sensation, we developed Novel Washout Filter and the algorithms for motion control. And also, we developed some health care service for the health care of horseman. A body state index was proposed that evaluates the personal health state from both the measured physiological variables and the surveyed questions. The physiological variables such as weight, blood pressure, heart rate variability (HRV), accelerated state photoplethysmograph(APG), body fat, and happiness index were measured by the specially designed bio-handle system and survey questions. The efficiency of the proposed ride robot is evaluated in the experiments.

  • PDF

인지 무선 통신망을 위한 인지 알고리즘 및 엔진

  • Song Myeong-Seon;Reed Jeffrey H.;Kim Chang-Ju
    • The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.17 no.2 s.58
    • /
    • pp.19-27
    • /
    • 2006
  • Technologies to utilize the limited frequency resource more efficiently in spatial and temporal are accelerated. In this paper cognitive algorithms as brain of cognitive radio, kind and characteristics of databases which are necessary parts for algorithm were reviewed and summarized. And an example of cognitive engine on which database and algorithm are executed was described also. Because the current status of development of technologies relating to cognitive radio is at the initial stage, the best database, algorithm and engine for a cognitive radio were not suggested, but the direction of development and factors to be considered during development of relating technologies were explained.

Feature Matching Algorithm Robust To Viewpoint Change (시점 변화에 강인한 특징점 정합 기법)

  • Jung, Hyun-jo;Yoo, Ji-sang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.12
    • /
    • pp.2363-2371
    • /
    • 2015
  • In this paper, we propose a new feature matching algorithm which is robust to the viewpoint change by using the FAST(Features from Accelerated Segment Test) feature detector and the SIFT(Scale Invariant Feature Transform) feature descriptor. The original FAST algorithm unnecessarily results in many feature points along the edges in the image. To solve this problem, we apply the principal curvatures for refining it. We use the SIFT descriptor to describe the extracted feature points and calculate the homography matrix through the RANSAC(RANdom SAmple Consensus) with the matching pairs obtained from the two different viewpoint images. To make feature matching robust to the viewpoint change, we classify the matching pairs by calculating the Euclidean distance between the transformed coordinates by the homography transformation with feature points in the reference image and the coordinates of the feature points in the different viewpoint image. Through the experimental results, it is shown that the proposed algorithm has better performance than the conventional feature matching algorithms even though it has much less computational load.

An efficient acceleration algorithm of GPU ray tracing using CUDA (CUDA를 이용한 효과적인 GPU 광선추적 가속 알고리즘)

  • Ji, Joong-Hyun;Yun, Dong-Ho;Ko, Kwang-Hee
    • 한국HCI학회:학술대회논문집
    • /
    • 2009.02a
    • /
    • pp.469-474
    • /
    • 2009
  • This paper proposes an real time ray tracing system using optimized kd-tree traversal environment and ray/triangle intersection algorithm. The previous kd-tree traversal algorithms search for the upper nodes in a bottom-up manner. In a such way we need to revisit the already visited parent node or use redundant memory after failing to find the intersected primitives in the leaf node. Thus ray tracing for relatively complex scenes become more difficult. The new algorithm contains stacks implemented on GPU's local memory on CUDA framework, thus elegantly eliminate the problems of previous algorithms. After traversing the node we perform the latest CPU-based ray/triangle intersection algorithm 'Plucker coordinate test', which is further accelerated in massively parallel thanks to CUDA. Plucker test can drastically reduce the computational costs since it does not use barycentric coordinates but only simple test using the relations between a ray and the triangle edges. The entire system is consist of a single ray kernel simply and implemented without introduction of complicated synchronization or ray packets. Consequently our experiment shows the new algorithm can is roughly twice as faster as the previous.

  • PDF

EFFICIENT COMPUTATION OF COMPRESSIBLE FLOW BY HIGHER-ORDER METHOD ACCELERATED USING GPU (고차 정확도 수치기법의 GPU 계산을 통한 효율적인 압축성 유동 해석)

  • Chang, T.K.;Park, J.S.;Kim, C.
    • Journal of computational fluids engineering
    • /
    • v.19 no.3
    • /
    • pp.52-61
    • /
    • 2014
  • The present paper deals with the efficient computation of higher-order CFD methods for compressible flow using graphics processing units (GPU). The higher-order CFD methods, such as discontinuous Galerkin (DG) methods and correction procedure via reconstruction (CPR) methods, can realize arbitrary higher-order accuracy with compact stencil on unstructured mesh. However, they require much more computational costs compared to the widely used finite volume methods (FVM). Graphics processing unit, consisting of hundreds or thousands small cores, is apt to massive parallel computations of compressible flow based on the higher-order CFD methods and can reduce computational time greatly. Higher-order multi-dimensional limiting process (MLP) is applied for the robust control of numerical oscillations around shock discontinuity and implemented efficiently on GPU. The program is written and optimized in CUDA library offered from NVIDIA. The whole algorithms are implemented to guarantee accurate and efficient computations for parallel programming on shared-memory model of GPU. The extensive numerical experiments validates that the GPU successfully accelerates computing compressible flow using higher-order method.

Comparative Study of Corner and Feature Extractors for Real-Time Object Recognition in Image Processing

  • Mohapatra, Arpita;Sarangi, Sunita;Patnaik, Srikanta;Sabut, Sukant
    • Journal of information and communication convergence engineering
    • /
    • v.12 no.4
    • /
    • pp.263-270
    • /
    • 2014
  • Corner detection and feature extraction are essential aspects of computer vision problems such as object recognition and tracking. Feature detectors such as Scale Invariant Feature Transform (SIFT) yields high quality features but computationally intensive for use in real-time applications. The Features from Accelerated Segment Test (FAST) detector provides faster feature computation by extracting only corner information in recognising an object. In this paper we have analyzed the efficient object detection algorithms with respect to efficiency, quality and robustness by comparing characteristics of image detectors for corner detector and feature extractors. The simulated result shows that compared to conventional SIFT algorithm, the object recognition system based on the FAST corner detector yields increased speed and low performance degradation. The average time to find keypoints in SIFT method is about 0.116 seconds for extracting 2169 keypoints. Similarly the average time to find corner points was 0.651 seconds for detecting 1714 keypoints in FAST methods at threshold 30. Thus the FAST method detects corner points faster with better quality images for object recognition.

Satellite-detected red tide algal blooms in Korean and neighboring waters during 1999-2004

  • Ahn Yu-Hwan;Shanmugam Palanisamy
    • Proceedings of the KSRS Conference
    • /
    • 2006.03a
    • /
    • pp.95-100
    • /
    • 2006
  • Measurements of ocean color from space since 1970s provided vital information with reference to physical and biogeochemical properties of the oceanic waters. The utility of these data has been explored in order to map and monitor highly toxic/or harmful algal blooms (HABs) that affected most of coastal waters throughout the world due to accelerated eutrophication from human activities and certain oceanic processes. However, the global atmospheric correction and bio-optical algorithms developed for oceanic waters were found to yield false information about the HABs in coastal waters. The present study aimed to evaluate the potential use of red tide index (RI) method, which has been developed by Ahn and Shanmugam (2005), for mapping of HABs in Korean and neighboring waters. Here we employed the SSMM to remove the atmospheric effect in the SeaWiFS image data and the achieved indices by RI method were found more appropriate in correctly identifying potential areas of the encountered HABs in Korean South Sea (KSS) and Chinese coastal waters during 1999-2004. But the existence of high absorbing and scattering materials greatly interfered with the standard OC4 algorithm which falsely identified red tides in these waters. In comparison with other methods, the RI approach for the early detection of HABs can provide state managers with accurate identification of the extent and location of these blooms as a management tool.

  • PDF

A Study on Terrain Surface Modeling and Polygon-Searching Algorithms (지표면 모델링 및 폴리건 검색기법에 관한 연구)

  • 공지영;강현주;윤석준
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2002.11a
    • /
    • pp.163-170
    • /
    • 2002
  • Terrain surfaces have to be modeled in very detail and wheel-surface contacting geometry must be well defined in order to obtain proper ground-reaction and friction forces for realistic simulation of off-road vehicles. Delaunay triangulation is one of the most widely used methods in modeling 3-dimensional terrain surfaces, and T-search is a relevant algorithm for searching resulting triangular polygons. The T-search method searches polygons in successive order and may not allow real-time computation of off-road vehicle dynamics if the terrain is modeled with many polygons, depending on the computer performance used in the simulation. In order to accelerate the searching speed of T-search, a terrain database of triangular polygons is modeled in multi-levels by adopting the LOD (Level of Detail) method used in realtime computer graphics. Simulation results show that the new LOD search is effective in shortening the required computing time. The LOD search can be even further accelerated by introducing an NN (Neural Network) algorithm, in the cases where a appropriate range of moving paths can be predicted by cultual information of the simulated terrain, such as lakes, houses, etc.. Numerical tests show that LOD-NN search almost double the speed of the original T-search.

  • PDF

Computational study of the wind load on a free-form complex thin shell structure

  • Rodrigues, A. Moret;Tome, Ana;Gomes, M. Gloria
    • Wind and Structures
    • /
    • v.25 no.2
    • /
    • pp.177-193
    • /
    • 2017
  • The accelerated development of new materials, technologies and construction processes, in parallel with advances in computational algorithms and ever growing computational power, is leading to more daring and innovative architectural and structural designs. The search for non-regular building shapes and slender structures, as alternative to the traditional architectural forms that have been prevailing in the building sector, poses important engineering challenges in the assessment of the strength and mechanical stability of non-conventional structures and systems, namely against highly variable actions as wind and seismic forces. In case of complex structures, laboratory experiments are a widely used methodology for strength assessment and loading characterization. Nevertheless, powerful numerical tools providing reliable results are also available today and able to compete with the experimental approach. In this paper the wind action on a free-form complex thin shell is investigated through 3D-CFD simulation in terms of the pressure coefficients and global forces generated. All the modelling aspects and calibrating process are described. The results obtained showed that the CFD technique is effective in the study of the wind effects on complex-shaped structures.

Development of Numerical Algorithm of Total Point Method for Thinning Evaluation of Nuclear Secondary Pipes (원전 2차측 배관 감육여부 판별을 위한 Total Point Method 전산 알고리즘 개발)

  • Oh, Young Jin;Yun, Hun;Moon, Seung Jae;Han, Kyunghee;Park, Byeong Uk
    • Transactions of the Korean Society of Pressure Vessels and Piping
    • /
    • v.11 no.2
    • /
    • pp.31-39
    • /
    • 2015
  • Pipe wall-thinning by flow-accelerated corrosion (FAC) and various types of erosion is a significant and costly damage phenomenon in secondary piping systems of nuclear power plants (NPPs). Most NPPs have management programs to ensure pipe integrity due to wall-thinning that includes periodic measurements for pipe wall thicknesses using ultrasonic tests (UTs). Nevertheless, thinning evaluations are not easy because the amount of thickness reduction being measured is often quite small compared to the accuracy of the inspection technique. U.S. Electric Power Research Institute (EPRI) had proposed Total Point Method (TPM) as a thinning occurrence evaluation method, which is a very useful method for detecting locally thinned pipes or fittings. However, evaluation engineers have to discern manually the measurement data because there are no numerical algorithm for TPM. In this study, numerical algorithms were developed based on non-parametric and parametric statistical method.