• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.6
• /
• pp.675-683
• /
• 2001

In this paper, we propose the edge compensation algorithm which connects the adjacent edges without losing the information of the skeletons on the edge image. The proposed edge compensation algorithm is composed of succeeding two steps. In the first step, the uplifted image is obtained by uplifting the edge image repeatedly. The next step is to extract the edge image from the uplifted image using the skeleton extraction algorithm. Experimental results show that the proposed method connects the adjacent edges without the distortion of the original edge information compared to the traditional method.

• Proceedings of the KSRS Conference
• /
• 1999.11a
• /
• pp.411-420
• /
• 1999

In geology, lineament features have been used to identify geological events, and many of scientists have been developed the algorithm that can be applied with the computer to recognize the lineaments. We choose several edge detection filter, line detection filters and Hough transform to detect an edge, line, and to vectorize the extracted lineament features, respectively. firstly the edge detection filter using a first-order derivative is applied to the original image In this step, rough lineament image is created Secondly, line detection filter is used to refine the previous image for further processing, where the wrong detected lines are, to some extents, excluded by using the variance of the pixel values that is composed of each line Thirdly, the thinning process is carried out to control the thickness of the line. At last, we use the Hough transform to convert the raster image to the vector one. A Landsat image is selected to extract lineament features. The result shows the lineament well regardless of directions. However, the degree of extraction of linear feature depends on the values of parameters and patterns of filters, therefore the development of new filter and the reduction of the number of parameter are required for the further study.

• Journal of Korean Society for Geospatial Information Science
• /
• v.7 no.1 s.13
• /
• pp.75-86
• /
• 1999

Three dimensional city model is composed of man-made and natural features, among these, most of man-made features are buildings. Therefore, it is very important to extract the building informations accurately and promptly to update the existing database. To achieve this, DTM can be reconstructed using building Information which is extracted from DTM, then this can be used as three dimensional city model. Thus, this paper aims to extract building boundaries and heights from high resolution DTM and edge informations of aerial photograph using mathematical morphology and image segmentation. We found that it is possible to extract buildings using opening operation in mathematical morphology and to improve the accuracy of building extraction using edge informations from aerial photograph.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11A
• /
• pp.1098-1103
• /
• 2005

The edge and contour information are very much appreciated by the human visual systems and are responsible for our perceptions and recognitions. Therefore, if edge information is integrated during extracting video objects, we can generate boundaries of oects closer to human visual systems for multimedia applications such as interaction between video objects, object-based coding, and representation. Most of object extraction methods are difficult to implement real-time systems due to their iterative and complex arithmetic operations. In this paper, we propose a VLSI architecture integrating edge information to extract video objects for precisely located object boundaries. The proposed architecture can be easily implemented into hardware due to simple arithmetic operations. Also, it can be applied to real-time object extraction for object-oriented multimedia applications.

• The Journal of the Acoustical Society of Korea
• /
• v.32 no.2
• /
• pp.147-156
• /
• 2013

In this paper, a new speech endpoint detection method in noisy environments for moving robot platforms is proposed. In the conventional method, the endpoint of speech is obtained by applying an edge detection filter that finds abrupt changes in the feature domain. However, since the feature of the frame energy is unstable in such noisy environments, it is difficult to accurately find the endpoint of speech. Therefore, a novel feature extraction method based on the twice-iterated fast fourier transform (TIFFT) and statistical models of speech is proposed. The proposed feature extraction method was applied to an edge detection filter for effective detection of the endpoint of speech. Representative experiments claim that there was a substantial improvement over the conventional method.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.11
• /
• pp.75-82
• /
• 2010

The paper proposed CBIRS/EFI with contents based search technique using edge feature information of the object from image information of the object which is uncertain. In order to search specially efficiently case of partial image information of the object, we used the search technique which extracts outline information and color information in feature information of object. In order to experiment this, we extracted side edge feature information of the vehicle for feature information of the object after capture the car image of the underground garage. This is the system which applies a contents base search by the result which analyzes the image which extracts a feature, an original image to search and a last similar measurement result. This system compared in FE-CBIRS systems which are an existing feature extraction contents base image retrieval system and the function which improves the accuracy and an effectiveness of search rate was complemented. The performance appraisal of CBIRS/EFI systems applied edge extraction feature information and color information of the cars. And we compared a color feature search time, a shape characteristic search time and a search rate from the process which searches area feature information. We extracted the case 91.84% of car edge feature extraction rate. And a average search time of CBIRS/EFI is showing a difference of average 0.4-0.9 seconds than FE-CBIRS from vehicle. color search time, shape characteristic search time and similar search time. So, it was proven with the fact that is excellent.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.4 s.310
• /
• pp.19-26
• /
• 2006

In these days, multimedia data is transmitted and processed in compressed format. Due to the decoding procedure and filtering for edge detection, the feature extraction process of MPEG-7 Edge Histogram Descriptor (EHD) is time consuming as well as computationally expensive. To improve efficiency of compressed image retrieval, we propose a new edge histogram generation algorithm in DCT domain in this paper. Using the edge information provided by the only two AC coefficients of DCT coefficients, we can get edge directions and strengths directly in DCT domain. The experimental results demonstrate that our system has good performance in terms of retrieval efficiency and effectiveness.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1865-1872
• /
• 1997

This paper proposes not only the thresholding problem which has been one of the major problems in the pre-existing edge detection method but also the removal of blurring effect occurred at the edge regions due to the smoothing process. The structure of a given image is assigned as one of the three predefined image structure classes by evaluating its toll membership value to each reference structure class:The structure of an image belongs to the structure class which has the least cost value with the image. Upon the structure class assigned, noise removal and edge extraction precesses are performed, e.g., the smoothing algorithm is applied to the image if its structure belongs to the pure noise region class; edge extraction while removing the noise is performed simultaneously if the edge structure class. The proposed method shows that preventing the blurring effect can be usually seen in the edge images and extracting the edges with no using thresholding value by the experiments.

• Journal of Convergence for Information Technology
• /
• v.11 no.2
• /
• pp.41-46
• /
• 2021

The method of the edge detection algorithm based on grayscale mathematical morphology has the advantage that image noise can be removed and processed in parallel, and the operation speed is fast. However, the method of detecting the edge of an image using a single structural scale element may be affected by image information. The characteristics of grayscale morphology may be limited to the edge information result of the operation result by repeatedly performing expansion, erosion, opening, and containment operations by repeating structural elements. In this paper, we propose an edge detection algorithm that applies a structural element with strong directionality to noise and then applies weighted entropy to each pixel information in the element. The result of applying the multi-scale structural element applied to the image and the result of applying the directional weighted entropy were compared and analyzed, and the simulation result showed that the proposed algorithm is superior in edge detection.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.5
• /
• pp.786-792
• /
• 2022

In the cloud computing environment, there has been a lot of research into the Fog/Edge Computing (FEC) paradigm for securing user proximity of application services and computation offloading to alleviate service delay difficulties. The method of predicting dynamic location change patterns of edge devices (moving objects) requesting application services is critical in this FEC environment for efficient computing resource distribution and deployment. This paper proposes an optimal moving pattern extraction algorithm in which variable weights (distance, time, congestion) are applied to selected paths in addition to a support factor threshold for frequency patterns (moving objects) of edge devices. The proposed algorithm is compared to the OPE_freq [8] algorithm, which just applies frequency, as well as the A^* and Dijkstra algorithms, and it can be shown that the execution time and number of nodes accessed are reduced, and a more accurate path is extracted through experiments.