• The KIPS Transactions:PartB
• /
• v.16B no.3
• /
• pp.233-238
• /
• 2009

This paper presents an approach to the classifications of small size document using the instance-based feature filtering Relief-F algorithm. In the document classifications, we have not always good classification performances of small size document included a few features. Because total number of feature in the document set is large, but feature count of each document is very small relatively, so the similarities between documents are very low when we use general assessment of similarity and classifiers. Specially, in the cases of the classification of web document in the directory service and the classification of the sectors that cannot connect with the original file after recovery hard-disk, we have not good classification performances. Thus, we propose the Extended Relief-F(ERelief-F) algorithm using instance-based feature filtering algorithm Relief-F to solve problems of Relief-F as preprocess of classification. For the performance comparison, we tested information gain, odds ratio and Relief-F for feature filtering and getting those feature values, and used kNN and SVM classifiers. In the experimental results, the Extended Relief-F(ERelief-F) algorithm, compared with the others, performed best for all of the datasets and reduced many irrelevant features from document sets.

• Spatial Information Research
• /
• v.19 no.1
• /
• pp.117-126
• /
• 2011

Recently, AR applications provide location-based spatial information by GPS. Also, the spatial information is displayed by the angle of the camera. So far, traditional spatial indexes in spatial database field retrieve and filter spatial information by the minimum bounding rectangle (MBR) algorithm.(ex. R-tree) MBR strategy is a useful technique in the geographic information systems and location based services. But MBR technique doesn't reflect the characteristics of spatial queries in AR. Spatial queries of AR applications have high possibility of the dead space area between MBRs of non-leaf node and query area. We propose triangle node filtering algorithm that improved efficiency of spatial retrieval used the triangle node filtering techniques by exclusion the dead space. In this paper, the proposed algorithm has been implemented on PostgreSQL/PostGIS. Experimental results show the spatial retrieval that using the proposed algorithm better performance than the spatial retrieval that of the minimum bounding rectangle algorithm.

• Journal of the Korean Vacuum Society
• /
• v.8 no.3B
• /
• pp.315-321
• /
• 1999

In this paper, the SEM image processing system based on PC is designed, and a new noise reduction filtering algorithm is proposed. The SEM image obtained in semiconductor processing line is sensitive to noise, the weighted-D filter can remove uniform and Gaussian noise effectively, but can not remove impulse noise properly, A new improved filtering algorithm is proposed to reduce mixed-noise. The performance of the proposed filter is quantitatively evaluated by use of the normalized mean square errors (NMSE). The experimental results show that the performance of the proposed filter is obtained between 0.96 and 2.5 times better than that of weighted-D filter in NMSE evaluation.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.6
• /
• pp.390-394
• /
• 2016

This paper presents a new comparison method for haze-removal algorithms in next-generation automotive systems. Compared to previous peak signal-to-noise ratio-based comparisons, which measure similarity, the proposed modulation transfer function-based method checks sharpness to select a more suitable haze-removal algorithm for lane detection. Among the practical filtering schemes used for a haze-removal algorithm, experimental results show that Gaussian filtering effectively preserves the sharpness of road images, enhancing lane detection accuracy.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.10
• /
• pp.639-642
• /
• 2005

In this paper, a robust nonlinear echo cancellation is proposed, where a third-order adaptive Volterra filtering is employed along with an expanded correlation LMS (ECLMS) algorithm to compensate for nonlinear distortion in the echo path. (e.g., DAC of the hybrid network). Finally, the robustness in the echo cancellation of the proposed approach is demonstrated using computer simulations, where high attenuation of echo signals is achieved even in the double-talk situation (e.n., BdB improvement in ERLE).

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.434-436
• /
• 2022

For 4th industrial revolution and the development of various communication media, unmanned and automation are rapidly progressing in various fields. In particular, high-level image processing technology is required in fields such as smart factories, autonomous driving technology, and intelligent CCTV. Accordingly, the importance of preprocessing in a system operating based on an image is increasing, and an algorithm for effectively removing noise from an image is attracting attention. In this paper, we propose a filtering algorithm using noise judgment and a segmentation mask in a complex noise environment. The proposed algorithm calculates the final output by switching the segmentation mask suitable for filtering by performing noise judgment on the pixel values of the input image. Simulation was conducted to verify the performance of the proposed algorithm, and the result image was compared and evaluated with the existing filter algorithm.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.35T no.2
• /
• pp.13-19
• /
• 1998

The Median of a set of number is a number which partitions the given set. The specified numbers of a set partitions in one subset and in another subset. In Image Processing, The Sorting method of numbers of one subset equal to the previous Median Filtering. but The Sorting method of numbers of another subset not equal to in the other. In this paper, a fast two-dimentional Median Filtering Algorithm is proposed. The Algorithm designed in such a during the partitioning of the previous window are used. Test results obtained by running the Algorithm on IBM PC(586) are presented and its filtering. It is shown that the proposed Algorithm's processing time is faster and independent of the number of bits used to represent the data values.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.24-26
• /
• 2006

In this paper, a nonlinear echo cancellation approach, based on a Gauss-Seidel pseudo affine projection algorithm and Volterra filtering, is proposed to compensate for echo path nonlinearity in the telephone network. Simulation results demonstrate that the proposed approach yields reduction of computational complexity and improved convergence speed than the conventional nonlinear echo cancellation methods (NLMS, ECLMS, FAP, RLS).

• Speech Sciences
• /
• v.1
• /
• pp.277-283
• /
• 1997

In this paper, we present a robust recognition algorithm based on the Wiener filtering method as a research tool to develop the Korean Speech recognition system. We especially used Wiener filtering method in cepstrum-domain, because the method in frequency-domain is computationally expensive and complex. Evaluation of the effectiveness of this method has been conducted in speaker-independent isolated Korean digit recognition tasks using discrete HMM speech recognition systems. In these tasks, we used 12th order weighted cepstral as a feature vector and added computer simulated white gaussian noise of different levels to clean speech signals for recognition experiments under noisy conditions. Experimental results show that the presented algorithm can provide an improvement in recognition of as much as from $5\%\;to\;\20\%$ in comparison to spectral subtraction method.

• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.8-18
• /
• 2016

In this paper, we propose a number of blind equalization approaches for time-varying andmulti-path channels. The approaches employ cost reference particle filter (CRPF) as the symbol estimator, and additionally employ either least mean squares algorithm, recursive least squares algorithm, or $H{\infty}$ filter (HF) as a channel estimator such that they are jointly employed for the strategy of "Rao-Blackwellization," or equally called "mixture filtering." The novel feature of the proposed approaches is that the blind equalization is performed based on direct channel estimation with unknown noise statistics of the received signals and channel state system while the channel is not directly estimated in the conventional method, and the noise information if known in similar Kalman mixture filtering approach. Simulation results show that the proposed approaches estimate the transmitted symbols and time-varying channel very effectively, and outperform the previously proposed approach which requires the noise information in its application.