• Communications for Statistical Applications and Methods
• /
• v.9 no.2
• /
• pp.355-366
• /
• 2002

The web is one of the most plentiful sources of images. The web has an immediate need for image processing technology in Java. This paper provides a practical introduction to statistical image processing using Java on the web. The paper describes how images are represented in Java and deals with four image processing operations based on basic statistical methods: point processing, spatial filtering, edge detection and image segmentation.

• Communications for Statistical Applications and Methods
• /
• v.10 no.2
• /
• pp.325-332
• /
• 2003

This study was to develop a system for grading apples by their color using statistical image processing. T-test was used to detect edges in apple images and the chain code method was used for contour coding. The histogram and mean gray level of each RGB channel in a ring-shaped region was used to compare apple colors to reference apple color.

• Communications for Statistical Applications and Methods
• /
• v.29 no.2
• /
• pp.277-286
• /
• 2022

Due to the uniquely slow convergence speed of the EM algorithm, it suffers form a lot of processing time until the desired deconvolution image is obtained when the image is large. To cope with the problem, in this paper, an immediate solution of the EM algorithm is provided under the Gaussian image model. It is derived by finding the recurrent formular of the EM algorithm and then substituting the results repeatedly. In this paper, two types of immediate soultion of image deconboution by EM algorithm are provided, and both methods have been shown to work well. It is expected that it free the processing time of image deconvolution because it no longer requires an iterative process. Based on this, we can find the statistical properties of the restored image at specific iterates. We demonstrate the effectiveness of the proposed method through a simple experiment, and discuss future concerns.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.2
• /
• pp.385-399
• /
• 2007

In many image processing applications, a random noise makes some trouble since most video enhancement functions produce visual artifacts if a priori of the noise is incorrect. The basic difficulty is that the noise and the signal are difficult to be distinguished. Typical unsharp masking (UM) enhances the visual appearances of images, but it also amplifies the noise components of the image. Hence, the applications of a UM are limited when noises are presented. This paper proposed statistical algorithms based on parametric and nonparametric tests to adaptively enhance the image feature and the noise combining while applying UM. With the proposed algorithm, it is made possible to enhance the local contrast of an image without amplifying the noise.

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

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.16 no.3
• /
• pp.49-58
• /
• 2020

Image interpolation, a technology that converts low resolution images into high resolution images, has been widely used in various image processing fields such as CCTV, web-cam, and medical imaging. This technique is based on the fact that the statistical distributions of the white Gaussian noise and the difference between the interpolated image and the original image is similar to each other. The proposed algorithm is composed of three steps. In first, the interpolated image is derived by random image interpolation. In second, we derive weighting functions that are used to apply non-local mean filtering. In the final step, the prediction error is corrected by performing non-local mean filtering by applying the selected weighting function. It can be considered as a post-processing algorithm to further reduce the prediction error after applying an arbitrary image interpolation algorithm. Simulation results show that the proposed method yields reasonable performance.

• Journal of the Korean Vacuum Society
• /
• v.6 no.S1
• /
• pp.66-69
• /
• 1997

Porosity is one important characteristic feature and structural index of sprayed coatings. A method of measurement of porosity, EPMA-EDS image processing is developed in the paper. The characteristics of pores can be determined by processing of the image obtained from an electron microscope via VISTA, Not only the porosity can be presented but also the statistical result of pore size distribution. Finally it can be drawn from this paper that EPMA-EDS is a quite effective method to completely characterize the pores in plasma sprayed coatings.

• Management & Information Systems Review
• /
• v.3
• /
• pp.15-45
• /
• 1999

Processing techniques of remote sensed image data using computer have been recognized very necessary techniques to all social fields, such as, environmental observation, land cultivation, resource investigation, military trend grasp and agricultural product estimation, etc. Especially, accurate classification and analysis to remote sensed image da are important elements that can determine reliability of remote sensed image data processing systems, and many researches have been processed to improve these accuracy of classification and analysis. Traditionally, remote sensed image data processing systems have been processed 2 or 3 selected bands in multiple bands, in this time, their selection criterions are statistical separability or wavelength properties. But, it have be bring up the necessity of bands selection method by data distribution characteristics than traditional bands selection by wavelength properties or statistical separability. Because data sensing environments change from multispectral environments to hyperspectral environments. In this paper for efficient data classification in multispectral bands environment, a band feature extraction method using the Rough sets theory is proposed. First, we make a look up table from training data, and analyze the properties of experimental multispectral image data, then select the efficient band using indiscernibility relation of Rough set theory from analysis results. Proposed method is applied to LANDSAT TM data on 2 June 1992. From this, we show clustering trends that similar to traditional band selection results by wavelength properties, from this, we verify that can use the proposed method that centered on data properties to select the efficient bands, though data sensing environment change to hyperspectral band environments.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1347-1351
• /
• 1987

This thesis aims at studying laplacian pyramid vector quantization which keeps a simple compression algorithm and stability against various kinds of image data. To this end, images are devied into two groups according to their statistical characteristics. At 0.860 bits/pixel and 0.360 bits/pixel respectively, laplacian pyramid vector quantization is compared to the existing spatial domain vector quantization and transform coding under the same condition in both objective and subjective value. The laplacian pyramid vector quantization is much more stable against the statistical characteristics of images than the existing vector quantization and transform coding.

• Communications for Statistical Applications and Methods
• /
• v.19 no.2
• /
• pp.225-235
• /
• 2012

Noise reduction is an important issue in the field of image processing because image noise worsens the quality of the input image. The basic difficulty is that the noise and the signal are not easy to distinguish. Simple moothing is one of the most basic and important procedures to remove the noise, however, it does not consider the level of noise. This method effectively reduces the noise but the feature area is simultaneously blurred. This paper considers the block approach to detect noise and image features of the input image so that noise reduction could be adaptively applied. Simulation results show that the proposed algorithm improves the overall quality of the image by removing the noise according to the noise level.