Saved in:
Bibliographic Details
Main Authors: Lu, Tianle, Chen, Ke, Duan, Yuping
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2512.18968
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908731626749952
author Lu, Tianle
Chen, Ke
Duan, Yuping
author_facet Lu, Tianle
Chen, Ke
Duan, Yuping
contents We introduce a novel formulation for curvature regularization by penalizing normal curvatures from multiple directions. This total normal curvature regularization is capable of producing solutions with sharp edges and precise isotropic properties. To tackle the resulting high-order nonlinear optimization problem, we reformulate it as the task of finding the steady-state solution of a time-dependent partial differential equation (PDE) system. Time discretization is achieved through operator splitting, where each subproblem at the fractional steps either has a closed-form solution or can be efficiently solved using advanced algorithms. Our method circumvents the need for complex parameter tuning and demonstrates robustness to parameter choices. The efficiency and effectiveness of our approach have been rigorously validated in the context of surface and image smoothing problems.
format Preprint
id arxiv_https___arxiv_org_abs_2512_18968
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Total Normal Curvature Regularization and its Minimization for Surface and Image Smoothing
Lu, Tianle
Chen, Ke
Duan, Yuping
Computer Vision and Pattern Recognition
68U10, 65K10
We introduce a novel formulation for curvature regularization by penalizing normal curvatures from multiple directions. This total normal curvature regularization is capable of producing solutions with sharp edges and precise isotropic properties. To tackle the resulting high-order nonlinear optimization problem, we reformulate it as the task of finding the steady-state solution of a time-dependent partial differential equation (PDE) system. Time discretization is achieved through operator splitting, where each subproblem at the fractional steps either has a closed-form solution or can be efficiently solved using advanced algorithms. Our method circumvents the need for complex parameter tuning and demonstrates robustness to parameter choices. The efficiency and effectiveness of our approach have been rigorously validated in the context of surface and image smoothing problems.
title Total Normal Curvature Regularization and its Minimization for Surface and Image Smoothing
topic Computer Vision and Pattern Recognition
68U10, 65K10
url https://arxiv.org/abs/2512.18968