• Korean Journal of Remote Sensing
• /
• v.12 no.1
• /
• pp.43-59
• /
• 1996

The objective of this research is to investigate the potential of relational matching in one of the fundamental photogrammetric processes, that is initial approximation problem. The automatic relative orientation procedures of aerial stereopairs have been investigated. The fact that the existing methods suffer from approximations, distortions (geometric and radiometric), occlusions, and breaklines is the motivation to investigate relational matching which appears to be a much more general solution. An elegant way of solving the initial approximation problem by using distinct(special) relationship from relational description is suggested and experimented. As for evaluation function, the cost function was implemented. The detection of erroneous matching is incorporated as a part of proposed relational matching scheme. Experiments with real urban area images where large numbers of repetitive patterns, breaklines, and occluded areas are present prove the feasibility of implementation of the proposed relational matching scheme. The investigation of relational matching in the domain of image matching problem provides advantages and disadvantages over the existing image matching methods and shows the future area of development and implementation of relational matching in the field of digital photogrammetry.

• 한국지형공간정보학회:학술대회논문집
• /
• 2004.10a
• /
• pp.25-31
• /
• 2004

To obtain the 3-D coordinates of the urban roads from aerial images, the accurate matching technique in road areas is required. In this paper, we suggest the relational matching method that is performed by comparison of relationships of road pavement markings after they are extracted from aerial images using geometric properties and spatial relationships of the pavement markings. Relational matching requires not only high level description of features but also the solution for inexact matching problems. In addition, it needs a lot of tests for the reliable final result. In this research, we described features as calculating geometric properties of the pavement markings, suggested the solution for inextact matching problems, and performed tests to decide whether the result is acceptable or not, which use the property that road areas are flat. In order to evaluate the accuracy of matching, we made a visual evaluation and compared the result of this technique with those measured by analytical photogrammetry.

• Journal of Korea Multimedia Society
• /
• v.9 no.12
• /
• pp.1552-1559
• /
• 2006

In a web environment, similar information exists in many different places in diverse formats. Even duplicate information is stored in the various databases using different terminologies. Since most information serviced in the current World Wide Web however had been constructed before the advent of ontology, it is practically almost impossible to construct ontology for all those resources in the web. In this paper, we assume that most information in the web environment exist in the form of RDBMS, and propose a matching method between domain ontology and existing RDBMS tables for semantic retrieval. In the processing of extracting a local ontology, some problems such as losing domain in formation can occur since the correlation of domain ontology has not been considered at all. To prevent these problems, we propose an instance-based matching which uses relational information between RDBMS tables and relational information between classes in domain ontology. To verify the efficiency of the method proposed in this paper, several experiments are conducted using the digital heritage information currently serviced in the countrywide museums. Results show that the proposed method increase retrieval accuracy in terms of user relevance and satisfaction.

• Journal of Korean Society for Geospatial Information Science
• /
• v.12 no.4 s.31
• /
• pp.61-68
• /
• 2004

In this paper, we suggest an automatic technique to obtain 3-D road information in complex urban areas using road pavement markings. This method is composed of following three main steps. The first step is extracting the pavement markings from aerial images, the second one is matching the same pavement markings in two aerial images, and the last one is obtaining the 3-D coordinates of those using EOP(exterior orientation parameters) of aerial images. Here, we focus on the first and second step because the last step can be performed by using the well hewn collinearity condition equation. We used geometric properties and spatial relationships of the pavement markings to extract the lane line markings on the images and extracted arrow lane markings additionally using template matching. And then, we obtained 3-D coordinates of the road using relational matching for the pavement markings. In order to evaluate the accuracy of extraction, we did a visual inspection and compared the result of this technique with those measured by digital photogrammetric system.

• The Journal of the Korea Contents Association
• /
• v.6 no.10
• /
• pp.25-33
• /
• 2006

For semantic retrieval in semantic web environment, it is an important factor to manage and manipulate distributed resources. Ontology is essential for efficient search in distributed resources, but it is almost impossible to construct an unified ontology for all distributed resources in the web. In this paper, we assumed that most information in the web environment exist in the form of RDBMS, and propose a matching method between domain ontology and the existing RDBMS tables for semantic retrieval. Most previous studies about matching between RDBMS tables and domain ontology have extracted a local ontology from RDBMS tables at first, and conducted the matching between the local ontology and domain ontology. However in the processing of extracting a local ontology, some problems such as losing domain information can be occurred since its correlation with domain ontology has not been considered at all. In this paper, we propose a methods to prevent the loss of domain information through the similarity measure between instances of RDBMS tables and instances of ontology. And using the relational information between RDBMS tables and the relational information between classes in domain ontology, more efficient instance-based matching becomes possible.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.687-690
• /
• 1988

