• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권3호
• /
• pp.1121-1139
• /
• 2015

In texture-plus-depth format, depth map compression is an important task. Different from normal texture images, depth maps have less texture information, while contain many homogeneous regions separated by sharp edges. This feature will be employed to form an efficient depth map coding scheme in this paper. Firstly, the histogram of the depth map will be analyzed to find an appropriate threshold that segments the depth map into the foreground and background regions, allowing the edge between these two kinds of regions to be obtained. Secondly, the two regions will be encoded through rate distortion optimization with a shape adaptive wavelet transform, while the edges are lossless encoded with JBIG2. Finally, a depth-updating algorithm based on the threshold and the depth range is applied to enhance the quality of the decoded depth maps. Experimental results demonstrate the effective performance on both the depth map quality and the synthesized view quality.

• 제어로봇시스템학회논문지
• /
• 제9권3호
• /
• pp.210-217
• /
• 2003

We introduced a scheme for finding an optimal data association matrix that represents the relationships between the measurements and tracks in multi-target tracking (MIT). We considered the relationships between targets and measurements as Markov Random Field and assumed a priori of the associations as a Gibbs distribution. Based on these assumptions, it was possible to reduce the MAP estimate of the association matrix to the energy minimization problem. After then, we defined an energy function over the measurement space that may incorporate most of the important natural constraints. To find the minimizer of the energy function, we derived a new equation in closed form. By introducing Lagrange multiplier, we derived a compact equation for parameters updating. In this manner, a pair of equations that consist of tracking and parameters updating can track the targets adaptively in a very variable environments. For measurements and targets, this algorithm needs only multiplications for each radar scan. Through the experiments, we analyzed and compared this algorithm with other representative algorithm. The result shows that the proposed method is stable, robust, fast enough for real time computation, as well as more accurate than other method.

• 드라이브 ㆍ 컨트롤
• /
• 제14권3호
• /
• pp.40-49
• /
• 2017

This study presents an online estimation of an excavator's rotational inertia by using recursive least square with forgetting. It is difficult to measure rotational inertia in real systems. Against this background, online estimation of rotational inertia is essential for improving safety and automation of construction equipment such as excavators because changes in inertial parameter impact dynamic characteristics. Regarding an excavator, rotational inertia for swing motion may change significantly according to working posture and digging conditions. Hence, rotational inertia estimation by predicting swing motion is critical for enhancing working safety and automation. Swing velocity and damping coefficient were used for rotational inertia estimation in this study. Updating rules are proposed for enhancing convergence performance by using the damping coefficient and forgetting factors. The proposed estimation algorithm uses three forgetting factors to estimate time-varying rotational inertia, damping coefficient, and torque with different variation rates. Rotational inertia in a typical working scenario was considered for reasonable performance evaluation. Three simulations were conducted by considering several digging conditions. Presented estimation results reveal the proposed estimation scheme is effective for estimating varying rotational inertia of the excavator.

• Journal of Communications and Networks
• /
• 제6권1호
• /
• pp.19-25
• /
• 2004

In this paper, we present a trellis-based blind channel estimation and equalization technique coupling two kinds of adaptive Viterbi algorithms. First, the initial blind channel estimation is accomplished by incorporating the list parallel Viterbi algorithm with the least mean square (LMS) updating approach. In this operation, multiple trellis mappings are preserved simultaneously and ranked in terms of path metrics. Equivalently, multiple channel estimates are maintained and updated once a single symbol is received. Second, the best channel estimate from the above operation will be adopted to set up the whole trellis. The conventional adaptive Viterbi algorithm is then applied to detect the signal and further update the channel estimate alternately. A small delay is introduced for the symbol detection and the decision feedback to smooth the noise impact. An automatic switch between the above two operations is also proposed by exploiting the evolution of path metrics and the linear constraint inherent in the trellis mapping. Simulation has shown an overall excellent performance of the proposed scheme in terms of mean square error (MSE) for channel estimation, robustness to the initial channel guess, computational complexity, and channel equalization.

• 한국수자원학회:학술대회논문집
• /
• 한국수자원학회 2002년도 학술발표회 논문집(II)
• /
• pp.1187-1194
• /
• 2002

In this study, we have simulated regional climate over East Asia using dynamical downscaling For dynamic downscaling experiments for regional climate simulation, MM5method. with 27 km horizontal resolution and 18 layers of sigma-coordinate in vertical is nested within global-scale NCEP reanalysis data with 2.5。${\times}$2.5。 resolution in longitude and latitude. In regional simulation, January and July, 1979 monthly mean features have been obtained by both continuous integration and daily restart integration driven by updating the lateral boundary forcing at 6-hr intervals from the NCEP reanalysis data using a nudging scheme with the updating design of initial and boundary conditions in both continuous and restart integrations. In result, we may successfully generated regional detail features which might be forced by topography, lake, coastlines and land use distribution from a regional climate. There is no significant difference in monthly mean features either integrate continuously or integrate with daily restart. For climatologically long integration, the initial condition may not be significantly important. Accordingly, MM5 can be integrated for a long period without restart frequently, if a proper lateral boundary forcing is given.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권4호
• /
• pp.2094-2112
• /
• 2019

