2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05)
DOI: 10.1109/cvpr.2005.375
|View full text |Cite
|
Sign up to set email alerts
|

Wide-Baseline Stereo Matching with Line Segments

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
125
0
1

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 174 publications
(134 citation statements)
references
References 14 publications
0
125
0
1
Order By: Relevance
“…Another family of approaches use junctions at line intersections, reducing to a point problem [14,15]. However, as shown below, these points are not accurately located.…”
Section: Related Workmentioning
confidence: 99%
“…Another family of approaches use junctions at line intersections, reducing to a point problem [14,15]. However, as shown below, these points are not accurately located.…”
Section: Related Workmentioning
confidence: 99%
“…Overall, most of these methods are not adapted to satellite images whose wide baselines typically produce severe occlusion problems that are not specifically handled. The additional use of geometric primitives as line-segments usually helps to better interpret occluded parts of images [20].…”
Section: Related Workmentioning
confidence: 99%
“…The mapping constraints applied here are the sidedness constraint [25] and the one-to-one constraint.…”
Section: Problem-solving Using the Spectral Techniquementioning
confidence: 99%
“…Many methods of matching individual line segments are based on the appearance similarities of the line segments, such as [25], in which colour histograms of neighbouring profiles are used to obtain an original set of candidate matches that grows iteratively. In [26], the author proposed a mean standard deviation line descriptor (MSLD), based on the appearance of the pixel support region.…”
Section: Related Workmentioning
confidence: 99%