2019
DOI: 10.31224/osf.io/v74eq
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Mining Minimal Map-Segments for Visual Place Classifiers

Abstract: In visual place recognition (VPR), map segmentation (MS) is a preprocessing technique used to partition a given view-sequence map into place classes (i.e., map segments) so that each class has good place-specific training images for a visual place classifier (VPC). Existing approaches to MS implicitly/explicitly suppose that map segments have a certain size, or individual map segments are balanced in size. However, recent VPR systems showed that very small important map segments (minimal map segments) often su… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2
1

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 37 publications
(50 reference statements)
0
2
0
Order By: Relevance
“…This formulation requires to partition the robot workspace into place classes. The concept of place partitioning is an important topic of on-going research in the field of robot self-localization (e.g., [24], [25]), as was demonstrated in our previous study [26]. In this study, we loosely follow the relatively simple equal-spaced partitioning method [27], and partition the workspace into 40m×40m square regions.…”
Section: B Localizermentioning
confidence: 99%
“…This formulation requires to partition the robot workspace into place classes. The concept of place partitioning is an important topic of on-going research in the field of robot self-localization (e.g., [24], [25]), as was demonstrated in our previous study [26]. In this study, we loosely follow the relatively simple equal-spaced partitioning method [27], and partition the workspace into 40m×40m square regions.…”
Section: B Localizermentioning
confidence: 99%
“…Such landmark-based self-localization problem has two unique challenges. (1) Landmark selection: In offline training stage, the robot must learn the main landmarks that represent the robot workspace, in either self-supervised or unsupervised manner [5]. (2) Next-Best-View (NBV): In online selflocalization stage, the robot must determine NBVs to reidentify such spatially sparse landmarks as many as possible [6].…”
Section: Introductionmentioning
confidence: 99%