Asymmetric Sparse Kernel Approximations for Large-Scale Visual Search

2014 ◽  
Author(s):  
Damek Davis ◽  
Jonathan Balzer ◽  
Stefano Soatto
Keyword(s):  
Visual Search ◽  
Large Scale ◽  
Sparse Kernel

Data-Driven Lightweight Interest Point Selection for Large-Scale Visual Search

2018 ◽  
Vol 20 (10) ◽  
pp. 2774-2787 ◽  
Author(s):  
Feng Gao ◽  
Xinfeng Zhang ◽  
Yicheng Huang ◽  
Yong Luo ◽  
Xiaoming Li ◽  
...  
Keyword(s):  
Visual Search ◽  
Large Scale ◽  
Data Driven ◽  
Interest Point ◽  
Point Selection ◽  
Selection For

A New Mobile Visual Search System Based on the Human Visual System

2013 ◽  
Vol 461 ◽  
pp. 792-800
Author(s):  
Bo Zhao ◽  
Hong Wei Zhao ◽  
Ping Ping Liu ◽  
Gui He Qin
Keyword(s):  
Visual Search ◽  
Visual System ◽  
Human Visual System ◽  
Large Scale ◽  
Scale Invariant ◽  
Search System ◽  
Mobile Visual Search ◽  
Extraction Algorithm ◽  
Retrieval Scheme ◽  
Scale Invariant Feature

We describe a novel mobile visual search system based on the saliencymechanism and sparse coding principle of the human visual system (HVS). In the featureextraction step, we first divide an image into different regions using thesaliency extraction algorithm. Then scale-invariant feature transform (SIFT)descriptors in all regions are extracted while regional identities arepreserved based on their various saliency levels. According to the sparsecoding principle in the HVS, we adopt a local neighbor preserving Hash functionto establish the binary sparse expression of the SIFT features. In the searchingstep, the nearest neighbors matched to the hashing codes are processed accordingto different saliency levels. Matching scores of images in the database arederived from the matching of hashing codes. Subsequently, the matching scoresof all levels are weighed by degrees of saliency to obtain the initial set of results. In order to further ensure matching accuracy, we propose an optimized retrieval scheme based on global texture information. We conduct extensive experiments on an actual mobile platform in large-scale datasets by using Corel-1000. The resultsshow that the proposed method outperforms the state-of-the-art algorithms on accuracyrate, and no significant increase in the running time of the feature extractionand retrieval can be observed.

Sparse kernel spectral clustering models for large-scale data analysis

2011 ◽  
Vol 74 (9) ◽  
pp. 1382-1390 ◽  
Author(s):  
Carlos Alzate ◽  
Johan A.K. Suykens
Keyword(s):  
Data Analysis ◽  
Spectral Clustering ◽  
Large Scale ◽  
Large Scale Data ◽  
Sparse Kernel ◽  
Scale Data

scholarly journals Visual search in large-scale spaces: Spatial memory and head movements

2017 ◽  
Vol 17 (10) ◽  
pp. 926
Author(s):  
Chia-Ling Li ◽  
M. Aivar ◽  
Matthew Tong ◽  
Mary Hayhoe
Keyword(s):  
Visual Search ◽  
Spatial Memory ◽  
Large Scale ◽  
Head Movements ◽  
Scale Spaces

scholarly journals Memory shapes visual search strategies in large-scale environments

2018 ◽  
Vol 8 (1) ◽  
Author(s):  
Chia-Ling Li ◽  
M. Pilar Aivar ◽  
Matthew H. Tong ◽  
Mary M. Hayhoe
Keyword(s):  
Visual Search ◽  
Large Scale ◽  
Search Strategies

scholarly journals Zooming in and out: Global-local shifts in large scale visual search

2012 ◽  
Vol 12 (9) ◽  
pp. 731-731
Author(s):  
G. Solman ◽  
D. Smilek
Keyword(s):  
Visual Search ◽  
Large Scale
Sign in / Sign up

Export Citation Format

Share Document