2006/05/29 by Simon P Morgan, Simon P. Morgan, Morgan, Simon P
Computer Science · #Computer Vision and Pattern Recognition (cs.CV) #Digital Image Processing Techniques #FOS: Computer and information sciences #cs.CV
paper · pdf · doi:10.48550/arxiv.cs/0605131
9 pages, no figures. This informal discussion paper will be updated periodically
openalex publication_date 2006/05/29 · arxiv created 2006/05/30 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Regularization functionals that lower level set boundary length when used with L1 fidelity functionals on signal de-noising on images create artifacts. These are (i) rounding of corners, (ii) shrinking of radii, (iii) shrinking of cusps, and (iv) non-smoothing of staircasing. Regularity functionals based upon total curvature of level set boundaries do not create artifacts (i) and (ii). An adjusted fidelity term based on the flat norm on the current (a distributional graph) representing the density of curvature of level sets boundaries can minimize (iii) by weighting the position of a cusp. A regularity term to eliminate staircasing can be based upon the mass of the current representing the graph of an image function or its second derivatives. Densities on the Grassmann bundle of the Grassmann bundle of the ambient space of the graph can be used to identify patterns, textures, occlusion and lines.