NDLI: Fast dense stereo correspondences by binary locality sensitive hashing

Content Provider	IEEE Xplore Digital Library
Author	Heise, P. Jensen, B. Klose, S. Knoll, A.
Copyright Year	2015
Description	Author affiliation: Dept. of Inf., Tech. Univ. Munchen, Garching, Germany (Heise, P.; Jensen, B.; Klose, S.; Knoll, A.)
Abstract	The stereo correspondence problem is still a highly active topic of research with many applications in the robotic domain. Still many state of the art algorithms proposed to date are unable to reasonably handle high resolution images due to their run time complexities or memory requirements. In this work we propose a novel stereo correspondence estimation algorithm that employs binary locality sensitive hashing and is well suited to implementation on the GPU. Our proposed method is capable of processing very high-resolution stereo images at near real-time rates. An evaluation on the new Middlebury and Disney high-resolution stereo benchmarks demonstrates that our proposed method performs well compared to existing state of the art algorithms.
Starting Page	105
Ending Page	110
File Size	2176087
Page Count	6
File Format	PDF
e-ISBN	9781479969234
DOI	10.1109/ICRA.2015.7138987
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-05-26
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Hamming distance Real-time systems Error analysis Complexity theory Runtime Memory management Estimation
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Fast search in Hamming space with multi-index hashing

Efficient manifold preserving audio source separation using locality sensitive hashing

Beyond “project and sign” for cosine estimation with binary codes

Binary Code Ranking with Weighted Hamming Distance

An improved algorithm for locality-sensitive hashing

Approximate Computation of Object Distances by Locality-Sensitive Hashing (2008)

TailoredBRIEF: Online per-feature descriptor customization

Bilinear random projections for locality-sensitive binary codes

Fast Access for Star Catalog Based on Locality-Sensitive Hashing

Fast dense stereo correspondences by binary locality sensitive hashing

Similar Documents

Fast search in Hamming space with multi-index hashing

Efficient manifold preserving audio source separation using locality sensitive hashing

Beyond “project and sign” for cosine estimation with binary codes

Binary Code Ranking with Weighted Hamming Distance

An improved algorithm for locality-sensitive hashing

Approximate Computation of Object Distances by Locality-Sensitive Hashing (2008)

TailoredBRIEF: Online per-feature descriptor customization

Bilinear random projections for locality-sensitive binary codes

Fast Access for Star Catalog Based on Locality-Sensitive Hashing

Fast dense stereo correspondences by binary locality sensitive hashing