• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.122-125
• /
• 2003

An adaptive contour smoothing algorithm designed as a preprocessor for shape coders is presented. In the proposed method, the degree of the adaptive smoothing is controlled based on the significance of each contour point, which is quantified according to inter-region contrast in an intensity image. The actual smoothing consists of an expansion operator and a thinning algorithm. Experimental results show that the proposed method results in a saving of about 20% in number of coded bits with a negligible additional texture degradation in the reconstructed intensity image.

• The Korean Journal of Applied Statistics
• /
• v.22 no.1
• /
• pp.221-235
• /
• 2009

This manuscript illustrates the comparative study between ARIMA and Exponential Smoothing modeling to develop forest fire forecasting system using different weather parameters. In this paper, authors have developed the most suitable and closest forecasting models like ARIMA and Exponential Smoothing techniques using different weather parameters. Authors have considered the extremes of the Wind speed, Radiation, Maximum Temperature and Deviation Temperature of the Summer Season form March to June month for the Ranchi Region in Jharkhand. The data is taken by own resource with the help of Automatic Weather Station. This paper consists a deep study of the effect of extreme values of the different parameters on the weather fluctuations which creates forest fires in the region. In this paper, the numerical illustration has been incorporated to support the present study. Comparative study of different suitable models also incorporated and best fitted model has been tested for these parameters.

• Journal of Korea Multimedia Society
• /
• v.5 no.3
• /
• pp.263-271
• /
• 2002

In this paper, we propose a new smoothing method for removing moire patterns using analysis of halftone patterns interference. The proposed method can determine a strength of moire patterns by using gray values of pixels and the size of smoothing mask for moire region is adjusted adaptively according to the strength of moire patterns. Therefore it can remove moire patterns effectively and preserve meaningful high frequencies well, such as edges and textures. The proposed method only refer to predefined lookup table to determine the strength of moire patterns, so it is more efficient than a previous work based on FFT of subblock. It could be applied to field of various multimedia applications that deal with color prints.

• 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.

• 한국컴퓨터산업교육학회:학술대회논문집
• /
• 2003.11a
• /
• pp.87-94
• /
• 2003

Anisotropic diffusion is a selective smoothing technique that promotes smoothing within a region instead of smoothing across boundaries. In anisotropic 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. El-Fallah and Gary E. Ford represented the image as a surface and proved that setting the inhomogeneous diffusion coefficient equal to the inverse of the magnitude of the surface normal results in surface evolving speed that is proportional to the mean curvature of the image surface. This model has the advantage of having the mean curvature diffusion (MCD) render invariant magnitude, thereby preserving structure and locality. In this paper, the proposed MCD model efficiently reduces diffusion coefficient at the thin edges using the smoothness of the surface.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.345-346
• /
• 2009

The segmentation of vessel including portal vein, hepatic vein and artery, from Computed Tomography (CT) images plays an important role in the therapeutic strategies for hepatic diseases. Representing segmented vessels in three dimensional spaces is extremely useful for doctors to plan liver surgery. In this paper, proposed method is focused on smoothing technique of segmented 3D liver vessels, which derived from 3D region growing approach. A pixel expand algorithm has been developed first to avoid vessel lose and disconnection cased by the next smoothing technique. And then a binary volume filtering technique has been implemented and applied to make the segmented binary vessel volume qualitatively smoother. This strategy uses an iterative relaxation process to extract isosurfaces from binary volumes while retaining anatomical structure and important features in the volume. Hard and irregular place in volume image has been eliminated as shown in the result part, which also demonstrated that proposed method is a suitable smoothing solution for post processing of fine vessel segmentation.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.36T no.4
• /
• pp.24-29
• /
• 1999

In this paper, a simple contour-preserving filtering algorithm is proposed. The goal of the contour-preserving filtering method is to remove noise ad granularity as the preprocessing for the image segmentation procedure. Our method finds edge map and separates the image into the edge region and the non-edge region using this edge map. For the non-edge region, typical smoothing filters could be used to remove the noise and the small areas during the segmentation procedure. The result of simulation shows that our method is slightly better than the typical methods such as the median filtering and gradient inverse weighted filtering in the point of view of analysis of variance (ANOVA).

• Journal of applied mathematics & informatics
• /
• v.29 no.3_4
• /
• pp.653-668
• /
• 2011

This paper presents a new hybrid method for solving nonlinear complementarity problems with $P_0$-functions. It can be regarded as a combination of smoothing trust region method with ODE-based method and line search technique. A feature of the proposed method is that at each iteration, a linear system is only solved once to obtain a trial step, thus avoiding solving a trust region subproblem. Another is that when a trial step is not accepted, the method does not resolve the linear system but generates an iterative point whose step-length is defined by a line search. Under some conditions, the method is proven to be globally and superlinearly convergent. Preliminary numerical results indicate that the proposed method is promising.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.07a
• /
• pp.262-265
• /
• 2012

In this paper we propose a new deinterlacing method with block classification and motion vector smoothing. The proposed method classifies a block, then depending on the region it belongs to, the motion estimation or line averaging is applied. To classify a block its variance is calculated. Then, for those blocks that belong to simple non-texture region the line averaging is done while motion estimation is applied to complex region. The motion vector field is smoothed using median filter what yields more accurate interpolation. In the experiments for the subjective evaluation, the proposed method bas shown satisfying results in terms of computation time consumption and peak signal-to-noise ratio. Due to the simplicity of the algorithm computation time was drastically decreased.

• Transactions of Materials Processing
• /
• v.13 no.4
• /
• pp.334-341
• /
• 2004

In this study, a remeshing algorithm adapted to the mesh density map using the Delaunay mesh generation method is developed. In the finite element simulation of forging process, the numerical error increases as the process goes on because of discrete property of the finite elements and distortion of elements. Especially, in the region where stresses and strains are concentrated, the numerical error will be highly increased. However, it is not desirable to use a uniformly fine mesh in the whole domain. Therefore, it is necessary to reduce the analysis error by constructing locally refined mesh at the region where the error is concentrated such as at the die corner. In this paper, the point insertion algorithm is used and the mesh size is controlled by using a mesh density map constructed with a posteriori error estimation. An optimized smoothing technique is adopted to have smooth distribution of the mesh and improve the mesh element quality.