KMITL

Permanent URI for this communityhttps://dspace.kmitl.ac.th/handle/123456789/1

Browse

Search Results

Now showing 1 - 2 of 2
  • Some of the metrics are blocked by your 
    Item type:Item,
    Shape retrieval using Eigen and Fisher Barycenter contour
    (2011-01-01)
    Thourn, Kosorl
    ;
    Kitjaidure, Yuttana
    ;
    Kondo, Shozo
    To achieve a good performance for shape retrieval, it requires both shape representation and classifier. In this paper, the algorithm for shape matching and retrieval is developed by using Eigen Barycenter Contour (EBcC) and Fisher Barycenter Contour (FBcC). In our algorithm, the Signed Enclosed Area (SEA) signature (formed by two adjacent points of contour and its center point), computed at each scale level of Barycenter contour (BcC), is utilized as the shape representation. The BcC technique is robust to moderate amount of noise and occlusion. Furthermore, the SEA signature is invariant to general affine transformation including translation, rotation, scale and shear. Because of high dimension of the shape representation, thus, in the matching step, two classifiers have been studied. The first classifier, Eigen face technique, is employed for dimensionality reduction while the second classifier, Fisher face technique, is used for reducing dimension as well and making discrimination. Then, the similarity among shapes is measured by the normalized crosscorrelation (NCC). The performance of our technique is evaluated onto the affine shape database and two well-known databases, the MPEG-7 shape database part B and the Kimia's database. The experimental results illustrate that our approach gives very high retrieval efficiency over all published methods.
  • Some of the metrics are blocked by your 
    Item type:Item,
    Affine invariant shape recognition based on multi-level of barycenter contour
    (2008-12-01)
    Thourn, Kosorl
    ;
    Kitjaidure, Yuttana
    ;
    Kondo, Shozo
    In this paper, a new multiresolution created from multi-level of barycenter contour is proposed in order to reduce the moderate amount of noise and to improve the retrieval efficiency of the recognition task in computer vision. Then, the Triangle Area Representation with two points (TAR-2p) signature at each level of barycenter contour is introduced as the shape representation. Finally, the normalized cross-correlation function at each level is used for measuring the similarity among the shapes. Our experiment has been performed on database consisting of 560 affine distorted shapes, chosen from MPEG-7 contour shape database CE-1. The results illustrate that our algorithm is invariant to affine transformation, robustness to the noise. Moreover, it achieves high retrieval efficiencies when compares to those of the Triangle Area Representation with three points (TAR-3p) signature and the centroid distance signature. © 2008 IEEE.