• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5A
• /
• pp.426-432
• /
• 2007

The MAP algorithm is designed and implemented through the sliding window method for turbo decoding. First, the implementation issues, which are the length of the sliding window and the normalization method of state metrics are reviewed, and their optimal values are obtained by the simulation. All component schemes of the decoder including the branch metric evaluator are also presented. The proposed MAP architecture can be easily redesigned according to the size of sliding window, that is, sub-frame length because of its simplicity on buffer control.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.164-164
• /
• 2000

This paper proposes a moving window technique that extracts lanes and vehicles using the images captured by a CCD camera equipped inside an automobile in real time. For the purpose, first of all the optimal size of moving window is determined based upon speed of the vehicle, road curvature, and camera parameters. Within the moving windows that are dynamically changing, lanes and vehicles are extracted, and the vehicles within the driving lanes are classified as obstacles. Assuming highway driving, there are two sorts of image-objects within the driving lanes: one is ground mark to show the limit speed or some information for driving, and the other is the vehicle as an obstacle. Using characteristics of three-dimension objects, a neural network can be trained to distinguish the vehicle from ground mark. When it is recognized as an obstacle, the distance from the camera to the front vehicle can be calculated with the aids of database that keeps the models of automobiles on the highway. The correctness of this measurement is verified through the experiments comparing with the radar and laser sensor data.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.421-424
• /
• 2000

In this paper, we propose a window warping method to solve stereo matching problems in projective distortion region. Because the projective distortion region cant t be estimated with fixed-size block matching algorithm, we use the window warping technique in block matching process. The position of a reference window to resample is obtained adaptively according to the degree of reliability in disparity estimated previously. The initial disparity and reliability are obtained by applying a well known hierarchical strategy. The experimental result shows that considerable improvement is obtained in the projective distortion region.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.187-189
• /
• 2014

패킷 네트워크에서 음성, 영상 트래픽이 IP, UDP, RTP 를 이용하여 전송 될 때 중복 헤더가 사용되어 통신의 비효율을 초래한다. 이를 방지 하기 위해 ROHC(Robust Header Compression)가 적용된다. 이는 인접 패킷 헤더 간의 차이 값이 규칙적으로 증가하는 영역은 그 차이 값만을 전송한다. 차이 값은 WLSB 인코딩 과정을 거쳐 전송이 되는데 인코팅 시 Sliding Window 값이 사용된다. Sliding Window 크기에 따라 헤더 압축률이 변하고 대역폭에도 영향을 미치게 된다. 본 논문에서는 효과적인 Sliding Window 값을 구하여 기존 ROHC 에 적용 하여 네트워크 통신의 효율성을 향상 시키고자 한다.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.580-583
• /
• 2007

Various matching methods have been introduced by investigators to improve digital elevation model (DEM) accuracy of satellite imagery. This study proposed an area-based matching method according to land cover property using correlation coefficient of pixel brightness value between the two images for DEM generation from IKONOS stereo imagery. For this, matching line (where "matching line" implies straight line that is approximated to complex nonlinear epipolar geometry) is established by exterior orientation parameters to minimize search area. The matching is carried out based on this line. Land cover classes are divided off into water, urban land, forest and agricultural land. Matching size is selected using a correlation-coefficient image in the four areas. The selected sizes are $81{\times}81$ pixels window, $21{\times}21$ pixels window, $119{\times}119$ pixels window and $51{\times}51$ pixels window in the water area, urban land, forest land and agricultural land, respectively. And hence, DEM is generated from IKONOS stereo imagery using the selected matching sizes and land cover map on the four types.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.896-909
• /
• 2010

