Back to Search
Start Over
3D mesh segmentation via L0-constrained random walks
- Source :
- Multimedia Tools and Applications. 80:24885-24899
- Publication Year :
- 2021
- Publisher :
- Springer Science and Business Media LLC, 2021.
-
Abstract
- 3D mesh segmentation is a challenging problem in computer graphics, computer vision, and multimedia. In this paper, we cast mesh segmentation as a L0 minimization problem using random walks and L0 norm. In random walks method, the probabilities of random walks change smoothly over the whole model, which may lead to inaccurate segmentation boundaries. To attain a perception-aware result, the changes of probabilities should comply with mesh geometry. That is, the changes of probabilities near region boundaries should be more drastic than those inside the regions. Therefore, we introduce a L0 constraint to reflect the sparsity of probability changes, and identify region boundaries more precisely. Experimental results show that the proposed algorithm is effective, robust, and outperforms the state-of-the-art methods on various 3D meshes.
- Subjects :
- Computer Networks and Communications
Computer science
Minimization problem
020207 software engineering
02 engineering and technology
Random walk
Mesh geometry
Constraint (information theory)
Computer graphics
Hardware and Architecture
Norm (mathematics)
0202 electrical engineering, electronic engineering, information engineering
Media Technology
Polygon mesh
Segmentation
Algorithm
Software
Subjects
Details
- ISSN :
- 15737721 and 13807501
- Volume :
- 80
- Database :
- OpenAIRE
- Journal :
- Multimedia Tools and Applications
- Accession number :
- edsair.doi...........068f7024d877143941d61af0a9a5e0ea