• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.12
• /
• pp.70-80
• /
• 1997

This paper proposes a hierarchical Hausdorff distance (HD) matching algorithm baased on coarse-to-fine approach. It reduces the computational complexity greatly by using the pyramidal structures consisting of distance transform (DT) and edge pyramids. Also, inthe proposed hierarchical HD matching, a thresholding method is presented to find an optimal matching position with small error, in which the threshold values are determined by using the property between adjacent level of a DT map pyramid. By computer simulation, the performance of the conventional and proposed hierarchical HD matching algorithms is compared in therms of the matching position for binary images containing uniform noise.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.11
• /
• pp.899-905
• /
• 2003

An intermediate images generation method using multi-resolution based hierarchical block matching disparity map is proposed. This method is composed of a disparity estimation, an occlusion detection and intermediate image synthesis. For the disparity estimation, which is one of the important processes in intermediate image synthesis, we use the multi-resolution based hierarchical block matching algorithm to overcome the imperfect ness of block matching algorithm. The proposed method makes disparity maps more accurate and dense by multi-resolution based hierarchical block matching, and the estimated disparity maps are used to generate intermediate images of stereo images. Generated intermediate images show 0.1∼1.4 ㏈ higher PSNR than the images obtained by block matching algorithm.

• Spatial Information Research
• /
• v.14 no.4 s.39
• /
• pp.403-419
• /
• 2006

The well-blown address matching technology developed by the U.S. Census Bureau was applicable only for street addresses. However, many other addressing systems on the basis of a hierarchy of areas (hierarchical areal addressing system), such as Korean or Japanese addressing system, cannot be suitable for the existing address matching method. This paper, therefore, develops an areal address matching method, especially for Korean addressing system, in order to geocode 2D and 3D locational data of human activities. Thus, this study explains a new approach to dealing with 3D positioning method composed of two geocoding methods, which are a '2D Korean Address Matching' technique and a '3D Address Matching' technique.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.5
• /
• pp.1-11
• /
• 2004

In this paper we proposed a hierarchical ASM for real-time tracking of non-rigid objects. For tracking an object we used ASM for estimating object contour possibly with occlusion. Moreover, to reduce the processing time we used hierarchical approach for real-time tacking. In the next frame we estimated the initial feature point by using Kalman filter. We also added block matching algorithm for increasing accuracy of the estimation. The proposed hierarchical, prediction-based approach was proven to out perform the exiting non-hierarchical, non-prediction methods.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1482-1485
• /
• 2005

An equivalent schema matching among several different source schemas is very important for information integration or mining on the XML based World Wide Web. Finding most similar source schema corresponding mediated schema is a major bottleneck because of the arbitrary nesting property and hierarchical structures of XML DTD schemas. It is complex and both very labor intensive and error prune job. In this paper, we present the first complex matching of XML schema, i.e. XML DTD, inlining two dimensional DTD graph into flat feature values. The proposed method captures not only schematic information but also integrity constraints information of DTD to match different structured DTD. We show the integrity constraints based hierarchical schema matching is more semantic than the schema matching only to use schematic information and stored data.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.1
• /
• pp.32-36
• /
• 2003

An equivalent schema matching among several different source schemas is very important for information integration or mining on the XML based World Wide Web. Finding most similar source schema corresponding mediated schema is a major bottleneck because of the arbitrary nesting property and hierarchical structures of XML DTD schemas. It is complex and both very labor intensive and error prune job. In this paper, we present the first complex matching of XML schema, i.e. XML DTD. The proposed method captures not only schematic information but also integrity constraints information of DTD to match different structured DTD. We show the integrity constraints based hierarchical schema matching is more semantic than the schema matching only to use schematic information and stored data.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.421-424
• /
• 2000

In this paper, we propose a window warping method to solve stereo matching problems in projective distortion region. Because the projective distortion region cant t be estimated with fixed-size block matching algorithm, we use the window warping technique in block matching process. The position of a reference window to resample is obtained adaptively according to the degree of reliability in disparity estimated previously. The initial disparity and reliability are obtained by applying a well known hierarchical strategy. The experimental result shows that considerable improvement is obtained in the projective distortion region.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.145-148
• /
• 2001

This paper presents a phase-based stereo matching algorithm in order to efficiently extract 3-dimensional objects from two 2D images. Conventional phase-based methods, especially using windowed Fourier phases, inherit good properties in the cage of hierarchical approaches, because they basically use a multi-resolution phase map. On the contrary, their computational cost is too heavy. Therefore, a fast hierarchical approach, using multi-resolution phase-based strategy and reducing redundancies of phase calculations based on FFT concept is proposed in this paper. In addition, a structural matching algorithm on the phase domain is presented to improve the matching quality. In experimental results. it is shown that the computation loads are considerably reduced about 8 times and stable outputs are obtained from various images.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.217-220
• /
• 1996

This paper describes a new hierarchial block matching algorithm especially appropriate for a large search area. The proposed algorithm consists of higher level search for an initial motion vector estimate by using a new matching criterion over the evenly subsampled search points, and lower level search for the final motion vector refinement. In the higher level matching criterion, mean absolute differences at the search points (or motion vector candidates) similar to motion vectors of causally neighboring blocks, are weighted properly so that these points can have a higher chance to being selected. The proposed algorithm outperforms existing hierarchical block matching algorithms, and its computational regularity makes hardware implementation simple.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3C
• /
• pp.279-287
• /
• 2009

In this paper, a hierarchical stereo matching with color information is proposed. To generate an initial disparity map, feature based stereo matching is carried out and to generate a final disparity map, hierarchical stereo matching is carried out. The boundary (edge) region is obtained by segmenting a given image into R, G, B and White components. From the obtained boundary, disparity is extracted. The initial disparity map is generated when the extracted disparity is spread to the surrounding regions by evaluating autocorrelation from each color region. The initial disparity map is used as an initial value for generating the final disparity map. The final disparity map is generated from each color region by changing the size of a block and the search range. 4 test images that are provided by Middlebury stereo vision are used to evaluate the performance of the proposed algorithm objectively. The experiment results show better performance compared to the Graph-cuts and Dynamic Programming methods. In the final disparity map, about 11% of the disparities for the entire image were inaccurate. It was verified that the boundary for the non-contiguous point was clear in the disparity map.