IEEE 802.11 medium access control (MAC) employs the distributed coordination function (DCF) as the fundamental medium access function. DCF operates with binary exponential backoff (BEB) in order to avoid frame collisions. However it may waste wireless resources because collisions occur when multiple stations are contending for frame transmissions. In order to solve this problem, a binary negative-exponential backoff (BNEB) algorithm has been proposed that uses the maximum contention window size whenever a collision occurs. However, when the number of contending stations is small, the performance of BNEB is degraded due to the unnecessarily long backoff time. In this paper, we propose the adaptive BNEB (A-BNEB) algorithm to maximize the throughput regardless of the number of contending stations. A-BNEB estimates the number of contending stations and uses this value to adjust the maximum contention window size. Simulation results show that A-BNEB significantly improves the performance of IEEE 802.11 DCF and can maintain a high throughput irrespective of the number of contending stations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11A
• /
• pp.1113-1119
• /
• 2007

In this paper, first, we proposed various possible candidate schemes for determining initial sleep window size and varying sleep window size in sleep mode for power saving class I of IEEE 802.16e. Then, we analyzed and compared the power saving performances of those schemes. The schemes used for the comparisons are EICV of IEEE 802.16e, and other comparable schemes such as EIED, EILD, LIED and LILD. Experimental results show that LILD and EIED outperform other comparable schemes. Especially, EIED shows the better performances for the case of high traffic intensity environments, while LILD does for the low traffic intensity case.

• 한국정보컨버전스학회:학술대회논문집
• /
• 2008.06a
• /
• pp.199-204
• /
• 2008

Sensor nodes have various energy and computational constraints because of their inexpensive nature and ad-hoc method of deployment. Considerable research has been focused at overcoming these deficiencies through faster media accessing, more energy efficient routing, localization algorithms and system design. Our research attempts to provide a method of improvement MAC performance in these issues. We show that traditional carrier-sense multiple access(CSMA) protocols like IEEE 802.11 do not handle the first constraint adequately, and do not take advantage of the second property, leading to degraded latency and throughput as the network scales in size, We present more efficient method of a medium access for real-time wireless sensor networks. Proposed MAC protocol is a randomized CSMA protocol, but unlike previous legacy protocols, does not use a time-varying contention window from which a node randomly picks a transmission slot. To reduce the latency for the delivery of event reports, it carefully decides a fixed-size contention window, non-uniform probability distribution of transmitting in each slot within the window. We show that it can offer up to several times latency reduction compared to legacy of IEEE 802.11 as the size of the sensor network scales up to 256 nodes using widely used simulator ns-2. We, finally show that proposed MAC scheme comes close to meeting bounds on the best latency achievable by a decentralized CSMA-based MAC protocol for real-time wireless sensor networks which is sensitive to latency.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.641-644
• /
• 2008

This paper describes the GUI implementation of an intelligent embedded system which can be used for a personal information platform and an industrial mobile application system. It shows the architecture and the necessary structure and components of X Window graphic system. The embedded system used in this paper has low power and high performance processor, and has a large memory size with a nand-flash memory device. We configured the linux kernel with a TIT-LCD and touch screen device for the operation of X Window system. And we used GTK+2 for running application softwares on the platform embedded system. The GUI library of GTK+2 is useful for providing the same graphics programming environment with host Linux PC. We have developed in this paper the X Window system and the GUI environment for GTK+2 in a new embedded system, and verified the full operation of X Window system and application softwares using GTK+2. The embedded system with large memory size can be used in X Window application softwares for providing a personal information service with a mobile embedded system.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.3
• /
• pp.57-69
• /
• 2000

A moving window technique for detecting a lane and obstacles using the Images captured by a CCD camera attached in an automobile, is proposed in this paper To process the dynamic images in real time, there could be many constraints on the hardware To overcome these hardware constraints and to detect the lane and obstacles in real time, the optimal size of window IS determined based upon road conditions and automobile states. By utilizing the sub-Images inside the windows, detection of the lane and obstacles become possible m real time. For each Image frame, the moving windows are re-determined following the predicted directions based on Kalman filtering theory to Improve detection accuracy, as well as efficiency The feasibility of proposed algorithm IS demonstrated through the simulated experiments of highway driving.