Similarity Indexing with the SS-tree
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
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
Similarity Search in High Dimensions via Hashing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Pattern Recognition and Machine Learning (Information Science and Statistics)
Pattern Recognition and Machine Learning (Information Science and Statistics)
ACM Transactions on Information Systems (TOIS)
CompositeMap: a novel framework for music similarity measure
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
Unified video annotation via multigraph learning
IEEE Transactions on Circuits and Systems for Video Technology
Beyond distance measurement: constructing neighborhood similarity for video annotation
IEEE Transactions on Multimedia - Special section on communities and media computing
Self-taught hashing for fast similarity search
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
| Hi-index | 0.00 |
Accurate and fast nearest neighbor search is often required in applications involving media sequences, such as duplicate detection in video collections, music retrieval in digital libraries, and event discovery in streaming documents. Among various related techniques, developing indexing scheme is probably most challenging because of its complexity. This paper documents a novel scheme called HMMH (Hidden Markov Model based Hashing) to facilitate scalable and efficient media sequence retrieval based on advanced hashing algorithm. Main conjecture of our approach is that media sequence's content is complex and the associated dynamic characteristics cannot be ignored. As such, we propose to use hidden Markov model (HMM) for comprehensive media sequence modeling and calculate HMM supervector to represent segments of media sequence. With the novel scheme, more discriminative information about temporal structure can be captured. In addition, the difference of two media sequences is approximated by the Euclidean distance between the associated HMM supervectors. The statistical property enables the proposed HMMH to enjoy good system flexibility - various hashing algorithms (e.g., LSH and SPH) can be applied on HMM supervectors for effective binary code calculation. Our experimental results using both large scale video and music collections demonstrate that the proposed scheme various kinds of advantages over existing techniques.