• Journal of Korean Society for Geospatial Information Science
• /
• v.14 no.2 s.36
• /
• pp.3-13
• /
• 2006

Extraction of man-made objects from high resolution satellite images has been studied by many researchers. In order to reconstruct accurate 3D building structures most of previous approaches assumed 3D information obtained by stereo analysis. For this, they need the process of sensor modeling, etc. We argue that a single image itself contains many clues of 3D information. The algorithm we propose projects virtual shadow on the image. When the shadow matches against the actual shadow, the height of a building can be determined. If the height of a building is determined, the algorithm draws vertical lines of sides of the building onto the building in the image. Then the roof boundary moves along vertical lines and the footprint of the building is extracted. The algorithm proposed can use the shadow cast onto the ground surface and onto facades of another building. This study compared the building heights determined by the algorithm proposed and those calculated by stereo analysis. As the results of verification, root mean square errors of building heights were about 1.5m.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.17 no.4
• /
• pp.421-429
• /
• 1999

It is estimated that, in the twenty-first century, 70％ of global citizens will live in urban areas. This accelerated urbanization will require a greater need for the building DEM and orthoimagery along with Geographic Information System for urban management. The building DEM requires the detection of outlines showing building shapes. To do this, automatic and semiautomatic building extractions are usually used. However, in cases where automatic extraction is performed directly from the aerial images, accurate building outline extraction is very difficult because of shadow, roof color, and neighboring trees making it hard to discern building roofs. To overcome this problem semiautomatic building extraction was suggested in this paper. When a roof texture was homogeneous, building outline detection was performed by mouse-clicking on a part of the roof. To construct the building outlines when the texture was not homogeneous, a computer program was developed to search out corner points by clicking spots near corner points. The building DEM was generated by taking into account building outlines and heights calculated by image matching.

• Journal of Digital Contents Society
• /
• v.16 no.6
• /
• pp.951-959
• /
• 2015

Scene text extraction is important because it offers some important information on different image based applications pouring in current smart generation. Edge-Enhanced MSER(Maximally Stable Extremal Regions) which enhances the boundaries using the canny operator after extracting the basic MSER shows excellent performance in terms of text extraction. But according to setting the threshold of the canny operator, the result images using Edge-Enhanced MSER are different, so there needs a method figuring out the threshold. In this paper, we propose a AEMSER(Adaptive Edge-enhanced MSER) that applies the method extracting the boundary using the middle value of histogram to Edge-Enhanced MSER to get the canny operator's threshold. The proposed method can acquire better result images than the existing methods because it extracts the area only for the obvious boundaries.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.12
• /
• pp.2949-2955
• /
• 2015

Recently, with the sharp increase of digital visual media such as photographs, animations, and digital videos, it has been necessary to generate mosaic blocks in a static or dynamic image intentionally or unintentionally. In this paper, we suggest a new method for detecting mosaic blocks contained in a color image using boundary features. The suggested method first extracts Canny edges in the image and finds candidate mosaic blocks with the boundary features of mosaic blocks. The method then determines real mosaic blocks after filtering out non-mosaic blocks using geometric features like size and elongatedness features. Experimental results show that the proposed method can detect mosaic blocks robustly rather than other methods in various types of input images.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.3
• /
• pp.173-182
• /
• 2009

In this paper, we studied about the extraction of the parameter and implementation of speechreading system to recognize the Korean 8 vowel. Face features are detected by amplifying, reducing the image value and making a comparison between the image value which is represented for various value in various color space. The eyes position, the nose position, the inner boundary of lip, the outer boundary of upper lip and the outer line of the tooth is found to the feature and using the analysis the area of inner lip, the hight and width of inner lip, the outer line length of the tooth rate about a inner mouth area and the distance between the nose and outer boundary of upper lip are used for the parameter. 2400 data are gathered and analyzed. Based on this analysis, the neural net is constructed and the recognition experiments are performed. In the experiment, 5 normal persons were sampled. The observational error between samples was corrected using normalization method. The experiment show very encouraging result about the usefulness of the parameter.

