2017
DOI: 10.1016/j.patcog.2017.08.002
|View full text |Cite
|
Sign up to set email alerts
|

Tracks selection for robust, efficient and scalable large-scale structure from motion

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
17
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(17 citation statements)
references
References 9 publications
0
17
0
Order By: Relevance
“…Our pipeline employs the feature tracks selection method from [12], summarized in Algorithm 4, to select an optimal subset of feature tracks (or equivalently tie points) for the bundle adjustment. V and E denote the nodes/cameras and edges of EG list of tracks, {T j } j=1,...,N tracks number of spanning trees, K EG [default value = 60] output : subset of tracks, S T ranked = set of ranked tracks in T in decreasing priority (length-scale-cost criterion) Initialize k = 0 k is the counter of spanning trees Initialize S = {} S is the output subset of tracks while k < K EG do Compute camera weights Equation ( 8) C root = camera with largest weight, Create inverted_list using T ranked a list that sorts the tracks seen in each camera using T ranked Set l = 1 l counts the layers in the current tree…”
Section: Feature Tracks Selectionmentioning
confidence: 99%
See 3 more Smart Citations
“…Our pipeline employs the feature tracks selection method from [12], summarized in Algorithm 4, to select an optimal subset of feature tracks (or equivalently tie points) for the bundle adjustment. V and E denote the nodes/cameras and edges of EG list of tracks, {T j } j=1,...,N tracks number of spanning trees, K EG [default value = 60] output : subset of tracks, S T ranked = set of ranked tracks in T in decreasing priority (length-scale-cost criterion) Initialize k = 0 k is the counter of spanning trees Initialize S = {} S is the output subset of tracks while k < K EG do Compute camera weights Equation ( 8) C root = camera with largest weight, Create inverted_list using T ranked a list that sorts the tracks seen in each camera using T ranked Set l = 1 l counts the layers in the current tree…”
Section: Feature Tracks Selectionmentioning
confidence: 99%
“…where mean(C i ) and std(C i ) correspond to the mean and the standard deviation of the average reprojection errors of visible tracks in C i . The scalar µ is a balancing factor set to 3 [12].…”
Section: Feature Tracks Selectionmentioning
confidence: 99%
See 2 more Smart Citations
“…Based on the analysis of error upper bound, Liu et al (2014) and similarly Cui et al (2015) selected a subset of matches that has a good quality vs. quantity trade-off to enhance the accuracy of two-view SfM. In Cui et al (2017) a fast tracks selection method to improve both efficiency and robustness of the bundle adjustment is proposed. In their method, three selection criteria of Compactness, Accurateness and Connectedness are introduced: the first two are used to calculate a selection priority for each track and the third is to guarantee the completeness of scene structure.…”
Section: Introductionmentioning
confidence: 99%