GithubHelp home page GithubHelp logo

hmmn's Introduction

Hierarchical Memory Matching Network for Video Object Segmentation

Hongje Seong, Seoung Wug Oh, Joon-Young Lee, Seongwon Lee, Suhyeon Lee, Euntai Kim

ICCV 2021

no_image

This is the implementation of HMMN.
This code is based on STM (ICCV 2019): [link].
Please see our paper for the details: [paper]

Hierarchical Memory Matching Network for Video Object Segmentation (ICCV 2021)

Dependencies

  • Python 3.8
  • PyTorch 1.8.1
  • numpy, opencv, pillow

Trained model

  • Download pre-trained weights into the same folder with demo scripts
    Link: [weights]

Code

  • DAVIS-2016 validation set (Single-object)
python eval_DAVIS.py -g '0' -s val -y 16 -D [path/to/DAVIS]
  • DAVIS-2017 validation set (Multi-object)
python eval_DAVIS.py -g '0' -s val -y 17 -D [path/to/DAVIS]

Pre-computed Results

We also provide pre-computed results for benchmark sets.

Bibtex

@inproceedings{seong2021hierarchical,
  title={Hierarchical Memory Matching Network for Video Object Segmentation},
  author={Seong, Hongje and Oh, Seoung Wug and Lee, Joon-Young and Lee, Seongwon and Lee, Suhyeon and Kim, Euntai},
  booktitle={Proceedings of the IEEE/CVF International Conference on Computer Vision},
  year={2021}
}

Terms of Use

This software is for non-commercial use only. The source code is released under the Attribution-NonCommercial-ShareAlike (CC BY-NC-SA) Licence (see this for details)

hmmn's People

Contributors

hongje avatar

Stargazers

wangyu avatar Raymond Nya avatar  avatar Yufei Jin avatar githubuser avatar  avatar  avatar  avatar  avatar  avatar  avatar He Songcheng avatar  avatar Eteph avatar bluejangbaljang avatar  avatar  avatar 啊旺 avatar  avatar Xianghui avatar  avatar Rex Cheng avatar Suhwan Cho avatar  avatar  avatar Suhyeon Lee avatar  avatar darinshaw312 avatar Bo Miao avatar binerone avatar  avatar IverMind avatar  avatar Tianshu Yu avatar Mohsen Azimi avatar  avatar Mingqi Gao avatar An-zhi WANG avatar Tesla-1i avatar DS.Xu avatar  avatar huhu avatar David Zhang avatar KwanYong Park avatar Jiaying Lin avatar  avatar Seongwon Lee avatar Alexander Kozhevin avatar Vladimir Guzov avatar Jie Liu (刘杰) avatar Yunyao avatar Ren Tianhe avatar Shijie avatar  avatar  avatar Motahareh avatar Derrick avatar Lawrence avatar 爱可可-爱生活 avatar  avatar  avatar YM avatar Xiaohao Xu avatar  avatar Hakeem Demi avatar  avatar Sukjun Hwang avatar Jiaxing Chen avatar PabloBots avatar Adrian Johnston avatar girish hegde avatar Edward Seo avatar Mike avatar Hengkai Guo avatar  avatar Researcher.YuanYuhui avatar Albert Li avatar  avatar

Watchers

YM avatar Mike avatar  avatar

hmmn's Issues

Regarding the results on YouTube-VOS

Hi,

THX for releasing the inference code of DAVIS.

May I ask what frame rate did you use in the evaluation of HMMN and KMN on YouTube-VOS? Validation or Validation All Frames? 6FPS or 30FPS?

Best.

How to train your model?

I noticed that this code only included evaluation part and lack the training part. It would be really helpful if you could proide the training code. Another question is that the model in this code has some differences compared to the paper. In the top-k guided memory matching module, the model in this code don't have the VQ3 add to the result which come out from dropout. Instead, it directly uses results after the second ''matmul'' as the output of the top-k module (in Figure.6 in the paper this is Z4). Could you please explain the reason? Moreover, I wonder if I need to add a dropout layer, a conv3 layer and a ''VQ3 add.'' layer when training the model. Of course if you can provide me with your training code, it would be most helpful! Thank you for your time!
6650b00feaa8005421926ba4506cbe5

Dropout in the top-k guided memory matching module and the value of query(r2,r3)

Excellent work!
I have some question about the dropout in the top-k guided memory matching module and the value of query(r2,r3).
In your code, you doesn't use the value of query of r2 and r3 stage, but in the paper you use the value to generate Z3. The operation in the code is different from the description in the paper.

question about the top-k guided memory matching

thanks for your sharing . wonderful job,
but why i didn't see the dropout in top-k guided memory matching and the conv3*3 before it in your code.
and the KV_Q_r3 = KeyValue(512, keydim=128, valdim=-1, only_key=True) means there is no need for values.
What do I understand it ?

Training code

Are you also planning to share code for training (e.g. based on DAVIS data)?

thanks in advance

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.