• Title/Summary/Keyword: PRESENT algorithm

Search Result 4,420, Processing Time 0.037 seconds

Real-time Visual Tracking System and Control Method for Laparoscope Manipulator (복강경 수술용 도구의 실시간 영상 추적 및 복강경 조종기의 지능형 제어 방법)

  • 김민석;허진석;이정주
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.21 no.11
    • /
    • pp.83-90
    • /
    • 2004
  • In this paper we present a new real-time visual servoing unit for laparoscopic surgery This unit can automatically control laparoscope manipulator through visual tracking of laparoscopic surgical tool. For the tracking, we present two-stage adaptive CONDENSATION(conditional density propagation) algorithm to extract the accurate position of the surgical tool tip from a surgical image sequence in real-time. This algorithm can be adaptable to abrupt change of laparoscope illumination. For the control, we present virtual damper system to control a laparoscope manipulator safely and stably. This system causes the laparoscope to move under constraint of the virtual dampers which are linked to the four sides of image. The visual servoing unit operates the manipulator in real-time with locating the surgical tool in the center of image. The experimental results show that the proposed visual tracking algorithm is highly robust and the controlled manipulator can present stable view with safe.

A STUDY ON INITIAL CONVERGENCE PROPERTIES OF THE KALMAN FILLTERING ALGORITHM

  • Park, Dong-Jo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1988.10b
    • /
    • pp.1051-1054
    • /
    • 1988
  • In this paper we present initial convergence properties of the Kalman filtering algorithm, we put an arbitrary small positive correlation matrix as an initial condition in the recursive algorithm. This arbitrary small initial condition perturbs the Kalman filtering algorithm and may lead to initial instability. We derive a condition which insures the stable operation of the Kalman filtering algorithm from the stochastic Lyapunov difference equation.

  • PDF

On A Symbolic Method for Error Estimation of a Mixed Interpolation

  • Thota, Srinivasarao
    • Kyungpook Mathematical Journal
    • /
    • v.58 no.3
    • /
    • pp.453-462
    • /
    • 2018
  • In this paper, we present a symbolic formulation of the error obtained due to an approximation of a given function by the mixed-interpolating function. Using the proposed symbolic method, we compute the error evaluation operator as well as the error estimation at any arbitrary point. We also present an algorithm to compute an approximation of a function by the mixed interpolation technique in terms of projector operator. Certain examples are presented to illustrate the proposed algorithm. Maple implementation of the proposed algorithm is discussed with sample computations.

A Multi-Level HW/SW Partitioning Algorithm for SoCs (SoC를 위한 다단 HW/SW 분할 알고리듬)

  • Ahn, Byung-Gyu;Sihn, Bong-Sik;Chong, Jong-Wha
    • Proceedings of the IEEK Conference
    • /
    • 2004.06b
    • /
    • pp.553-556
    • /
    • 2004
  • In this paper, we present a new efficient multi-level hardware/software partitioning algorithm for system-on-a-chip design. Originally the multi-level partitioning algorithm are proposed to enhance the performance of previous iterative improvement partitioning algorithm for large scale circuits. But when designing very complex and heterogeneous SoCs, the HW/SW partitioning decision needs to be made prior to refining the system description. In this paper, we present a new method, based on multi-level algorithm, which can cover SoC design. The different variants of algorithm are evaluated by a randomly generated test graph. The experimental results on test graphs show improvement average $9.85\%$ and $8.51\%$ in total communication costs over FM and CLIP respectively.

  • PDF

IMPROVING THE POCKLINGTON AND PADRÓ-SÁEZ CUBE ROOT ALGORITHM

  • Cho, Gook Hwa;Lee, Hyang-Sook
    • Bulletin of the Korean Mathematical Society
    • /
    • v.56 no.2
    • /
    • pp.277-283
    • /
    • 2019
  • In this paper, we present a cube root algorithm using a recurrence relation. Additionally, we compare the implementations of the Pocklington and $Padr{\acute{o}}-S{\acute{a}}ez$ algorithm with the Adleman-Manders-Miller algorithm. With the recurrence relations, we improve the Pocklington and $Padr{\acute{o}}-S{\acute{a}}ez$ algorithm by using a smaller base for exponentiation. Our method can reduce the average number of ${\mathbb{F}}_q$ multiplications.

