Sparse Graph Regularized Mesh Color Edit Propagation.

Area of Science:

• Computer Graphics
• Geometric Modeling
• Image Processing

Background:

• Mesh color edit propagation is challenging due to the lack of luminance information in 3D data.
• Existing methods for image color propagation do not directly translate to 3D meshes.
• Research in 3D mesh color propagation is less extensive compared to image-based methods.

Purpose of the Study:

• To propose a novel solution for 3D mesh color edit propagation.
• To enable effective colorization, enhancement, and editing of 3D mesh data.
• To address the difficulties specific to propagating color information on 3D geometric data.

Main Methods:

• Utilizes sparse graph regularization to propagate color strokes.
• Minimizes a sparse graph regularized nonlinear energy function for color distribution.
• Employs complementary multiscale feature descriptors to measure geometric similarity.
• Applies sparse ℓ1 optimization to prevent color bleeding, differing from quadratic minimization.

Main Results:

• Successfully propagates user-drawn color strokes to the entire mesh.
• Effectively measures geometric similarity across different shapes.
• Controls color bleeding more effectively than traditional methods.
• Demonstrates superior performance against state-of-the-art methods in qualitative and quantitative experiments.

Conclusions:

• The proposed sparse graph regularization framework offers an effective solution for 3D mesh color edit propagation.
• The method provides robust control over color bleeding and geometric similarity measurement.
• The framework is versatile and applicable to interactive mesh colorization, enhancement, and editing tasks.