• Title/Summary/Keyword: Information Algorithm

Search Result 29,040, Processing Time 0.058 seconds

Welfare Interface using Multiple Facial Features Tracking (다중 얼굴 특징 추적을 이용한 복지형 인터페이스)

  • Ju, Jin-Sun;Shin, Yun-Hee;Kim, Eun-Yi
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.1
    • /
    • pp.75-83
    • /
    • 2008
  • We propose a welfare interface using multiple fecial features tracking, which can efficiently implement various mouse operations. The proposed system consist of five modules: face detection, eye detection, mouth detection, facial feature tracking, and mouse control. The facial region is first obtained using skin-color model and connected-component analysis(CCs). Thereafter the eye regions are localized using neutral network(NN)-based texture classifier that discriminates the facial region into eye class and non-eye class, and then mouth region is localized using edge detector. Once eye and mouth regions are localized they are continuously and correctly tracking by mean-shift algorithm and template matching, respectively. Based on the tracking results, mouse operations such as movement or click are implemented. To assess the validity of the proposed system, it was applied to the interface system for web browser and was tested on a group of 25 users. The results show that our system have the accuracy of 99% and process more than 21 frame/sec on PC for the $320{\times}240$ size input image, as such it can supply a user-friendly and convenient access to a computer in real-time operation.

Distributed Multi-channel Assignment Scheme Based on Hops in Wireless Mesh Networks (무선 메쉬 네트워크를 위한 홉 기반 분산형 다중 채널 할당 방안)

  • Kum, Dong-Won;Choi, Jae-In;Lee, Sung-Hyup;Cho, You-Ze
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.5
    • /
    • pp.1-6
    • /
    • 2007
  • In wireless mesh networks (WMNs), the end-to-end throughput of a flow decreases drastically according to the traversed number of hops due to interference among different hops of the same flow in addition to interference between hops of different flows with different paths. This paper proposes a distributed multi-channel assignment scheme based on hops (DMASH) to improve the performance of a static WMN. The proposed DMASH is a novel distributed multi-channel assignment scheme based on hops to enhance the end-to-end throughput by reducing interference between channels when transmitting packets in the IEEE 802.11 based multi-interface environments. The DMASH assigns a channel group to each hop, which has no interference between adjacent hops from a gateway in channel assignment phase, then each node selects its channel randomly among the channel group. Since the DMASH is a distributed scheme with unmanaged and auto-configuration of channel assignment, it has a less overhead and implementation complexity in algorithm than centralized multi-channel assignment schemes. Simulation results using the NS-2 showed that the DMASH could improve remarkably the total network throughput in multi-hop environments, comparing with a random channel assignment scheme.

A Design of AES-based WiBro Security Processor (AES 기반 와이브로 보안 프로세서 설계)

  • Kim, Jong-Hwan;Shin, Kyung-Wook
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.7 s.361
    • /
    • pp.71-80
    • /
    • 2007
  • This paper describes an efficient hardware design of WiBro security processor (WBSec) supporting for the security sub-layer of WiBro wireless internet system. The WBSec processor, which is based on AES (Advanced Encryption Standard) block cipher algorithm, performs data oncryption/decryption, authentication/integrity, and key encryption/decryption for packet data protection of wireless network. It carries out the modes of ECB, CTR, CBC, CCM and key wrap/unwrap with two AES cores working in parallel. In order to achieve an area-efficient implementation, two design techniques are considered; First, round transformation block within AES core is designed using a shared structure for encryption/decryption. Secondly, SubByte/InvSubByte blocks that require the largest hardware in AES core are implemented using field transformation technique. It results that the gate count of WBSec is reduced by about 25% compared with conventional LUT (Look-Up Table)-based design. The WBSec processor designed in Verilog-HDL has about 22,350 gates, and the estimated throughput is about 16-Mbps at key wrap mode and maximum 213-Mbps at CCM mode, thus it can be used for hardware design of WiBro security system.

