• Communications for Statistical Applications and Methods
• /
• v.19 no.4
• /
• pp.619-628
• /
• 2012

Noise reduction is an important issue in the field of image processing because image noise lowers the quality of the original pure image. The basic difficulty is that the noise and the signal are not easily distinguished. Simple smoothing is the most basic and important procedure to effectively remove the noise; however, the weakness is that the feature area is simultaneously blurred. In this research, we use ways to measure the degree of noise with respect to the degree of image features and propose a Bayesian noise reduction method based on MAP (maximum a posteriori). Simulation results show that the proposed adaptive noise reduction algorithm using Bayesian MAP provides good performance regardless of the level of noise variance.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.399-402
• /
• 2000

In this paper, we present a regularized mixed norm multichannel image restoration algorithm. The problem of multichannel restoration using both within- and between- channel deterministic information is considered. For each channel a functional which combines the least mean squares (LMS), the least mean fourth(LMF), and a smoothing functional is proposed, We introduce a mixed norm parameter that controls the relative contribution between the LMS and the LMF, and a regularization parameter that defines the degree of smoothness of the solution, both updated at each iteration according to the noise characteristics of each channel. The novelty of the proposed algorithm is that no knowledge of the noise distribution for each channel is required, and the parameters mentioned above are adjusted based on the partially restored image.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.7 no.6
• /
• pp.72-79
• /
• 1998

In this paper, image processing algorithm is studied to enhance the preciseness of the geometry while converting captured images to CAD data. A program is developed as a result. The code, in the image processing, utilizes outline trace, point data smoothing algorithm. It is capable of automatically generating design data by converting input image data to the CAD data. The output can be made in DXF, IGES formats. The current research can be utilized as a base data for the development of factory automation or flexible manufacturing system which adopt image processing based automatic inspection and measuring system.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.6
• /
• pp.1136-1142
• /
• 2010

In this study, an efficient removal algorithm for specular reflections in a tooth color image is proposed to minimize the artefact interrupting color image segmentation. The pixel values of RGB color channels are initially reversed to emphasize the features in reflective regions, and then those regions are automatically detected by utilizing perceptron artificial neural network model and those prominent intensities are corrected by applying a smoothing spatial filter. After correcting specular reflection regions, multiple seeds in the tooth candidates are selected to find the regional minima and MCWA(Marker-Controlled Watershed Algorithm) is applied to delineate the individual tooth region in a CCD tooth color image. Therefore, the accuracy in segmentation for separating tooth regions can be drastically improved with removing specular reflections due to the illumination effect.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.96-102
• /
• 1995

This paper presents the VHSIC Hardware Description Language(VHDL) implementation of the Fixed Point Covariance Lattice(FLAT) algorithm for an Linear Predictive Coding(LPC) analysis and its related algorithms, such as the forth order high pass Infinite Impulse Response(IIR) filter, covariance matrix calculation, and Spectral Smoothing Technique(SST) in the Vector Sum Exited Linear Predictive(VSELP) speech coder that has been Selected as the standard speech coder for the North America and Japanese digital cellular. Existing Digital Signal Processor(DSP) chips used in digital cellular phones are derived from general purpose DSP chips, and thus, these DSP chips may not be optimal and effective architectures are to be designed for the above mentioned algorithms. Then we implemented the VHDL code based on the C code, Finally, we verified that VHDL results are the same as C code results for real speech data. The implemented VHDL code can be used for performing logic synthesis and for designing an LPC Application Specific Integrated Circuit(ASOC) chip and DsP chips. We first developed the C language code to investigate the correctness of algorithms and to compare C code results with VHDL code results block by block.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1711-1714
• /
• 2003

The noise in an image degrades image quality and deteriorates coding efficiency of compression. Recently, various edge-preserving noise filtering methods based on the nonstationary image model have been proposed to overcome this problem. In most conventional nonstationary image models, however, pixels are assumed to be uncorrelated to each other In order not to increase the computational burden too much. As a result, some detailed information is lost in the filtered results. In this paper, we propose a computationally feasible adaptive noise smoothing algorithm which considers the nonstationary correlation characteristics of images. We assume that an image has a nonstationary mean and can be segmented into subimages which have individually different stationary correlations. Taking advantage of the special structure of the covariance matrix that results from the proposed image model, we derive a computationally efficient FFT-based adaptive linear minimum mean square error filter. The justification for the proposed image model is presented and the effectiveness of the proposed algorithm is demonstrated experimentally.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.2 no.4
• /
• pp.61-66
• /
• 2003

An excellent mesh construction is of Importance in yielding good results of finite element analysis. The new mesh generation algorithm, which offsets boundaries inward, was developed on the basis of a looping method. An user interface technique and automatic splitting lines which both divide a given domain into subdomains manually or automatically, were used. In addition, the separation method has advantages to prevent the large scale of element size and to control numbers of nodes and elements. This new mesh generation algorithm was proved in practice.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.6
• /
• pp.455-466
• /
• 1990

Enalish character recognition with the neural networl algorithm has been performed. Character recognition technition techniques which are processed by software, have the limit of the recognition speed. To overcome this limit, we realize this system to hardware by using the neural network algorithm. We have designed preprocessing chip using the neural nework model, that is single layer perceptorn, in the noise elimination, smoothing, thinning and feature point extraction. These chips are implemented as a CMOS double metal 2um design rule.

• 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 Institute of Control, Robotics and Systems
• /
• v.8 no.3
• /
• pp.275-280
• /
• 2002

A new algorithm for gradual scene change detection in MPEG based frame sequences is proposed in this paper. The proposed algorithm is based on the fact that most of gradual curves can be characterized by variance distributions of edge information in the frame sequences. Average edge frame sequences are obtained by performing "sober" edge detection. Features are extracted by comparing variances with those of local blocks in the average edge frames. Those features are further processed by the opening operation to obtain smoothing variance curves. The lowest variance in the local frame sequences is chosen as a gradual detection point. Experimental results show that the proposed method provides 85% precision and 86% recall rate fur gradual scene changes.