On Algebraic Smoothing: Theory and Results

A Weighted Jacobi iteration based algebraic technique is proposed for smoothing discrete data, e.g., signal, image or video on grids with arbitrary topology. Energy of the discrete data is defined in $H^1$-space and a requirement for discrete scale-space theory is proposed based on the non-increase of energetic norm of the data. A shape-preserving smoothing method is also derived using a combination of Jacobi smoothers. Scale-selective smoothing of the data is achieved by eigenanalysis of the stiffness matrix. Experimental results are shown for isotropic image data.

By: Sugata Ghosal

Published in: International Conference on Pattern Recognition (ICIP 2000), Barcelona, Spain, September 2000., unknown in 2000

LIMITED DISTRIBUTION NOTICE:

This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.

ri00008.pdf

Questions about this service can be mailed to reports@us.ibm.com .