Clustering Reference Images Based on Covisibility for Visual Localization  

作　　者：Sangyun Lee Junekoo Kang Hyunki Hong 

机构地区：[1]School of Integrative Engineering,Chung-Ang University,Heukseok-ro 84,Dongjak-ku,Seoul,06973,Korea [2]School of Software,Chung-Ang University,Heukseok-ro 84,Dongjak-ku,Seoul,06973,Korea

出　　处：《Computers, Materials & Continua》2023年第5期2705-2725,共21页计算机、材料和连续体（英文）

基　　金：supported by the Basic Science Research Program through the National Research Foundation of Korea(NRF)funded by the Ministry of Education(NRF-2018R1D1A1B07049932).

摘　　要：In feature-based visual localization for small-scale scenes,local descriptors are used to estimate the camera pose of a query image.For large and ambiguous environments,learning-based hierarchical networks that employ local as well as global descriptors to reduce the search space of database images into a smaller set of reference views have been introduced.However,since global descriptors are generated using visual features,reference images with some of these features may be erroneously selected.In order to address this limitation,this paper proposes two clustering methods based on how often features appear as well as their covisibility.For both approaches,the scene is represented by voxels whose size and number are computed according to the size of the scene and the number of available 3Dpoints.In the first approach,a voxel-based histogram representing highly reoccurring scene regions is generated from reference images.A meanshift is then employed to group the most highly reoccurring voxels into place clusters based on their spatial proximity.In the second approach,a graph representing the covisibility-based relationship of voxels is built.Local matching is performed within the reference image clusters,and a perspective-n-point is employed to estimate the camera pose.The experimental results showed that camera pose estimation using the proposed approaches was more accurate than that of previous methods.

关 键 词：Visual localization deep learning voxel representation CLUSTERING covisibility MEANSHIFT graph structure 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]