• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.7
• /
• pp.515-521
• /
• 2022

In this paper, we propose Quad BTC that compresses DSM files to allow random access for TRF (Terrain Referenced Flight). The terrain data used for TRF has a large data capacity to be stored in the UAV (Unmanned Aerial Vehicle), so its size must be reduced through compression. Conventional BTC (Block Truncation Coding) based compression methods are suitable for TRF because it can decode randomly accessing specific coordinates. However, These conventional methods have a problem that the error increases because the deviation of the data increases as the size of the block increases. In this paper, we propose Quad BTC method that adaptively divides a block in to 4 sub blocks and compresses to solve this problem. The proposed method may reduce errors because the size of the sub block can be adjusted within the block. Through simulation using actual terrain data, it is verified that Quad BTC has less error at the same compression ratio than conventional BTC and AM BTC.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.2
• /
• pp.98-105
• /
• 2007

In this paper, we propose the method and system which determines the condition for safe and unsafe lane changing. To determine the condition, first, the system sets up the Region of Interest(ROI) on the neighboring lane. Second, a dangerous vehicle is extracted during the line changing. Third, the condition is determined to wm or not by calculating the moving direction, relative distance md relative velocity. To set up the ROI, the only one side lane is detected and the interested region is expanded. Using the coordinate transformation method, the accuracy of the ROI raised. To correctly extract the vehicle on the neighboring lane, the Adaptive Background Update method and Image Segmentation method which uses the feature of the travelling road are used. The object which is extracted by the dangerous vehicle is calculated the relative distance, the relative velocity and the moving average. And then in order to ring, the direction of the vehicle and the condition for safe and unsafe is determined. As minimizes the interested region and uses the feature of the travelling road, the computational quantity is reduced and the accuracy is raised and a stable result on a travelling road images which demands a high speed calculation is showed.

• The Korean Journal of Applied Statistics
• /
• v.19 no.2
• /
• pp.319-330
• /
• 2006

A signal in real world usually composes of multiple signals having different scales of frequencies. For example sun-spot data is fluctuated over 11 year and 85 year. Economic data is supposed to be compound of seasonal component, cyclic component and long-term trend. Decomposition of the signal is one of the main topics in time series analysis. However when the signal is subject to nonstationarity, traditional time series analysis such as spectral analysis is not suitable. Huang et. at(1998) proposed data-adaptive method called empirical mode decomposition (EMD) . Due to its robustness to nonstationarity, EMD has been applied to various fields. Huang et. at, however, have not considered denoising when data is contaminated by error. In this paper we propose efficient denoising method utilizing cross-validation.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.86-101
• /
• 2006

The bandwidth of channel and the power of the mobile devices are limited on a wireless environment. In this case, data broadcast has become an excellent technique for efficient data dissemination. A significant amount of researches have been done on generating an efficient broadcast program of a set of data items with different access frequencies over multiple wireless broadcast channels as well as single wireless broadcast channel. In this paper, an efficient data allocation method over multiple wireless broadcasting channels is explored. In the traditional approaches, a set of data items are partitioned into a number of channel based on their access probabilities. However, these approaches ignore a variation of access probabilities of data items allocated in each channel. In practice, it is difficult to have many broadcast channels and thus each channel need to broadcast many data items. Therefore, if a set of data items broadcast in each channel have different repetition frequencies based on their access frequencies, it will give much better performance than the traditional approaches. In this paper, we propose an adaptive data allocation technique based on data access probabilities over multiple broadcast channels. Our proposed technique allows the adaptation of repetition frequency of each data item within each channel by taking its access probabilities into at count.

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.755-768
• /
• 2002

We investigate the effect of the data skew of join attributes on the performance of a pipelined multi-way hash join method, and propose two new hash join methods with load balancing capabilities. The first proposed method allocates buckets statically by round-robin fashion, and the second one allocates buckets adaptively via a frequency distribution. Using hash-based joins, multiple joins can be pipelined so that the early results from a join, before the whole join is completed, are sent to the next join processing without staying on disks. Unless the pipelining execution of multiple hash joins includes some load balancing mechanisms, the skew effect can severely deteriorate system performance. In this paper, we derive an execution model of the pipeline segment and a cost model, and develop a simulator for the study. As shown by our simulation with a wide range of parameters, join selectivities and sizes of relations deteriorate the system performance as the degree of data skew is larger. But the proposed method using a large number of buckets and a tuning technique can offer substantial robustness against a wide range of skew conditions.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.6
• /
• pp.672-686
• /
• 2002

