Skip to main navigation
Skip to search
Skip to main content
New Jersey Institute of Technology Home
Help & FAQ
Home
Profiles
Research units
Facilities
Federal Grants
Research output
Press/Media
Search by expertise, name or affiliation
Weighted matchings for dense stereo correspondence
Gabriel Fielding,
Moshe Kam
Research output
:
Contribution to journal
›
Article
›
peer-review
24
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Weighted matchings for dense stereo correspondence'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Stereo Images
100%
Weighted Matching
100%
Dense Stereo
100%
Stereo Correspondence
100%
Pixel Points
50%
Bipartite Graph
50%
Occlusion
50%
Dense Correspondence
50%
Order Constraint
50%
Computation Time
25%
Cost Function
25%
Optimization Techniques
25%
Combinatorial Optimization
25%
Matching Approach
25%
Performance Criteria
25%
Local Region
25%
Dynamic Programming Algorithm
25%
Correspondence Problem
25%
Pixel Features
25%
Maximum Weighted Matching
25%
Disparity Map
25%
Greedy Algorithm
25%
Assignment Problem
25%
Local Dynamics
25%
Polynomial Computation
25%
Occlusion Detection
25%
Low Texture
25%
No-Match
25%
Using Performance
25%
Computer Science
stereo-image
100%
stereo correspondence
100%
Bipartite Graph
50%
Optimization Technique
25%
Combinatorial Optimisation
25%
Matching Approach
25%
Performance Criterion
25%
Dynamic Programming Algorithm
25%
Computation Time
25%
Correspondence Problem
25%
Desirable Property
25%
Greedy Algorithm
25%
Assignment Problem
25%