• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.11
• /
• pp.1185-1198
• /
• 1992

In this paper, the differential weighted algorithm proposed in order to improve th noise smoothing characteristics of conventional Median filter and FIR-Median Hybrid filter. Performance of some image restoration filter(median filter, FIR-Median Hybird filter, FIR-Median Hybrid filter to proposed differential weighted algorithm) are compared and evaluated on the noise smoothing characteristics and sharp edge conservation characteristics. Test and Real images used in this paper are Lenna and Urological images corrupted by impulse, gaussian, exponential and laplacian noise. Experimental results show that the FIR-Median Hybrid filter applied to the differential weighted algorithm are comparatively superior to others. But the filter orders have increased, the more time consumed to image processing. Hence if the adequate filtering by the type of image is selected. now after a great support will be take consideration into the various parts of application by computer science and of medical image processing.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.7
• /
• pp.1393-1398
• /
• 2004

Image is degraded by several causes such as the process of acquisition, storage and transmission. To restore those images, many researches have been continued. Centrally methods to restore degraded image by AWGN(additive white gaussian noise) a.e mean filter and wiener filter. Especially, mean filter is superior in noise reduction of area that is a small change of luminosity. But mean filter brings about the effect smoothing edge components of the image, because it does'nt consider characteristics of the image. So in this paper we propose an image restoration method compounding respective images adding established weights, after filtering with mean filter and powerful wiener filter in both improvement of contrast and preservation of edge components.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.161-164
• /
• 2003

A study on the gray images morphing using morphology and spline interpolation is realized. The adapted method is that join the 2 broken line together with the dilation of morphology to the morphing image, remove the holes to be a soft edge at the image boundaries and extract the featuring points with the cubic spline interpolation. As a result of experiment the method elicits more smoothing image morphing in detail and speed up the interframe processing.

• Journal of Korean Society for Geospatial Information Science
• /
• v.4 no.1 s.6
• /
• pp.93-102
• /
• 1996

For an atomatic generation of DEM(Digital Elevation Model) by computer, it is a time-consumed work to determine adquate matches from stereo images. Correlation and evenly distributed area-based method is generally used for matching operation. In this paper, we propose a new approach that computes matches efficiantly by changing the size of mask window and search area according to the given terrain information. For image segmentation, at first edge-preserving smoothing filter is used for preprocessing, and then region growing algorithm is applied for the filterd images. The segmented regions are classifed into mountain, plain and water area by using MRF(Markov Random Filed) model. Maching is composed of predicting parallex and fine matching. Predicted parallex determines the location of search area in fine matching stage. The size of search area and mask window is determined by terrain information for each pixel. The execution time of matching is reduced by lessening the size of search area in the case of plain and water. For the experiments, four images which are covered $10km{\times}10km(1024{\times}1024\;pixel)$ of Taejeon-Kumsan in each are studied. The result of this study shows that the computing time of the proposed method using terrain information for matching operation can be reduced from 25% to 35%.

• Journal of Broadcast Engineering
• /
• v.4 no.1
• /
• pp.59-67
• /
• 1999

In this paper, we study two important topics in stereoscopic image communication system. One is a disparity estimation (DE) method to obtain the depth information of a scene at the transmitter and the other is an intermediate view reconstruction(IVR) method at the receiver. We propose a new DE method using an edge-preserving directional regularization technique. The proposed DE method smooths disparity vectors in smooth regions and preserves edges without over-smoothing problem. It provides better reconstructed stereoscopic images and improved coding efficiency than the existing regularization techniques. In addition. we propose a new IVR method using interpolation and extrapolation techniques. The proposed IVR method preserves edge regions as well as occlusion regions well. Thus. it gives better intermediate views than the existing IVR methods.

• Progress in Medical Physics
• /
• v.19 no.3
• /
• pp.186-190
• /
• 2008

In this study, we describe the preliminary application for the delineation of a metal object using cone-beam reconstruction (CBR) based on limited electronic portal imaging device (EPID) projections. A typical Feldkamp, Davis and Kress (FDK) reconstruction algorithm accompanying the edge preserving smoothing filter was used as only a few projections are acquired for reconstruction. In a correlation study of the projection numbers, we found that the size of the seeds and their location depicted by these CBR images were almost identical. Limited views were used for CBR, and our method is inexpensive and competitive for use in clinical applications.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.930-933
• /
• 2011

This paper addresses an adaptive postprocessing method applied in the spatial domain for block-based discrete cosine transform (BDCT) coded images. The proposed algorithm is designed by a serial concatenation of a 1D simple smoothing filter and a 2D directional filter. The 1D smoothing filter is applied according to the block type, which is determined by an adaptive threshold. It depends on local statistical properties, and updates block types appropriately by a simple rule, which affects the performance of deblocking processes. In addition, the 2D directional filter is introduced to suppress the ringing effects at the sharp edges and the block discontinuities while preserving true edges and textural information. Comprehensive experiments indicate that the proposed algorithm outperforms many deblocking methods in the literature, in terms of PSNR and subjective visual quality evaluated by GBIM.

• Journal of information and communication convergence engineering
• /
• v.12 no.3
• /
• pp.168-172
• /
• 2014

In this paper, we propose an algorithm that can efficiently detect and monitor multiple ships in real-time. The proposed algorithm uses morphological operations and edge information for detecting and tracking ships. We used smoothing filter with a $3{\times}3$ Gaussian window and luminance component instead of RGB components in the captured image. Additionally, we applied Sobel operator for edge detection and a threshold for binary images. Finally, object labeling with connectivity and morphological operation with open and erosion were used for ship detection. Compared with conventional methods, the proposed method is meant to be used mainly in coastal surveillance systems and monitoring systems of harbors. A system based on this method was tested for both stationary and non-stationary backgrounds, and the results of the detection and tracking rates were more than 97% on average. Thousands of image frames and 20 different video sequences in both online and offline modes were tested, and an overall detection rate of 97.6% was achieved.

• 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 Korea Society of Digital Industry and Information Management
• /
• v.11 no.4
• /
• pp.155-164
• /
• 2015

In this paper, we propose a new color interpolation method based on trilateral filter approach, which not only preserve the high-frequency components(image edge) while interpolating the missing raw data of color image(bayer data pattern), but also immune to the image noise components and better preserve the detail of the low-frequency components. The method is the trilateral filter approach applying a gradient to the low frequency components of the image signal in order to preserve the high-frequency components and the detail of the low-frequency components through the measure of the freedom of similarity among adjacent pixels. And also we perform Gaussian smoothing to the interpolated image data in order to robust to the noise. In this paper, we compare the conventional demosaicing algorithm and the proposed algorithm using 10 test images in terms of hue MAD, saturation MAD and CPSNR for the objective evaluation, and verify the performance of the proposed algorithm.