현재 단대단(End-to-End) 비디오 서비스의 질을 높이기 위해 많은 연구가 각 계층별로 진행되고 있다. 전송계층에서의 오류 제어(Error Control), 네트워크계층에서의 QoS (Quality of Service)모델, 표현 및 응용계층에서의 오류 강인성(Error resilience)/오류 은닉(Error concealment) 등이 연구 개발되고 있다. 그러나 계층 간의 연관성이 높은 부분에서의 통합을 통한 성능향상에 관한 연구는 그 필요성과 효율에 비해 아직도 미흡하다. 본 논문은 QoS 서비스 모델하에서의 적응적 FEC(Forward Error Correction) 적용 및 우선순위에 따른 비디오패킷(VP ,VideoPacket)을 통하여 효율적인 계층화 비디오 스트리밍을 단대단 QoS성능의 향상에 관점을 맞추어 제안한다. 제안하는 방식은 최소 화질 보장과 같은 효율에서 보다 적은 가격에서의 서비스를 제공할 수 있다. 이를 위하여 통합형 서비스(IntServ, IS, Integrated Service) 의 자원예약을 사용하는 방법과 높은 가격의 자원 예약을 사용하지 않는 차별화 서비스(DiffServ, DS, Differentiated Service)를 적용했으며 이에 보장형 서비스의 특징을 공통을 가지기 위해 계층화 FEC를 적용하였으며 적절한 가격의 조절을 위하여 비디오패킷을 통한 데이터 분할을 적용하였다. 본 논문은 또한 최종 사용자의 만족도를 PSNR(Picture Signal to Noise Ration)과 PSNR에서 표현하지 못하는 부분의 평가를 위해 손상프레임율(DFR, Damaged Frame Ratio)과 오류프레임율(EFR,Error Frame Ratio)을 제안 이를 통해 평가하고자 한다. 제안하는 방식의 실험 결과는 비디오 코딩계층과 전송 계층, 네트워크 계층의 결합된 성능이며 이는 또한 화질의 개선뿐만 아니라 사용자의 가격문제에 대하여서도 비교 분석하였다.

• Journal of Broadcast Engineering
• /
• v.27 no.3
• /
• pp.332-340
• /
• 2022

Recently, with the development of deep learning and artificial neural network technologies, research on the application of neural network has been actively conducted in the field of video coding. In particular, deep learning-based intra prediction is being studied as a way to overcome the performance limitations of the existing intra prediction techniques. This paper presents a method of context-adaptive neural network-based intra prediction model training and its coding performance analysis. In other words, in this paper, we implement and train a known intra prediction model based on convolutional neural network (CNN) that predicts a current block using contextual information from reference blocks. Then, we integrate the trained model into HM16.19 as an additional intra prediction mode and evaluate the coding performance of the trained model. Experimental results show that the trained model gives 0.28% BD-rate bit saving over HEVC in All Intra (AI) coding mode. In addition, the coding performance change of training considering block partition is also presented.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.14 no.1
• /
• pp.94-101
• /
• 2000

In this paper, a multi-channel active noise control(ANC) system using subband hybrid control techniques is proposed. Subband techniques could reduce computational burden and improve the performance of ANC systems by dividing several frequency subband and adjusting adaptive filter coefficients. So it can effectively cancel noises at wanted frequency range and use lower order adaptive filter than the existing algorithms. The adjoint LMS algorithm, which prefilter the error signals instead of the divided reference signals in frequency band, is also used for adaptive filter algorithms to reduce the computational burden of the subband adaptive systems. To improve performance of the ANC system, a weighted hybrid control technique, which has weightily properties of feedforward control systems and feedback control systems, is applied. This algorithm shows higher stability and good noise attenuation property in broad band ANC systems. Computer simulations were performed to show the effectiveness of the proposed algorithm.

• The Journal of the Acoustical Society of Korea
• /
• v.7 no.4
• /
• pp.54-76
• /
• 1988

In Part Ⅰ of the paper, we have developed various block least mean-square (BLMS) adaptive digital filters (ADF's) based on a unified matrix treatment. In Part Ⅱ we analyze the convergence behaviors of the self-orthogonalizing frequency-domain BLMS (FBLMS) ADF and the unconstrained FBLMS (UFBLMS) ADF both for the overlap-save and overlap-add sectioning methods. We first show that, unlike the FBLMS ADF with a constant convergence factor, the convergence behavior of the self-orthogonalizing FBLMS ADF is governed by the same autocorrelation matrix as that of the UFBLMS ADF. We then show that the optimum solution of the UFBLMS ADF is the same as that of the constrained FBLMS ADF when the filter length is sufficiently long. The mean of the weight vector of the UFBLMS ADF is also shown to converge to the optimum Wiener weight vector under a proper condition. However, the steady-state mean-squared error(MSE) of the UFBLMS ADF turns out to be slightly worse than that of the constrained algorithm if the same convergence constant is used in both cases. On the other hand, when the filter length is not sufficiently long, while the constrained FBLMS ADF yields poor performance, the performance of the UFBLMS ADF can be improved to some extent by utilizing its extended filter-length capability. As for the self-orthogonalizing FBLMS ADF, we study how we can approximate the autocorrelation matrix by a diagonal matrix in the frequency domain. We also analyze the steady-state MSE's of the self-orthogonalizing FBLMS ADF's with and without the constant. Finally, we present various simulation results to verify our analytical results.

• The Journal of the Acoustical Society of Korea
• /
• v.32 no.6
• /
• pp.548-555
• /
• 2013

The localization of sources has a numerous number of applications. To estimate the position of sources, the relative delay between two or more received signals for the direct signal must be determined. Although the generalized cross-correlation method is the most popular technique, an approach based on eigenvalue decomposition (EVD) is also popular one, which utilizes an eigenvector of the minimum eigenvalue. The performance of the eigenvalue decomposition (EVD) based method degrades in the low SNR and the correlated environments, because it is difficult to select a single eigenvector for the minimum eigenvalue. In this paper, we propose a new adaptive algorithm based on Canonical Correlation Analysis (CCA) in order to extend the operation range to the lower SNR and the correlation environments. The proposed algorithm uses the eigenvector corresponding to the maximum eigenvalue in the generalized eigenvalue decomposition (GEVD). The estimated eigenvector contains all the information that we need for time delay estimation. We have performed simulations with uncorrelated and correlated noise for several SNRs, showing that the CCA based algorithm can estimate the time delays more accurately than the adaptive EVD algorithm.