• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2003년도 추계종합학술대회
• /
• pp.122-125
• /
• 2003

본 논문에서는 이차원 윤곽선 부호화기의 전처리를 위한 새로운 윤곽선 평활화 방법을 제안한다. 제안된 방식에서는 영역 기반 동영상 부호화기의 부호화 효율을 고려하여 각 윤곽선 화소의 상대적 중요도를 자기 영상의 영역간 대조에 근거하여 추정하고, 추정된 중요도에 따라 평활화 정도를 적응적으로 조절한다. 실제의 평활화 과정은 확장 연산자와 세선화 알고리즘을 통하여 효율적으로 구현하였다. 모의실험을 통하여 제안된 방식이 복구 영상의 큰 화질열화 없이 전체 윤곽선 데이터량을 약 20% 정도 감소시킴을 알 수 있었다.

• 응용통계연구
• /
• 제22권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.

• 한국멀티미디어학회논문지
• /
• 제5권3호
• /
• pp.263-271
• /
• 2002

본 논문에서는 해프톤 패턴 간섭 분석을 통해 모아레 패턴을 효과적으로 제거할 수 있는 새로운 모아레 영역 평활화 방법을 제시한다. 제안한 방법에서는 픽셀의 화소값을 이용하여 모아레 패턴의 세기를 결정하고 그 세기에 따라 평활화 정도를 적응적으로 조정해 주기 때문에, 모아레 패턴을 효과적으로 제거하면서 경계나 텍스쳐 같은 의미 있는 고주파 성분도 효과적으로 보존할 수 있다. 또한 기존의 블록기반 퓨리에 변환 방법과 달리, 미리 만들어진 테이블을 참조하는 과정만으로 모아레 패턴의 세기를 결정하기 때문에 연산 시간측면에서도 효율적이다. 제안한 방법은 칼라 인쇄물을 다루는 다양한 멀티미디어 분야에서 유용하게 활용될 수 있다.

• 정보과학회 논문지
• /
• 제44권11호
• /
• pp.1194-1208
• /
• 2017

잡음제거에 많이 사용되는 평균 스무딩 방법은 곡률이 큰 코너와 잡음을 구분하지 못하므로 코너와 같은 특징점이 이동하거나 없어질 수 있고, 또한 곡선의 수축(shrinking)으로 곡선 내의 면적 오차가 커지는 문제점들이 있다. 이 논문에서는 입력곡선을 다각형 근사화하고 근사화된 다각형의 정보를 스무딩에 이용하여 이 문제점들을 완화시키는 방법을 제안한다. 제안된 방법은 근사화된 다각형과 입력곡선간의 오차와 다각형의 꼭짓점 각도를 이용하여 입력곡선의 각 점마다 개별적으로 스무딩 가중치를 정한다. 이 때 각 점의 가중치는 스무딩 후 점의 이동거리가 그 지역의 잡음크기의 평균에 가까워지도록 정해진다. 제안된 방법으로 잡음이 추가된 곡선을 스무딩하면 스무딩된 곡선이 잡음이 없는 원래곡선에 근접함을 실험으로 확인할 수 있다. 또한 크기가 작은 폐곡선들에 대해 스무딩의 정도를 늘여도 제안된 방법은 기존의 평균 스무딩 방법에 비해 곡선의 면적 축소가 많지 않다.

• 한국컴퓨터산업교육학회:학술대회논문집
• /
• 한국컴퓨터산업교육학회 2003년도 제4회 종합학술대회 논문집
• /
• 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.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2009년도 추계학술발표대회
• /
• 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.

• 전자공학회논문지T
• /
• 제36T권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
• /
• 제29권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.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2012년도 하계학술대회
• /
• 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.

• 소성∙가공
• /
• 제13권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.