3D Model Retrieval Using Sliced Shape Image (단면 형상 영상을 이용한 3차원 모델 검색)

  • Park, Yu-Sin;Seo, Yung-Ho;Yun, Yong-In;Kwon, Jun-Sik;Choi, Jong-Soo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.6
    • /
    • pp.27-37
    • /
    • 2008
  • Applications of 3D data increase with advancement of multimedia technique and contents, and it is necessary to manage and to retrieve for 3D data efficiently. In this paper, we propose a new method using the sliced shape which extracts efficiently a feature description for shape-based retrieval of 3D models. Since the feature descriptor of 3D model should be invariant to translation, rotation and scale for its model, normalization of models requires for 3D model retrieval system. This paper uses principal component analysis(PCA) method in order to normalize all the models. The proposed algorithm finds a direction of each axis by the PCA and creates orthogonal n planes in each axis. These planes are orthogonalized with each axis, and are used to extract sliced shape image. Sliced shape image is the 2D plane created by intersecting at between 3D model and these planes. The proposed feature descriptor is a distribution of Euclidean distances from center point of sliced shape image to its outline. A performed evaluation is used for average of the normalize modified retrieval rank(ANMRR) with a standard evaluation from MPEG-7. In our experimental results, we demonstrate that the proposed method is an efficient 3D model retrieval.

Real-Time Implementation of Acoustic Echo Canceller for Mobile Handset Using TeakLite DSP Core (Teaklite DSP Core 를 이용한 이동통신 단말기용 음향반향제거기의 실시간 구현)

  • Gwon, Hong-Seok;Kim, Si-Ho;Jang, Byeong-Uk;Bae, Geon-Seong
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.2
    • /
    • pp.128-136
    • /
    • 2002
  • In this paper, we developed an acoustic echo canceller in real-time using TeakLite DSP Core, which will be placed in the vocoder chip of a mobile handset. Considering the limited computational capacity given to the acoustic echo canceller in a vocoder chip, we employed a FIR-type adaptive filter using a conventional NLMS algorithm. To begin with, we designed and implemented an acoustic echo canceller with floating-point format C-source code, and then converted it into fixed-point format through integer simulation. Then we programmed and optimized it in the assembler level to make it run ill real-time. After optimization procedure, the implemented echo canceller has approximately 624 words of program memory and 811 words of data memory. With 8 KHz sampling rate and 256 filter taps in the echo canceller that corresponds to 32 msec of echo delay, it requires 14.12 MIPS of computational capacity. For coverage of 16 msec echo delay, i.e., 128 filter taps, 9 MIPS is requited.

A Study on the UAV-based Vegetable Index Comparison for Detection of Pine Wilt Disease Trees (소나무재선충병 피해목 탐지를 위한 UAV기반의 식생지수 비교 연구)

  • Jung, Yoon-Young;Kim, Sang-Wook
    • Journal of Cadastre & Land InformatiX
    • /
    • v.50 no.1
    • /
    • pp.201-214
    • /
    • 2020
  • This study aimed to early detect damaged trees by pine wilt disease using the vegetation indices of UAV images. The location data of 193 pine wilt disease trees were constructed through field surveys and vegetation index analyses of NDVI, GNDVI, NDRE and SAVI were performed using multi-spectral UAV images at the same time. K-Means algorithm was adopted to classify damaged trees and confusion matrix was used to compare and analyze the classification accuracy. The results of the study are summarized as follows. First, the overall accuracy of the classification was analyzed in order of NDVI (88.04%, Kappa coefficient 0.76) > GNDVI (86.01%, Kappa coefficient 0.72) > NDRE (77.35%, Kappa coefficient 0.55) > SAVI (76.84%, Kappa coefficient 0.54) and showed the highest accuracy of NDVI. Second, K-Means unsupervised classification method using NDVI or GNDVI is possible to some extent to find out the damaged trees. In particular, this technique is to help early detection of damaged trees due to its intensive operation, low user intervention and relatively simple analysis process. In the future, it is expected that the utilization of time series images or the application of deep learning techniques will increase the accuracy of classification.

GPS/INS Integration and Preliminary Test of GPS/MEMS IMU for Real-time Aerial Monitoring System (실시간 공중 자료획득 시스템을 위한 GPS/MEMS IMU 센서 검증 및 GPS/INS 통합 알고리즘)

  • Lee, Won-Jin;Kwon, Jay-Hyoun;Lee, Jong-Ki;Han, Joong-Hee
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.27 no.2
    • /
    • pp.225-234
    • /
    • 2009
  • Real-time Aerial Monitoring System (RAMS) is to perform the rapid mapping in an emergency situation so that the geoinformation such as orthophoto and/or Digital Elevation Model is constructed in near real time. In this system, the GPS/INS plays an very important role in providing the position as well as the attitude information. Therefore, in this study, the performance of an IMU sensor which is supposed to be installed on board the RAMS is evaluated. And the integration algorithm of GPS/INS are tested with simulated dataset to find out which is more appropriate in real time mapping. According to the static and kinematic results, the sensor shows the position error of 3$\sim$4m and 2$\sim$3m, respectively. Also, it was verified that the sensor performs better on the attitude when the magnetic field sensor are used in the Aerospace mode. In the comparison of EKF and UKF, the overall performances shows not much differences in straight as well as in curved trajectory. However, the calculation time in EKF was appeared about 25 times faster than that of UKF, thus EKF seems to be the better selection in RAMS.

