An Improved Video Analysis using Context based Extension of LSH

05/10/2017
by   Angana Chakraborty, et al.
0

Locality Sensitive Hashing (LSH) based algorithms have already shown their promise in finding approximate nearest neighbors in high dimen- sional data space. However, there are certain scenarios, as in sequential data, where the proximity of a pair of points cannot be captured without considering their surroundings or context. In videos, as for example, a particular frame is meaningful only when it is seen in the context of its preceding and following frames. LSH has no mechanism to handle the con- texts of the data points. In this article, a novel scheme of Context based Locality Sensitive Hashing (conLSH) has been introduced, in which points are hashed together not only based on their closeness, but also because of similar context. The contribution made in this article is three fold. First, conLSH is integrated with a recently proposed fast optimal sequence alignment algorithm (FOGSAA) using a layered approach. The resultant method is applied to video retrieval for extracting similar sequences. The pro- posed algorithm yields more than 80 average in different datasets. It has been found to save 36.3 time, consumed by the exhaustive search. conLSH reduces the search space to approximately 42 search by the aforementioned FOGSAA, Bag of Words method and the standard LSH implementations. Secondly, the effectiveness of conLSH is demon- strated in action recognition of the video clips, which yields an average gain of 12.83 in terms of classification accuracy over the state of the art methods using STIP descriptors. The last but of great significance is that this article provides a way of automatically annotating long and composite real life videos. The source code of conLSH is made available at http://www.isical.ac.in/ bioinfo_miu/conLSH/conLSH.html

READ FULL TEXT

page 32

page 34

research
06/19/2020

Improving Locality Sensitive Hashing by Efficiently Finding Projected Nearest Neighbors

Similarity search in high-dimensional spaces is an important task for ma...
research
03/11/2019

conLSH: Context based Locality Sensitive Hashing for Mapping of noisy SMRT Reads

Single Molecule Real-Time (SMRT) sequencing is a recent advancement of N...
research
12/15/2019

Efficient Bitmap-based Indexing and Retrieval of Similarity Search Image Queries

Finding similar images is a necessary operation in many multimedia appli...
research
04/11/2020

Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring

Locality-Sensitive Hashing (LSH) is one of the most popular methods for ...
research
08/09/2017

Random Binary Trees for Approximate Nearest Neighbour Search in Binary Space

Approximate nearest neighbour (ANN) search is one of the most important ...
research
06/09/2022

Learn2Augment: Learning to Composite Videos for Data Augmentation in Action Recognition

We address the problem of data augmentation for video action recognition...
research
12/22/2017

Lattice-based Locality Sensitive Hashing is Optimal

Locality sensitive hashing (LSH) was introduced by Indyk and Motwani (ST...

Please sign up or login with your details

Forgot password? Click here to reset