An unsupervised stereo matching cost based on sparse representation (Q5150118)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7308348
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An unsupervised stereo matching cost based on sparse representation |
scientific article; zbMATH DE number 7308348 |
Statements
An unsupervised stereo matching cost based on sparse representation (English)
0 references
9 February 2021
0 references
sparse representation
0 references
convex quadratic programming
0 references
interior point algorithm
0 references
stereo matching
0 references
0 references
0 references
0.733462929725647
0 references
0.718493640422821
0 references
0.7105817794799805
0 references
