Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

What algorithms is used to compute the dense stereo matching? #139

Closed
ghost opened this issue Mar 16, 2015 · 1 comment
Closed

What algorithms is used to compute the dense stereo matching? #139

ghost opened this issue Mar 16, 2015 · 1 comment

Comments

@ghost
Copy link

ghost commented Mar 16, 2015

I gave today MVE a try and received a nice point cloud
http://ibin.co/1v1e680F7shK
from the fountain dataset (http://cvlabwww.epfl.ch/data/multiview/denseMVS.html)
However, I wonder if its possible to improve this by selecting a different dense matching method.
So I have basically two questions:

  1. The applied "dmrecon" algorithm does not refere to some paper. Are there any details about the approach?
  2. How can I replace this to compute 3D points in the mve-scene-format?

Thanks in advance!

@simonfuhrmann
Copy link
Owner

The implemented MVS algorithm is:
http://www.gris.informatik.tu-darmstadt.de/~mgoesele/download/Goesele-2007-MVS.pdf

For more information, check this page:
http://www.gris.informatik.tu-darmstadt.de/projects/multiview-environment/

You can implement any stereo you want and run it as an app. Use the MVE libraries to store depth maps into the views. Make sure you also try FSSR for surface reconstruction:
https://github.com/simonfuhrmann/fssr

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant