Abstract

Abstract
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 "human" 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.

Abstract
Object detection and tracking is an essential preliminary task in event analysis systems (e.g. visual surveillance). Typically objects are extracted and tagged, forming representative tracks of their activity. Tagging is Usually performed by probabilistic data association, however, in systems capturing disjoint areas it is often not possible to establish such associations, as data may have been collected at different times OF in different locations. In this case, appearance matching is a valuable aid. We propose using bag-of-visterms, i.e. an histogram of quantized local feature descriptors, to represent and match tracked objects. This method has proven to be effective for object matching and classification in image retrieval applications, where descriptors can be extracted a priori. An important difference in event analysis systems is that relevant information is typically restricted to the foreground. Descriptors can, therefore, be extracted faster, approaching real-time requirements. Also, unlike image retrieval, objects can change over time and therefore their model needs to be updated Continuously. Incremental or adaptive learning is used to tackle this problem. Using independent tracks of 30 different persons, we show that the bag-of-visterms representation effectively discriminates visual object tracks and that it presents high resilience to incorrect object segmentation. Additionally, this methodology allows the construction of scalable object models that can be used to match tracks across independent views.

Abstract
The primary goal of the research on image segmentation is to produce better segmentation algorithms. In spite of almost 50 years of research and development in this Held, the general problem of splitting in image into meaningful regions remains unsolved. New and emerging techniques are constantly being applied with reduced Success. The design of each of these new segmentation algorithms requires spending careful attention judging the effectiveness of the technique. This paper demonstrates how the proposed methodology is well suited to perform a quantitative comparison between image segmentation algorithms using I ground-truth segmentation. It consists of a general framework already partially proposed in the literature, but dispersed over several works. The framework is based on the principle of eliminating the minimum number of elements Such that a specified condition is met. This rule translates directly into a global optimization procedure and the intersection-graph between two partitions emerges as the natural tool to solve it. The objective of this paper is to summarize, aggregate and extend the dispersed work. The principle is clarified, presented striped of unnecessary supports and extended to sequences of images. Our Study shows that the proposed framework for segmentation performance evaluation is simple, general and mathematically sound.

Abstract
In this paper we provide an analysis of rate-distortion (R-D) relationship in an H.264 codec using as quality metric Structural Similarly Information (SSIM). This study focus on the quantization parameter, namely rate-quantization (R-Q) functions and distortion-quantization (D-Q) functions. Together, these functions allow a better understanding of the rate-distortion (R-D) behaviour of an H.264 video codec, which is the key issue of optimum bit allocation. Initial results are presented and discussed.

Abstract
In this piper, we propose a method to broadcast digital video programs in which the channel capacity is dynamically distributed among video programs according to each video program particular complexity. A bit rate control algorithm based on the Structural Similarity Index as the measure of video program complexity is examined. Initial results show that a uniform picture quality among video programs can be obtained.