Computer Science > Computer Vision and Pattern Recognition
[Submitted on 6 Aug 2021]
Title:Smooth Mesh Estimation from Depth Data using Non-Smooth Convex Optimization
View PDFAbstract:Meshes are commonly used as 3D maps since they encode the topology of the scene while being lightweight.
Unfortunately, 3D meshes are mathematically difficult to handle directly because of their combinatorial and discrete nature.
Therefore, most approaches generate 3D meshes of a scene after fusing depth data using volumetric or other representations.
Nevertheless, volumetric fusion remains computationally expensive both in terms of speed and memory.
In this paper, we leapfrog these intermediate representations and build a 3D mesh directly from a depth map and the sparse landmarks triangulated with visual odometry.
To this end, we formulate a non-smooth convex optimization problem that we solve using a primal-dual method.
Our approach generates a smooth and accurate 3D mesh that substantially improves the state-of-the-art on direct mesh reconstruction while running in real-time.
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.