Kernel adaptive filter
About: Kernel adaptive filter is a(n) research topic. Over the lifetime, 8771 publication(s) have been published within this topic receiving 142711 citation(s).
Papers published on a yearly basis
TL;DR: The guided filter is a novel explicit image filter derived from a local linear model that can be used as an edge-preserving smoothing operator like the popular bilateral filter, but it has better behaviors near edges.
Abstract: In this paper, we propose a novel explicit image filter called guided filter. Derived from a local linear model, the guided filter computes the filtering output by considering the content of a guidance image, which can be the input image itself or another different image. The guided filter can be used as an edge-preserving smoothing operator like the popular bilateral filter , but it has better behaviors near edges. The guided filter is also a more generic concept beyond smoothing: It can transfer the structures of the guidance image to the filtering output, enabling new filtering applications like dehazing and guided feathering. Moreover, the guided filter naturally has a fast and nonapproximate linear time algorithm, regardless of the kernel size and the intensity range. Currently, it is one of the fastest edge-preserving filters. Experiments show that the guided filter is both effective and efficient in a great variety of computer vision and computer graphics applications, including edge-aware smoothing, detail enhancement, HDR compression, image matting/feathering, dehazing, joint upsampling, etc.
TL;DR: A new approach for generalizing the Kalman filter to nonlinear systems is described, which yields a filter that is more accurate than an extendedKalman filter (EKF) and easier to implement than an EKF or a Gauss second-order filter.
Abstract: This paper describes a new approach for generalizing the Kalman filter to nonlinear systems. A set of samples are used to parametrize the mean and covariance of a (not necessarily Gaussian) probability distribution. The method yields a filter that is more accurate than an extended Kalman filter (EKF) and easier to implement than an EKF or a Gauss second-order filter. Its effectiveness is demonstrated using an example.
01 Sep 1985
TL;DR: This tutorial paper gives an overview of the current state of the art in adaptive equalization and discusses the convergence and steady-state properties of least mean-square (LMS) adaptation algorithms, including digital precision considerations, and three classes of rapidly converging adaptive equalizer algorithms.
Abstract: Bandwidth-efficient data transmission over telephone and radio channels is made possible by the use of adaptive equalization to compensate for the time dispersion introduced by the channel Spurred by practical applications, a steady research effort over the last two decades has produced a rich body of literature in adaptive equalization and the related more general fields of reception of digital signals, adaptive filtering, and system identification. This tutorial paper gives an overview of the current state of the art in adaptive equalization. In the first part of the paper, the problem of intersymbol interference (ISI) and the basic concept of transversal equalizers are introduced followed by a simplified description of some practical adaptive equalizer structures and their properties. Related applications of adaptive filters and implementation approaches are discussed. Linear and nonlinear receiver structures, their steady-state performance and sensitivity to timing phase are presented in some depth in the next part. It is shown that a fractionally spaced equalizer can serve as the optimum receive filter for any receiver. Decision-feedback equalization, decision-aided ISI cancellation, and adaptive filtering for maximum-likelihood sequence estimation are presented in a common framework. The next two parts of the paper are devoted to a discussion of the convergence and steady-state properties of least mean-square (LMS) adaptation algorithms, including digital precision considerations, and three classes of rapidly converging adaptive equalization algorithms: namely, orthogonalized LMS, periodic or cyclic, and recursive least squares algorithms. An attempt is made throughout the paper to describe important principles and results in a heuristic manner, without formal proofs, using simple mathematical notation where possible.
06 Sep 2014
TL;DR: This paper presents a very appealing tracker based on the correlation filter framework and suggests an effective scale adaptive scheme to tackle the problem of the fixed template size in kernel correlation filter tracker.
Abstract: Although the correlation filter-based trackers achieve the competitive results both on accuracy and robustness, there is still a need to improve the overall tracking capability. In this paper, we presented a very appealing tracker based on the correlation filter framework. To tackle the problem of the fixed template size in kernel correlation filter tracker, we suggest an effective scale adaptive scheme. Moreover, the powerful features including HoG and color-naming are integrated together to further boost the overall tracking performance. The extensive empirical evaluations on the benchmark videos and VOT 2014 dataset demonstrate that the proposed tracker is very promising for the various challenging scenarios. Our method successfully tracked the targets in about 72% videos and outperformed the state-of-the-art trackers on the benchmark dataset with 51 sequences.
25 Mar 1971-Electronics Letters
TL;DR: In this paper, it is shown that modulo arithmetic may be used in the inverse filter to eliminate completely the possibility of instability, and a very simple automatic or adaptive equalisation system is presented.
Abstract: The limitations of present automatic and adaptive equalisers stem from the use of feedforward transversal filters. These drawbacks may be obviated by using a feedback transversal filter, the inverse filter, but this is only suitable for limited use since it can be an unstable circuit. It is shown that modulo arithmetic may be used in the inverse filter to eliminate completely the possibility of instability, and a very simple automatic or adaptive equalisation system is presented. Some interesting properties of the modulo inverse filter are included.
Related Topics (5)
111.8K papers, 2.1M citations
299.6K papers, 3.1M citations
96.4K papers, 2.1M citations
Convolutional neural network
74.7K papers, 2M citations
229.9K papers, 3.5M citations