BWT-based efficient shape matching

Authors:
Donald Adjeroh;U. Kandaswamy;N. Zhang;A. Mukherjee;M. T. Brown;Tim Bell
Affiliations:
West Virginia University, Morgantown, WV;West Virginia University, Morgantown, WV;University of Central Florida, Orlando, FL;University of Central Florida, Orlando, FL;University of Canterbury, Christchurch, New Zealand;University of Canterbury, Christchurch, New Zealand
Venue:
Proceedings of the 2007 ACM symposium on Applied computing
Year:
2007

Citing 15
Cited 0

Dynamic programming inference of Markov networks from finite sets of sample strings

IEEE Transactions on Pattern Analysis and Machine Intelligence
Parts of Visual Form: Computational Aspects

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Fast Algorithm for the Nearest-Neighbor Classifier

IEEE Transactions on Pattern Analysis and Machine Intelligence
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Content-Based Image Retrieval at the End of the Early Years

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Two-Stage Framework for Polygon Retrieval

Multimedia Tools and Applications
Shape Matching and Object Recognition Using Shape Contexts

IEEE Transactions on Pattern Analysis and Machine Intelligence
Matching and Retrieval of Distorted and Occluded Shapes Using Dynamic Programming

IEEE Transactions on Pattern Analysis and Machine Intelligence
Region-based shape representation and similarity measure suitable for content-based image retrieval

Multimedia Systems
Pattern Matching in BWT-Transformed Text

DCC '02 Proceedings of the Data Compression Conference
Searching BWT Compressed Text with the Boyer-Moore Algorithm and Binary Search

DCC '02 Proceedings of the Data Compression Conference
Shape Matching: Similarity Measures and Algorithms

SMI '01 Proceedings of the International Conference on Shape Modeling & Applications
Recognition of Shapes by Editing Their Shock Graphs

IEEE Transactions on Pattern Analysis and Machine Intelligence
PicToSeek: combining color and shape invariant features for image retrieval

IEEE Transactions on Image Processing
Shape retrieval based on dynamic programming

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Effective shape-based image retrieval requires an appropriate representation of object shape contours. Such a representation should be invariant under certain transformations, such as those due to rotation, scaling, partial occlusion, noise in the image, or changes in the viewing geometry. Given a shape boundary, we decompose it into primitive shape segments that capture the saliency of object parts, and perform retrieval based on the primitives. Motivated by the sorted contexts of the Burrows-Wheeler Transform, we present an algorithm for efficient shape matching, suitable for large-scale shape databases, when the shape boundaries are represented as a sequence of shape primitives. Given a query shape, the algorithm can locate all the potential areas in the database where a match could occur in time that is logarithmic with respect to the database size. The potential matches are then verified in time that is linear with respect to the number of potential matches. Performance of the proposed algorithm is evaluated using both synthetic and real shape databases.