• International Journal of Contents
• /
• v.5 no.4
• /
• pp.1-6
• /
• 2009

In this paper, we propose a mesh smoothing method for mesh models with noise. The proposed method enables not only the removal of noise from the vertexes but the preservation and smoothing of shape recognized as edges and comers. The magnitude ratio of 2D area and 3D volume in mesh data is adopted for the smoothing of noise. Comparing with previous smoothing methods, this method does not need many iteration of the smoothing process and could preserve the shape of original model. Experimental results demonstrate improved performance of the proposed approach in 3D mesh smoothing.

• Journal of KIISE
• /
• v.44 no.11
• /
• pp.1194-1208
• /
• 2017

A traditional average smoothing method is designed for smoothing out noise, which, however, unintentionally results in smooth corner points on the curvature accompanied with a shrinkage of curves. In this paper, we propose a novel curve smoothing method via polygonal approximation of the input curve. The proposed method determines the smoothing weight for each point of the input curve based on the angle and approximation error between the approximated polygon and the input curve. The weight constrains a displacement of the point after smoothing not to significantly exceed the average noise error of the region. In the experiment, we observed that the resulting smoothed curve is close to the original curve since the point moves toward the average position of the noise after smoothing. As an application to digital cartography, for the same amount of smoothing, the proposed method yields a less area reduction even on small curve segments than the existing smoothing methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.2 s.314
• /
• pp.55-62
• /
• 2007

This paper proposes method to get exquisite third dimension data removing included noise by error that occur in third dimension reconstruction through camera auto-calibration. Though reconstructing third dimension data by previous noise removing method, mesh that area is wide is happened problem by noise. Because mesh's area is important, the proposed algorithm need preprocessing that remove unnecessary triangle meshes of acquired third dimension data. The research analyzes the characteristics of noise using the area information of 3-dimensional meshes, separates a peek noise and a Gauss noise by its characteristics and removes the noise effectively. We give a quantitative evaluation of the proposed preprocessing filter and compare with the mesh smoothing procedures. We demonstrate that our effective preprocessing filter outperform the mesh smoothing procedures in terms of accuracy and resistance to over-smoothing.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.8
• /
• pp.77-84
• /
• 2016

In general statistical analysis, we need to make a normal assumption. If this assumption is not satisfied, we cannot expect a good result of statistical data analysis. Most of statistical methods processing the outlier and noise also need to the assumption. But the assumption is not satisfied in big data because of its large volume and heterogeneity. So we propose a methodology based on box-plot and data smoothing for controling outlier and noise in big data analysis. The proposed methodology is not dependent upon the normal assumption. In addition, we select patent documents as target domain of big data because patent big data analysis is a important issue in management of technology. We analyze patent documents using big data learning methods for technology analysis. The collected patent data from patent databases on the world are preprocessed and analyzed by text mining and statistics. But the most researches about patent big data analysis did not consider the outlier and noise problem. This problem decreases the accuracy of prediction and increases the variance of parameter estimation. In this paper, we check the existence of the outlier and noise in patent big data. To know whether the outlier is or not in the patent big data, we use box-plot and smoothing visualization. We use the patent documents related to three dimensional printing technology to illustrate how the proposed methodology can be used for finding the existence of noise in the searched patent big data.

• Nuclear Engineering and Technology
• /
• v.55 no.5
• /
• pp.1527-1532
• /
• 2023

The noise reduction algorithm using the non-local means (NLM) approach is very efficient in nuclear medicine imaging. In this study, the applicability of the NLM noise reduction algorithm in single-photon emission computed tomography (SPECT) images with a brain phantom and the optimization of the NLM algorithm by changing the smoothing factors according to various reconstruction methods are investigated. Brain phantom images were reconstructed using filtered back projection (FBP) and ordered subset expectation maximization (OSEM). The smoothing factor of the NLM noise reduction algorithm determined the optimal coefficient of variation (COV) and contrast-to-noise ratio (CNR) results at a value of 0.020 in the FBP and OSEM reconstruction methods. We confirmed that the FBP- and OSEM-based SPECT images using the algorithm applied with the optimal smoothing factor improved the COV and CNR by 66.94% and 8.00% on average, respectively, compared to those of the original image. In conclusion, an optimized smoothing factor was derived from the NLM approach-based algorithm in brain SPECT images and may be applicable to various nuclear medicine imaging techniques in the future.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.1
• /
• pp.185-192
• /
• 1997

