• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1457-1460
• /
• 1987

2-D shape matching algorithm is proposed which uses pivot vector and componentwise adaptive convergence factor. It is proved that proposed algorithm has better result than any other algorithm. It is to be expected that this algorithm will work effectively in 3-D shape matching.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.1
• /
• pp.171-178
• /
• 2013

In this paper, we develop noninformative priors for the generalized Pareto distribution when the parameter of interest is the shape parameter. We developed the first order and the second order matching priors.We revealed that the second order matching prior does not exist. It turns out that the reference prior satisfies a first order matching criterion, but Jeffrey's prior is not a first order matching prior. Some simulation study is performed and a real example is given.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.10
• /
• pp.497-502
• /
• 2016

Shape Contexts Recognition(SCR) is a technology recognizing shapes such as figures and objects, greatly supporting technologies such as character recognition, motion recognition, facial recognition, and situational recognition. However, generally SCR makes histograms for all contours and maps the extracted contours one to one to compare Shape A and B, which leads to slow progress speed. Thus, this paper has made simple yet more effective algorithm with optimized contour, finding the outlines according to shape figures and using the improved Douglas-Peucker algorithm and Harris corner detector. With this improved method, progress speed is recognized as faster.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.882-884
• /
• 2003

We present an application of digital video images for object tracking. In order to track a fixed object, which was shoot on a moving vehicle, this study develops a shape-based matching algorithm to implement the tracking task. Because the shape-based matching algorithm has scale and rotation invariant characteristics, therefore it can be used to calculate the similarity between two variant shapes. An experiment is performed to track the ship object in the open sea. The result shows that the proposed method can track the object in the video images even the shape change largely.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.327-328
• /
• 2007

A contour shape matching based pixel motion estimation is proposed. The pixel motion information is very useful to compensate the motion artifact generated at the specific gray level contours in the moving image for subfield gray-scale display devices. In this motion estimation method, the gray level boundary contours are extracted from the input image. Then using contour shape matching, the most similar contour in next frame is found, and the contour is divided into segment unit. The pixel motion vector is estimated from the displacement of the each segment in the contour by segment matching. From this method, more precise motion vector can be estimated and this method is more robust to image motion with rotation or from illumination variations.

• Journal of KIISE:Software and Applications
• /
• v.36 no.12
• /
• pp.996-1008
• /
• 2009

This paper proposes a novel approach for the model-based pose matching of a human body using Active Shape Models. To improve the processing time of model creation and registration, we use a skeleton-type model instead of the conventional silhouette-based models. The skeleton model defines feature information that is used to match the human pose. Images used to make the model are for 600 human bodies, and the model has 17 landmarks which indicate the body junction and key features of a human pose. When applying primary Active Shape Models to the skeleton-type model in the matching process, a problem may occur in the proximal joints of the arm and leg due to the color variations on a human body and the insufficient information for the fore-rear directions of profile normals. This problem is solved by using the background subtraction information of a body region in the input image and adding a 4-directions feature of the profile normal in the proximal parts of the arm and leg. In the matching process, the maximum iteration is less than 30 times. As a result, the execution time is quite fast, and was observed to be less than 0.03 sec in an experiment.

• Proceedings of the KOSOMBE Conference
• /
• v.1998 no.11
• /
• pp.62-63
• /
• 1998

In this paper, a new method to find the corpus callosum from sagittal brain MR images is proposed, which uses the statistical characteristics and shape information of corpus callosum. First, we extract regions satisfying the statistical characteristics of the corpus callosum and then find a region matching the shape information. In order to match the shape information, a new directed window region growing algorithm is proposed instead of using conventional contour matching algorithms. Using the proposed algorithm, we adaptively relax the statistical requirement until we find a region matching the shape information. Experiments show very promising results.

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

The techniques extract shape descriptors from 3D models and use these descriptors for indices for comparing shape similarities. Most similarity search techniques focus on comparisons of each individual 3D model from databases. However, our similarity search technique can compare not only each individual 3D model, but also partial shape similarities. The partial shape matching technique extends the user's query request by finding similar parts of 3D models and finding 3D models which contain similar parts. We have implemented an experimental partial shape-matching search system for 3D pagoda models, and preliminary experiments show that the system successfully retrieves similar 3D model parts efficiently.

• The Journal of Korea Robotics Society
• /
• v.4 no.3
• /
• pp.185-191
• /
• 2009

This paper presents a new shape-based algorithm using affine category shape model for object category recognition and model learning. Affine category shape model is a graph of interconnected nodes whose geometric interactions are modeled using pairwise potentials. In its learning phase, it can efficiently handle large pose variations of objects in training images by estimating 2-D homography transformation between the model and the training images. Since the pairwise potentials are defined on only relative geometric relationship betweenfeatures, the proposed matching algorithm is translation and in-plane rotation invariant and robust to affine transformation. We apply spectral matching algorithm to find feature correspondences, which are then used as initial correspondences for RANSAC algorithm. The 2-D homography transformation and the inlier correspondences which are consistent with this estimate can be efficiently estimated through RANSAC, and new correspondences also can be detected by using the estimated 2-D homography transformation. Experimental results on object category database show that the proposed algorithm is robust to pose variation of objects and provides good recognition performance.

• Journal of Biomedical Engineering Research
• /
• v.20 no.1
• /
• pp.59-68
• /
• 1999

In this paper, we propose an algorithm to locate the corpus callosum automatically from midsagittal brain MR images using the statistical characteristics and shape information of the corpus callosum. In the proposed algorithm, we first extract regions satisfying the statistical characteristics of the corpus callosum and then find a region matching the shape information. In order to match the shape information, a new directed window region-growing algorithm is proposed instead of using conventional contour matching algorithms. Using the proposed algorithm, we adaptively relax the statistical requirement until we find a region matching the shape information. Experiments show promising results.