• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8C
• /
• pp.680-688
• /
• 2010

In this paper, we present a dynamic programming(DP)-based stereo matching method using image segmentation algorithm. DP has been a classical and popular optimization method for various computer vision problems including stereo matching. However, the performance of conventional DP has not been satisfactory when it is applied to the stereo matching since the vertical correlation between scanned lines has not been properly considered. In the proposed algorithm, accurate edge information is first obtained from segmented image information then we considers the discontinuity of disparity and occlusions region based on the obtained edge information. The experimental results applied to the Middlebury stereo images demonstrate that the proposed algorithm has better performances in stereo matching than the previous DP based algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.956-958
• /
• 2016

Currently, image processing has been widely utilized and the noise may be occurred in the processes of image data transmission, processing, and storage. The studies have been actively conducted to eliminate the added noise in the image. The types of noise in the image are various depending on the causes and the forms, and additive white Gaussian noise(AWGN) is the representative one. The algorithm to apply and process the weighted value was suggested by the directions of the pixel in the local mask using edge detection to relieve the added AWGN in the image in this article.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.11
• /
• pp.1635-1644
• /
• 1993

In this paper, we examine the statistical characteristics of edge enhancing filters and their efficacy as preprocessing operator before edge detection. In particular, edge enhancing filters called the Comparison and Selection(CS), Hachimura-kuwahara(HK), and Selective Average(SA) filters are considered. These filters can reduce noise while producing step-type edges, thus seem to be effective for preprocessing noisy images prior to applying edge detecors. The ability of edge enhancing filters to suppress white Gaussian noise and the error probabilities occured during the edge detection following SA prefiltering are evaluated statistically through numerical analysis. The effect of prefiltering on edge detection is assessed by applying the edge enhancing fitters to a noise image degraded by additive white noise prior to applying the Sobel operator and the Laplacian of Gaussian( LoG ) operator, respectively. It is shown that the edge enhancing filters tend to produce ideal step-type edges while reducing the noise reasonably well, and the use of edge enhancing filters prior to edge detection can improve the performance of subsequent edge detector.

• Journal of KIISE:Software and Applications
• /
• v.27 no.5
• /
• pp.551-562
• /
• 2000

Content-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. GContent-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. Generally, the query image produced by a user is different from the intended target image. To overcome this problem, many image retrieval systems use the spatial relationships of the objects, instead of pixel coordinates of the objects. In this paper, a query-converting algorithm for an image retrieval system, which uses the spatial relationship of every two objects as an image feature, is proposed. The proposed algorithm converts the query image into a graph that has the minimum number of edges, by eliminating every transitive edge. Since each edge in the graph represents the spatial relationship of two objects, the elimination of unnecessary edges makes the retrieval process more efficient. Experimental results show that the proposed algorithm leads the smaller number of comparison in searching process as compared with other algorithms that do not guarantee the minimum number of edges.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.4
• /
• pp.973-979
• /
• 2011

In the transmitting process of image signal processing system, there are several different causes of degradation that have been occurring. The main cause of degradation is attributed to the noise. The most representive method of removing noise of image, which is caused by impulse noise environment, is using the SM(standard median filter). At edge, the filter has a special feature which has a tendency to decrease. As a result, we proposed a nonlinear filter that restores the image considering edge quality in the impulse noise environment. And through the simulation, we compared with the many of the conventional algorithms and the value of the PSNR(peak signal to nise ratio) is better than them and preserve the edge very well. So the nonlinear filter that proposed in this paper is excepted to help improve restoring the images that in impulse noise environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1342-1348
• /
• 2017

In an era where digital data takes on great importance, images are essential to various media. Noise is generated during the acquisition and transmission of such images, caused by a number of external factors. The removal of noise is an essential step in image processing. There are various methods used to remove noise, in accordance with the cause or form of the noise. AWGN is one of the leading methods. As such, this paper applies the edge detection method using the mean of each pixel after categorizing in detail the partial masks into nine areas as part of the preliminary process, in order to minimize noise that had been added to the image. In addition, the paper suggests an algorithm that applies different filters to the partial masks by using the critical mass value of the transfigured edge detection. To verify the competence of the suggested algorithm, it was compared with existing methods by using magnified images and PSNR(peak signal to noise ratio).

• Journal of Broadcast Engineering
• /
• v.17 no.2
• /
• pp.316-324
• /
• 2012

In this paper, a novel descreening method using HOG(histogram of gradient)-based adaptive smoothing filter is proposed. Conventional edge-oriented smoothing methods does not provide enough smoothing to the halftone image due to the edge-like characteristic of the halftone noise. Moreover, clustered-dot halftoning method, which is commonly used in printing tends to create Moire pattern because of the intereference in color channels. Therefore, the proposed method uses HOG to distinguish edges and the amount of smoothing to be performed on the halftone image is then calculated according to the magnitude of the HOG in the edge and edge normal orientation. The proposed method was tested on various scanned halftone materials, and the results show that it effectively removes halftone noises as well as Moire pattern while preserving image details.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.11
• /
• pp.89-94
• /
• 1999

In vector quantization (VQ), mean squared error (MSE) is widely used as a distance measure between vectors. But the distance between averages appears as a dominant quantity in MSE. In the case of image vectors, the coincidence of edge pattern is also important considering human visual system (HVS). Therefore, this paper presents a new distance measure using the variance of difference (VD) as a criterion for the coincidence of edge pattern. By using this in the VQ encoding, we can reduce the degradation of edge region in the reconstructed image. And applying this to the codebook design, we can obtain the final codebook that has a lot of various edge codevectors instead of redundant shade ones.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.2
• /
• pp.163-171
• /
• 2012

High resolution satellite images have been used for building and road system analysis, landscape analysis, and ecological assessment for several years. However, in high resolution satellite images, shadows are necessarily cast by manmade objects such as buildings and over-pass bridges. This paper develops the shadow extraction procedures in urban area including various land-use classes, and the extracted shadow areas are evaluated by a manually digitized shadow map. For the shadow extraction, the Canny edge operator and the dilation filter are applied to make building edge buffer area. Also, the object-based segmentation was performed using Gram-Schmitt fusion image, and spectral and spatial parameters are calculated from the segmentation results. Finally, we proposed appropriate parameters and extraction rules for the shadow extraction. The accuracy of the shadow extraction results from the various assessment indices is 80% to 90%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.4
• /
• pp.280-286
• /
• 1986

A newmethod of fast mask operators for edge detection is proposed, which is based on the matrix factorization. The output of each component in the multi-directional mask operator is obtained adding every image pixels in the mask area weighting by corresponding mask element. Therefore, it is same as the result of matrix-vector multiplication like one dimensional transform, i, e, , trasnform of an image vector surrounded by mask with a transform matrix consisted of all the elements of eack mask row by row. In this paper, for the Sobel and Prewitt operators, we find the transform matrices, add up the number of operations factoring these matrices and compare the performances of the proposed method and the standard method. As a result, the number of operations with the proposed method, for Sobel and prewitt operators, without any extra storage element, are reduced by 42.85% and 50% of the standard operations, respectively and in case of an image having 100x100 pixels, the proposed Sobel operator with 301 extra storage locations can be computed by 35.93% of the standard method.