• Journal of KIISE:Software and Applications
• /
• v.30 no.9
• /
• pp.876-884
• /
• 2003

It is essential to identify both the pupil and iris boundaries for iris recognition. The circular edge detector proposed by Daugman is the most common and powerful method for the iris region extraction. The method is accurate but requires lots of computational time since it is based on the exhaustive search. Some heuristic methods have been proposed to reduce the computational time, but they are not as accurate as that of Daugman. In this paper, we propose a pupil and iris boundary finding algorithm which is faster than and as accurate as that of Daugman. The proposed algorithm searches the boundaries using the Daugman's circular edge detector, but reduces the search region using the problem domain knowledge. In order to find the pupil boundary, the search region is restricted in the maximum and minimum bounding circles in which the pupil resides. The bounding circles are obtained from the binarized pupil image. Two iris boundary points are obtained from the horizontal line passing through the center of the pupil region obtained above. These initial boundary points, together with the pupil point comprise two bounding circles. The iris boundary is searched in this bounding circles. Experiments show that the proposed algorithm is faster than that of Daugman and more accurate than the conventional heuristic methods.

• Journal of applied mathematics & informatics
• /
• v.7 no.2
• /
• pp.493-506
• /
• 2000

Recently the first author and his coworker report a new finite element method for the Poisson equations with homogeneous Dirichlet boundary conditions on a polygonal domain with one re-entrant angle [7], They use the well-known fact that the solution of such problem has a singular representation, deduced a well-posed new variational problem for a regular part of solution and an extraction formula for the so-called stress intensity factor using tow cut-off functions. They use Fredholm alternative an Garding's inequality to establish the well-posedness of the variational problem and finite element approximation, so there is a maximum bound for mesh h theoretically. although the numerical experiments shows the convergence for every reasonable h with reasonable size y imposing a restriction to the support of the extra cut-off function without using Garding's inequality. We also give error analysis with similar results.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.13 no.3
• /
• pp.48-57
• /
• 2005

This paper presents a novel algorithm in order to extract lane-related information based on machine vision techniques. The algorithm makes up for the weak points of the former method, the Edge Distribution Function(EDF)-based approach, by introducing a Lane Boundary Pixel Extractor (LBPE) and the well-known Hough Transform(HT). The LBPE that serves as a filter to extract pixels expected to be on lane boundaries enhances the robustness of machine vision, and provides its results to the HT implementation and EDF construction. The HT forms the accumulator arrays and extracts the lane-related parameters composed of orientation and distance. Furthermore, as the histogram of edge magnitude with respect to edge orientation angle, the EDF has peaks at the orientations corresponding to lane slopes on the perspective image domain. Therefore, by fusing the results from the EDF and the HT the proposed algorithm improves the confidence of the extracted lane-related information. The system shows successful results under various degrees of illumination.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.141-144
• /
• 2001

In this paper, a new algorithm for extracting and recognizing characters from video, without pre-knowledge such as font, color, size of character, is proposed. To improve the recognition rate for videos with complex background at low resolution, continuous frames with identical text region are automatically detected to compose an average frame. Using boundary pixels of a text region as seeds, we apply region filling to remove background from the character Then color clustering is applied to remove remaining backgrounds according to the verification of region filling process. Features such as white run and zero-one transition from the center, are extracted from unknown characters. These feature are compared with a pre-composed character feature set to recognize the characters.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.3E
• /
• pp.118-135
• /
• 2009

The level set based approach is one of active methods for contour extraction in image segmentation. Since Osher and Sethian introduced the level set framework in 1988, the method has made the great impact on image segmentation. However, there are some problems to be solved; such as multi-objects segmentation, noise filtering and much calculation amount. In this paper we address the drawbacks of the previous level set methods and propose an extension of the traditional fast level set to cope with the limitations. We introduce a relationship matrix, a new split-and-merge criterion, a modified Chan-Vese criterion and a novel filtering criterion into the traditional fast level set approach. With the segmentation experiments we evaluate the proposed method and show the promising results of the proposed method.