• Proceedings of the KSME Conference
• /
• 2001.06b
• /
• pp.706-711
• /
• 2001

This paper represents a relaxation matching algorithm based on global structure constraint satisfaction. Relaxation matching algorithm is a conventional approach to the matching problem. However, we confronted some problems such as null-matching and multi-matching problems by just using the relaxation matching technique. In order to solve the problems, in this paper, the matching problem is regarded as constraint satisfaction problem, and a relaxation matching algorithm is proposed based on global structure constraint satisfaction. The proposed algorithm is applied a landslide picture to show the effectiveness. When the algorithm is processed at landslide inspecting and monitoring system, motion parameters such as displacement area and its direction are computed. Once movement is recognized, displacements are estimated graphically with statistical amount in the image plane. Simulation has been done to prove the proposed algorithm by using time-sequence image of landslide inspection and monitoring system.

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

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.1
• /
• pp.1-9
• /
• 2015

Template matching is used for many applications in image processing. One of the most researched topics is object tracking. Normalized Cross Correlation (NCC) is the basic statistical approach to match images. NCC is used for template matching or pattern recognition. A template can be considered from a reference image, and an image from a scene can be considered as a source image. The objective is to establish the correspondence between the reference and source images. The matching gives a measure of the degree of similarity between the image and the template. A problem with NCC is its high computational cost and occasional mismatching. To deal with this problem, this paper presents an algorithm based on the Sum of Squared Difference (SSD) and an adaptive template matching to enhance the quality of the template matching in object tracking. The SSD provides low computational cost, while the adaptive template matching increases the accuracy matching. The experimental results showed that the proposed algorithm is quite efficient for image matching. The effectiveness of this method is demonstrated by several situations in the results section.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.1
• /
• pp.102-110
• /
• 2015

In this paper, adaptive matching method using the same features for rigid and deformable object images is proposed. Firstly, we determine whether the two images are matched or not using the geometric verification and generate the matching information. Decision boundary which separates deformable matching-pair from non-matching pair is obtained through statistical analysis of matching information. The experimental result shows that the proposed method lowers the computational complexity and increases the matching accuracy compared to the existing method.

• Korean Journal of Organic Agriculture
• /
• v.21 no.1
• /
• pp.1-18
• /
• 2013

Animal and crop production systems were integrated on a single farm. This integrated farming system recycled nutrients on the farm. The separation of animal and crop production with the introduction of cheap commercial fertilizers, farms were not used land-applied manure. The on-line manure matching is one of the emerging business in the achievement of recycling and resource recovery. The manure matching actively promotes the reuse and recycling of by-products and manure. This study constructs to manure matching information system to solve the exchange problems between herders and croppers. Manure matching web sites designed. This paper introduces a web-based animal manure matching system. A manure matching service, part of the manure transport, links farmers who produce excess manure with farmers who can use the manure. Farmers registered with the service have requested manure. The manure matching service supports the transport project by linking farmers with excess manure with those farmers who can utilize the manure safely as a nutrient source. The goal of the service is to protect water quality by fostering efficient land application. Benefits to those who use the manure network include reduced disposal costs, lower purchase costs and recycling of manure. The manure matching is based on the principle that 'one persons waste is another person's fertilizer.' It provides a free online matchmaking service for environmentally safe manure recycling management system.

• Korean Journal of Geomatics
• /
• v.1 no.1
• /
• pp.43-49
• /
• 2001

Although many kinds of stereo matching method have been developed in the field of computer vision and photogrammetry, wrong matches are not easy to avoid. This paper presents a new method to reduce wrong matches after matching, and experimental results are reported. The main idea is to analyze the histogram of the image attribute differences between each pair of image patches matched. Typical image attributes of image patch are the mean and the standard deviation of gray value for each image patch, but there could be other kinds of image attributes. Another idea is to check relative position among potential matches. This paper proposes to use Gaussian blunder filter to detect the suspicious pair of candidate match in relative position among neighboring candidate matches. If the suspicious candidate matches in image attribute difference or relative position are suppressed, then many wrong matches are removed, but minimizing the suppression of good matches. The proposed method is easy to implement, and also has potential to be applied as post processing after image matching for many kinds of matching methods such as area based matching, feature matching, relaxation matching, dynamic programming, and multi-channel image matching. Results show that the proposed method produces fewer wrong matches than before.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.5
• /
• pp.345-352
• /
• 2004

