Color and color differences are critical aspects in many image processing and computer vision applications. A paradigmatic example is object segmentation, where color distances can greatly influence the performance of the algorithms. Metrics for color difference have been proposed in the literature, including the definition of standards such as CIEDE2000, which quantifies the change in visual perception of two given colors. This standard has been recommended for industrial computer vision applications, but the benefits of its application have been impaired by the complexity of the formula. This paper proposes a new strategy that improves the usability of the CIEDE2000 metric when a maximum acceptable distance can be imposed. We argue that, for applications where a maximum value, above which colors are considered to be different, can be established, then it is possible to reduce the amount of calculations of the metric, by preemptively analyzing the color features. This methodology encompasses the benefits of the metric while overcoming its computational limitations, thus broadening the range of applications of CIEDE2000 in both the computer vision algorithms and computational resource requirements.

In this paper we present a complete system for object tracking over multiple uncalibrated cameras with or without overlapping fields of view. We employ an approach based on the bag-of-visterms technique to represent and match tracked objects. The tracks are compared with a global object model based on an ensemble of individual object models. The system can globally recognise objects and minimise common tracking problems such as track drift or split. The output is a timeline representing the objects present in a given multi-camera scene. The methods employed in the system are online and can be optimized to operate in real-time.

Automatic image registration (AIR) is still a present challenge for the remote sensing community. Although a wide variety of AIR methods have been proposed in the last few years, there are several drawbacks which avoid their common use in practice. The recently proposed scale invariant feature transform (SIFT) approach has already revealed to be a powerful tool for the obtention of tie points in general image processing tasks, but it has a limited performance when directly applied to remote sensing images. In this paper, a new AIR method is proposed, based on the combination of image segmentation and SIFT, complemented by a robust procedure of outlier removal. This combination allows for an accurate obtention of tie points for a pair of remote sensing images, being a powerful scheme for AIR. Both synthetic and real data have been considered in this work for the evaluation of the proposed methodology, comprising medium and high spatial resolution images, and single-band, multispectral, and hyperspectral images. A set of measures which allow for an objective evaluation of the geometric correction process quality has been used. The proposed methodology allows for a fully automatic registration of pairs of remote sensing images, leading to a subpixel accuracy for the whole considered data set. Furthermore, it is able to account for differences in spectral content, rotation, scale, translation, different viewpoint, and change in illumination.

Automatic image registration is still an actual challenge in several fields. Although several methods for automatic image registration have been proposed in the last few years, it is still far from a broad use in several applications, such as in remote sensing. In this paper, a method for automatic image registration through histogram-based image segmentation (HAIRIS) is proposed. This new approach mainly consists in combining several segmentations of the pair of images to be registered, according to a relaxation parameter on the histogram modes delineation (which itself is a new approach), followed by a consistent characterization of the extracted objects--through the objects area, ratio between the axis of the adjust ellipse, perimeter and fractal dimension--and a robust statistical based procedure for objects matching. The application of the proposed methodology is illustrated to simulated rotation and translation. The first dataset consists in a photograph and a rotated and shifted version of the same photograph, with different levels of added noise. It was also applied to a pair of satellite images with different spectral content and simulated translation, and to real remote sensing examples comprising different viewing angles, different acquisition dates and different sensors. An accuracy below 1° for rotation and at the subpixel level for translation were obtained, for the most part of the considered situations. HAIRIS allows for the registration of pairs of images (multitemporal and multisensor) with differences in rotation and translation, with small differences in the spectral content, leading to a subpixel accuracy.

The geometric correction process is a crucial step in remote sensing applications. This process is frequently manually performed-which is a laborious task in many situations-as automatic image registration methods are still far from being broadly applied. One of the reasons that justify the absence of a broad application of automatic image registration methods is the lack of measures for an objective and automated analysis of the image registration process quality. The root mean square (RMS) of the residuals is the only quantitative evaluation which is generally used in this process, with the final validation of the geometric correction process being a qualitative analysis. Therefore, in both ldquohumanrdquo and automatic image registration processes, an objective evaluation of its quality is required. In this letter, we propose several measures for an objective evaluation of the geometric correction process, as a complement to the traditional RMS of the residuals and visual inspection. Two scenarios of control point distribution and the most common residual distributions were considered. With the proposed measures, we intend to cover the most common qualitative analysis aspects. This has particular importance under the scope of automatic image registration methods, where an automatic evaluation of the results is also required.

