Entity

Time filter

Source Type

Daegu, South Korea

Baek J.W.,Automotive IT Platform Research Section | Kwon K.-K.,Automotive IT Platform Research Section | Lee S.-I.,Daegu Gyeongbuk Research Center
Proceedings of the International Symposium on Consumer Electronics, ISCE | Year: 2014

This paper proposes a novel on-road vehicle detection algorithm for Advanced Driver Assistance Systems. The proposed algorithm uses shadow and edge information of original image to generate the candidate vehicles. The proposed algorithm extracts the shadow region darker than the road, and creates an edge image using the Canny edge detector. It performs AND operation between the shadow image and the edge image. The candidate vehicles are verified by SVM classifier based on the HOG feature vector. The experimental results show that the proposed algorithm provides fast and accurate vehicle detection. And the number of candidates is reasonable for the vehicle verification. © 2014 IEEE. Source


Baek J.W.,Daegu Gyeongbuk Research Center | Nam Y.J.,Daegu University | Seo D.-W.,Kyungpook National University
IEICE Transactions on Communications | Year: 2010

Wireless sensor networks are subject to node and link failures for a variety of reasons. This paper proposes a k-disjoint-path routing algorithm that varies the number of disjoint paths (k) in order to meet a target-delivery ratio of critical events and to reduce energy consumption. The proposed algorithm sends packets to the base station through a single path without the occurrence of critical events, however, it sends packets to the base station through k disjoint paths (k > 1) under the occurrence of critical events, where k is computed from a well-defined fault model. The proposed algorithm detects the occurrence of critical events by monitoring collected data patterns. The simulation results reveal that the proposed algorithm is more resilient to random node failure and patterned failure than other routing algorithms and it also decreases energy consumption much more than the multi-path and path-repair algorithms. © 2010 The Institute of Electronics. Source


Seo D.-W.,Daegu Gyeongbuk Research Center | Khang S.-T.,Korea Advanced Institute of Science and Technology | Chae S.-C.,Korea Advanced Institute of Science and Technology | Yu J.-W.,Korea Advanced Institute of Science and Technology | And 2 more authors.
Microwave and Optical Technology Letters | Year: 2016

An open-loop self-adaptive wireless power transfer system using magnetic resonance coupling for implantable biosensors, which provides stable wireless power regardless of variations in operating distance and lateral misalignment between the transmitting and receiving antennas, is proposed. According to adaptive impedance matching algorithms under the minimum reflected power conditions, the proposed system achieves an improved power transfer efficiency of maximum 47% within the operating distance. © 2016 Wiley Periodicals, Inc. Source


Baek J.W.,Daegu Gyeongbuk Research Center | Nam Y.J.,Daegu University | Seo D.-W.,Kyungpook National University
IEICE Transactions on Communications | Year: 2012

In this paper, we propose a novel in-network aggregation scheduling scheme for forest fire monitoring in a wireless sensor network. This adaptively configures both the timeout and the collecting period according to the potential level of a fire occurrence. At normal times, the proposed scheme decreases a timeout that is a wait time for packets sent from child nodes and makes the collecting period longer. That reduces the dissipated energy of the sensor node. Conversely, the proposed scheme increases the timeout and makes the collecting period shorter during fire occurrences in order to achieve more accurate data aggregation and early fire detection. Copyright © 2012 The Institute of Electronics, Information and Communication Engineers. Source


Baek J.W.,Daegu Gyeongbuk Research Center | Nam Y.J.,Daegu University | Seo D.-W.,Kyungpook National University
IEICE Transactions on Communications | Year: 2012

This paper proposes a novel routing algorithm that constructs position-based k-disjoint paths to realize greater resiliency to patterned failure. The proposed algorithm constructs k-disjoint paths that are spatially distributed by using the hop-count based positioning system. Simulation results reveal that the proposed algorithm is more resilient to patterned failure than other routing algorithms, while it has low power consumption and small delay. Copyright © 2012 The Institute of Electronics, Information and Communication Engineers. Source

Discover hidden collaborations