The pyramid-technique: towards breaking the curse of dimensionality
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Effective nearest neighbor indexing with the euclidean metric
Proceedings of the tenth international conference on Information and knowledge management
ACM Computing Surveys (CSUR)
Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Indexing the Distance: An Efficient Method to KNN Processing
Proceedings of the 27th International Conference on Very Large Data Bases
Query and update efficient B+-tree based indexing of moving objects
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficient video indexing scheme for content-based retrieval
IEEE Transactions on Circuits and Systems for Video Technology
Efficient video similarity measurement with video signature
IEEE Transactions on Circuits and Systems for Video Technology
Using high dimensional indexes to support relevance feedback based interactive images retrieval
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Hierarchical Indexing Structure for Efficient Similarity Search in Video Retrieval
IEEE Transactions on Knowledge and Data Engineering
Efficient similarity search by summarization in large video database
ADC '07 Proceedings of the eighteenth conference on Australasian database - Volume 63
Statistical summarization of content features for fast near-duplicate video detection
Proceedings of the 15th international conference on Multimedia
UQLIPS: a real-time near-duplicate video clip detection system
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A confidence based recognition system for TV commercial extraction
ADC '08 Proceedings of the nineteenth conference on Australasian database - Volume 75
On efficiently searching trajectories and archival data for historical similarities
Proceedings of the VLDB Endowment
Challenges and techniques for effective and efficient similarity search in large video databases
Proceedings of the VLDB Endowment
Spatio-temporal pyramid matching for sports videos
MIR '08 Proceedings of the 1st ACM international conference on Multimedia information retrieval
An efficient indexing structure for multimedia data
MIR '08 Proceedings of the 1st ACM international conference on Multimedia information retrieval
Bounded coordinate system indexing for real-time video clip search
ACM Transactions on Information Systems (TOIS)
Speed up interactive image retrieval
The VLDB Journal — The International Journal on Very Large Data Bases
An efficient near-duplicate video shot detection method using shot-based interest points
IEEE Transactions on Multimedia
Iterative incremental shot clustering algorithm by Haar wavelets
IMSA '07 Proceedings of the Eleventh IASTED International Conference on Internet and Multimedia Systems and Applications
Fast min-hashing indexing and robust spatio-temporal matching for detecting video copies
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
High-dimensional indexing with oriented cluster representation for multimedia databases
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Simulated evaluation of faceted browsing based on feature selection
Multimedia Tools and Applications
A new similarity measure for near duplicate video clip detection
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
An adaptive and efficient unsupervised shot clustering algorithm for sports video
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
A visual word weighting scheme based on emerging itemsets for video annotation
Information Processing Letters
Efficient nearest neighbor query based on extended B+-tree in high-dimensional space
Pattern Recognition Letters
Monitoring near duplicates over video streams
Proceedings of the international conference on Multimedia
Video copy detection: sequence matching using hypothesis test
AST/UCMA/ISA/ACN'10 Proceedings of the 2010 international conference on Advances in computer science and information technology
Efficient bulk-insertion for content-based video indexing
PKAW'10 Proceedings of the 11th international conference on Knowledge management and acquisition for smart systems and services
iPoc: a polar coordinate based indexing method for nearest neighbor search in high dimensional space
WAIM'10 Proceedings of the 11th international conference on Web-age information management
Speed up kernel discriminant analysis
The VLDB Journal — The International Journal on Very Large Data Bases
Effective data co-reduction for multimedia similarity search
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient histogram-based similarity search in ultra-high dimensional space
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Content-based video search on peer-to-peer networks
International Journal of Grid and Utility Computing
A TV commercial detection system
WISM'11 Proceedings of the 2011 international conference on Web information systems and mining - Volume Part II
Fast query point movement techniques with relevance feedback for content-based image retrieval
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
An efficient clustering and indexing approach over large video sequences
PCM'06 Proceedings of the 7th Pacific Rim conference on Advances in Multimedia Information Processing
Dual dimensionality reduction for efficient video similarity search
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
A spatio-temporal pyramid matching for video retrieval
Computer Vision and Image Understanding
Inter-media hashing for large-scale retrieval from heterogeneous data sources
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Effective hashing for large-scale multimedia search
Proceedings of the 2013 Sigmod/PODS Ph.D. symposium on PhD symposium
Near-duplicate video retrieval: Current research and future trends
ACM Computing Surveys (CSUR)
BNCOD'13 Proceedings of the 29th British National conference on Big Data
Data centric research at the University of Queensland
ACM SIGMOD Record
Hi-index | 0.06 |
With rapid advances in video processing technologies and ever fast increments in network bandwidth, the popularity of video content publishing and sharing has made similarity search an indispensable operation to retrieve videos of user interests. The video similarity is usually measured by the percentage of similar frames shared by two video sequences, and each frame is typically represented as a high-dimensional feature vector. Unfortunately, high complexity of video content has posed the following major challenges for fast retrieval: (a) effective and compact video representations, (b) efficient similarity measurements, and (c) efficient indexing on the compact representations. In this paper, we propose a number of methods to achieve fast similarity search for very large video database. First, each video sequence is summarized into a small number of clusters, each of which contains similar frames and is represented by a novel compact model called Video Triplet (ViTri). ViTri models a cluster as a tightly bounded hypersphere described by its position, radius, and density. The ViTri similarity is measured by the volume of intersection between two hyperspheres multiplying the minimal density, i.e., the estimated number of similar frames shared by two clusters. The total number of similar frames is then estimated to derive the overall similarity between two video sequences. Hence the time complexity of video similarity measure can be reduced greatly. To further reduce the number of similarity computations on ViTris, we introduce a new one dimensional transformation technique which rotates and shifts the original axis system using PCA in such a way that the original inter-distance between two high-dimensional vectors can be maximally retained after mapping. An efficient B+-tree is then built on the transformed one dimensional values of ViTris' positions. Such a transformation enables B+-tree to achieve its optimal performance by quickly filtering a large portion of non-similar ViTris. Our extensive experiments on real large video datasets prove the effectiveness of our proposals that outperform existing methods significantly.