Published in IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
As an extension of the multistage median filters, a class of r -filters is presented. Some properties of these filters are discussed. It is shown that the filters can smooth noise and preserve details of images efficiently.
Published in IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
A modified Hopfield neural network model for regularized image restoration is presented. The proposed network allows negative autoconnections for each neuron. A set of algorithms using the proposed neural network model is presented, with various updating modes: sequential updates; n-simultaneous updates; and partially asynchronous updates. The sequ...
Published in IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
An approach is based on the block discrete cosine transform (DCT). The novelty of this approach is that the transform coefficients of all image blocks are coded and transmitted in absolute magnitude order. The resulting ordered-by-magnitude transmission is accomplished without sacrificing coding efficiency by using partition priority coding. Coding...
Published in IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
The authors define linearly additive spatially invariant image sequences and present an explicit mathematical model for describing them. In such a sequence, all objects are positionally invariant in each image of the sequence but have varying gray-scale contributions to the successive images of the sequence. The various components (features or proc...
Published in IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
A class of vector quantizers with memory that are known as finite state vector quantizers (FSVQs) in the image coding framework is investigated. Two FSVQ designs, namely side match vector quantizers (SMVQs) and overlap match vector quantizers (OMVQs), are introduced. These designs take advantage of the 2-D spatial contiguity of pixel vectors as wel...
Published in IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
A distance transformation technique for a binary digital image using a gray-scale mathematical morphology approach is presented. Applying well-developed decomposition properties of mathematical morphology, one can significantly reduce the tremendous cost of global operations to that of small neighborhood operations suitable for parallel pipelined c...
Published in IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
The general conditions of exact reconstruction and a recursive design procedure for lapped orthogonal transform (LOT) with arbitrary length of overlapping are presented. It is shown that LOT can be realized with any standard block transform, discrete cosine transform (DCT), for example, and an additional processing. This processing must also satisf...
Published in IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Constraints provide an important means of incorporating a priori information into the image restoration process. However, much of the information available for constructing constraints is of a tentative nature. If the validity of this tentative information can be assessed before it is incorporated into the solution, helpful constraints can be retai...
Published in IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
The 2-D orthogonal wavelet transform decomposes images into both spatial and spectrally local coefficients. The transformed coefficients were coded hierarchically and individually quantized in accordance with the local estimated noise sensitivity of the human visual system (HVS). The algorithm can be mapped easily onto VLSI. For the Miss America an...
Published in IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Phase unwrapping refers to the determination of phase from modulo 2pi data, some of which may not be reliable. In 2D, this is equivalent to confining the support of the phase function to one or more arbitrarily shaped regions. A phase unwrapping algorithm is presented which works for 2D data known only within a set of nonconnected regions with poss...
