2019
DOI: 10.11591/eei.v8i3.1518
|View full text |Cite
|
Sign up to set email alerts
|

Efficient 3D stereo vision stabilization for multi-camera viewpoints

Abstract: In this paper, an algorithm is developed in 3D Stereo vision to improve image stabilization process for multi-camera viewpoints. Finding accurate unique matching key-points using Harris Laplace corner detection method for different photometric changes and geometric transformation in images. Then improved the connectivity of correct matching pairs by minimizing the global error using spanning tree algorithm. Tree algorithm helps to stabilize randomly positioned camera viewpoints in linear order. The unique matc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
2
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 14 publications
0
2
0
Order By: Relevance
“…Sharif Shah et al 17 described a technique for efficient 3D stereo vision stabilization for various camera views. The method makes use of spanning tree algorithm, Laplace pyramid scaling, and Harris corner detection to find precise matching key locations in images and stable camera angles.…”
Section: The Use Of Harris Corner Detectionmentioning
confidence: 99%
“…Sharif Shah et al 17 described a technique for efficient 3D stereo vision stabilization for various camera views. The method makes use of spanning tree algorithm, Laplace pyramid scaling, and Harris corner detection to find precise matching key locations in images and stable camera angles.…”
Section: The Use Of Harris Corner Detectionmentioning
confidence: 99%
“…where p is (π‘₯, 𝑦); the position of the targeted pixel, d is disparity value, π‘š 𝑙 is gradient of left image and π‘š π‘Ÿ is gradient of right image. By adding a cut-off point, the gradient matching with threshold, 𝐺𝑀 β€² (𝑝, 𝑑) is presented in (7),…”
Section: Matching Cost Computationmentioning
confidence: 99%
“…Only then, the aggregated pixel of interest from each images; left image and right image will correspondence with each other. Examples of block matching techniques are sum of absolute difference (SAD), sum squared difference (SSD) normalized cross correlation (NCC), rank transform (RT) and census transform (CT) according to the literature survey of [7]. Block matching techniques produces better disparity map compared to the pixel matching technique, but the computation time will be longer and closely tied to the sizes of the support window.…”
Section: Introductionmentioning
confidence: 99%
“…Computation of this method is usually fast. However, the quality suffers, especially in the depth discontinuity area [28], [29].…”
Section: Introductionmentioning
confidence: 99%