Focusing on the issue that the conventional Kernel Correlation Filter (KCF) algorithm has poor performance in handling scale change and obscured objects, this paper proposes an anti-occlusion and scale adaptive tracking algorithm in the basis of KCF. The average Peak-to Correlation Energy and the peak value of correlation filtering response are used as the confidence indexes to determine whether the target is obscured. In the case of non-occlusion, we modify the searching scheme of the KCF. Instead of searching for a target with a fixed sample size, we search for the target area with multiple scales and then resize it into the sample size to compare with the learnt model. The scale factor with the maximum filter response is the best target scaling and is updated as the optimal scale for the following tracking. Once occlusion is detected, the model updating and scale updating are stopped. Experiments have been conducted on the OTB benchmark video sequences for compassion with other state-of-the-art tracking methods. The results demonstrate the proposed method can effectively improve the tracking success rate and the accuracy in the cases of scale change and occlusion, and meanwhile ensure a real-time performance.

• 정보보호학회논문지
• /
• 제21권5호
• /
• pp.161-168
• /
• 2011

2009년에 전동호 등에 의해 경량의 강한 인증과 프라이버시를 제공하는 프로토콜이 제안되었다. 태그는 단지 간단한 비트연산들과 난수생성기를 필요로 한다. JK-RFID 인증 프로토콜은 도청, 재전송, 스푸핑, 위치추적, 서비스거부 공격, 전방향 안전성에 대한 강한 보안성을 제공한다. 하지만, 본 논문에서는 전방향 안전성에 대한 취약성을 지적하고 키 업데이트 과정에 대한 연산을 개선하였다. 본 논문은 전방향 안전성을 보장하는 개선된 JK-RFID 인증 프로토콜을 제안하고 전방향 안전성을 만족함을 검증하였다. 또한, 제안된 프로토콜의 안전성과 효율성을 분석하였다. 제안 프로토콜은 JK-RFID 인증 프로토콜에서 키 업데이트 부분의 연산을 수정하여 전방향 안전성을 개선하였다.

• 한국멀티미디어학회논문지
• /
• 제8권5호
• /
• pp.606-617
• /
• 2005

XML 질의 처리를 위한 XML 문서 트리내 노드들간의 구조적 관계를 효율적으로 찾는 많은 연구들이 수행되었으며 이러한 연구들의 대부분은 노드들의 위치에 기반한 영역 넘버링을 사용하고 있다 그러나 위치 기반의 노드번호 부여 방식은 동일장소에 반복적으로 노드을 삽입할 때 기존 노드번호들의 값 재조정을 필요로 한다. 본 논문에서는 가변길이 문자열을 이용한 버켓단위의 노드번호를 부여함으로써 재조정 노드수를 줄이는 ENN(Extensible Node Numbering) 방법을 제안한다. 또한 기존의 노드번호 부여 방식인 EP(extended preorder)와의 성능 비교를 실시하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권6호
• /
• pp.1253-1272
• /
• 2010

In this paper, we propose a new affine shape adaptation scheme for the affine invariant feature detector, in which the convergence stability is still an opening problem. This paper examines the relation between the integration scale matrix of next iteration and the current second moment matrix and finds that the convergence stability of the method can be improved by adjusting the relation between the two matrices instead of keeping them always proportional as proposed by previous methods. By estimating and updating the shape of the integration kernel and differentiation kernel in each iteration based on the anisotropy of the current second moment matrix, we propose a coarse-to-fine affine shape adaptation scheme which is able to adjust the pace of convergence and enable the process to converge smoothly. The feature matching experiments demonstrate that the proposed approach obtains an improvement in convergence ratio and repeatability compared with the current schemes with relatively fixed integration kernel.

• 스마트미디어저널
• /
• 제12권9호
• /
• pp.72-80
• /
• 2023

본 논문에서는 다수의 환자가 발생하여 구급차를 통해 병원으로 이송하여야 하는 경우 최소비용 최대유량 알고리즘에 기반하여 병원을 배정 및 재배정하는 기법을 설계하고 성능을 평가한다. 환자의 증상과 병원들까지의 거리에 의해 플로우 그래프를 생성하는 과정, 링크 용량 수정 과정, 구급차와 병원 매칭 과정 등으로 구성되며 알고리즘 수행시간의 효율성으로 인해 추가환자의 발생이나 병원의 수용능력 변경에도 플로우 그래프 재구성에 의해 재배정을 수행할 수 있다. 프로토타입 구현에 의한 성능 평가 결과 주어진 실험 환경에 대해 제안된 기법은 순차 배정 방식에 비해 24%까지 이송요구시간 불만족을 감소시킬 수 있다.