Giter VIP home page Giter VIP logo

idam's Introduction

Code for ECCV 2020 Paper "Iterative Distance-Aware Similarity Matrix Convolution with Mutual-Supervised Point Elimination for Efficient Point Cloud Registration" (IDAM)

This is the official code repository for ECCV 2020 paper "Iterative Distance-Aware Similarity Matrix Convolution with Mutual-Supervised Point Elimination for Efficient Point Cloud Registration" [arxiv]. The code is largely adapted from https://github.com/WangYueFt/dcp and https://github.com/WangYueFt/prnet.

model.png

elimination.png

Environment

We recommend using Anaconda to set up common packages such as numpy and scipy. The following packages are required but not installed by default by Anaconda. We list the version numbers of the packages that we use on our machine, but other versions should work, possibly with minor modification:

Pytorch 1.4.0

Open3D 0.7.0.0

tqdm

Usage

The easiest way to run the code is using the following command

python main.py --exp_name exp

This command will run an experiment on the ModelNet40 dataset (automatically downloaded) with all the options set to default. You can see at the end of main.py a list of options that can be used to control hyperparameters of the model and experiment settings. The comments in the file should be enough to understand them.

Citation

If you want to use it in your work, please cite it as

@InProceedings{idam,
  title={Iterative Distance-Aware Similarity Matrix Convolution with Mutual-Supervised Point Elimination for Efficient Point Cloud Registration},
  author={Li, Jiahao and Zhang, Changhao and Xu, Ziyao and Zhou, Hangning and Zhang, Chi},
  booktitle = {European Conference on Computer Vision (ECCV)},
  year={2020}
}

idam's People

Contributors

cvchanghao avatar jiahaoli95 avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar

idam's Issues

Some question about weight loss

Hello, can't your one-to-one LOSS design method lead to the default correspondence according to index when testing? In this way, the loss during training will be very low, but the test results will be very poor.

Some questions

Thank you for your wonderful work! I encounter some problems when I try to test the performance of ICP, FPFH+RANSAC and FGR. I use the Open3D library but do not know how to set hyper-parameters. Could you share the codes of ICP, FPFH+RANSAC and FGR with Open3d?

Some questions about test dataset

Dear authors,

Thank you for making the codes public. I am very intrested about your works, and I have some questions about your codes:

  1. I found that in PRNet's code, transformations of test data are fixed in this way:
if self.partition != 'train':
    np.random.seed(item)

But I am fail to find these codes in your codes. So are the transformations of test data fixed?

  1. You said that you used GNN as feature extractor, but the codes show that it is different from the GNN used in PRNet, in your codes, GNN is in this way:
class GNN(nn.Module):
    def __init__(self, emb_dims=64):
        super(GNN, self).__init__()
        self.propogate1 = Propagate(3, 64)
        self.propogate2 = Propagate(64, 64)
        self.propogate3 = Propagate(64, 64)
        self.propogate4 = Propagate(64, 64)
        self.propogate5 = Propagate(64, emb_dims)

    def forward(self, x):
        nn_idx = knn(x, k=12)

        x = self.propogate1(x, nn_idx)
        x = self.propogate2(x, nn_idx)
        x = self.propogate3(x, nn_idx)
        x = self.propogate4(x, nn_idx)
        x = self.propogate5(x, nn_idx)

        return x

But in this way, the idices will be fixed at first and not changed, and they are calculated by the Euclidean distance between coordinate points, instead of the L1 or L2 distance of the features. I think it is more like a variant of PointNet, not GNN.

I will be very appreciate if you can answer my doubts.

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.