Research indexJournal article
A Computationally Efficient 3D Shape Rejection Algorithm
Chen, Sundaram
24 Oct 2005
NobleIDark:/48914/w1/20260521/D7181C19DOI10.1109/icme.2005.1521643
A Computationally Efficient 3D Shape Rejection Algorithm
Chen, Sundaram · 2005 · Subscription
NobleIDark:/48914/w1/20260521/D7181C19DOI10.1109/icme.2005.1521643
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
In this paper, we present an efficient 3D shape rejection algorithm for unlabeled 3D markers. The problem is important in domains such as rehabilitation and the performing arts. There are three key innovations in our approach-(a) a multi-resolution shape representation using Haar wavelets for unlabeled markers, (b) a multi-resolution shape metric and (c) a shape rejection algorithm that is predicated on the simple idea that we do not need to compute the entire distance to conclude that two shapes are dissimilar. We tested the approach on a real-world pose classification problem with excellent results. We achieved a classification accuracy of 98% with an order of magnitude improvement in terms of computational complexity over a baseline shape matching algorithm.