Synthetic aperture radars (SAR) are coherent imaging systems that produce complex-valued images of the ground. Because modern systems can generate large amounts of data, there is substantial interest in applying image compression techniques to these products. We examine the properties of complex-valued SAR images relevant to the task of data compression. We advocate the use of transform-based comp...
View full abstract»

This paper describes the real time implementation of a simple and robust motion detection algorithm based on Markov random field (MRF) modeling, MRF-based algorithms often require a significant amount of computations. The intrinsic parallel property of MRF modeling has led most of implementations toward parallel machines and neural networks, but none of these approaches offers an efficient solutio...
View full abstract»

This work introduces a new approach to inverse halftoning using nonorthogonal wavelets. The distinct features of this wavelet-based approach are: (1) edge information in the highpass wavelet images of a halftone image is extracted and used to assist inverse halftoning, (2) cross-scale correlations in the multiscale wavelet decomposition are used for removing background halftoning noise while prese...
View full abstract»

A binary annular filter removes isolated points in the foreground and the background of an image. Here, the adjective “isolated” refers to an underlying adjacency relation between pixels, which may be different for foreground and background pixels. In this paper, annular filters are represented in terms of switch pairs. A switch pair consists of two operators which govern the removal o...
View full abstract»

In PDE image restoration problems, one has to invert operators which is a sum of a blurring operator and an elliptic operator with highly varying coefficient. We present a preconditioner for such operators, which can be used with the conjugate gradient (CG) method, and compare it with Vogel and Oman's (see SIAM J. Sci. Stat. Comput., vol.17, p.227-38, 1996, and IEEE Trans. Image Processing, vol.7,...
View full abstract»

An image reconstruction problem motivated by X-ray fiber diffraction analysis is considered. The experimental data are sums of the squares of the amplitudes of particular sets of Fourier coefficients of the electron density, and a part of the electron density is known. The image reconstruction problem is to estimate the unknown part of the electron density, the “image.” A Bayesian appr...
View full abstract»

In this work, a subband domain textual image compression method is developed. The document image is first decomposed into subimages using binary subband decompositions. Next, the character locations in the subbands and the symbol library consisting of the character images are encoded. The method is suitable for keyword search in the compressed data. It is observed that very high compression ratios...
View full abstract»

We describe a general coding strategy leading to a family of universal image compression systems designed to give good performance in applications where the statistics of the source to be compressed are not available at design time or vary over time or space. The basic approach considered uses a two-stage structure in which the single source code of traditional image compression systems is replace...
View full abstract»

Laplacian operators used in the literature for digital image processing are not rotationally invariant. We examine the anisotropy of 3×3 Laplacian operators for images quantized in square pixels, and find the operator which has the minimum overall anisotropy
View full abstract»

The one-dimensional (1-D) Boolean model is used to calculate features for the description of binary textures. Each two-dimensional (2-D) texture is converted into several 1-D strings by scanning it according to raster vertical, horizontal or Hilbert sequences. Several different probability distributions for the segment lengths created this way are used to model their distribution. Therefore, each ...
View full abstract»

It is well known that magnetic resonance magnitude image data obey a Rician distribution. Unlike additive Gaussian noise, Rician “noise” is signal-dependent, and separating signal from noise is a difficult task. Rician noise is especially problematic in low signal-to-noise ratio (SNR) regimes where it not only causes random fluctuations, but also introduces a signal-dependent bias to t...
View full abstract»

Noise degrades the performance of any image compression algorithm. However, at very low bit rates, image coders effectively filter noise that may he present in the image, thus, enabling the coder to operate closer to the noise free case. Unfortunately, at these low bit rates the quality of the compressed image is reduced and very distinctive coding artifacts occur. This paper proposes a combined r...
View full abstract»

It is shown how the signal-to-noise (SNR) scaleable coder can benefit from optimizing quantified discrete cosine transform (DCT) coefficients, in a rate-distortion context, in order to reduce bit-rate overheads. The technique is based on adjusting the quantized coefficients rather than dropping them, since the former gives finer control over rate-distortion trade-offs. The widely used Lagrangian o...
View full abstract»

Device and image-independent color space transformations for the compression of CMYK images were studied. A new transformation (to a YYCC color space) was developed and compared to known ones. Several tests were conducted leading to interesting conclusions. Among them, color transformations are not always advantageous over independent compression of CMYK color planes. Another interesting conclusio...
View full abstract»

Vector median filtering has been recently proposed as an effective method to refine estimated velocity fields. Here, the use of a weighted vector median filtering is suggested to improve the regularization of the optic flow field across motion boundaries. Information about the confidence of the estimated pixel velocities is exploited for the choice of the filter weights. Experimental results, on b...
View full abstract»

Since the postprocessing of coded images using a priori information depends on the constraints imposed on the coded images, it is important to utilize constraints that are best suited to postprocessing techniques. Among the constraint sets, the quantization constraint set (QCS) is commonly used in the iterative algorithms that are especially based on the theory of projections onto convex sets (POC...
View full abstract»

Typically, the linear image restoration problem is an ill-conditioned, underdetermined inverse problem. Here, stabilization is achieved via the introduction of a first-order smoothness constraint which allows the preservation of edges and leads to the minimization of a nonconvex functional. In order to carry through this optimization task, we use stochastic relaxation with annealing. We prefer the...
View full abstract»

This paper presents a novel method, based on magnetic field principles, for obtaining the axes of shapes. The method is based on directional information of the shape's boundary. By simulating a parallel algorithm, we are able to generate the inner as well as the outer axes (axes of concavities) of the shape. The preprocessing phase for this algorithm involves obtaining the shape's gradient. Each p...
View full abstract»

Texture is an important part of the visual world of animals and humans and their visual systems successfully detect, discriminate, and segment texture. Relatively recently progress was made concerning structures in the brain that are presumably responsible for texture processing. Neurophysiologists reported on the discovery of a new type of orientation selective neuron in areas V1 and V2 of the vi...
View full abstract»