• Title/Summary/Keyword: DT algorithm

Search Result 61, Processing Time 0.021 seconds

Detection of Optical Flows on the Trajectories of Feature Points Using the Cellular Nonlinear Neural Networks (셀룰라 비선형 네트워크를 이용한 특징점 궤적 상에서 Optical Flow 검출)

  • Son, Hon-Rak;Kim, Hyeong-Suk
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.37 no.6
    • /
    • pp.10-21
    • /
    • 2000
  • The Cellular Noninear Networks structure for Distance Transform(DT) and the robust optical flow detection algorithm based on the DT are proposed. For some applications of optical flows such as target tracking and camera ego-motion computation, correct optical flows at a few feature points are more useful than unreliable one at every pixel point. The proposed algorithm is for detecting the optical flows on the trajectories only of the feature points. The translation lengths and the directions of feature movements are detected on the trajectories of feature points on which Distance Transform Field is developed. The robustness caused from the use of the Distance Transform and the easiness of hardware implementation with local analog circuits are the properties of the proposed structure. To verify the performance of the proposed structure and the algorithm, simulation has been done about various images under different noisy environment.

  • PDF

3-Dimensional visualizationof heart in EBT images (EBT 단층 영상에서 심장의 3차원 시각화)

  • 원철호;조진호
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.7
    • /
    • pp.37-45
    • /
    • 1998
  • In this paper, we extracted heart region using dyamic contour model, increased the vertical resolution of heart region by proposed 2-dimensional interpolation method and visualized the 3-dimensional hearet volutme. the proposed new energy term of dynamic contour model considering the gray level and direction of controur vectors is effective to extract the closed heart boundary. And, we generatedvertical slice images from the extracted heart region images using the 2-dimensional linear interpolation by DT(distance transform). We showed that proposed algorithm is useful by 3-dimensional visualization of heart volume.

  • PDF

(Real Time Classification System for Lead Pin Images) (실시간 Lead Pin 영상 분류 시스템)

  • 장용훈
    • Journal of the Korea Computer Industry Society
    • /
    • v.3 no.9
    • /
    • pp.1177-1188
    • /
    • 2002
  • To classify real time Lead pin images in this paper, The image acquisition system was composed to C.C.D, image frame grabber(DT3153), P.C(PentiumIII). I proposed image processing algorithms. This algorithms were composed to real time monitoring, Lead Pin image acquisition, image noise deletion, object area detection, point detection and pattern classification algorithm. The raw images were acquired from Lead pin images using the system. The result images were obtained from raw images by image processing algorithms. In implemental result, The right recognition was 97 of 100 acceptable products, 95 of 100 defective products. The recognition rate was 96% for total 200 Lead Pins.

  • PDF

Real-Time Hybrid Broadcasting Algorithm Considering Data Property in Mobile Computing Environments (이동 컴퓨팅 환경에서 데이타 특성을 고려한 실시간 혼성 방송 알고리즘)

  • Yoon Hyesook;Kim Young-Kuk
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.3
    • /
    • pp.339-349
    • /
    • 2005
  • For recent years, data broadcast technology has been recognized as a very effective data delivery mechanism in mobile computing environment with a large number of cli;ents. Especially, a hybrid broadcast algorithm in real-time environment, which integrates one-way broadcast and on-demand broadcast, has an advantage of adapting the requests of clients to a limited up-link bandwidth and following the change of data access pattern. However, previous hybrid broadcasting algorithms has a problem in the methods to get a grip on the change of data access Pattern. It is caused by the diminution of requests for the data items which are contained in periodic broadcasting schedule because they are already broadcasted. To solve this problem, existing researches may remove data items in periodic broadcasting schedule over a few cycles multiplying cooling factor or find out the requests of data items with extracting them on purpose. Both of them are the artificial methods not considering the property of data. In this paper, we propose a real-time adaptive hybrid broadcasting based on data type(RTAHB-DT) to broadcast considering data property and analysis the performance of our aigorithm through simulation study.

A Comparative Study on Collision Detection Algorithms based on Joint Torque Sensor using Machine Learning (기계학습을 이용한 Joint Torque Sensor 기반의 충돌 감지 알고리즘 비교 연구)

  • Jo, Seonghyeon;Kwon, Wookyong
    • The Journal of Korea Robotics Society
    • /
    • v.15 no.2
    • /
    • pp.169-176
    • /
    • 2020
  • This paper studied the collision detection of robot manipulators for safe collaboration in human-robot interaction. Based on sensor-based collision detection, external torque is detached from subtracting robot dynamics. To detect collision using joint torque sensor data, a comparative study was conducted using data-based machine learning algorithm. Data was collected from the actual 3 degree-of-freedom (DOF) robot manipulator, and the data was labeled by threshold and handwork. Using support vector machine (SVM), decision tree and k-nearest neighbors KNN method, we derive the optimal parameters of each algorithm and compare the collision classification performance. The simulation results are analyzed for each method, and we confirmed that by an optimal collision status detection model with high prediction accuracy.

