The purpose of this investigation is to understand situations under wh
ich an enhancement method succeeds in recovering an image from data wh
ich are noisy and blurred. The method in question is due to Rudin and
Osher. The method selects, from a class of feasible images, one that h
as the least total variation. Our investigation is limited to images w
hich have small total variation. We call such images ''blocky'' as the
y are commonly piecewise constant (or nearly so) in grey-level values.
The image enhancement is applied to three types of problems, each one
leading to an optimization problem. The optimization problems are ana
lyzed in order to understand the conditions under which they can be ex
pected to succeed in reconstructing the desired blocky images. We illu
strate the main findings of our work in numerical examples.