danini / graph-cut-ransac

The Graph-Cut RANSAC algorithm proposed in paper: Daniel Barath and Jiri Matas; Graph-Cut RANSAC, Conference on Computer Vision and Pattern Recognition, 2018. It is available at http://openaccess.thecvf.com/content_cvpr_2018/papers/Barath_Graph-Cut_RANSAC_CVPR_2018_paper.pdf

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Library extension

paaraujo opened this issue · comments

Hi @danini,

This is not an issue, it is a question. I couldn't find a better tab to ask this.

I am working on a problem of the form A * x = y, and I was wondering if it is possible to use your library for that.

Do you think it is possible? If so, how hard would it be? Also, where would be the best starting point?

Thank you,
Paulo Araujo