The traditional pipeline for non-rigid registration is to iteratively update the correspondence and alignment such that the transformed source surface aligns well with the target surface.Among the pipeline,the corresp...The traditional pipeline for non-rigid registration is to iteratively update the correspondence and alignment such that the transformed source surface aligns well with the target surface.Among the pipeline,the correspondence construction and iterative manner are key to the results,while existing strategies might result in local optima.In this paper,we adopt the widely used deformation graph-based representation,while replacing some key modules with neural learning-based strategies.Specifically,we design a neural network to predict the correspondence and its reliability confidence rather than the strategies like nearest neighbor search and pair rejection.Besides,we adopt the GRU-based recurrent network for iterative refinement,which is more robust than the traditional strategy.The model is trained in a self-supervised manner and thus can be used for arbitrary datasets without ground-truth.Extensive experiments demonstrate that our proposed method outperforms the state-of-the-art methods by a large margin.展开更多
基金supported by National Natural Science Foundation of China(No.62122071)the Youth Innovation Promotion Association CAS(No.2018495)“the Fundamental Research Funds for the Central Universities”(No.WK3470000021).
文摘The traditional pipeline for non-rigid registration is to iteratively update the correspondence and alignment such that the transformed source surface aligns well with the target surface.Among the pipeline,the correspondence construction and iterative manner are key to the results,while existing strategies might result in local optima.In this paper,we adopt the widely used deformation graph-based representation,while replacing some key modules with neural learning-based strategies.Specifically,we design a neural network to predict the correspondence and its reliability confidence rather than the strategies like nearest neighbor search and pair rejection.Besides,we adopt the GRU-based recurrent network for iterative refinement,which is more robust than the traditional strategy.The model is trained in a self-supervised manner and thus can be used for arbitrary datasets without ground-truth.Extensive experiments demonstrate that our proposed method outperforms the state-of-the-art methods by a large margin.