AI Paper Atlas

Research map / Detection and segmentation / Open-set and few-shot detection

Low Compute and Fully Parallel Computer Vision With HashMatch

Sean Ryan Fanello, Julien Valentin, Adarsh Kowdle, Christoph Rhemann, Vladimir Tankovich, Carlo Ciliberto, Philip Davidson, Shahram Izadi

ICCV 2017 · Detection and segmentation › Open-set and few-shot detection · approach: Amodal and open-world instance segmentation · 20 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
add the proposed parallel inference on top of the hash-code data term (ablation)HashMatch · Synthetic stereo disparityaccuracy (% pixels below 1 px error): 77% -> 96%Improved
use the proposed parallel inference instead of PatchMatch inference with the same unary term (ablation)HashMatch depth estimation · Active stereo depthspeed: 2X fasterImproved
add inference propagation over the unaries alone (ablation)Background subtraction CRF · Background subtractionaverage energy: 5.8 ∗105 -> 2.9 ∗105Improved
use the proposed parallel inference instead of TRWBackground subtraction CRF · Background subtractionaverage energy: 2.85 ∗105 -> 2.9 ∗105No clear effect
use sparse HashMatch codes (4 non-zeros) instead of dense Binary Autoencodershash codes for stereo matching · Synthetic stereo disparityaccuracy: 77% -> 77%No clear effect
use HashMatch codes instead of other sparse hashing schemes (CBE, SBE)hash codes for stereo matching · Synthetic stereo disparityaccuracy: 70% -> 77%Improved
approximate SIFT with HashMatch descriptorswide-baseline matching · EPFL wide-baseline stereomatch inlier accuracy: 81% -> 90%Improved
approximate SIFT with HashMatch descriptorswide-baseline matching · EPFL wide-baseline stereoaverage end-point error: 0.8 cm -> 1.2 cmHurt
approximate SIFT with HashMatch descriptorswide-baseline matching · EPFL wide-baseline stereogood matches per image: 350 -> 150Hurt
use HashMatch codes instead of dense and sparse baselines at small code lengthsGIST1M nearest neighbor retrieval · GIST1MRecall@RMixed

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy