• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.6
• /
• pp.75-83
• /
• 2007

A model based approach of tracking the limbs of a walking human subject is proposed in this paper. The tracking process begins by building a data base composed of conditional probabilities of motions between the limbs of a walking subject. With a suitable amount of video footage from various human subjects included in the database, a probabilistic model characterizing the relationships between motions of limbs is developed. The motion tracking of a test subject begins with identifying and tracking limbs from the surveillance video image using the edge and silhouette detection methods. When occlusion occurs in any of the limbs being tracked, the approach uses the probabilistic motion model in conjunction with the minimum cost based edge and silhouette tracking model to determine the motion of the limb occluded in the image. The method has shown promising results of tracking occluded limbs in the validation tests.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.8
• /
• pp.151-160
• /
• 2022

In this paper, we propose an algorithm that enables near-field delivery at a faster and lowest cost to meet the growing demand for delivery services. The algorithm proposed in this study involves subway passengers (shipper) in logistics movement as delivery sources. At this time, the passenger may select a delivery logistics matching subway route. And from the perspective of the service user, it is possible to select a delivery man whose route matches. At this time, the delivery source recommendation is carried out in a text similarity measurement method that combines TF-IDF&N-gram and BERT. Therefore, unlike the existing delivery system, two-way selection is supported in a man-to-man method between consumers and delivery man. Both cost minimization and delivery period reduction can be guaranteed in that passengers on board are involved in logistics movement. In addition, since special skills are not required in terms of transportation, it is also meaningful in that it can provide opportunities for economic participation to workers whose job positions have been reduced.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.40 no.4
• /
• pp.437-444
• /
• 2020

A lunar rover's optical camera is used to provide navigation and terrain information in an exploration zone. However, due to the scant presence of atmosphere, the Moon has homogeneous terrain with dark soil. Also, in extreme environments, the rover has limited data storage with low computation capability. Thus, for successful exploration, it is required to examine feature detection and matching methods which are robust to lunar terrain and environmental characteristics. In this research, SIFT, SURF, BRISK, ORB, and AKAZE are comparatively analyzed with lunar terrain images from a lunar rover. Experimental results show that SIFT and AKAZE are most robust for lunar terrain characteristics. AKAZE detects less quantity of feature points than SIFT, but feature points are detected and matched with high precision and the least computational cost. AKAZE is adequate for fast and accurate navigation information. Although SIFT has the highest computational cost, the largest quantity of feature points are stably detected and matched. The rover periodically sends terrain images to Earth. Thus, SIFT is suitable for global 3D terrain map construction in that a large amount of terrain images can be processed on Earth. Study results are expected to provide a guideline to utilize feature detection and matching methods for future lunar exploration rovers.

• The KIPS Transactions:PartB
• /
• v.12B no.4 s.100
• /
• pp.429-436
• /
• 2005

A simple stereo matching algorithm using population-based incremental learning(PBIL) is proposed in this paper to decrease the general problem of genetic algorithms, such as memory consumption and inefficiency of search. PBIL is a variation of genetic algorithms using stochastic search and competitive teaming based on a probability vector. The structure of PBIL is simpler than that of other genetic algorithm families, such as serial and parallel ones, due to the use of a probability vector. The PBIL strategy is simplified and adapted for stereo matching circumstances. Thus, gene pool, chromosome crossover, and gene mutation we removed, while the evolution rule, that fitter chromosomes should have higher survival probabilities, is preserved. As a result, memory space is decreased, matching rules are simplified and computation cost is reduced. In addition, a scheme controlling the distance of neighbors for disparity smoothness is inserted to obtain a wide-area consistency of disparities, like a result of coarse-to-fine matchers. Because of this scheme, the proposed algorithm can produce a stable disparity map with a small fixed-size window. Finally, an alterative version of the proposed algorithm without using probability vector is also presented for simpler set-ups.

• KSCI Review
• /
• v.14 no.1
• /
• pp.265-271
• /
• 2006

In this paper, we propose a new automatic fingerprint identification system that identifies individuals in large databases. The algorithm consists of three steps: preprocessing, classification, and matching, in the classification, we present a new classification technique based on the statistical approach for directional image distribution. In matching, we also describe improved minutiae candidate pair extraction algorithm that is faster and more accurate than existing algorithm. In matching stage, we extract fingerprint minutiaes from its thinned image for accuracy, and introduce matching process using minutiae linking information. Introduction of linking information into the minutiae matching process is a simple but accurate way, which solves the problem of reference minutiae pair selection in comparison stage of two fingerprints quickly. This algorithm is invariant to translation and rotation of fingerprint. The proposed system was tested on 1000 fingerprint images from the semiconductor chip style scanner. Experimental results reveal false acceptance rate is decreased and genuine acceptance rate is increased than existing method.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2006.08a
• /
• pp.641-643
• /
• 2006

