By Topic

Roughness penalties on finite domains

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
O'Sullivan, A. ; Dept. of Electr. Eng., Washington Univ., St. Louis, MO, USA

A class of penalty functions for use in estimation and image regularization is proposed. These penalty functions are defined for vectors whose indexes are locations in a finite lattice as the discrepancy between the vector and a shifted version of itself. After motivating this class of penalty functions, their relationship to Markov random field priors is explored. One of the penalty functions proposed, a divergence roughness penalty, is shown to be a discretization of a penalty proposed by Good and Gaskins (1971) for use in density estimation. One potential use in estimation problems is explored. An iterative algorithm that takes advantage of induced neighborhood structures is proposed and convergence of the algorithm is proven under specified conditions. Examples in emission tomographic imaging and radar imaging are given

Published in:

Image Processing, IEEE Transactions on  (Volume:4 ,  Issue: 9 )