• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.10B
• /
• pp.1399-1408
• /
• 2001

본 논문에서는 삼각형 메쉬(triangular mesh)로 이루어진 3차원 모델의 연결 정보(connectivity data)와 형상 정보(geometry data)를 삼각형 팬(triangle fan) 구조에 기반하여 효율적으로 압축하는 부호화 기법을 제안한다. 첫째로, 연결 정보의 무손실 부호화로 꼭지점 차수 왜곡(vertex degree warping) 기법을 제안한다. 기존의 알고리듬이 연결 정보와 형상 정보를 분리하여 부호화하는데 반해 제안하는 알고리듬은 연결 정보를 부호화하는데 형상 정보를 이용하여 압축 효율을 높인다. 둘째로, 형상 정보를 압축하기 위해 이중 평행사변형 예측(dual parallelogram prediction) 기법을 제안한다. 삼각형 팬 구조를 이용함으로써 기존의 삼각형 스트립(triangle strip) 기반의 알고리듬보다 정확한 형상 예측이 가능하고, 예측 오차가 작아지게 된다. 다양한 3차원 메쉬 모델에 대한 모의 실험을 통하여 제안하는 알고리듬이 기존의 알고리듬보다 우수한 압축 성능을 나타냄을 확인하다.

• Journal of Broadcast Engineering
• /
• v.20 no.2
• /
• pp.257-264
• /
• 2015

In this paper, Enhanced binary block matching method for Constrained one-bit transform (C1BT) based motion estimation is proposed. Binary motion estimation exploits the Number of non-matched points (NNMP) as a block matching criterion instead of the Sum of Absolute Differences (SAD) for low complex motion estimation. The motion estimation using SAD could use the smaller block for more accurate motion estimation. In this paper the enhanced binary block matching method using smaller motion estimation block for C1BT is proposed to the more accurate binary matching. Experimental results shows that the proposed algorithm has better Peak Signal to Noise Ration (PSNR) results compared with conventional binary transform algorithms.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.41 no.4
• /
• pp.13-20
• /
• 2004

In this paper, we developed a method for predicting the tracking performance of the multiple hypothesis tracking (MHT) algorithm. The MHT algerithm is known to be a measurement-oriented optimal Bayesian approach and is superior to any other tracking filters because it takes into account the events that the measurements can be originated from new targets and false alarms as well as interesting targets. In the MHT algorithm, a number of candidate hypotheses are generated and evaluated later as more data are received. The probability of each candidate hypotheses is approximately evaluated by using the hybrid conditional average approach (HYCA). We performed numerical experiments to show the validity of our performance prediction.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6B
• /
• pp.641-647
• /
• 2009

This paper proposes an improved predictive dynamic power management (DPM) scheme and a task scheduling algorithm to reduce unnecessary power consumption in embedded systems. The proposed algorithm performs pre-scheduling to minimize unnecessary power consumption. The proposed predictive DPM utilizes a scheduling library provided by the system to reduce computation overhead. Experimental results show that the proposed algorithm can reduce power consumption by 22.3% on the average comparing with the LLF algorithm for DPM-enable system scheduling.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2023.11a
• /
• pp.86-87
• /
• 2023

해상환경에 적용된 최적항로예측 알고리듬을 자율운항선박의 기본 시스템으로 가정하고 육상의 육상원격제어시스템을 통해 선박이 제어되는 환경을 ECDIS 시스템을 사용하여 시뮬레이션하고 자율운항선박과 육상원격제어 간 안전운항를 위해 상호 시스템 공유를 이용한 협업을 바탕으로 최적항로예측 시뮬레이션을 개선하는 방안을 분석하였다.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.3
• /
• pp.160-166
• /
• 1989

We propose adaptive algorithms computing the coefficients of spatial domain predictors. The method uses the LMS approach to compute the coefficients of the predictors realized by using the TDL(tapped-delay-line) and the ESC (escalator) structures. The predictors to be presented differ from the conventional ones in the sense that the relevant weights are updated such that the sum of the mean squared values of the forward and the backward prediction errors is minimized. Using the coefficients of such spatial domain predictors yields improved linear predictive spatial spectrums. The algorithms are applied to the problems of estimating incident angles of multiple narrow-band signals received by a linear array of sensors. Simulation results demonstrating the performances of the proposed methods are presented.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.1
• /
• pp.49-57
• /
• 2012

An image reconstruction algorithm is proposed to estimate transmitted original images from images displayed on a video terminal. The proposed algorithm acquires images that are displayed on video terminal screens by using a camera. The transmitted images are then estimated with the acquired images. However, camera-acquired images exhibit geometric and color distortions caused by characteristics of the camera and display devices. We make use of a geometric distortion correction algorithm that exploits homography and color distortions using a weighted-linear model. The experimental results show that the proposed algorithm yields promising estimation performance with respect to the peak signal-to-noise ratio (PSNR). PSNR values of the estimated images with respect to the corresponding original images range from 28-29 dB.

• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.647-652
• /
• 2000

This paper proposes a collision warning/avoidance algorithm using a trajectory prediction method. This algorithm is based on 2-dimensional kinematics and the Kalman filter has been used to obtain the information of the object vehicle. This algorithm has been investigated via computer simulation and showed a good trajectory prediction performance. The proposed collision warning/avoidance algorithm would enhanced driver acceptance for a collision warning/avoidance system.

• Journal of Broadcast Engineering
• /
• v.10 no.4 s.29
• /
• pp.621-631
• /
• 2005

To enhance the performance of multi-view sequence CODEC, an efficient disparity vector coding method fur multiview sequences is proposed herein. For higher coding efficiency, we encode the differential vectors acquired by subtracting the original vectors from the predicted ones. To enhance the performance of disparity vector coding, it is essential to predict the disparity vectors accurately. The prediction by this proposed method utilizes the correlation among the multiview images, while conventional methods exploit the correlation among the causal blocks. Experiments were performed fur three different 5 view sequences. We were able to confirm that the proposed method predicts disparity vectors accurately by comparing the entropy and the mean absolute values for differential vectors with conventional methods. Its performance is superior to vector coding methods used in MPEG-4 which uses only a spatial correlation. The proposed method increases the coding efficiency by a factor of $30{\~}45\%$ while preserving image quality.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.9-16
• /
• 2005

A new online routing algerian is proposed in this paper, which use the interference-prediction to solve the network congestion originated from extension of Internet scope and increasing amount of traffic. The end-to-end QoS has to be guaranteed in order to satisfy service level agreements (SLAs) in the integrated networks of next generation. For this purpose, bandwidth is allocated dynamically and effectively, moreover the path selection algorithm is required while considering the network performance. The proposed algorithm predicts the level of how much the amount of current demand interferes the future potential traffic, and then minimizes it. The proposed algorithm considers the bandwidth on demand, link state, and the information about ingress-egress pairs to maximize the network performance and to prevent the waste of the limited resources. In addition, the interference-prediction supports the bandwidth guarantee in dynamic network to accept more requests. In the result, the proposed algorithm performs the effective admission control and QoS routing. In this paper, we analyze the required conditions of routing algorithms, the aspect of recent research, and the representative algorithms to propose the optimized path selection algorithm adequate to Internet franc engineering. Based on these results, we analyze the problems of existing algorithms and propose our algorithm. The simulation shows improved performance by comparing with other algorithms and analyzing them.