Impulse Response Filtration Technique for the Determination of Phase Velocities from SASW Measurements (SASW시험에 의한 위상속도 결정을 위한 임펄스 응답필터 기법)

  • ;Stokoe, K.H., Il
    • Geotechnical Engineering
    • /
    • v.13 no.1
    • /
    • pp.111-122
    • /
    • 1997
  • The calculation of phase velocities in Spectral-Analysis -of-Surface -Waves (SASW) meas urements requires unwrapping phase angles. In case of layered systems with strong stiffness contrast like a pavement system, conventional phase unwrapping algorithm to add in teger multiples of 2n to the principal value of a phase angle may lead to wrong phase volocities. This is because there is difficulty in counting the number of jumps in the phase spectrum especially at the receiver spacing where the measurements are in the transition Bone of defferent modes. A new phase interpretation scheme, called "Impulse Response Fil traction ( IRF) Technique," is proposed, which is based on the separation of wave groups by the filtration of the impulse response determinded between two receivers. The separation of a wave group is based on the impulse response filtered by using information from Gabor spectrogram, which visualizes the propagation of wave groups at the frequency -time space. The filtered impulse response leads to clear interpretation of phase spectrum, which eliminates difficulty in counting number of jumps in the phase spectrum. Verification of the IRF technique was performed by theoretical simulation of the SASW measurement on a pavement system which complicates wave propagation.opagation.

  • PDF

Design of Multilayer Radome with Particle Swarm Optimization (Particle Swarm Optimization을 이용한 다층 구조 레이돔 설계)

  • Lee, Kyung-Won;Hong, Ic-Pyo;Park, Beom-Jun;Chung, Yeong-Chul;Yook, Jong-Gwan
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.21 no.7
    • /
    • pp.744-751
    • /
    • 2010
  • In this paper, the design of multilayer radome within, the insertion loss, -0.3 dB in X-band with PSO was carried out based on two cases. The first is that, deciding material constant of skin and core, each layer thickness of c-sandwich radome with PSO is found and the second is that, deciding material constant and thickness of the skins of both sides, the material constant and thickness of three layers between skins of both sides using PSO is decided. The performance of the designed radome almost agreed with the required performance. It was showed that the radome design applying PSO algorithm is easy and fast and the optimum radome is also designed in combination of the various parameters of radome. From these results, the radome having various performance can be designed except the tedious calculation and also be applied to various radome structure.

An Item-based Collaborative Filtering Technique by Associative Relation Clustering in Personalized Recommender Systems (개인화 추천 시스템에서 연관 관계 군집에 의한 아이템 기반의 협력적 필터링 기술)

  • 정경용;김진현;정헌만;이정현
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.4
    • /
    • pp.467-477
    • /
    • 2004
  • While recommender systems were used by a few E-commerce sites former days, they are now becoming serious business tools that are re-shaping the world of I-commerce. And collaborative filtering has been a very successful recommendation technique in both research and practice. But there are two problems in personalized recommender systems, it is First-Rating problem and Sparsity problem. In this paper, we solve these problems using the associative relation clustering and “Lift” of association rules. We produce “Lift” between items using user's rating data. And we apply Threshold by -cut to the association between items. To make an efficiency of associative relation cluster higher, we use not only the existing Hypergraph Clique Clustering algorithm but also the suggested Split Cluster method. If the cluster is completed, we calculate a similarity iten in each inner cluster. And the index is saved in the database for the fast access. We apply the creating index to predict the preference for new items. To estimate the Performance, the suggested method is compared with existing collaborative filtering techniques. As a result, the proposed method is efficient for improving the accuracy of prediction through solving problems of existing collaborative filtering techniques.