Driving Algorithm on Three Phase BLDC Motor Applied 4-Switch using Voltage Doubler (Voltage Doubler를 이용한 4-스위치 3상 BLDC 전동기 구동 알고리즘)

  • Yoon, Yong-Ho;Lee, Jung-Suk;Won, Chung-Yuen
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.60 no.1
    • /
    • pp.48-52
    • /
    • 2011
  • Over the years, traditionally, six-switch three-phase inverters have been widely utilized for variable speed alternating current motor drives. Recently, some efforts have been made on the application of four-switch three phase inverter for uninterruptible power supply and variable speed drives. This is due to some advantages of the four-switch three phase inverter over the conventional six-switch three-phase inverters such as reduced price due to reduction in number of switches, reduced switching losses, reduced number of interface circuits to supply logic signals for the switches, simpler control algorithms to generate logic signals, less chances of destroying the switches due to lesser interaction among switches, and less real-time computational burden. However such as slow di/dt and speed limitation, are the inherent characteristics and main drawbacks of the four-switch configuration. Those problems can be overcome in conjugation with Voltage-doublers which has additional advantage, such as unity power factor correction.

An Enhanced Density and Grid based Spatial Clustering Algorithm for Large Spatial Database (대용량 공간데이터베이스를 위한 확장된 밀도-격자 기반의 공간 클러스터링 알고리즘)

  • Gao, Song;Kim, Ho-Seok;Xia, Ying;Kim, Gyoung-Bae;Bae, Hae-Young
    • The KIPS Transactions:PartD
    • /
    • v.13D no.5 s.108
    • /
    • pp.633-640
    • /
    • 2006
  • Spatial clustering, which groups similar objects based on their distance, connectivity, or their relative density in space, is an important component of spatial data mining. Density-based and grid-based clustering are two main clustering approaches. The former is famous for its capability of discovering clusters of various shapes and eliminating noises, while the latter is well known for its high speed. Clustering large data sets has always been a serious challenge for clustering algorithms, because huge data set would make the clustering process extremely costly. In this paper, we propose an enhanced Density-Grid based Clustering algorithm for Large spatial database by setting a default number of intervals and removing the outliers effectively with the help of a proper measurement to identify areas of high density in the input data space. We use a density threshold DT to recognize dense cells before neighbor dense cells are combined to form clusters. When proposed algorithm is performed on large dataset, a proper granularity of each dimension in data space and a density threshold for recognizing dense areas can improve the performance of this algorithm. We combine grid-based and density-based methods together to not only increase the efficiency but also find clusters with arbitrary shape. Synthetic datasets are used for experimental evaluation which shows that proposed method has high performance and accuracy in the experiments.

Estimation and Validation of Collection 6 Moderate Resolution Imaging Spectroradiometer Aerosol Products for East Asia

  • Lee, Kwon-Ho
    • Asian Journal of Atmospheric Environment
    • /
    • v.12 no.3
    • /
    • pp.193-203
    • /
    • 2018
  • The operational aerosol retrieval algorithm for the Moderate Resolution Imaging Spectroradiometer (MODIS) measurements was recently updated and named collection 6 (C6). The C6 MODIS aerosol algorithm, a substantially improved version of the collection 5 (C5) algorithm, uses an enhanced aerosol optical thickness(AOT) retrieval process consisting of new surface reflection and aerosol models. This study reports on the estimation and validation of the two latest versions, the C5 and C6 MODIS aerosol products over the East Asian region covering $20^{\circ}N$ to $56^{\circ}N$ and $80^{\circ}E$ to $150^{\circ}E$. This study also presents a comparative validation of the two versions(C5 and C6) of algorithms with different methods(Dark Target(DT) and Deep Blue (DB) retrieval methods) from the Terra and Aqua platforms to make use of the Aerosol Robotic Network (AERONET) sites for the years 2000-2016. Over the study region, the spatially averaged annual mean AOT retrieved from C6 AOT is about 0.035 (5%) less than the C5 counterparts. The linear correlations between MODIS and AERONET AOT are R = 0.89 (slope = 0.86) for C5 and R = 0.95 (slope = 1.00) for C6. Moreover, the magnitude of the mean error in C6 AOT-the difference between MODIS AOT and AERONET AOT-is 40% less than that in C5 AOT.

Improve ARED Algorithm in TCP/IP Network (TCP/IP 네트워크에서 ARED 알고리즘의 성능 개선)

  • Nam, Jae-Hyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.3
    • /
    • pp.177-183
    • /
    • 2007
  • Active queue management (AQM) refers to a family of packet dropping mechanisms for router queues that has been proposed to support end-to-end congestion control mechanisms in the Internet. The proposed AQM algorithm by the IETF is Random Early Detection (RED). The RED algorithm allows network operators simultaneously to achieve high throughput and low average delay. However. the resulting average queue length is quite sensitive to the level of congestion. In this paper, we propose the Refined Adaptive RED(RARED), as a solution for reducing the sensitivity to parameters that affect RED performance. Based on simulations, we observe that the RARED scheme improves overall performance of the network. In particular, the RARED scheme reduces packet drop rate and improves goodput.

  • PDF

A Study on the Modified Queue Management Scheme for Congestion Avoidance (폭주회피를 위한 개선된 큐 관리 기법에 관한 연구)

  • 양진영;이팔진;김종화
    • Journal of Internet Computing and Services
    • /
    • v.2 no.2
    • /
    • pp.65-70
    • /
    • 2001
  • In this paper, a Modified RED algorithm for congestion avoidance in IP networks is presented. The RED detects incipient congestion by computing the average queue size. By notifying only a randomly selected fraction of connection, it causes to the global synchronization or fairness problem, And also, the network characteristics need to be known in order to find th optimum average queue length. When the average queue size exceeds a minimum threshold, a modified RED algorithm drops packets based on the state of each connection. Performance is improved because of keeping the average queue size low while allowing occasional bursts of packets in the queue, we compare performance of modified RED with RED and Drop Tail in terms of goodput, network utilization and fairness.

  • PDF