• Journal of Information Processing Systems
• /
• v.15 no.5
• /
• pp.1108-1118
• /
• 2019

Non-local means (NLM) algorithm is an effective and successful denoising method, but it is computationally heavy. To deal with this obstacle, we propose a novel NLM algorithm with fuzzy metric (FM-NLM) for image denoising in this paper. A new feature metric of visual features with fuzzy metric is utilized to measure the similarity between image pixels in the presence of Gaussian noise. Similarity measures of luminance and structure information are calculated using a fuzzy metric. A smooth kernel is constructed with the proposed fuzzy metric instead of the Gaussian weighted L2 norm kernel. The fuzzy metric and smooth kernel computationally simplify the NLM algorithm and avoid the filter parameters. Meanwhile, the proposed FM-NLM using visual structure preferably preserves the original undistorted image structures. The performance of the improved method is visually and quantitatively comparable with or better than that of the current state-of-the-art NLM-based denoising algorithms.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.11a
• /
• pp.73-76
• /
• 2018

A Gaussian noise is caused by surrounding environment or channel interference when transmitting image. The noise reduces not only image quality degradation but also high-level image processing performance. The Non-Local Means (NLM) filter finds similarity in the neighboring sets of pixels to remove noise and assigns weights according to similarity. The weighted average is calculated based on the weight. The NLM filter method shows low noise cancellation performance and high complexity in the process of finding the similarity using weight allocation and neighbor set. In order to solve these problems, we propose an algorithm that shows an excellent noise reduction performance by using Summed Square Image (SSI) to reduce the complexity and applying the weighting function based on a cosine Gaussian kernel function. Experimental results demonstrate the effectiveness of the proposed algorithm.

• KIISE Transactions on Computing Practices
• /
• v.23 no.3
• /
• pp.156-164
• /
• 2017

Measuring the similarity of two graphs is a basic tool to solve graph problems in various applications. Most graph algorithms have a high time complexity according to the number of vertices and edges. Because Graphics Processing Units (GPUs) have a high computational power and can be obtained at a low cost, these have been widely used in graph applications to improve execution time. This paper proposes an efficient parallel algorithm to measure graph similarity using the CUDA on a GPU environment. The experimental results show that the proposed approach brings a considerable improvement in performance and efficiency when compared to CPU-based results. Our results also show that the performance is improved significantly as the size of the graph increases.

• Journal of KIISE:Software and Applications
• /
• v.37 no.1
• /
• pp.74-79
• /
• 2010

The amino acid composition of a protein provides basic information for solving many problems in bioinformatics. We propose a new method that uses biologically relevant similarity between amino acids to determine the amino acid composition, where the BOLOSUM matrix is exploited to define a similarity measure between amino acids. Futhermore, to extract more information from a protein sequence than conventional methods for determining amino acid composition, we exploit the concepts of spectral analysis of signals such as radar and speech signals-the concepts of time-dependent analysis, time resolution, and frequency resolution. The proposed method was applied to predict subcellular localization of proteins, and showed significantly improved performance over previous methods for amino acid composition estimation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.4
• /
• pp.684-690
• /
• 2009

In this paper, we proposed a new method of the steganography based on bit plane using similarity. Applying a fixed threshold, the insert information into all bit planes showed different image quality. Therefore, we first defined the bit plane of block similarity to solve the fixing threshold problem. We then proposed a new method using the Bit Plane complexity and similarity to insert information into bit planes of block. In the experiment, we inserted information into the standard images with the same image quality and same insertion capacity. Finally analyzed the insertion capacity and image quality. As a result, the proposed method increased the insertion capacity of about 6% and improved the image quality of about 3.3dB than fixing threshold method.

• Journal of KIISE
• /
• v.42 no.11
• /
• pp.1380-1385
• /
• 2015

Collaborative filtering is one of the most successfully used methods for recommender systems and has been utilized in various areas such as books and music. The key point of this method is selecting the most proper recommenders, for which various similarity measures have been studied. To improve recommendation performance, this study analyzes problems of existing recommender selection methods based on similarity and presents a method of dynamically determining recommenders based on the rate of co-rated items as well as similarity. Examination of performance with varying thresholds through experiments revealed that the proposed method yielded greatly improved results in both prediction and recommendation qualities, and that in particular, this method showed performance improvements with only a few recommenders satisfying the given thresholds.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.1123-1127
• /
• 2005

The Conventional methods of color separation in computer-based machine vision offer only weak performance because of environmental factors such as light source, camera sensitivity, and others. In this paper, we propose an improved color separation method using RGB, HLS, color coordination space, and fuzzy similarity measure. RGB consists of red, green and blue, the three primary colors of light. HLS includes hue, light and saturation, the human recognition elements of co]or. A fuzzy similarity measure was employed for evaluate the similarity among fuzzy colors with the six features of RGB and HLS.

• The KIPS Transactions:PartB
• /
• v.17B no.1
• /
• pp.37-46
• /
• 2010

In this paper we have presented a two dimensional model based tracking system using improved chamfer matching. Conventional chamfer matching could not calculate similarity well between the object and image when there is very cluttered background. Then we have improved chamfer matching to calculate similarity well even in very cluttered background with edge and corner feature points. Improved chamfer matching is used as likelihood function of particle filter which tracks the geometric object. Geometric model which uses edge and corner feature points, is a discriminant descriptor in color changes. Particle Filter is more non-linear tracking system than Kalman Filter. Then the presented method uses geometric model, particle filter and improved chamfer matching for tracking object in complex environment. In experimental result, the robustness of our system is proved by comparing other methods.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.11
• /
• pp.7718-7728
• /
• 2015

Semantic similarity between words can be applied in many fields including computational linguistics, artificial intelligence, and information retrieval. In this paper, we present weighted method for measuring a semantic similarity between words in a document. This method uses edge distance and depth of WordNet. The method calculates a semantic similarity between words on the basis of document information. Document information uses word term frequencies(TF) and word concept frequencies(CF). Each word weight value is calculated by TF and CF in the document. The method includes the edge distance between words, the depth of subsumer, and the word weight in the document. We compared out scheme with the other method by experiments. As the result, the proposed method outperforms other similarity measures. In the document, the word weight value is calculated by the proposed method. Other methods which based simple shortest distance or depth had difficult to represent the information or merge informations. This paper considered shortest distance, depth and information of words in the document, and also improved the performance.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.1
• /
• pp.61-69
• /
• 2009

This paper presents an improved method measuring inter-utterance similarity in an example-based dialogue system, which searches the most similar utterance in a dialogue database to generate a response to a given user utterance. Unlike general inter-sentence similarity measures, the inter-utterance similarity measure for example-based dialogue system should consider not only word distribution but also various linguistic features, such as affirmation/negation, tense, modality, sentence type, which affects the natural conversation. However, previous approaches do not sufficiently reflect these features. This paper proposes a new utterance similarity measure by analyzing and reflecting various linguistic features to improve performance in accuracy. Also, by considering substitutability of the features, the proposed method can utilize limited number of examples. Experimental results show that the proposed method achieves 10%p improvement in accuracy compared to the previous method.