Sparse graph regularized mesh color edit propagation

Bo, Li, Lai, Yu-kun ORCID: https://orcid.org/0000-0002-2094-5680 and Rosin, Paul L. ORCID: https://orcid.org/0000-0002-4965-3884 2020. Sparse graph regularized mesh color edit propagation. IEEE Transactions on Image Processing 29 , pp. 5408-5419. 10.1109/TIP.2020.2980962

Preview

PDF - Accepted Post-Print Version Download (20MB) | Preview

Abstract

Mesh color edit propagation aims to propagate the color from a few color strokes to the whole mesh, which is useful for mesh colorization, color enhancement and color editing, etc. Compared with image edit propagation, luminance information is not available for 3D mesh data, so the color edit propagation is more difficult on 3D meshes than images, with far less research carried out. This paper proposes a novel solution based on sparse graph regularization. Firstly, a few color strokes are interactively drawn by the user, and then the color will be propagated to the whole mesh by minimizing a sparse graph regularized nonlinear energy function. The proposed method effectively measures geometric similarity over shapes by using a set of complementary multiscale feature descriptors, and effectively controls color bleeding via a sparse ℓ 1 optimization rather than quadratic minimization used in existing work. The proposed framework can be applied for the task of interactive mesh colorization, mesh color enhancement and mesh color editing. Extensive qualitative and quantitative experiments show that the proposed method outperforms the state-of-the-art methods.

Item Type:	Article
Date Type:	Published Online
Status:	Published
Schools:	Computer Science & Informatics
Publisher:	Institute of Electrical & Electronic Engineers
ISSN:	1057-7149
Date of First Compliant Deposit:	10 March 2020
Date of Acceptance:	2 March 2020
Last Modified:	04 Dec 2024 22:15
URI:	https://orca.cardiff.ac.uk/id/eprint/130301

Citation Data

Cited 2 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item