Cost effective design of RC building frame employing unified particle swarm optimization

  • Payel Chaudhuri;Swarup K. Barman
    • Advances in Computational Design
    • /
    • v.9 no.1
    • /
    • pp.1-23
    • /
    • 2024
  • Present paper deals with the cost effective design of reinforced concrete building frame employing unified particle swarm optimization (UPSO). A building frame with G+8 stories have been adopted to demonstrate the effectiveness of the present algorithm. Effect of seismic loads and wind load have been considered as per Indian Standard (IS) 1893 (Part-I) and IS 875 (Part-III) respectively. Analysis of the frame has been carried out in STAAD Pro software.The design loads for all the beams and columns obtained from STAAD Pro have been given as input of the optimization algorithm. Next, cost optimization of all beams and columns have been carried out in MATLAB environment using UPSO, considering the safety and serviceability criteria mentioned in IS 456. Cost of formwork, concrete and reinforcement have been considered to calculate the total cost. Reinforcement of beams and columns has been calculated with consideration for curtailment and feasibility of laying the reinforcement bars during actual construction. The numerical analysis ensures the accuracy of the developed algorithm in providing the cost optimized design of RC building frame considering safety, serviceability and constructional feasibilities. Further, Monte Carlo simulations performed on the numerical results, proved the consistency and robustness of the developed algorithm. Thus, the present algorithm is capable of giving a cost effective design of RC building frame, which can be adopted directly in construction site without making any changes.

Clinical Practice Guideline for Soeumin Disease of Sasang Constitutional Medicine: Diagnosis and Algorithm (소음인체질병증 임상진료지침: 진단 및 알고리즘)

  • Lee, Jun-Hee;Lee, Eui-Ju
    • Journal of Sasang Constitutional Medicine
    • /
    • v.26 no.1
    • /
    • pp.11-26
    • /
    • 2014
  • Objectives This research was proposed to present Clinical Practice Guideline(CPG) for Soeumin Disease of Sasang Constitutional Medicine(SCM): Diagnosis and Algorithm. This CPG was developed by the national-wide experts committee consisting of SCM professors. Methods We searched the literature and articles related to Soeumin Symptomatology diagnosis and algorithm. For developin diagnosis and algorithm, we searched the classification, ordinary symptom, present symptom of the Soeumin Symptomatology Results & Conclusions We classified the Soeumin Symptomatology by 4 steps: Exterior-Interior disease, favorable-unfavorable pattern, mild-moderate-severe-critical pattern, initial-intermediate-advanced pattern. And at the unfavorable pattern, ordinary symptom is very important. So Doctors focuss on the symptom of unfavorable's ordinary symptom such as temperament inclined symptom, excessive sweating, diarrhea, and vexation.

Theoretical Performance Bounds and Parallelization of a Two-Dimensional Packing Algorithm (이차원 팩킹 알고리즘의 이론적 성능 분석과 병렬화)

  • Hwang, In-Jae;Hong, Dong-Kweon
    • The KIPS Transactions:PartA
    • /
    • v.10A no.1
    • /
    • pp.43-48
    • /
    • 2003
  • Two-dimensional packing algorithm can be used for allocating submeshes in mesh multiprocessor systems. Previously, we developed an efficient packing algorithm called TP heuristic, and showed how the results of the packing could be used for allocating submeshes. In this paper, we present theoretical performance bounds for TP heuristic. We also present a parallel version of the algorithm that consumes reduced time when it is executed by multiple processors in mesh multiprocessors.

Study on the Self Diagnostic Monitoring System for an Air-Operated Valve : Algorithm for Diagnosing Defects

  • Kim Wooshik;Chai Jangbom;Choi Hyunwoo
    • Nuclear Engineering and Technology
    • /
    • v.36 no.3
    • /
    • pp.219-228
    • /
    • 2004
  • [1] and [2] present an approach to diagnosing possible defects in the mechanical systems of a nuclear power plant. In this paper, by using a fault library as a database and training data, we develop a diagnostic algorithm 1) to decide whether an Air Operated Valve system is sound or not and 2) to identify the defect from which an Air-Operated Valve system suffers, if any. This algorithm is composed of three stages: a neural net stage, a non-neural net stage, and an integration stage. The neural net stage is a simple perceptron, a pattern-recognition module, using a neural net. The non-neural net stage is a simple pattern-matching algorithm, which translates the degree of matching into a corresponding number. The integration stage collects each output and makes a decision. We present a simulation result and confirm that the developed algorithm works accurately, if the input matches one in the database.

Developemet of noncontact velocity tracking algorithm for 3-dimensional high speed flows using digital image processing technique (디지털 화상처리를 이용한 유동장의 비접촉 3차원 고속류 계측법의 개발)

  • 도덕희
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.23 no.2
    • /
    • pp.259-269
    • /
    • 1999
  • A new algorithm for measuring 3-D velocity components of high speed flows were developed using a digital image processing technique. The measuring system consists of three CCD cameras an optical instrument called AOM a digital image grabber and a host computer. The images of mov-ing particles arranged spatially on a rotation plate are taken by two or three CCD cameras and are recorderd onto the image grabber or a video tape recoder. The three-dimensionl velocity com-ponents of the particles are automatically obtained by the developed algorithm In order to verify the validity of this technique three-dimensional velocity data sets obtained from a computer simu-lation of a backward facing step flow were used as test data for the algorithm. an uncertainty analysis associated with the present algorithm is systematically evaluated, The present technique is proved to be used as a tookl for the measurement of unsteady three-dimensional fluid flows.

  • PDF