Interactive high-dimensional index for large Chinese calligraphic character databases

Authors:
Yl Zhuang;Yueting Zhuang;Qing Li;Lei Chen
Affiliations:
Zhejiang University, P.R.China;Zhejiang University, P.R.China;City University of Hong Kong, HKSAR, P.R.China;Hong Kong University of Science and Technology, HKSAR, P.R.China
Venue:
ACM Transactions on Asian Language Information Processing (TALIP)
Year:
2007

Citing 25
Cited 6

The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
BIRCH: an efficient data clustering method for very large databases

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
On-Line and Off-Line Handwriting Recognition: A Comprehensive Survey

IEEE Transactions on Pattern Analysis and Machine Intelligence
Multidimensional binary search trees used for associative searching

Communications of the ACM
Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases

ACM Computing Surveys (CSUR)
A search engine for 3D models

ACM Transactions on Graphics (TOG)
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Shape Matching and Object Recognition Using Shape Contexts

IEEE Transactions on Pattern Analysis and Machine Intelligence
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
MindReader: Querying Databases Through Multiple Examples

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Indexing High-Dimensional Data for Content-Based Retrieval in Large Databases

DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
Efficient Query Refinement for Image Retrieval

CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Independent Quantization: An Index Compression Technique for High-Dimensional Data Spaces

ICDE '00 Proceedings of the 16th International Conference on Data Engineering
The Earth Mover's Distance under Transformation Sets

ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
A new point matching algorithm for non-rigid registration

Computer Vision and Image Understanding - Special issue on nonrigid image registration
3D motion retrieval with motion index tree

Computer Vision and Image Understanding - Special isssue on video retrieval and summarization
Classification of Hebrew Calligraphic Handwriting Styles: Preliminary Results

DIAL '04 Proceedings of the First International Workshop on Document Image Analysis for Libraries (DIAL'04)
iDistance: An adaptive B+-tree based indexing method for nearest neighbor search

ACM Transactions on Database Systems (TODS)
Enhancing relevance feedback in image retrieval using unlabeled data

ACM Transactions on Information Systems (TOIS)
Retrieval of chinese calligraphic character image

PCM'04 Proceedings of the 5th Pacific Rim conference on Advances in Multimedia Information Processing - Volume Part I
Hierarchical browsing and search of large image databases

IEEE Transactions on Image Processing
Relevance feedback: a power tool for interactive content-based image retrieval

IEEE Transactions on Circuits and Systems for Video Technology

A Web-Based Search Engine for Chinese Calligraphic Manuscript Images

ICWL '009 Proceedings of the 8th International Conference on Advances in Web Based Learning
TF-Tree: an interactive and efficient retrieval of Chinese calligraphic manuscript images based on triple features

Proceedings of the ACM International Conference on Image and Video Retrieval
A hybrid-feature-based efficient retrieval over Chinese calligraphic manuscript image repository

WAIM'10 Proceedings of the 11th international conference on Web-age information management
Probabilistic and interactive retrieval of chinese calligraphic character images based on multiple features

DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Searching the past: an improved shape descriptor to retrieve maya hieroglyphs

MM '11 Proceedings of the 19th ACM international conference on Multimedia
Approximate high-dimensional nearest neighbor queries using R-forests

Proceedings of the 17th International Database Engineering & Applications Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

The large numbers of Chinese calligraphic scripts in existence are valuable part of the Chinese cultural heritage. However, due to the shape complexity of these characters, it is hard to employ existing techniques to effectively retrieve and efficiently index them. In this article, using a novel shape-similarity- based retrieval method in which shapes of calligraphic characters are represented by their contour points extracted from the character images, we propose an interactive partial-distance-map(PDM)- based high-dimensional indexing scheme which is designed specifically to speed up the retrieval performance of the large Chinese calligraphic character databases effectively. Specifically, we use the approximate minimal bounding sphere of a query character and utilize users' relevance feedback to refine the query gradually. Comprehensive experiments are conducted to testify the efficiency and effectiveness of this method. In addition, a new k-NN search called Pseudo k-NN (Pk-NN) search is presented to better facilitate the PDM-based character retrieval.