Algorithms that represent given pattern in the form of an ARG (Attributed relational graph) using not only structural relations but also symbolic or numerical attributes, and then recognize that pattern by graph matching process are presented in this paper. Based on definitions of pattern deformational models, algorithms that can find GPECI(Graph preserved error correcting isomorphism). SGECI(subgraph ECI) and DSECI(Double subgraph ECI) are proposed and comparisons among these algorithms are described. To be useful in performig practical tasks, efficient schemes for extraction of ARG representation fron raw image are needed. In this study, given patterns are restricted within objects having distinct skeleton, and then the information which is necessary for recognition and analysis is successfully extracted.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2003.10a
• /
• pp.49-54
• /
• 2003

As of date, the cadastral information which is the utility to be computerized have not been identical with local autonomous entities and relational groups each other and updated real-time, therefore the relation group or the academic circles carried out in many researches on a cadastral map matching, but the cadastral maps have not been even occurred the expansion and contraction so that the theory arrangement doesn't seem simple as to a cadastral map matching. As being take such reality into consideration, We have to be based on $\boxDr$construction ministry of the rules for continuous map$\boxUl$ for a continuous cadastral map with using PBLIS data; so the operators use Autodesk Map 5 which added applications and match the neat line by the identical scale, the different scale, the district boundary and the origin according to the judgement myself We have the purpose to minimize the problem as analyzing the accuracy between the parcel coordinates If the matched map and ones of moved map.

• Korean Journal of Computational Design and Engineering
• /
• v.12 no.4
• /
• pp.283-297
• /
• 2007

Seamless data integration in the CAx chain of the CAD/CAPP/CAM/CNC has been achieved to a high degree, but research concerning the transfer of data from conceptual sketches to a CAD system should be carried out further. This paper presents a method for reconstructing a 3D model from a freehand sketch. Sketch-based modeling research can be classified into gestural modeling methods and reconstructional modeling methods. This research involves the reconstructional modeling method. Here, Mitani's seminal work, designed for box-shaped 3D model using a predefined template, is improved by leveraging a relational template and specialized for automotive design. Matching between edge graphs of the relational template and the sketch is formulated and solved as the assignment problem using the feature vectors of the edges. Including the stroke preprocessing method required to generate an edge graph from a sketch, necessary procedures and relevant techniques for implementing the template-based modeling method are described. Examples from a working implementation are given.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1946-1956
• /
• 2001

In this paper, we propose a novel 2-D partial matching algorithm based on model-based stochastic analysis of feature correspondences in a relation vector space, which is quite robust to shape variations as well as invariant to geometric transformations. We represent an object using the ARG (Attributed Relational Graph) model with features of a set of relation vectors. In addition, we statistically model the partial occlusion or noise as the distortion of the relation vector distribution in the relation vector space. Our partial matching algorithm consists of two-phases. First, a finite number of candidate sets areselected by using logical constraint embedding local and structural consistency Second, the feature loss detection is done iteratively by error detection and voting scheme thorough the error analysis of relation vector space. Experimental results on real images demonstrate that the proposed algorithm is quite robust to noise and localize target objects correctly even inseverely noisy and occluded scenes.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.28 no.5
• /
• pp.485-491
• /
• 2010

Acquisition of information on failure slope, which may cause apprehension of second hand damage, requires acquisition of fast and accurate topographical data and efficient expression in indirect surveying method without accessing as needed. Therefore, in this study, the images on the intended area were photographed through hovering in the air by approaching collapsed road cut slope with the use of unmanned helicopter photography system. As a result of comparing the points observed by no prism total station and the 10 coordinate points analyzed through image analysis, the averages of absolute values were shown to be 0.056m in X axis direction, 0.082m in Y axis direction and 0.066m Z axis direction. In addition, the RMSE of the error for 10 points of test points were 0.015636m in X axis direction, 0.021319m in Y axis direction and 0.018734m in Z axis direction. Therefore, this method can determine the range of slope and longitudinal and cross sections of each slope in dangerous area that cannot be approached in relational image matching method for the terrains of such collapsed cut slope.