Add-Vision has developed a low-cost print technology for P-OLED displays on flexible substrates that meets several essentials for a new technology including: (1) Functionality including low DC voltage and wide color gamut; (2) Utilization of inexpensive tools; (3) Performance matching entry applications and markets. AVI's process is based on large-area printing of a combination of doped emissive and air-stable cathode inks utilizing truly low-cost tools to create printed P-OLEDs.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.6
• /
• pp.1048-1057
• /
• 2008

This paper represents a design method for PID or low-order controllers cascaded with a linear plant in the unit feedback system where it is required to meet the given time response specifications such as overshoot and settling time. This problem is difficult to solve because the zeros of the controller appear in the numerator of the overall system and thus those zeros may make the time response design difficult. In this paper, we propose a new approach based on the partial model matching and the so called K-polynomial. The partial matching problem is formulated to an optimization problem in which a quadratic function of coefficient errors between a target model and the resulting closed loop system is minimized. For the sake of satisfying the closed loop stability, a set of quadratic constraints associated with the cost function is introduced. As a result, the controller designed meets both time response requirements and the closed loop stability, if any. It is shown through several examples that the present method can be easily applied to these problems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.583-599
• /
• 2015

We apply the Bayesian matching pursuit (BMP) algorithm to the estimation of time-frequency selective channels in orthogonal frequency division multiplexing (OFDM) systems. By exploiting prior statistics and sparse characteristics of propagation channels, the Bayesian method provides a more accurate and efficient detection of the channel status information (CSI) than do conventional sparse channel estimation methods that are based on compressive sensing (CS) technologies. Using a reasonable approximation of the system model and a skillfully designed pilot arrangement, the proposed estimation scheme is able to address the Doppler-induced inter-carrier interference (ICI) with a relatively low complexity. Moreover, to further reduce the computational cost of the channel estimation, we make some modifications to the BMP algorithm. The modified algorithm can make good use of the group-sparse structure of doubly selective channels and thus reconstruct the CSI more efficiently than does the original BMP algorithm, which treats the sparse signals in the conventional manner and ignores the specific structure of their sparsity patterns. Numerical results demonstrate that the proposed Bayesian estimation has a good performance over rapidly time-varying channels.

• Journal of Information Technology Applications and Management
• /
• v.12 no.4
• /
• pp.93-104
• /
• 2005

Recently, RFID/USN is one of fundamental technologies in information and communications networks. Low-Rate WPAN, IEEE802.15.4 is a low-cost communication network that allows wireless connectivity in applications with limited Power and relaxed throughput requirements. Its applications are building automation, personal healthcare, industrial control, consumer electronics, and so on. Some applications require location information. Of course location awareness is useful to improve usability of data Low-Rate WPAN Is regarded as a key specification of the sensor network with the characteristics of wireless communication, computing, energy scavenging, self-networking, and etc. Unfortunately ZigBee alliance propose a lot of applications based on location aware technologies, but the specification and low-rate WPAN devices don't support anything about location-based services. RSSI ( Received Signal Strength indication) is for energy detection to associate, channel selection, and etc. RSSI is used to find the location of a potable device in WLAN. In this paper we studied indoor location awareness using vector matching of RSSI in low-Rate wireless PAN. We analyzed the characteristics of RSSI according to distance and experimented location awareness. We implemented sensor nodes with different shapes and configured the sensor network for the location awareness with 4 fixed nodes and a mobile node. We try to contribute developing location awareness method using RSSI in 3-dimension space.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.1
• /
• pp.27-38
• /
• 2017

Packet classification is one of the essential functionalities of Internet routers in providing quality of service. Since the arrival rate of input packets can be tens-of-millions per second, wire-speed packet classification has become one of the most challenging tasks. While traditional packet classification only reports a single matching result, new network applications require multiple matching results. Ternary content-addressable memory (TCAM) has been adopted to solve the multi-match classification problem due to its ability to perform fast parallel matching. However, TCAM has a fundamental issue: high power dissipation. Since TCAM is designed for a single match, the applicability of TCAM to multi-match classification is limited. In this paper, we propose a cost- and energy-efficient multi-match classification architecture that combines TCAM with a tuple space search algorithm. The proposed solution uses two small TCAM modules and requires a single-cycle TCAM lookup, two SRAM accesses, and several Bloom filter query cycles for multi-match classifications.