• Journal of Korea Multimedia Society
• /
• v.7 no.12
• /
• pp.1692-1699
• /
• 2004

Many researchers have developed various techniques for detection of human faces in ordinary still images. Face detection is the first imperative step of human face recognition systems. The two main problems of human face detection are how to cutoff the running time and how to reduce the number of false positives. In this paper, we present frontal and near-frontal face detection algorithm in still gray images using a thick edge image and neural network. We have devised a new filter that gets the thick edge image. Our overall scheme for face detection consists of two main phases. In the first phase we describe how to create the thick edge image using the filter and search for face candidates using a whole face detector. It is very helpful in removing plenty of windows with non-faces. The second phase verifies for detecting human faces using component-based eye detectors and the whole face detector. The experimental results show that our algorithm can reduce the running time and the number of false positives.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.859-863
• /
• 1993

There are two methods to get 3-dimensional information by matching image pair feature-based matching and area-based matching. One of the problems in the area-based matching is how the optimal search region which gives accurate correlation between given point and its neighbors can be selected. In this paper, we proposed a new area-based matching algorithm which uses edge-features used in the conventional feature-based matching. It first selects matching candidates by feature-based and matches image pair with area-based method by taking these candidates as guidance to decision of search area. The results show that running time is reduced by optimizing search area(considering edge points and continuity of disparity), keeping on the precision as the conventional area-based matching method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.11
• /
• pp.4395-4412
• /
• 2020

The multisource image fusion has become an active topic in the last few years owing to its higher segmentation rate. To enhance the accuracy of multimodal pig-body feature segmentation, a multisource image fusion method was employed. Nevertheless, the conventional multisource image fusion methods can not extract superior contrast and abundant details of fused image. To superior segment shape feature and detect temperature feature, a new multisource image fusion method was presented and entitled as NSST-GF-IPCNN. Firstly, the multisource images were resolved into a range of multiscale and multidirectional subbands by Nonsubsampled Shearlet Transform (NSST). Then, to superior describe fine-scale texture and edge information, even-symmetrical Gabor filter and Improved Pulse Coupled Neural Network (IPCNN) were used to fuse low and high-frequency subbands, respectively. Next, the fused coefficients were reconstructed into a fusion image using inverse NSST. Finally, the shape feature was extracted using automatic threshold algorithm and optimized using morphological operation. Nevertheless, the highest temperature of pig-body was gained in view of segmentation results. Experiments revealed that the presented fusion algorithm was able to realize 2.102-4.066% higher average accuracy rate than the traditional algorithms and also enhanced efficiency.

• International Journal of Advanced Culture Technology
• /
• v.6 no.4
• /
• pp.317-322
• /
• 2018

We use edge detection technique for the input image to extract the entire edges of the object in the image and then select only the edges that construct the outline of the object. By examining the positional relation between these pixels composing the outline, a simplified version of the outline of the object in the input image is generated by removing unnecessary pixels while maintaining the condition of connection of the outline. For each pixel constituting the outline, its direction is calculated by examining the positional relation with the next pixel. Then, we group the consecutive pixels with same direction into one and then change them to a line segment instead of a point. Among those line segments composing the outline of the object, a line segment whose length is smaller than a predefined minimum length of acceptable line segment is removed by merging it into one of the adjacent line segments. As a result, an outline composed of line segments of over a certain length is obtained through this process.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.5
• /
• pp.841-849
• /
• 2001

The pixel information of the object was obtained sequentially and pixels were clustered to a label by the line labeling method. Feature points were determined by finding the slope for edge pixels after selecting the fixed number of edge pixels. The slope was estimated by the least square method to reduce the detection error. Once a matching point was determined by comparing the feature information of the object and the pattern, the parameters for translation, scaling and rotation were obtained by selecting the longer line of the two which passed through the matching point from left and right sides. Finally, modified Hausdorff Distance has been used to identify the similarity between the object and the given pattern. The multi-label method was developed for recognizing the patterns with more than one label, which performs the modified Hausdorff Distance twice. Experiments have been performed to verify the performance of the proposed algorithm and method for simple target image, complex target image, simple pattern, and complex pattern as well as the partially hidden object. It was proved via experiments that the proposed image matching algorithm for recognizing the object had a good performance of matching.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.99-102
• /
• 2009

