• Journal of Korea Multimedia Society
• /
• v.14 no.12
• /
• pp.1572-1582
• /
• 2011

The rapid growth of UnderWater Acoustic Sensor Networks (UW-ASNs) has led researchers to enhance underwater MAC protocols against limitations existing in underwater environment. We propose the customized robust real-time packet inspection mechanism with addressing the problem of the search for the data packet loss and network performance quality analysis in UW-ASNs, and describe our experiences using this approach. The goal of this work is to provide a framework to assess the network real-time performance quality. We propose a customized and adaptive mechanism to detect, monitor and analyze the data packets according to the MAC protocol standards in UW-ASNs. The packet analyzing method and software we propose is easy to implement, maintain, update and enhance. We take input stream as real data packets from sniffer node in capture mode and perform fully analysis. We were interested in developing software and hardware designed tool with the same capabilities which almost all terrestrial network packet sniffers have. Experimental results confirm that the best way to achieve maximum performance requires the most adaptive algorithm. In this paper, we present and offer the proposed packet analyzer, which can be effectively used for implementing underwater MAC protocols.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.1
• /
• pp.1-7
• /
• 2017

In this paper, we propose an efficient method that is tracking an object in real time using particle filter and adaptive observation model. When tracking object, it happens object shape variation by camera or object movement in variety environments. The traditional method has an error of tracking from these variation, because it has fixed observation model about the selected object by the user in the initial frame. In order to overcome these problems, we propose a method that updates the observation model by calculating the similarity between the used observation model and the eight-way of edge model from the current position. If the similarity is higher than the threshold value, tracking the object using updated observation model to reset observation model. On the contrary to this, the algorithm which consists of a process is to maintain the used observation model. Finally, this paper demonstrates the performance of the stable tracking through comparison with the traditional method by using a number of experimental data.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.17 no.2
• /
• pp.175-181
• /
• 2014

In this paper, we propose a robust clutter pre-thresholding method using background adaptive Threshold Map for the clutter rejection in the complex coastal environment. The proposed algorithm is composed of the use of Threshold Map's and method of its calculation. Additionally we also suggest an automatic decision method of Thresold Map's update. Experimental results on some sets of real infrared image sequence show that the proposed method could remove clutters effectively without any loss of detection rate for the aim target and reduce processing time dramatically.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.1
• /
• pp.131-142
• /
• 1994

This paper analyzes the properties of such algorithm that corresponds to the nonlinear adaptive algorithm with additional update terns, parameterized by the scalar factors ${\alpha}1,\;and\;{\alpha}2$. The analysis of concergence leads to eigenvalues of the transition matrix for the mean filter coefficient vector. Regions in which the algorithm becomes stable are demonstrated. The time constant is derived and the computational complexity of the QFG algorithm is compared with those of the conventional LMS. sign, and LFG algorithm. The properties of convergence in the mean square error is derived and the neccessary condition for the CFG algorithm to be stable is attaned. In the computer simulation a channel equalization is utilized to demonstrate the performance feature of the QFG algorithm. The QFG algorithm has the more computational complexities but the faster convergence speed than LMS and LFG algorithm. Since the QFG algorithm has smoother convergence, it may be useful in case where error bursting is a problem.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.5
• /
• pp.767-774
• /
• 1990

Successive images can be reconstructed without great degradation by using one codebook in vector quantization, because statistics of successive images are sinilar. In this paper, we propose a method to update vector centroids in one slot of an image sequence and reconstruct images with the codebook replenished with the updated vector centroids. To remove the overhead required to transmit the updated vector centroids, we catagorize image blocks into changing blocks and nonchanging blocks, and then transmit only the labels of the changing blocks. Therefore, we can assign the remaining bits to the replenishment of a codebook. By the proposed method, almost the same image as the same image as the one reconstructed by LBG algorithm can be obtained and the bit rate can be reduced to below 0.5 bit/pixel.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.30 no.1 s.244
• /
• pp.8-15
• /
• 2006

