• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.4
• /
• pp.241-250
• /
• 1986

Current distributions are the basis of analyzing and designing the antenna. In this paper, a method of deriving the current distribution of a spiral shaped thin wire scattere is proposed when plane wave is incident on it. The calculated results are also shown for severla spiral sizes and incidence angles selected. For numerical calculation, the method of point matching is used with a cubic B-spline function as a basis function.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.4
• /
• pp.387-394
• /
• 2016

A stereo matching method is one of the ways to obtain a depth value from two dimensional images. This method estimates the depth value of target images using stereo images which have two different viewpoints. In the result of stereo matching, the depth value is represented by a disparity value. The disparity means a distance difference between a current pixel in one side of stereo images and its corresponding point in the other side of stereo images. The stereo matching in a homogeneous region is always difficult to find corresponding points because there are no textures in that region. In this paper, we propose a novel matching equation using the distance transform to estimate accurate disparity values in the homogeneous region. The distance transform calculates pixel distances from the edge region. For this reason, pixels in the homogeneous region have specific values when we apply this transform to pixels in that region. Therefore, the stereo matching method using the distance transform improves the matching accuracy in the homogeneous regions. In addition, we also propose an adaptive matching cost computation using a kernel of one dimensional array depending on the characteristic of regions in the image. In order to aggregate the matching cost, we apply a cross-scale cost aggregation method to our proposed method. As a result, the proposed method has a lower average error rate than that of the conventional method in all regions.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.22 no.3
• /
• pp.452-458
• /
• 2013

Over the past several years, many studies have been carried out in the field of 3D data inspection systems. Several attempts have been made to improve the quality of manufactured parts. The introduction of laser sensors for inspection has made it possible to acquire data at a remarkably high speed. In this paper, a robust inspection technique for detecting defects in 3D pressed parts using laser-scanned data is proposed. Point cloud data are segmented for the extraction of features. These segmented features are used for shape matching during the localization process. An iterative closest point (ICP) algorithm is used for the localization of the scanned model and CAD model. To achieve a higher accuracy rate, the ICP algorithm is modified and then used for matching. To enhance the speed of the matching process, aKd-tree algorithm is used. Then, the deviation of the scanned points from the CAD model is computed.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.38 no.5
• /
• pp.477-486
• /
• 2020

Drone has been widely used for many applications ranging from amateur and leisure to professionals to get fast and accurate 3-D information of the surface of the interest. Most of commercial softwares developed for this purpose are performing automatic matching based on SIFT (Scale Invariant Feature Transform) or SURF (Speeded-Up Robust Features) using nadir-looking stereo image sets. Since, there are some situations where not only nadir and nadir-looking matching, but also nadir and oblique-looking matching is needed, the existing software for the latter case could not get good results. In this study, a matching experiment was performed to utilize images with differences in geometry. Nadir and oblique-looking images were acquired through drone for a total of 2 times. SIFT, SURF, which are feature point-based, and IMAS (Image Matching by Affine Simulation) matching techniques based on affine transformation were applied. The experiment was classified according to the identity of the geometry, and the presence or absence of a building was considered. Images with the same geometry could be matched through three matching techniques. However, for image sets with different geometry, only the IMAS method was successful with and without building areas. It was found that when performing matching for use of images with different geometry, the affine transformation-based matching technique should be applied.

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

The problem of inference about the unknown change-point with a change in mean is considered. We suggest a nonparametric change-point estimator using window and prove its consistency when the errors are from the distribution with the mean zero and the common variance. a comparison study is done by simulation on the mean, the variance, and the proportion of matching the true change-points.

• Journal of Korea Multimedia Society
• /
• v.8 no.9
• /
• pp.1195-1207
• /
• 2005

In this paper, we describe image matching techniques which is automatically retrieving the exact matching area using geometry-phase information. We proposed a Matching Method which is rapidly estimating the correspondent points between adjacent images that included big-rotation and top-bottom movement element. It is a method that reduce computation quantity to be required to find an exact correspondent position using geometry-phase information of extracted points in images and DT map which set the distance value among feature points and other points on the basis of each feature point of a image. The proposed method shows good performance especially in the part to search a exact correspondent position between adjacent images that included big-rotation and top-bottom movement element.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1003-1010
• /
• 2004

In this paper, we address efficient processing of subsequence matching in time-series databases. We first point out the performance problems occurring in the index searching of a prior method for subsequence matching. Then, we propose a new method that resolves these problems. Our method starts with viewing the index searching of subsequence matching from a new angle, thereby regarding it as a kind of a spatial-join called a window-join. For speeding up the window-join, our method builds an R＊-tree in main memory for f query sequence at starting of sub-sequence matching. Our method also includes a novel algorithm for joining effectively one R＊-tree in disk, which is for data sequences, and another R＊-tree in main memory, which is for a query sequence. This algorithm accesses each R＊-tree page built on data sequences exactly cure without incurring any index-level false alarms. Therefore, in terms of the number of disk accesses, the proposed algorithm proves to be optimal. Also, performance evaluation through extensive experiments shows the superiority of our method quantitatively.

• Journal of Digital Contents Society
• /
• v.13 no.2
• /
• pp.255-262
• /
• 2012

Human motion tracking algorithm is receiving attention from many research areas, such as human computer interaction, video conference, surveillance analysis, and game or entertainment applications. Over the last decade, various tracking technologies for each application have been demonstrated and refined among them such of real time computer vision and image processing, advanced man-machine interface, and so on. In this paper, we introduce cost-effective and real-time human motion tracking algorithms based on depth image 3D point matching with a given superellipsoid body representation. The body representative model is made by using parametric volume modeling method based on superellipsoid and consists of 18 articulated joints. For more accurate estimation, we exploit initial inverse kinematic solution with classified body parts' information, and then, the initial pose is modified to more accurate pose by using 3D point matching algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.3
• /
• pp.235-241
• /
• 2007

This paper proposes a self-calibration method of robots those are used in industrial assembly lines. The proposed method is a position compensation using laser sensor and vision camera. Because the laser sensor is cross type laser sensor which can scan a horizontal and vertical line, it is efficient way to detect a feature of vehicle and winding shape of vehicle's body. For position compensation of 3-Dimensional axis, we applied block interpolation method. For selecting feature point, pattern matching method is used and 3-D position is selected by Euclidean distance mapping between 462 feature values and evaluated feature point. In order to evaluate the proposed algorithm, experiments are performed in real industrial vehicle assembly line. In results, robot's working point can be displayed 3-D points. These points are used to diagnosis error of position and reselecting working point.

• Journal of Korea Multimedia Society
• /
• v.4 no.5
• /
• pp.406-413
• /
• 2001

Ordinary high-speed block matching algorithms have a disadvantage that they need to get MAD (Mean Absolute Distance) as many as the number of search points due to comparing the MAD between the current frame's search block and the reference frame's search block. To solve such disadvantage of high-speed block matching algorithm, the proposed high-speed DS algorithm employs a MMAD calculation method using a specific characteristic that neighboring pixels have almost same values. In this thesis, we can get rid of unnecessary MAD calculation between the search point block by the new calculation method which uses the previously calculated MAD as the current search point and by breaking from the established MAD calculation method which calculates the MAD of a new search point by each search stage. Comparing with the established high-speed block matching algorithm, this new calculation's estimated movement error was shown as similar, and th total calculation amount decreased by $2FN^2Ep$.