In this paper a hierarchical stereo matching algorithm based on feature extraction is proposed. The boundary (edge) as feature point in an image is first obtained by segmenting an image into red, green, blue and white regions. With the obtained boundary information, disparities are extracted by matching window on the image boundary, and the initial disparity map is generated when assigned the same disparity to neighbor pixels. The final disparity map is created with the initial disparity. The regions with the same initial disparity are classified into the regions with the same color and we search the disparity again in each region with the same color by changing block size and search range. The experiment results are evaluated on the Middlebury data set and it show that the proposed algorithm performed better than a phase based algorithm in the sense that only about 14% of the disparities for the entire image are inaccurate in the final disparity map. Furthermore, it was verified that the boundary of each region with the same disparity was clearly distinguished.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2004.03a
• /
• pp.273-278
• /
• 2004

Feature identification is one of the largest issue in high spatial resolution satellite imagery. A popular method associated with this feature identification is image segmentation to produce image segments that are more likely to features interested. Here, it is, proposed that combination of edge extraction and region growing methods for image segments were used to improve the result of image segmentation. At the intial step, an image was segmented by edge detection method. The segments were assigned IDs, and polygon topology of segments were built. Based on the topology, the segments were tested their similarities with adjacent segments using multivariate analysis. The segments that have similar spectral characteristics were merged into a region. The test application shows that the segments composed of individual large, spectrally homogeneous structures, such as buildings and roads, were merged into more similar shape of structures.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.1
• /
• pp.97-101
• /
• 1987

The edge, a discontinuity or abrupt change in the gray-level or color, is a fundamentally important primitive feature of an image necessary for the image analysis and classification. Two-dimensional 3x3 compass gradient operators (ex. Sobel, Prewitt, and Kirsch operators)are commonly used in the edge detection and usually detect 8 compass directional components. In this paper, we present a new interpretation of the relationships between the resulting 8 gradient magnitudes and the 8 intensity values of neighboring pixels which are covered by the two-dimensional 3x3 mask. It is expected that a new gradient edge operator may be designed by changing the eigenvalues in the transform domain and the fast optical edge operator may be implemented by using the optical system.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.332-335
• /
• 2013

In this paper, we propose an image retrieval method using an EHD (Edge Histogram Descriptor) of MPEG-7 and the color histogram. The EHD algorithm can be used to collect the gradient of edge distribution and to find a similar image. However, if you only search the edge gradient without considering the image color, the color shows a weakness. In order to overcome this problem, we use the color histogram and extract the feature to determine whether a similar image. The proposed method shows that the weakness of existing EHD can be overcome by using the color histogram.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.8
• /
• pp.57-66
• /
• 2011

In this paper, it is proposed for algorithm to detect human efficiently using a edge symmetry and gradient directional characteristics in realtime by the feature extraction in a single input image. Proposed algorithm is composed of three stages, preprocessing, region partition of human candidates, verification of candidate regions. Here, preprocessing stage is strong the image regardless of the intensity and brightness of surrounding environment, also detects a contour with characteristics of human as considering the shape features size and the condition of human for characteristic of human. And stage for region partition of human candidates has separated the region with edge symmetry for human and size in the detected contour, also divided 1st candidates region with applying the adaboost algorithm. Finally, the candidate region verification stage makes excellent the performance for the false detection by verifying the candidate region using feature vector of a gradient for divided local area and classifier. The results of the simulations, which is applying the proposed algorithm, the processing speed of the proposed algorithms is improved approximately 1.7 times, also, the FNR(False Negative Rate) is confirmed to be better 3% than the conventional algorithm which is a single structure algorithm.