We propose a method of paramete estimation using order-of-magnitude analysis for optimal boundary smoothing in Mean Field Annealing(MFA) technique in this paper. We previously proposed two boundary smoothing methods for consistent object representation in the previous paper, one is using a constratined regulaization(CR) method and the other is using a MFA method. The CR method causes unnecessary smoothing effects at corners. On the other hand, the MFA method method smooths our the noise without losing sharpness of corners. The MFA algorithm is influenced by several parameters such as standard deviation of the noise, the relativemagnitude of prior ter, initial temperature and final temperature. We propose a general parameter esimation method for optimal boundary smoothing using order-of-magnitude analysis to be used for consistent object representation in this paper. In addition, we prove the effectiveness of our parameter estimation and also show the temperature parameter sensitivities of the algorithm.

• Archives of Pharmacal Research
• /
• v.10 no.1
• /
• pp.1-8
• /
• 1987

One of the problems of derivatie spectrophotometry, the decrease of signal-to-noise ratio by derivative operations, was solved by three concepts of digital filtering, ensemble averaging, least squares polynomial smoothing and Fourier smoothing. The suthors made several compouter programs written in APPLE SOFT BASIC language for the actual applications of the concepts of these digital filters on UV spectrophotometer system. As a result, ensemble averaging could not be used as a routine operation for the spectrophotometer used. The maximum S/N ratio enhancement factors achieved by least squares polynomial smoothing were 6.17 and 7.47 for the spectra of Gaussian and Lorentzian distribution models, and by Fourier smoothing 16.42 and 11.78 for the spectra of two models, respectively.

• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.159-162
• /
• 2008

This paper presents a modified mean curvature diffusion filter to smooth speckle noise in images. Mean curvature diffusion filter has already shown good results in reducing noise in images while preserving fine details. In the mean curvature diffusion, the rate of smoothing is controlled by the local value of the diffusion coefficient chosen to be a function of the local image gradient magnitude. In this paper, the diffusion coefficient is modified to be controlled adaptively by local image surface slope and heterogeneity. The local surface slope contributes to preserving details (e.g.edges) in image and the local surface heterogeneity helps the smoothing filter consider the amount of noise in both edge and non-edge area. The proposed filter's performance is demonstrated by quantitative experiments using speckle noised aerial image and TerraSAR-X satellite image.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1903-1906
• /
• 2003

This paper proposes an adaptive regularized noise smoothing algorithm for range image using the area decreasing flow method, which can preserve meaningful edges during the smoothing process. Although the area decreasing flow method can easily smooth Gaussian noise, it has two problems; ⅰ) it is not easy to remove impulsive noise from observed range data, and ⅱ) it is also difficult to remove noise near edge when the adaptive regularization is used. In the paper, therefore, the second smoothness constraint is addtionally incorporated into the existing regularization algorithm, which minimizes the difference between the median filtered data and the estimated data. As a result, the Proposed algorithm can effectively remove the noise of dense range data with edge preserving.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.12
• /
• pp.27-33
• /
• 2018

In this paper, we propose an efficient edge preserving smoothing filter for Infrared image that can reduce noise while preserving edge information. Infrared images suffer from low signal-to-noise ratio, low edge detail information and low contrast. So, detail enhancement and noise reduction play crucial roles in infrared image processing. We first apply a guided image filter as a local analysis. After the filtering process, we optimization globally using relativity of guided image filter. Our method outperforms the previous methods in removing the noise while preserving edge information and detail enhancement.