1995
DOI: 10.1007/978-1-4471-3035-2_9
|View full text |Cite
|
Sign up to set email alerts
|

Depth Estimation from Stereoscopic Image Pairs Assuming Piecewise Continuos Surfaces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

2002
2002
2021
2021

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 44 publications
(21 citation statements)
references
References 1 publication
0
21
0
Order By: Relevance
“…(a) Determination the extension of cell: for patch p, collect cell image of neighbors in each visible image to initialize C(p): (4) If a patch has been rebuilt, it is not necessary to expand. Specifically, if an image cell has a neighbor patch to p, remove from C(p).…”
Section: Expansionmentioning
confidence: 99%
See 1 more Smart Citation
“…(a) Determination the extension of cell: for patch p, collect cell image of neighbors in each visible image to initialize C(p): (4) If a patch has been rebuilt, it is not necessary to expand. Specifically, if an image cell has a neighbor patch to p, remove from C(p).…”
Section: Expansionmentioning
confidence: 99%
“…The local methods such as gradient descent, level set, or global method such as image segmentation, have high reconstruction precision. But the process of rebuilding demands extra information, such as depth maps, bounding box, visual shell and so on, which are not suitable for the reconstruction of chaotic image sets and outdoor scenes [3][4][5].…”
Section: Introductionmentioning
confidence: 99%
“…Both types use knowledge about the set-up geometry. Depth from stereo [7] builds a depth map of the surface using a stereo microscope observing the same image from different perspectives. Using the pixel-wise found disparity along the epipolar line and the knowledge about the relation of both cameras, the depth map can be reconstructed.…”
Section: Previous Workmentioning
confidence: 99%
“…First, it is compared with the algorithm of Koch [12] and Falkenhagen [10]. They developed an algorithm that searches for correspondences by matching blocks (for instance NCC).…”
Section: Comparisonmentioning
confidence: 99%
“…A second alternative is a more complex dissimilarity function that implements a cross correlation between the neighbourhoods of the pixels under consideration [10]. It is implemented according to following formula:…”
mentioning
confidence: 99%