In this paper, we recover a graph interpretation of the mutual partition distance, proposed recently by Cardoso and Corte-Real. We deduce some properties of this measure, and establish a correspondence with the partition distance introduced by Almudevar and Field and Gusfield, and independently by Guigues. We also present some different formulations for the computation of the mutual partition distance. Finally, a comparison is made with similar measures.

The implementation of fast dedicated processor for block matching motion estimation based on cumulants matching criteria implies the optimization of all of its components. Special care should be spent with the multiply-accumulate unit that is the core of many digital signal processing systems. Therefore, its optimization may be of outmost importance, specially if a significative number of such units are present in the platform. In this paper, the minimization of the size of one such unit is provided for a specific application, although the results have relevance in other scenarios.

Image segmentation plays a major role in a broad range of applications. Evaluating the adequacy of a segmentation algorithm for a given application is a requisite both to allow the appropriate selection of segmentation algorithms as well as to tune their parameters for optimal performance. However, objective segmentation quality evaluation is far from being a solved problem. In this paper, a generic framework for segmentation evaluation is introduced after a brief review of previous work. A metric based on the distance between segmentation partitions is proposed to overcome some of the limitations of existing approaches. Symmetric and asymmetric distance metric alternatives are presented to meet the specificities of a wide class of applications. Experimental results confirm the potential of the proposed measures.

We present a model based video coder for remote video surveillance applications at very low bit rates. Unlike the known model based video codecs, we use the model based approach for background modeling and not for "head-and-shoulders" modeling. Since in video surveillance the remote site that is being monitored is usually a previously known physically closed space, we build a 3-D model of the site and use it to synthesize the background of the scene for each of the video cameras used. The codec has two layers, one layer for the background using a 3-D model and a second layer for the part of the scene not represented by the background. The second layer may use conventional hybrid DPCM-DCT coding schemes, like H.263, or object-based coding techniques, like those used in MPEG-4 video VM. The proposed codec can be a good framework for a multiview codec.

Higher-order statistics extend the analysis methods of non-linear systems and non-Gaussian signals based on the autocorrelation and power spectrum. The main drawback of their use in real time applications is the high complexity of their estimation due to the large number of arithmetic operations. This paper presents an experimental vector architecture for the estimation of the higher-order moments. The processor's core is a pipelined multiply-accumulate unit that receives four data vectors and computes in parallel the moment taps up to the fourth-order. The design of custom cache memory organization and address generation circuits has led to more than 11 operations per clock cycle. The architecture was modeled and simulated in Verilog and is presently being implemented in XILINX field-programmable gate arrays (FPGAs) and one custom integrated circuit for the multiply-accumulate unit.

Describes a video coder based on a hybrid DPCM-vector quantization algorithm that is suited for bit rates ranging from 8-16 kb/s. The proposed approach involves segmenting difference images into variable-size and variable-shape blocks and performing segmentation and motion compensation simultaneously. The purpose of obtaining motion vectors for variable-size and variable-shape blocks is to improve the quality of motion estimation, particularly in those areas where the edges of moving objects are situated. For the larger blocks, decimation takes place in order to simplify vector quantization. For very active blocks, which are always of small dimension, a specific vector quantizer has been applied, the fuzzy classified vector quantizer (FCVQ). The coding algorithm described displays good performance in the compression of test sequences at the rates of 8 and 16 kb/s; the signal-to-noise ratios obtained are good in both cases. The complexity of the coder implementation is comparable to that of conventional hybrid coders, while the decoder is much simpler in this proposal.

Vector quantization of images raises problems of complexity in codebook search and subjective quality of images. The family of image vector quantization algorithms proposed in this paper addresses both of those problems. The fuzzy classified vector quantizer (FCVQ) is based on fuzzy set theory and consists basically in a method of extracting a subcodebook from the original codebook, biased by the features of the block to be coded. The incidence of each feature on the blocks is represented by a fuzzy set that captures its (possibly subjective) nature. Unlike the classified vector quantizer (CVQ), in the FCVQ a specific subcodebook is extracted for each block to be coded, allowing a better adaptation to the block. The CVQ may be regarded as a special case of the FCVQ. In order to explore the possible correlation between blocks, an estimator for the degree of incidence of features on the block to be coded is included. The estimate is based on previously coded blocks and is obtained by maximizing a possibility; a distribution that intends to represent the subjective knowledge on the feature's possibility of occurrence conditioned to the coded blocks is used. Some examples of the application of a FCVQ coder to two test images are presented. A slight improvement on the subjective quality of the coded images is obtained, together with a significant reduction on the codebook search complexity and, when applying the estimator, a reduction of the bit rate.>