• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.6
• /
• pp.345-352
• /
• 2014

Edge detection considers the important technical details of digital image processing. Many edge detection operators already perform edge detection in digital color imaging. In this study, the edge of many real color images that represent the type of digital image was detected using a new operator in the least square approximation method, which is a type of numerical method. The Linear Fitting algorithm is computationally more expensive compared to the Canny, LoG, Sobel, Prewitt, HIS, Fuzzy, Parametric, Synthetic and Vector methods, and Robert' operators. The results showed that the new method can detect an edge in a digital color image with high efficiency compared to standard methods used for edge detection. In addition, the suggested operator is very useful for detecting the edge in a digital color image.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.12
• /
• pp.2982-2988
• /
• 2014

The edge detection is a pre-processing of such as image segmentation, image recognition, etc, and many related studies are being conducted both in domestic and abroad. Representative edge detection methods are Sobel, Prewitt, Laplacian, Roberts and Canny edge detectors. Such existing methods are possible for superb detections of edges if edges are detected from videos without noises. However, for video degraded by the salt-and-pepper noise, the edge detection characteristic is shown to be insufficient due to the noise influence. Therefore, in this study, the area is separated as the top, down, left and right from the mask's center pixel first to acquire a superb edge detection characteristic from the video damaged by the salt-and-pepper noise. And the algorithm that detects the final edge by applying the directional mask on the assumed factor of mask that is obtained according to the result of determination for the noise status of representative pixel value of each area.

• The Korean Journal of Applied Statistics
• /
• v.14 no.1
• /
• pp.149-160
• /
• 2001

In this paper we employ two-sample location tests such as Wilcoxon test and T test for detecting edges in noisy images. For this, we compute a test statistic on pixel gray levels obtained using an edge-height parameter and compare it with a threshold determined by a significance level. Experimental results applied to sample images are given and performances of these tests in terms of the objective measure are compared.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.147-153
• /
• 2004

This paper proposes an efficient edge detection using Van der Waerden statistic in original and noisy images. An edge is where the intensity of an image moves from a low value to a high value or vice versa. We describe a nonparametric Wilcoxon test and a parametric T test based on statistical hypothesis testing for the detection of edges. We use the threshold determined by specifying significance level $\alpha$, while Bovik, Huang and Munson consider the range of possible values of test statistics for the threshold. From the experimental results of edge detection, the T and Wilcoxon method perform sensitively to the noisy image, while the proposed Waerden method is robust over both noisy and noise-free images under $\alpha$=0.0005. Comparison with our statistical test and Sobel, LoG, Canny operators shows that Waerden method perform more effectively in both noisy and noise-free images.

• Journal of Computational Design and Engineering
• /
• v.3 no.3
• /
• pp.191-197
• /
• 2016

Since 3D measurement technologies have been widely used in manufacturing industries edge detection in a depth image plays an important role in computer vision applications. In this paper, we have proposed an edge detection process in a depth image based on the image based smoothing and morphological operations. In this method we have used the principle of Median filtering, which has a renowned feature for edge preservation properties. The edge detection was done based on Canny Edge detection principle and was improvised with morphological operations, which are represented as combinations of erosion and dilation. Later, we compared our results with some existing methods and exhibited that this method produced better results. However, this method works in multiframe applications with effective framerates. Thus this technique will aid to detect edges robustly from depth images and contribute to promote applications in depth images such as object detection, object segmentation, etc.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.3
• /
• pp.51-57
• /
• 2012

Hepatic vessel tree is the key structure for hepatic disease diagnosis and liver surgery planning. Especially, it is used to evaluate the donors' and recipients' liver for the LDLT(Living Donors Liver Transplantation) and estimate the volumes of left and right hepatic lobes for securing their life in the LDLT. In this study, we propose a method to apply canny edge detection that is not affected by noise to the liver images for automatic segmentation of hepatic vessels tree in contrast abdominal MDCT image. Using histograms and average pixel values of the various liver CT images, optimized parameters of the Canny algorithm are determined. It is more time-efficient to use the common parameters than to change parameters manually according to CT images. Candidates of hepatic vessels are extracted by threshold filtering around the detected the vessel edge. Finally, using a system which detects the true-negatives and the false-positives in horizontal and vertical direction, the true-negatives are added in candidate of hepatic vessels and the false-positives are removed. As a result of the process, the various hepatic vessel trees of patients are accurately reconstructed in 3D.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.739-741
• /
• 2004

