Papers with Code 아카이브
Loop Closure Detection
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 0
- 보존된 평가 기록
- 0
Loop closure detection is the process of detecting whether an agent has returned to a previously visited location.
<span style="color:grey; opacity: 0.6">( Image credit: Backtracking Regression Forests for Accurate Camera Relocalization )</span>
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
MRS-VPR: a multi-resolution sampling based global visual place recognition method
Learning to See the Wood for the Trees: Deep Laser Localization in Urban and Natural Environments on a CPU
Loop Closure Detection with RGB-D Feature Pyramid Siamese Networks
Fusion++: Volumetric Object-Level SLAM
LDSO: Direct Sparse Odometry with Loop Closure
Exploiting Points and Lines in Regression Forests for RGB-D Camera Relocalization
Backtracking Regression Forests for Accurate Camera Relocalization
Beyond SIFT using Binary features for Loop Closure Detection
Original Loop-closure Detection Algorithm for Monocular vSLAM
MILD: Multi-Index hashing for Loop closure Detection
Multi-Model Hypothesize-and-Verify Approach for Incremental Loop Closure Verification
Learning Binary Features Online from Motion Dynamics for Incremental Loop-Closure Detection and Place Recognition
Incremental Loop Closure Verification by Guided Sampling
Convolutional Neural Network-Based Image Representation for Visual Loop Closure Detection
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.