Scalable high-dimensional indexing and searching with Hadoop

January 10, 2015 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Denis Shestakov, Diana Moise arXiv ID 1501.02398 Category cs.IR: Information Retrieval Cross-listed cs.DC, cs.MM Citations 0 Venue arXiv.org Last Checked 4 months ago
Abstract
While high-dimensional search-by-similarity techniques reached their maturity and in overall provide good performance, most of them are unable to cope with very large multimedia collections. The 'big data' challenge however has to be addressed as multimedia collections have been explosively growing and will grow even faster than ever within the next few years. Luckily, computational processing power has become more available to researchers due to easier access to distributed grid infrastructures. In this paper, we show how high-dimensional indexing and searching methods can be used on scientific grid environments and present a scalable workflow for indexing and searching over 30 billion SIFT descriptors using a cluster running Hadoop. Besides its scalability, the proposed scheme not only provides good search quality, but also achieves a stable throughput of around 210ms per image when searching a 100M image collection. Our findings could help other researchers and practitioners to cope with huge multimedia collections.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Retrieval

Died the same way β€” πŸ‘» Ghosted