• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2003.10a
• /
• pp.159-162
• /
• 2003

The remeshing algorithm using the constrained Delaunay method adapted to the mesh density map is developed. In the finite element simulation of forging process, the numerical error increases as the process goes on. 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 fine mesh at the region where the error is concentrated such as die corner. In this paper, the point insertion algorithm is used and mesh size is controlled by using a mesh density map constructed with a posteriori error estimation. And an optimized smoothing technique is adapted to have smooth distribution and improve the quality of the mesh.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2013.11a
• /
• pp.237-238
• /
• 2013

The quality of document image captured from electronic display might be worse when it is compared with document image captured from paper. The problem appears because of Moir? noise. This problem can lead to achieve inaccurate intermediate result for further image processing. This paper proposes a method to remove Moir? noise of document images captured from electronic display. The proposed algorithm is separated in two parts. In the first step, it corrects the text area region (foreground) with small area of smoothing. Then, it corrects the background area with large area of smoothing.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.48 no.4
• /
• pp.174-181
• /
• 1999

To obtain more accurate result in the finite element analysis for electric machinery, it is important to have a mesh being of good quality. This paper describes a new technique of mesh generation for the finite element method. When the list of points defining the region of analysis is given, an appropriate distribution of interior points is generated first. Secondly the points are connected to from the trianlges. Finally the connectivity data are used to reposition the interior points using Laplacian smoothing and mesh relaxation technique. In this paper, a mesh searching technique of Lawson which modifies the start mesh is proposed in addition to the above three steps. This algorithm is simple and produces the meshes being of good quality with high speed in comparison with the existing one.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3694-3702
• /
• 1999

OSL algorithm has an advantage that repeated algorithm is easily derived, even though penalty function which has a complicated transcendental function. In order to solve this problem, we suggested MPEMG algorithm. However, though this algorithm extend convergence rate of smoothing constant, it include the problem that is not faster than OSL algorithm in the convergence rate increasing penalized log-likelihood. Accordingly, in this paper, we will suggest SMOSLG digital image restoration algorithm which is fast in the convergence rate as well as extend convergence region of smoothing constant. And also we will study the usefulness of algorithm suggested through digital image simulation.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1995.06a
• /
• pp.83-86
• /
• 1995

Many image display devices allow only a limited number of colors to be simultaneously displayed. In displaying of natural color image using color palette, it is necessary to construct an optimal color palette and map each pixel of the original image to a color palette with fast. In this paper, we proposed the clustering algorithm using local region block centered one color cluster in the prequantized 3-D histogram. Cluster pairs which have the least distortion error are merged by considering distortion measure. The clustering process is continued until to obtain the desired number of colors. Same as the clustering process, original color image is mapped to palette color via a local region block centering around prequantized original color value. The proposed algorithm incorporated with a spatial activity weighting value which is smoothing region. The method produces high quality display images and considerably reduces computation time.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.2 s.308
• /
• pp.21-32
• /
• 2006

The license plate recognition (LPR) unit consists of the following core components: plate region segmentation, individual character extraction, and character recognition. Out of the above three components, accuracy in the performance of plate region segmentation determines the overall recognition rate of the LPR unit. This paper proposes an algorithm for segmenting the license plate region on the front or rear of a vehicle in a fast and accurate manner. In the case of the proposed algorithm images are captured on the spot where unmanned monitoring of illegal parking and stowage is performed with a variety of roadway environments taken into account. As a means of enhancing the segmentation performance of the on-the-spot-captured images of license plate regions, the proposed algorithm uses a mathematical model for license plate colors to convert color images into digital data. In addition, this algorithm uses Gaussian smoothing and double threshold to eliminate image noises, one-pass boundary tracing to do region labeling, and MBR to determine license plate region candidates and extract individual characters from the determined license plate region candidates, thereby segmenting the license plate region on the front or rear of a vehicle through a verification process. This study contributed to addressing the inability of conventional techniques to segment the license plate region on the front or rear of a vehicle where the frame of the license plate is damaged, through processing images in a real-time manner, thereby allowing for the practical application of the proposed algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.11
• /
• pp.5150-5155
• /
• 2011

Alzheimer's disease (AD) and vascular dementia (VD) are the most common dementia. In this paper, we proposed a region selection for classification of AD, VD and normal (NOR) based on micro-Raman spectra from platelet. The preprocessing step is a smoothing followed by background elimination to the original spectra. Then we applied the minmax method for normalization. After the inspection of the preprocessed spectra, we found that 725-777, 1504-1592 and 1632-1700 $cm^{-1}$ regions are the most discriminative features in AD, VD and NOR spectra. We applied the feature transformation using PCA (principal component analysis) and NMF (nonnegative matrix factorization). The classification result of MAP(maximum a posteriori probability) involving 327 spectra transformed features using proposed local region showed about 92.8 % true classification average rate.

• Journal of the Korean Society of Visualization
• /
• v.8 no.3
• /
• pp.41-48
• /
• 2010

A visualization study to evaluate bubble motion in a tab water filled cylindrical tank with a varying flow rate of compressed air is conducted. The flow rate of compressed air varies from 1 to 5 L/min. Time resolved images are acquired by a high speed camera in 10 bit gray level at 100 fps and the measurement volume is irradiated by a 230 W halogen lamp. It is observed that there are three different regions; the bubble formation region, the rising bubble region and the free surface region. During the rise of bubble, the shape is changed as if an elastic body. Based on the binarized bubble image, the mean diameters of rising bubbles are estimated at beneath of the free surface. As the gas flow rate increases, the mean diameter is increased and the rising velocity also increases with buoyancy force.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.4
• /
• pp.848-854
• /
• 1996

Many image display devices allow only a limited number of colors to be simultaneously displayed. in disphaying of natural color image using color palette, it is necessary to construct an optimal color palette and the optimal mapping of each pixed of the original image to a color from the palette. In this paper, we proposed the clustering algorithm using local region block centered one color cluster in the prequantized 3-D histogram. Cluster pairs which have the least distortion error are merged by considering distortion measure. The clustering process is continued until to obtain the desired number of colors. The same as the clustering process, original color value. The proposed algorithm incroporated with a spatial activity weighting value which is reflected sensitivity of HVS quantization errors in smoothing region. This method produces high quality display images and considerably reduces computation time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.141-147
• /
• 2000

In the restoration of degraded noisy motion blurred image, we have trade-off problem between smoothing the noise and restoration of the edge region. While the noise is smoothed, die edge or details will be corrupted. On the other hand, restoring the edge will amplify the noise. To solve this problem we propose an adaptive algorithm which uses I- H regularization operator for flat region and Laplacian regularization operator for edge region. Through the experiments, we verify that the proposed method shows better results in the suppression of the noise amplification in flat region, introducing less ringing artifacts in edge region and better ISNR than those of the conventional ones.