2020
DOI: 10.1109/tro.2020.3002432
|View full text |Cite
|
Sign up to set email alerts
|

CLEAR: A Consistent Lifting, Embedding, and Alignment Rectification Algorithm for Multiview Data Association

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
31
0
1

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
1
1

Relationship

2
5

Authors

Journals

citations
Cited by 25 publications
(32 citation statements)
references
References 25 publications
0
31
0
1
Order By: Relevance
“…In practice, however, CG matching can be made real-time by storing and reusing previously computed matches. On the other hand, the CLEAR algorithm could also be accelerated by implementing a block SVD method that exploits the separable structure of the underlying data association graph (Fathian et al, 2019). Still, as the number of submaps grows, we note that multiway association is likely to become the computation bottleneck of the overall system.…”
Section: Real-time Planning and Cslam Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…In practice, however, CG matching can be made real-time by storing and reusing previously computed matches. On the other hand, the CLEAR algorithm could also be accelerated by implementing a block SVD method that exploits the separable structure of the underlying data association graph (Fathian et al, 2019). Still, as the number of submaps grows, we note that multiway association is likely to become the computation bottleneck of the overall system.…”
Section: Real-time Planning and Cslam Resultsmentioning
confidence: 99%
“…Similarly in the computer vision community, cycle consistency has also gained considerable attention owing to popular applications such as multi-shape matching (Huang and Guibas, 2013;Nguyen et al, 2011) and multi-image matching (Leonardos et al, 2017;Zhou et al, 2015). Principled approaches based on spectral relaxation (Pachauri et al, 2013), semidefinite relaxation (Chen et al, 2014), distributed consensus (Leonardos et al, 2017), and spectral clustering (Fathian et al, 2019) have been proposed for solving this problem, and performance guarantees for exact matching are proved under certain noise models (Chen et al, 2014;Pachauri et al, 2013). In this work, we propose a novel application of cycle consistent multiway matching for fusing tree landmarks during multi-robot data association and SLAM.…”
Section: Multiway Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…This enables the robots to communicate labels and observations among each other, and potentially still merge topic models if appropriate, with fewer drawbacks and less communication required. Of particular interest is using the CLEAR algorithm [33], which is capable of efficiently solving the multi-agent data association problem to find all sets of equivalent semantic labels across all robots, to find much better correspondences than the 1-to-1 correspondences solved using the Hungarian algorithm in [23].…”
Section: Multi-robot Federated Explorationmentioning
confidence: 99%