| A string matching approach for visual retrieval and classification |
| Full text |
Pdf
(541 KB)
|
Source
|
International Multimedia Conference
archive
Proceeding of the 1st ACM international conference on Multimedia information retrieval
table of contents
Vancouver, British Columbia, Canada
SESSION: Image retrieval 1
table of contents
Pages 52-58
Year of Publication: 2008
ISBN:978-1-60558-312-9
|
|
Authors
|
|
Mei-Chen Yeh
|
University of California, Santa Barbara, Santa Barbara, CA, USA
|
|
Kwang-Ting Cheng
|
University of California, Santa Barbara, Santa Barbara, CA, USA
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 8, Downloads (12 Months): 150, Citation Count: 0
|
|
|
ABSTRACT
We present an approach to measuring similarities between visual data based on approximate string matching. In this approach, an image is represented by an ordered list of feature descriptors. We show the extraction of local features sequences from two types of 2-D signals - scene and shape images. The similarity of these two images is then measured by 1) solving a correspondence problem between two ordered sets of features and 2) calculating similarities between matched features and dissimilarities between unmatched features. Our experimental study shows that such a globally ordered and locally unordered representation is more discriminative than a bag-of-features representation and the similarity measure based on string matching is effective. We illustrate the application of the proposed approach to scene classification and shape retrieval, and demonstrate superior performance to existing solutions.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
|
 |
3
|
|
| |
4
|
H. Bunke and U. Buhler. Applications of approximate string matching to 2d shape recognition. Pattern Recognition, 26(12):1797--1812, December 1993.
|
| |
5
|
C.-C. Chang and C.-J. Lin. LIBSVM: a library for support vector machines, 2001.
|
| |
6
|
|
| |
7
|
P. F. Felzenszwalb and J. D. Schwartz. Hierarchical matching of deformable shapes. In IEEE International Conference on Computer Vision and Pattern Recognition, pages 1--8, June 2007.
|
| |
8
|
|
| |
9
|
|
| |
10
|
K. Grauman and T. Darrell. Fast contour matching using approximate earth mover's distance. In IEEE International Conference on Computer Vision and Pattern Recognition, pages 220--227, 2004.
|
| |
11
|
L. J. Latecki, R. Lakamper, and U. Eckhardt. Shape descriptors for non-rigid shapes with a single closed contour. In IEEE International Conference on Computer Vision and Pattern Recognition, pages 424--429, 2000.
|
| |
12
|
|
| |
13
|
|
| |
14
|
H. Ling and K. Okada. EMD-L1: An efficient and robust algorithm for comparing histogram-based descriptors. In European Conference on Computer Vision, pages 330--343, 2006.
|
| |
15
|
|
 |
16
|
|
| |
17
|
M. Neuhaus and H. Bunke. An error-tolerant approximate matching algorithm for attributed planar graphs and its application to fingerprint classification. In International Workshop on Structural and Syntactic Pattern, pages 180--189, October 2004.
|
| |
18
|
|
| |
19
|
|
| |
20
|
C. Scott and R. Nowak. Robust contour matching via the order-preserving assignment problem. IEEE Transactions on Image Processing, 15(7):1831--1838, July 2006.
|
| |
21
|
|
| |
22
|
G. Seni, V. Kripasundar, and R. Srihari. Generalizing edit distance to incorporate domain information: Handwritten text recognition as a case study. Pattern Recognition, 29(3):405--414, March 1996.
|
| |
23
|
|
| |
24
|
H. Zaboli, M. Rahmati, and A. Mirzaei. Shape recognition and retrieval: A structural approach using velocity function. In International Conference on Computer Analysis of Images and Patterns, pages 734--741, 2007.
|
| |
25
|
|
|