This paper treats the problem of establishing bounds for the morpholog
ical filter by reconstruction class. Morphological filters by reconstr
uction, which are composed of openings and closings by reconstruction,
are useful filters for image processing because they do not introduce
discontinuities. The main contributions of this paper are: (a) To est
ablish when the combination of openings by reconstruction (Or, respect
ively, of closings by reconstruction) is an opening by reconstruction
(respectively a closing by reconstruction). (b) To establish, for any
filter by reconstruction, upper and lower bounds that are, respectivel
y, a closing by reconstruction and an opening by reconstruction. In ad
dition, the paper investigates certain aspects of filters by reconstru
ction that possess a robustness property called strong property. Some
dual and equivalent forms are introduced for a family of multi-level f
ilters recently introduced. A significant side-result is to determine
some instances of connected openings composed by openings and closings
by reconstruction that are not openings by reconstruction (similarly
for closings). (C) 1998 Pattern Recognition Society. Published by Else
vier Science Ltd. All rights reserved.