영상에서 Edge는 영역의 경계를 표현하며. 특징으로는 픽셀 밝기의 불연속점을 나타낸다. 이러한 Edge를 찾아내는 Edge detection은 설러 가지 영상 처리 기법에서 유용하게 사용되고 있다. 현재까지 많은 알고리즘들이 제안되었으며. 이 논문에서는 이러한 알고리즘들에 대한 장단점을 파악하고, 미분 연산자를 이용한 Sobel, Prewitt. Roberts. Laplacian, 그리고 Canny 마스크를 이용한 윤곽선 검출방법과 Discrete Sing에ar Convolution (DSC) 알고리즘을 이용한 윤곽선 검출방법을 백색 가우시안 잡음 환경과 비 잡음 환경에서 비교해 보았다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.7
• /
• pp.939-944
• /
• 2007

Edge is a significant element to represent boundary information between objects in images. There are various edge detection methods, which are based on differential operation, such as Sobel, Prewitt, Roberts, Canny, Laplacian, and etc. However the conventional methods have drawbacks as follow : (i) insensitivity to edges with gentle curve intensity, (ii) detection of double edges for edges with one pixel width. For the detection of edges, not only development of the effective operators but also that of appropriate thresholding methods are necessary. But it is very complicate problem to find an appropriate threshold. In this paper, we propose an edge detection method based on the region separateness between objects to overcome the drawbacks of the conventional methods, and a thresholding method for the proposed edge detection method. We show the effectiveness of the proposed method through experimental results obtained by applying the proposed and the conventional methods to well-known test images.

• Smart Structures and Systems
• /
• v.28 no.6
• /
• pp.779-789
• /
• 2021

Cracks in railway sleeper are an inevitable condition and has a significant influence on the safety of railway system. Although the technology of railway sleeper condition monitoring using machine learning (ML) models has been widely applied, the crack recognition accuracy is still in need of improvement. In this paper, a two-stage method using edge detection and convolutional neural network (CNN) is proposed to reduce the burden of computing for detecting cracks in railway sleepers with high accuracy. In the first stage, the edge detection is carried out by using the 3×3 neighborhood range algorithm to find out the possible crack areas, and a series of mathematical morphology operations are further used to eliminate the influence of noise targets to the edge detection results. In the second stage, a CNN model is employed to classify the results of edge detection. Through the analysis of abundant images of sleepers with cracks, it is proved that the cracks detected by the neighborhood range algorithm are superior to those detected by Sobel and Canny algorithms, which can be classified by proposed CNN model with high accuracy.

• International Journal of Advanced Culture Technology
• /
• v.10 no.2
• /
• pp.300-306
• /
• 2022

Currently, Korea is building traffic infrastructure using Intelligent Transport Systems (ITS), but the pedestrian traffic accident rate is very high. The purpose of this paper is to prevent the risk of traffic accidents by jaywalking pedestrians. The development of this study aims to detect pedestrians who trespass using the public data set provided by the Artificial Intelligence Hub (AIHub). The data set uses training data: 673,150 pieces and validation data: 131,385 pieces, and the types include snow, rain, fog, etc., and there is a total of 7 types including passenger cars, small buses, large buses, trucks, large trailers, motorcycles, and pedestrians. has a class format of Learning is carried out using YOLOv5 as an implementation model, and as an object detection and edge detection method of an input image, a canny edge model is applied to classify and visualize human objects within the detected road boundary range. In this study, it was designed and implemented to detect pedestrians using the deep learning-based YOLOv5 model. As the final result, the mAP 0.5 showed a real-time detection rate of 61% and 114.9 fps at 338 epochs using the YOLOv5 model.