Currently, high data rate PLC(Power Line Communications), up to 100 Mbps, which use frequency bandwidth between 2 MHz and 30 MHz is investigated very hard, and commercial PLC modem for low voltage powerline network (indoor) is coming soon into communication market. For the purpose of developing a fit communication system which has little distortion of signal and attenuation, it is surely necessary to know about channel environments of powerline. Especially, the impedance measurement of the powerline and impedance matching are very important. As is known, since medium-voltage powerline (22.9 ㎸) is still working, it is not so simple to measure the powerline impedance. In our study, a portable impedance measurement equipment is developed. It consists of coupling capacitor, a drain coil and impedance matching transformer. The equipment is easily connected to medium voltage line and impedance of power line is measured using a network analyzer. Also, measurement results are used for impedance matching of PLC signal. In fact, matching transformer with several different impedances are used. The matching transformer is connected between coupling capacitor and signal port. In this paper, the developed portable impedance measurement equipment and impedance measurement results are presented. Also impedance matching technique using matching transformers will be explained. We showed the result of the improved performance by the impedance matching.

• Journal of the Korean Society of Safety
• /
• v.37 no.1
• /
• pp.41-48
• /
• 2022

Bridge engineering documents have essential contents that must be referenced continuously throughout a structure's entire life cycle, but research related to the quality of the contents is still lacking. XML schema matching is an excellent technique to improve the quality of stored data; however, it takes excessive computing time when applied to documents with many contents and a deep hierarchical structure, such as bridge engineering documents. Moreover, it requires a manual parametric study for matching elements' weight factors, maintaining a high matching accuracy. This study proposes an efficient weight-factor determination method based on an artificial neural network (ANN) model using the simplified XML schema-matching method proposed in a previous research to reduce the computing time. The ANN model was generated and verified using 580 data of document properties, weight factors, and matching accuracy. The proposed ANN-based schema-matching method showed superiority in terms of accuracy and efficiency compared with the previous study on XML schema matching for bridge engineering documents.

• The Journal of Korea Robotics Society
• /
• v.17 no.3
• /
• pp.373-380
• /
• 2022

This paper considers a method of fast correspondence matching for iterative closest point (ICP) algorithm. In robotics, the ICP algorithm and its variants have been widely used for pose estimation by finding the translation and rotation that best align two point clouds. In computational perspectives, the main difficulty is to find the correspondence point on the reference point cloud to each observed point. Jump-table-based correspondence matching is one of the methods for reducing computation time. This paper proposes a method that corrects errors in an existing jump-table-based correspondence matching algorithm. The criterion activating the use of jump-table is modified so that the correspondence matching can be applied to the situations, such as point-cloud registration problems with highly curved surfaces, for which the existing correspondence-matching method is non-applicable. For demonstration, both hardware and simulation experiments are performed. In a hardware experiment using Hokuyo-10LX LiDAR sensor, our new algorithm shows 100% correspondence matching accuracy and 88% decrease in computation time. Using the F1TENTH simulator, the proposed algorithm is tested for an autonomous driving scenario with 2D range-bearing point cloud data and also shows 100% correspondence matching accuracy.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1860-1863
• /
• 1997

Transfer alignement is the process of initializing attitude of slave INS using the data of master INS. This paper presents the performance analysis of transfer alignment at sea using convariance analysis method. Velocity & angle matching and angular rate & acceleration matching are used for analysis, and the performance of two matching methods are compared. We propose a new method for angular rate & acceleration matching. Under the assumption of accurate modeling of ship flexure, the performance of transfer alignment time and accuray is improved very much for the new method.