• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2012.10a
• /
• pp.565-566
• /
• 2012

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.1186-1191
• /
• 1991

This paper represents a new edge relaxation algorithm that enhances the noisy boundary informations in images. The proposed algorithm employes relaxation process that reduces or eliminates ambiguities of derivative operator response via contextual informations. The contextual informations are the neighborhood patterns of a central edge which are estimated using fuzzy pattern matching technique. The algorithm is developed on crack edges. Experimental results show that the proposed scheme is effective even for noisy images or low contrast images.

• Transactions on Electrical and Electronic Materials
• /
• v.17 no.6
• /
• pp.363-368
• /
• 2016

Rectangular shape detection plays an important role in many image recognition systems. However, it requires continued research for its improved performance. In this study, we propose a strong rectangular shape detection algorithm, which combines the canny edge and line detection algorithms based on the perpendicularity and parallelism of a rectangle. First, we use the canny edge detection algorithm in order to obtain an image edge map. We then find the edge of the contour by using the connected component and find each edge contour from the edge map by using a DP (douglas-peucker) algorithm, and convert the contour into a polyline segment by using a DP algorithm. Each of the segments is compared with each other to calculate parallelism, whether or not the segment intersects the perpendicularity intersecting corner necessary to detect the rectangular shape. Using the perpendicularity and the parallelism, the four best line segments are selected and whether a determined the rectangular shape about the combination. According to the result of the experiment, the proposed rectangular shape detection algorithm strongly showed the size, location, direction, and color of the various objects. In addition, the proposed algorithm is applied to the license plate detecting and it wants to show the strength of the results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.412-434
• /
• 2023

This study discusses the high-order diffusion method in the wavelet domain. It aims to improve the edge protection capability of the high-order diffusion method using wavelet coefficients that can reflect image information. During the first step of the proposed diffusion method, the wavelet packet decomposition is a more refined decomposition method that can extract the texture and structure information of the image at different resolution levels. The high-frequency wavelet coefficients are then used to construct the edge detection function. Subsequently, because accurate wavelet coefficients can more accurately reflect the edges and details of the image information, by introducing the idea of state weight, a scheme for recovering wavelet coefficients is proposed. Finally, the edge detection function is constructed by the module of the wavelet coefficients to guide high-order diffusion, the denoised image is obtained. The experimental results showed that the method presented in this study improves the denoising ability of the high-order diffusion model, and the edge protection index (SSIM) outperforms the main methods, including the block matching and 3D collaborative filtering (BM3D) and the deep learning-based image processing methods. For images with rich textural details, the present method improves the clarity of the obtained images and the completeness of the edges, demonstrating its advantages in denoising and edge protection.

• Journal of information and communication convergence engineering
• /
• v.8 no.2
• /
• pp.185-190
• /
• 2010

In this paper we propose the CBIR algorithm which is based on a novel image block method that combined both color and edge feature. The main drawback of global histogram representation is dependent of the color without spatial or shape information, a new image block method that divided the image to 8 related blocks which contained more information of the image is utilized to extract image feature. Based on these 8 blocks, histogram equalization and edge detection techniques are also used for image retrieval. The experimental results show that the proposed image block method has better ability of characterizing the image contents than traditional block method and can perform the retrieval system efficiently.

• Journal of Astronomy and Space Sciences
• /
• v.33 no.4
• /
• pp.313-318
• /
• 2016

Communication, Ocean And Meteorological Satellite (COMS) Meteorological Imager (MI) images are processed for radiometric and geometric correction from raw image data. When intermediate image data are matched and compared with reference landmark images in the geometrical correction process, various techniques for edge detection can be applied. It is essential to have a precise and correct edged image in this process, since its matching with the reference is directly related to the accuracy of the ground station output images. An edge detection method based on neural networks is applied for the ground processing of MI images for obtaining sharp edges in the correct positions. The simulation results are analyzed and characterized by comparing them with the results of conventional methods, such as Sobel and Canny filters.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.11
• /
• pp.871-875
• /
• 2009

A software birthmark is inherent characteristics that can be used to identify a program. In this paper, we propose a new Java birthmark based on control flow graph (CFG) matching. The CFG matching consists of node matching and edge matching. To get similarities of nodes and edges of two CFGs, we apply a sequence alignment algorithm and a shortest path algorithm, respectively. To evaluate the proposed birthmark, we perform experiments on Java programs that implement various algorithms. In the experiments, the proposed birthmark shows not only high credibility and resilience but also fast runtime performance.

• The Journal of the Korea Contents Association
• /
• v.7 no.12
• /
• pp.311-321
• /
• 2007

For fast and robust face detection, this paper proposes an approach for face detection using fusion of heterogeneous template matching. First, we detect skin regions using a model of skin color which covers various illumination and races. After reducing a search space by region labelling and filtering, we apply template matching with skin color and edge to the detected regions. Finally, we detect a face by finding the best choice of template fusion. Experimental results show the proposed approach is more robust in skin color-like environments than with a single template matching and is fast by reducing a search space to face candidate regions. Also, using a global accumulator can reduce excessive space requirements of template matching.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.04b
• /
• pp.400-407
• /
• 1995

The straightness property is one of fundamental geometric tolerances to be strictly controlled for guideways of machine tools and measuring machines. The staightness measurement for long guideways was usually difficult to perform, and it needed additional equipments or special treatment with limited application. In this paper, a new approach is proposed using the profile matching technique for the long guideways, which can be applicable to most of straghtness measurements. An edge of relativelly sthort length is located along a divided section of a long guideway, and the local straightness measurement is performed. The edge is then moved to the next section with several positions overlap. After thelocal straightness profile is measured for every section along the long guideway with overlap, the global straightness profile is constructed using the profile matching technique based on theleast squares method. The proposed techinique is numerically tested for two cases of known global straightness profile arc profile and irregular profile and those profiles with and without random error intervention, respectively. When norandom errors are involved, the constructed golval profile is identical to the original profile. When the random errors are involved, the effect of the number of overlap points are investigated, and it is also found that the difference between the difference between the constructed and original profiles is very close to the limit of random uncertainty with juist few overlap points. The developed technique has been practically applied to a vertical milling machine of moving table type, and showed good performance. Thus the accuracy and efficiency of the proposed method are demonstrated, and shows great potential for variety of application for most of straightness measuirement cases using straight edges, laser optics, and angular measurement equipments.

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