• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.90-93
• /
• 2009

The use of physics based deformation methods is continuously increasing in computer graphics area such as game and simulation. Many researchers have worked on this method. However, relatively few researchers have considered the development of the user interaction to the 3D objects. This research proposes a physics-based deformation technique using AR (Augmented Reality) environments to enhance user immersion and the effectiveness of the deformation. In the AR circumstances, the physics based deformation should be accomplished in realtime. In the proposed method, we combine RBF (Radial Basis Function) [1] and LSM (Lattice Shape Matching) [2, 3] and apply it to polygonal models for real-time user interaction. The dynamics of the LSM is also calculated to trace the movement of each lattice. Finally these algorithms are implemented in AR environments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.4
• /
• pp.617-623
• /
• 2018

In this paper, we propose a novel seamless video composition method based on shape matching and Poisson equation. Video composition method consists of video segmentation process and video blending process. In the video segmentation process, the user first sets a trimap for the first frame, and then performs a grab-cut algorithm. Next, considering that the performance of video segmentation may be reduced if the color, brightness and texture of the object and the background are similar, the object region segmented in the current frame is corrected through shape matching between the objects of the current frame and the previous frame. In the video blending process, the object of source video and the background of target video are blended seamlessly using Poisson equation, and the object is located according to the movement path set by the user. Simulation results show that the proposed method has better performance not only in the naturalness of the composite video but also in computational time.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.825-832
• /
• 2010

This paper presents only a matching algorithm based on Delaunay triangulation and Parametrization from the extracted minutiae points. This method maps local neighborhood of points of two different point sets to unit-circle using topology information by Delaunay triangulation method from feature points of real fingerprint. Then, a linked convex polygon that includes an interior point is constructed as one-ring which is mapped to unit-circle using Parametrization that keep shape preserve. In local matching, each area of polygon in unit-circle is compared. If the difference of two areas are within tolerance, two polygons are consider to be matched and then translation, rotation and scaling factors for global matching are calculated.

• Journal of KIISE
• /
• v.44 no.4
• /
• pp.392-398
• /
• 2017

The point-cloud representation of an object is performed by scanning a space through a laser scanner that is extracting a set of points, and the points are then integrated into the same coordinate system through a registration. The set of the completed registration-integrated point clouds is classified into meaningful regions, shapes, and noises through a mathematical analysis. In this paper, the aim is the matching of a curved area like a cylinder shape in 3D point-cloud data. The matching procedure is the attainment of the center and radius data through the extraction of the cylinder-shape candidates from the sphere that is fitted through the RANdom Sample Consensus (RANSAC) in the point cloud, and completion requires the matching of the curved region with the Catmull-Rom spline from the extracted center-point data using the Principal Component Analysis (PCA). Not only is the proposed method expected to derive a fast estimation result via linear and curved cylinder estimations after a center-axis estimation without constraint and segmentation, but it should also increase the work efficiency of reverse engineering.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.29 no.2
• /
• pp.113-121
• /
• 2011

In this paper, we proposed the method automatically to match areal feature based on similarity using spatial information. For this, we extracted candidate matching pairs intersected between two different spatial datasets, and then measured a shape similarity, which is calculated by an weight sum method of each matching criterion automatically derived from CRITIC method. In this time, matching pairs were selected when similarity is more than a threshold determined by outliers detection of adjusted boxplot from training data. After applying this method to two distinct spatial datasets: a digital topographic map and street-name address base map, we conformed that buildings were matched, that shape is similar and a large area is overlaid in visual evaluation, and F-Measure is highly 0.932 in statistical evaluation.

• Proceedings of the KSME Conference
• /
• 2001.11a
• /
• pp.324-329
• /
• 2001

A novel method for non-matching interfaces on the boundaries of the finite elements in partitioned domains is presented by introducing interface elements in this paper. The interface element method (IEM) satisfies the continuity conditions exactly through interfaces without recourse to the Lagrange multiplier technique. The moving least square (MLS) approximation in the present study is implemented to construct the shape functions of the interface elements. Alignment of the boundaries of sub-domains in the MLS approximation and integration domains provides a consistent numerical integration due to one form of rational functions in an integration domain. The compatibility of displacements on the boundaries of the finite elements and the interface elements is always preserved in this method, and the completeness of the shape functions of the interface elements guarantees the convergence of numerical solutions. The numerical examples show that the interface element method is a useful tool for the analysis of a partitioned system and for a global-local analysis.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.3
• /
• pp.349-354
• /
• 2011

In this paper we propose a simple efficient stereo matching algorithm to recover sharp object boundaries and to obtain dense disparity map using new multiple line shape windows. To this end, we consider left-right consistency and unique constraint. From the experimental results it is found that the proposed algorithm is very good for obtaining sharp and dense disparity maps for stereo image pairs.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.1
• /
• pp.227-235
• /
• 2014

In this paper, we develop the noninformative priors for the scale parameter and the shape parameter in the log-logistic distribution. We developed the first and second order matching priors. It turns out that the second order matching prior matches the alternative coverage probabilities, and is a highest posterior density matching prior. Also we revealed that the derived reference prior is the second order matching prior for both parameters, but Jerffrey's prior is not a second order matching prior. We showed that the proposed reference prior matches the target coverage probabilities in a frequentist sense through simulation study, and an example based on real data is given.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.39-42
• /
• 2000

Motion estimation plays an important role for video coding. In this paper, we derive optimal search patterns for fast block matching motion estimation. By analyzing the block matching algorithm as a function of block shape and size, we can find an optimal search pattern for initial motion estimation. The proposed idea, which has been verified experimentally by computer simulations, can provide an analytical basis for the current MPEG-2 proposals. In order to choose a more compact search pattern for BMA, we exploit the statistical relationship between the motion and the frame difference of each block.

• Proceedings of the KIEE Conference
• /
• 1990.07a
• /
• pp.72-76
• /
• 1990

A new statistical linearization technique for nonlinear system called covariance matching method is proposed in this paper. The covariance matching method makes the mean and variance of an approximated output be identical real functional output, and the distribution of the approximated output have identical shape with a given random input. Also, the covariance matching method can be easily implemented for statistical analysis of nonlinear systems with a combination of linear system covariance analysis.