• Journal of Korea Society of Digital Industry and Information Management
• /
• v.15 no.3
• /
• pp.37-44
• /
• 2019

In this study, we propose the automatic extraction method of Rescue Requests from Drone Images. A central object is extracted from each image by using central object extraction method[7] before classification. A central object in an images are defined as a set of regions that is lined around center of the image and has significant texture distribution against its surrounding. In this case of artificial objects, edge of straight line is often found, and texture is regular and directive. However, natural object's case is not. Such characteristics are extracted using Edge direction histogram energy and texture Gabor energy. The Edge direction histogram energy calculated based on the direction of only non-circular edges. The texture Gabor energy is calculated based on the 24-dimension Gebor filter bank. Maximum and minimum energy along direction in Gabor filter dictionary is selected. Finally, the extracted rescue requestor object areas using the dominant features of the objects. Through experiments, we obtain accuracy of more than 75% for extraction method using each features.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.2
• /
• pp.131-139
• /
• 2003

Shape descriptors play an important role in systems for object recognition, retrieval, registration, and analysis. Seven well-known descriptors including MPEG-7 visual descriptors arebriefly reviewed and a new robust pattern recognition descriptor is proposed. Performance comparison among descriptors are presented. Experiments show that the newly proposed descriptor yields better performance results than Fourier, invariant moment, and edge histogram descriptors.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.77-80
• /
• 2000

In this paper, we present a new automatic thresholding algorithm based on maximum entropy of two-dimensional pixel histogram. While most of the previous algorithms select thresholds depending only on the histogram of gray level itself in the image, the presented algorithm considers 2D relational histogram of gray levels of two adjacent pixels in the image. Thus, the new algorithm tends to leave salient edge features on the image after thresholding. The experimental results show the good performance of the presented algorithm.

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

• 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 Sensor Science and Technology
• /
• v.33 no.6
• /
• pp.510-515
• /
• 2024

This study investigated the use of YOLOv5 for defect detection in transparent adhesives, comparing two distinct training methods: one without preprocessing and another incorporating edge operator preprocessing. In the first approach, the original color images were labeled in various ways and trained without transformation. This method failed to distinguish between the original images with properly applied adhesive and those exhibiting adhesive application defects. An analysis of the factors contributing to the reduced learning performance was conducted using histogram comparison and template matching, with performance validated by maximum similarity measurements, quantified by the Intersection over Union values. Conversely, the preprocessing method involved transforming the original images using edge operators before training. The experiments confirmed that the Canny Edge Detection operator was particularly effective for detecting adhesive application defects and proved most suitable for real-time defect detection.

• The Korean Journal of Applied Statistics
• /
• v.24 no.2
• /
• pp.359-371
• /
• 2011

Edge detection in images is an important step in image segmentation and object recognition as preprocessing for image processing. This paper presents a new edge detection using local histogram analysis based on wavelet transform. In this work, the wavelet transform uses three components (horizontal, vertical and diagonal) to find the magnitude of the gradient vector, instead of the conventional approach in which tw components are used. We compare the magnitude of the gradient vector with the threshold that is obtained from a local histogram analysis to conclude that an edge is present or not. Some experimental results for our edge detector with a Sobel, Canny, Scale Multiplication, and Mallat edge detectors on sample images are given and the performances of these edge detectors are compared in terms of quantitative and qualitative measures. Our detector performs better than the other wavelet-based detectors such as Scale Multiplication and Mallat detectors. Our edge detector also preserves a good performance even if the Sobel and Canny detector are sharply low when the images are highly corrupted.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.10
• /
• pp.162-170
• /
• 2013

In recent years, the interests and needs of the Pedestrian Protection System (PPS), which is mounted on the vehicle for the purpose of traffic safety improvement is increasing. In this paper, we propose a pedestrian candidate window extraction and unit cell histogram based HOG descriptor calculation methods. At pedestrian detection candidate windows extraction stage, the bright ratio of pedestrian and its circumference region, vertical edge projection, edge factor, and PCA reconstruction image are used. Dalal's HOG requires pixel based histogram calculation by Gaussian weights and trilinear interpolation on overlapping blocks, But our method performs Gaussian down-weight and computes histogram on a per-cell basis, and then the histogram is combined with the adjacent cell, so our method can be calculated faster than Dalal's method. Our PCA reconstruction error based pedestrian detection candidate window extraction method efficiently classifies background based on the difference between pedestrian's head and shoulder area. The proposed method improves detection speed compared to the conventional HOG just using image without any prior information from camera calibration or depth map obtained from stereo cameras.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.304-306
• /
• 2007

Methods of Object recognition from camera image are to compare features of color. edge or pattern with model in a general way. SIFT(scale-invariant feature transform) has good performance but that has high complexity of computation. Using simple color histogram has low complexity. but low performance. In this paper we represent a model as a color cooccurrence histogram. and we improve performance using pyramid matching. The color cooccurrence histogram keeps track of the number of pairs of certain colored pixels that occur at certain separation distances in image space. The color cooccurrence histogram adds geometric information to the normal color histogram. We suggest object recognition by pyramid matching of color cooccurrence histogram.