Filter (video)

About: Filter (video) is a research topic. Over the lifetime, 114499 publications have been published within this topic receiving 886600 citations.

Frequency Filter for Time Integrations

Abstract: A simple filter for controlling high-frequency computational and physical modes arising in time integrations is proposed. A linear analysis of the filter with leapfrog, implicit, and semi-implicit, differences is made. The filter very quickly removes the computational mode and is also very useful in damping high-frequency physical waves. The stability of the leapfrog scheme is adversely affected when a large filter parameter is used, but the analysis shows that the use of centered differences with frequency filter is still more advantageous than the use of the Euler-backward method. An example of the use of the filter in an actual forecast with the meteorological equations is shown.

Automatic foveation for video compression using a neurobiological model of visual attention

Abstract: We evaluate the applicability of a biologically-motivated algorithm to select visually-salient regions of interest in video streams for multiply-foveated video compression. Regions are selected based on a nonlinear integration of low-level visual cues, mimicking processing in primate occipital, and posterior parietal cortex. A dynamic foveation filter then blurs every frame, increasingly with distance from salient locations. Sixty-three variants of the algorithm (varying number and shape of virtual foveas, maximum blur, and saliency competition) are evaluated against an outdoor video scene, using MPEG-1 and constant-quality MPEG-4 (DivX) encoding. Additional compression radios of 1.1 to 8.5 are achieved by foveation. Two variants of the algorithm are validated against eye fixations recorded from four to six human observers on a heterogeneous collection of 50 video clips (over 45 000 frames in total). Significantly higher overlap than expected by chance is found between human and algorithmic foveations. With both variants, foveated clips are, on average, approximately half the size of unfoveated clips, for both MPEG-1 and MPEG-4. These results suggest a general-purpose usefulness of the algorithm in improving compression ratios of unconstrained video.

Linear transmit processing in MIMO communications systems

Abstract: We examine and compare the different types of linear transmit processing for multiple input, multiple output systems, where we assume that the receive filter is independent of the transmit filter contrary to the joint optimization of transmit and receive filters. We can identify three filter types similar to receive processing: the transmit matched filter, the transmit zero-forcing filter, and the transmit Wiener filter. We show that the transmit filters are based on similar optimizations as the respective receive filters with an additional constraint for the transmit power. Moreover, the transmit Wiener filter has similar convergence properties as the receive Wiener filter, i.e., it converges to the matched filter and the zero-forcing filter for low and high signal-to-noise ratio, respectively. We give closed-form solutions for all transmit filters and present the fundamental result that their mean-square errors are equal to the errors of the respective receive filters, if the information symbols and the additive noise are uncorrelated. However, our simulations reveal that the bit-error ratio results of the transmit filters differ from the results for the respective receive filters.

Improving Grid-based SLAM with Rao-Blackwellized Particle Filters by Adaptive Proposals and Selective Resampling

Abstract: Recently Rao-Blackwellized particle filters have been introduced as effective means to solve the simultaneous localization and mapping (SLAM) problem. This approach uses a particle filter in which each particle carries an individual map of the environment. Accordingly, a key question is how to reduce the number of particles. In this paper we present adaptive techniques to reduce the number of particles in a Rao-Blackwellized particle filter for learning grid maps. We propose an approach to compute an accurate proposal distribution taking into account not only the movement of the robot but also the most recent observation. This drastically decrease the uncertainty about the robot's pose in the prediction step of the filter. Furthermore, we present an approach to selectively carry out re-sampling operations which seriously reduces the problem of particle depletion. Experimental results carried out with mobile robots in large-scale indoor as well as in outdoor environments illustrate the advantages of our methods over previous approaches.

The normalized normal constraint method for generating the Pareto frontier

Abstract: The authors recently proposed the normal constraint (NC) method for generating a set of evenly spaced solutions on a Pareto frontier – for multiobjective optimization problems. Since few methods offer this desirable characteristic, the new method can be of significant practical use in the choice of an optimal solution in a multiobjective setting. This paper’s specific contribution is two-fold. First, it presents a new formulation of the NC method that incorporates a critical linear mapping of the design objectives. This mapping has the desirable property that the resulting performance of the method is entirely independent of the design objectives scales. We address here the fact that scaling issues can pose formidable difficulties. Secondly, the notion of a Pareto filter is presented and an algorithm thereof is developed. As its name suggests, a Pareto filter is an algorithm that retains only the global Pareto points, given a set of points in objective space. As is explained in the paper, the Pareto filter is useful in the application of the NC and other methods. Numerical examples are provided.