• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.4
• /
• pp.502-508
• /
• 2014

In this paper, a delay-dependent $H_{\infty}$ filtering problem is investigated for discrete-time delayed nonlinear systems which include a more general sector nonlinear function instead of employing the commonly used Lipschitz-type function. By using the Lyapunov-Krasovskii functional approach, a less conservative sufficient condition is established for the existence of the desired filter, and then, the corresponding solvability condition guarantee the stability of the filter with a prescribed $H_{\infty}$ performance level. Finally, two simulation examples are given to show the effectiveness of the proposed filtering scheme.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.505-508
• /
• 2005

Wavelet scheme can be applied to the various remote sensing problems: conventional multi-resolution image analysis, compression of large image sets, fusion of heterogeneous sensor image and segmentation of features. In this study, we attempted wavelet-based filtering and its analysis. Traditionally, statistical methods and adaptive filter are used to manipulate noises in the image processing procedure. While we tried to filter random noise from optical image and radar image using Discrete Wavelet Transform (DW1) and Stationary Wavelet Transform (SW1) and compared with existing methods such as median filter and adaptive filter. In result, SWT preserved boundaries and reduced noises most effectively. If appropriate thresholds are used, wavelet filtering will be applied to detect road boundaries, buildings, cars and other complex features from high-resolution imagery in an urban environment as well as noise filtering

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.605-608
• /
• 1999

A conventional image coder, such as JPEG, requires not only DCT and quantization but also additional pre-filtering under noisy environment. Since the pre-filtering removes camera noise and improves coding efficiency dramatically, its efficient implementation has been an important issue. Based on well-known noise removal techniques in image processing fields, this paper introduces an efficient scheme by adapting a noise removal procedure to block-based image coders. By using two-dimensional DCT factorization, the proposed image coder has only a modified DCT and a VLC, and performs pre-filtering and quantization simultaneously in the modified DCT operation.

• 전자공학회논문지 IE
• /
• v.45 no.1
• /
• pp.24-30
• /
• 2008

In this paper, Digital MultiTone(DMT) is an emerging multi-carrier modulation scheme, which has been adopted for VDSL(Very high speed Digital Subscribe Line). A problem of DMT is its sensitivity to frequency offset between the transmitted and received carrier frequencies. This frequency offset introduces inter-carrier interference(ICI) in the DMT symbol. This paper is proposed an ICI cancelation scheme using Kalman Filtering. The performance of the proposed method is compared with conventional methods in terms of bit error rate performance, bandwidth efficiency, and computational complexity. Through simulations, it is shown that for high values of the frequency offset and for higher order modulation schemes, the EKF(Enhanced Kalman Filtering) method perform better than the others.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.1
• /
• pp.1-9
• /
• 2014

This paper proposes a low-latency Sample Adaptive Offset filter (SAO) architecture and its Single Instruction Multiple Data (SIMD) optimization scheme to achieve fast High Efficiency Video Coding (HEVC) decoding in a multi-core environment. According to the HEVC standard and its Test Model (HM), SAO operation is performed only at the picture level. Most realtime decoders, however, execute their sub-modules on a Coding Tree Unit (CTU) basis to reduce the latency and memory bandwidth. The proposed low-latency SAO architecture has the following advantages over picture-based SAO: 1) significantly less memory requirements, and 2) low-latency property enabling efficient pipelined multi-core decoding. In addition, SIMD optimization of SAO filtering can reduce the SAO filtering time significantly. The simulation results showed that the proposed low-latency SAO architecture with significantly less memory usage, produces a similar decoding time as a picture-based SAO in single-core decoding. Furthermore, the SIMD optimization scheme reduces the SAO filtering time by approximately 509% and increases the total decoding speed by approximately 7% compared to the existing look-up table approach of HM.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.8
• /
• pp.360-367
• /
• 2002

In this paper, genetic algorithm based adaptive image enhancement filtering scheme is proposed and Implemented on FPGA board. Conventional filtering methods require a priori noise information for image enhancement. In general, if a priori information of noise is not available, heuristic intuition or time consuming recursive calculations are required for image enhancement. Contrary to the conventional filtering methods, the proposed filter system can find optimal combination of filters as well as their sequent order and parameter values adaptively to unknown noise types using structured genetic algorithms. The proposed image enhancement filter system is mainly composed of two blocks. The first block consists of genetic algorithm part and fitness evaluation part. And the second block consists of four types of filters. The first block (genetic algorithms and fitness evaluation blocks) is implemented on host computer using C code, and the second block is implemented on re-configurabe FPGA board. For gray scale control, smoothing and deblurring, four types of filters(median filter, histogram equalization filter, local enhancement filter, and 2D FIR filter) are implemented on FPGA. For evaluation, three types of noises are used and experimental results show that the Proposed scheme can generate optimal set of filters adaptively without a pioi noise information.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.6
• /
• pp.1171-1179
• /
• 2021

Image forensic is performed to check image limpidness. In this paper, a robust scheme is discussed to detect median filtering in low quality images. Detection of median filtering assists in overall image forensic. Improved spatial statistical features are extracted from the image to classify pristine and median filtered images. Image array data is rescaled to enhance the spatial statistical information. Features are extracted using Markov model on enhanced spatial statistics. Multiple difference arrays are considered in different directions for robust feature set. Further, texture operator features are combined to increase the detection accuracy and SVM binary classifier is applied to train the classification model. Experimental results are promising for images of low quality JPEG compression.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.11a
• /
• pp.191-194
• /
• 2003

As internet commerce grows, many company has begun to use a CF (Collaborative Filtering) as a Recommender System. To achieve an accuracy of CF, we need to obtain sufficient account of voting scores from customers. Moreover, those scores may not be consistent. To overcome this problem, we propose a new recommendation scheme using binary user-item matrix, which represents whether a user purchases a product instead of using the voting scores. Through the experiment regarding this new scheme, a better accuracy is demonstrated.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.459-470
• /
• 2003

It is required to research on high-dimensional index structures for efficiently retrieving high-dimensional data because an attribute vector in data warehousing and a feature vector in multimedia database have a characteristic of high-dimensional data. For this, many high-dimensional index structures have been proposed, but they have so called ‘dimensional curse’ problem that retrieval performance is extremely decreased as the dimensionality is increased. To solve the problem, the cell-based filtering (CBF) scheme has been proposed. But the CBF scheme show a linear decreasing on performance as the dimensionality. To cope with the problem, it is necessary to make use of parallel processing techniques. In this paper, we propose a parallel CBF scheme which uses a horizontally-partitioned technique as declustering. In order to maximize the retrieval performance of the proposed parallel CBF scheme, we construct our parallel CBF scheme under a SN (Shared Nothing) cluster architecture. In addition, we present a data insertion algorithm, a rage query processing one, and a k-NN query processing one which are suitable for the SN cluster architecture. Finally, we show that our parallel CBF scheme achieves better retrieval performance in proportion to the number of servers in the SN cluster architecture, compared with the conventional CBF scheme.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.3E
• /
• pp.110-112
• /
• 2003

There have been numerous studies on the enhancement of the noisy speech signal. In this paper, we propose a completely new speech enhancement scheme, that is, a filtering of a dissonant frequency (especially F# in each octave of the tempered scale) based on the fundamental frequency which is developed in frequency domain. In order to evaluate the performance of the proposed enhancement scheme, subjective tests (MOS tests) were conducted. The subjective test results indicate that the proposed method provides a significant gain in audible improvement especially for speech contaminated by colored noise and speaking in a husky voice. Therefore when the filter is employed as a pre-filter for speech enhancement, the output speech quality and intelligibility is greatly enhanced.