A Sparse Point Representation(SPR) based on interpolation wavelets is presented. The SPR is implemented for the purpose of CFD data compression. Unlike conventional wavelet transformation, the SPR relieves computing workload in the similar fashion of lifting scheme that includes splitting and prediction procedures in sequence. However, SPR skips update procedure that is major part of lifting scheme. Data compression can be achieved by proper thresholding method. The advantage of the SPR method is that, by keeping even point physical values, low frequency filtering procedure is omitted and its related unphysical thresholing mechanism can be avoided in reconstruction process. Extra singular feature detection algorithm is implemented for preserving singular features such as shock and vortices. Several numerical tests show the adequacy of SPR for the CFD data. It is also shown that it can be easily extended to nonlinear adaptive wavelets for enhanced feature capturing.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.11a
• /
• pp.145-150
• /
• 1997

In this paper is studied a method of fuzzy logic control based on possibly inconsistent if-then rules representing uncertain knowledge or imprecise data. In most cases of practical applications adopting fuzzy if-then rule bases, inconsistent rules have been considered as ill-defined rules and, thus, not allowed to be in the same rule base. Note, however, that, in representing uncertain knowledge by using fuzzy if-then rules, the knowledge sometimes can not be represented in literally consistent if-then rules. In this regard, when it is hard to obtain consistent rule base, we propose the weighted rule base fuzzy logic control depending on output performance using neural network and we will derive the weight update algorithm. Computer simulations show the proposed method has good performance to deal with the inconsistent rule base fuzzy logic control. And we discuss the real application problems.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2124-2126
• /
• 2003

본 논문에서는 M-Max 선택적 계수 갱신 알고리즘을 이용한 부밴드 광대역 적응 빔포밍 구조를 제안하였다. 기존의 적응 필터 분야에서 일반적으로 가장 안정화된 적응 알고리즘인 NLMS 적응 필터링을 수행할 때 필터의 길이가 증가 할수록 복잡도가 증가하는 문제점을 매 갱신 주기마다 모든 각각의 계수들 위치에서 대응하는 기울기 추정치 크기를 바탕으로 선택된 계수만을 갱신함으로써 모든 계수를 갱신할 때와 비교해서 복잡도는 크게 감소하는 반면 수렴 성능은 거의 비슷한 M-Max 알고리즘이 제안되어왔다. 이러한 H-Max 알고리즘을 부밴드 적응 빔포밍 구조에 적용하고 그 타당성을 모의실험을 통하여 광대역 서브밴드 적응 빔포밍에 선택적 계수 갱신 알고리즘을 적용하였을 때 성능 저하 거의 없이 계산량은 크게 감소됨을 검증하였다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.3
• /
• pp.77-82
• /
• 2018

This paper is concerned with the performance analysis of a modified stop-and-go generalized multi-modulus algorithm (MSAG-GMMA) adaptive blind equalization algorithm with variable step size. The proposed algorithm multiplies the fixed step size by the error signal of the decision-oriented algorithm in the equalization coefficient update equation, and changes the step size according to the error size. Also, the MSAG-GMMA having a fixed step size is operated so as to maintain a fast convergence speed from a certain threshold to a steady state by determining the error signal size of the decision-directed algorithm, and when the MSAG-GMMA to work To evaluate the performance of the proposed algorithm, we use the ensemble ISI, ensemble-averaged MSE, and equalized constellation obtained from the output of the equalizer as the performance index. Simulation results show that the proposed algorithm has faster convergence speeds than MMA, GMMA, and MSAG-GMMA and has a small residual error in steady state.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.1
• /
• pp.77-82
• /
• 2017

This paper related with the VSS_SE-MMA (Varying Step Size_Signed Error-MMA) which possible to improving the equalization performance that employing the varying adaptive step size based on the nonlinearities of error signal of SE-MMA (Signed Error-MMA), compensates the intersymbol interference by distortion occurs at the communication channel, in the transmitting the spectral efficient nonconstant modulus signal such as 16-QAM. The SE-MMA appeared to the reducing the computational arithematic operation using the polarity of error signal in the updating the tap coefficient of present MMA adaptive equalizer, but have a problem of equalization performance degradation. The VSS_SE-MMA improves the problem of such SE-MMA, using the varying step size consider the error signal in the update the adaptive equalizer tap coefficient, and its improved performance were confirmed by simulation. For this, the output signal constellation of equalizer, the residual isi and maximum distortion, MSE and SER were applied. As a result of computer simulation, it was confirmed that the VSS_SE-MMA algorithm has nearly same in convergence speed and has more good performance in every performance index at the steady state.