Matching 2d shapes using u descriptors

Authors:
Zhanchuan Cai;Wei Sun;Dongxu Qi
Affiliations:
School of Information Science and Technology, Sun Yat-sen University, Guangzhou, P.R. China;School of Information Science and Technology, Sun Yat-sen University, Guangzhou, P.R. China;School of Information Science and Technology, Sun Yat-sen University, Guangzhou, P.R. China
Venue:
CGI'06 Proceedings of the 24th international conference on Advances in Computer Graphics
Year:
2006

Citing 5
Cited 1

An Experimental Comparison of Autoregressive and Fourier-Based Descriptors in 2D Shape Classification

IEEE Transactions on Pattern Analysis and Machine Intelligence
NeTra: a toolbox for navigating large image databases

Multimedia Systems - Special issue on video content based retrieval
Matching Hierarchical Structures Using Association Graphs

IEEE Transactions on Pattern Analysis and Machine Intelligence
WARP: Accurate Retrieval of Shapes Using Phase of Fourier Descriptors and Time Warping Distance

IEEE Transactions on Pattern Analysis and Machine Intelligence
Retrieval by shape similarity with perceptual distance andeffective indexing

IEEE Transactions on Multimedia

Fourband multiwavelet series and orthogonal analysis for geometric shape

ICIMCS '10 Proceedings of the Second International Conference on Internet Multimedia Computing and Service

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a novel U-System-based approach for representing and matching similar shapes. U-system is a complete orthogonal piecewise k-degree polynomials in L2[0,1]and it has some good properties,such as regeneration,convergence by group. Using U-system with finite items, it can be realized to accurate representation of shapes. This paper make shapes analysis in theory. We experimentally demonstrate that U descriptors are more suitable for representing and matching 2D shapes than Fourier descriptors.