English
Related papers

Related papers: Oblique Matching Pursuit

200 papers

Matching pursuit algorithms are an important class of algorithms in signal processing and machine learning. We present a blended matching pursuit algorithm, combining coordinate descent-like steps with stronger gradient descent steps, for…

Optimization and Control · Mathematics 2019-11-21 Cyrille W. Combettes , Sebastian Pokutta

Multi-object or integral field spectrographs are recognized techniques for achieving simultaneous spectroscopic observations of different or extended sky objects with a high multiplex factor. In this communication is described a…

Instrumentation and Detectors · Physics 2016-12-14 Francois Henault , Florence Laurent

In this note, we investigate the theoretical properties of Orthogonal Matching Pursuit (OMP), a class of decoder to recover sparse signal in compressed sensing. In particular, we show that the OMP decoder can give $(p,q)$ instance…

Information Theory · Computer Science 2011-02-18 Zhiqiang Xu

Much more attention has been paid to unsupervised feature selection nowadays due to the emergence of massive unlabeled data. The distribution of samples and the latent effect of training a learning method using samples in more effective…

Machine Learning · Computer Science 2021-12-15 Weiyi Li , Hongmei Chen , Tianrui Li , Jihong Wan , Binbin Sang

A greedy pursuit strategy which finds a common basis for approximating a set of similar signals is proposed. The strategy extends the Optimized Orthogonal Matching Pursuit approach to selecting the subspace containing the approximation of…

Signal Processing · Electrical Eng. & Systems 2025-03-24 Laura Rebollo-Neira

We propose a unified framework for multi-view subspace learning to learn individual orthogonal projections for all views. The framework integrates the correlations within multiple views, supervised discriminant capacity, and distance…

Machine Learning · Computer Science 2020-10-06 Li Wang , Leihong Zhang , Chungen Shen , Ren-cang Li

When people pursue rewards in stochastic environments, they often match their choice frequencies to the observed target frequencies, even when this policy is demonstrably sub-optimal. We used a ``hide and seek'' task to evaluate this…

Neurons and Cognition · Quantitative Biology 2025-11-11 Peter DiBerardino , Britt Anderson

In object-based Simultaneous Localization and Mapping (SLAM), 6D object poses offer a compact representation of landmark geometry useful for downstream planning and manipulation tasks. However, measurement ambiguity then arises as objects…

Robotics · Computer Science 2021-08-04 Jiahui Fu , Qiangqiang Huang , Kevin Doherty , Yue Wang , John J. Leonard

Oblique images are aerial photographs taken at oblique angles to the earth's surface. Projections of vector and other geospatial data in these images depend on camera parameters, positions of the geospatial entities, surface terrain,…

Computer Vision and Pattern Recognition · Computer Science 2022-06-22 Pragyana Mishra , Eyal Ofek , Gur Kimchi

Dynamic stereo matching is the task of estimating consistent disparities from stereo videos with dynamic objects. Recent learning-based methods prioritize optimal performance on a single stereo pair, resulting in temporal inconsistencies.…

Computer Vision and Pattern Recognition · Computer Science 2024-03-19 Junpeng Jing , Ye Mao , Krystian Mikolajczyk

One of the crucial problems in visual tracking is how the object is represented. Conventional appearance-based trackers are using increasingly more complex features in order to be robust. However, complex representations typically not only…

Computer Vision and Pattern Recognition · Computer Science 2015-09-29 Ang Li , Feng Tang , Yanwen Guo , Hai Tao

Previous work shows that humans tend to prefer large bounding boxes over small bounding boxes with the same IoU. However, we show here that commonly used object detectors predict large and small boxes equally often. In this work, we…

Computer Vision and Pattern Recognition · Computer Science 2024-08-21 Ombretta Strafforello , Osman S. Kayhan , Oana Inel , Klamer Schutte , Jan van Gemert

A generalization of the Gram-Schmidt procedure is achieved by providing equations for updating and downdating oblique projectors. The work is motivated by the problem of adaptive signal representation outside the orthogonal basis setting.…

Functional Analysis · Mathematics 2009-11-11 Laura Rebollo-Neira

We consider the popular and classical method of alternating projections for finding a point in the intersection of two closed sets. By situating the algorithm in a metric space, equipped only with well-behaved geodesics and angles (in the…

Optimization and Control · Mathematics 2022-06-10 Adrian S. Lewis , Genaro López-Acedo , Adriana Nicolae

Sparse representation of astronomical images is discussed. It is shown that a significant gain in sparsity is achieved when particular mixed dictionaries are used for approximating these types of images with greedy selection strategies.…

Mathematical Physics · Physics 2015-06-11 Laura Rebollo-Neira , James Bowley

Motivated by recent work on ordinal embedding (Kleindessner and von Luxburg, 2014), we derive large sample consistency results and rates of convergence for the problem of embedding points based on triple or quadruple distance comparisons.…

Statistics Theory · Mathematics 2016-05-05 Ery Arias-Castro

In this paper, we propose a new constraint, called shift-consistency, for solving matrix/tensor completion problems in the context of recommender systems. Our method provably guarantees several key mathematical properties: (1) satisfies a…

Information Retrieval · Computer Science 2023-10-18 Tung Nguyen , Jeffrey Uhlmann

We investigate the possibility of implementing a given projection measurement using linear optics and arbitrarily fast feedforward based on the continuous detection of photons. In particular, we systematically derive the so-called Dolinar…

Quantum Physics · Physics 2009-11-10 Masahiro Takeoka , Masahide Sasaki , Peter van Loock , Norbert Lütkenhaus

This paper presents a robust tracking approach to handle challenges such as occlusion and appearance change. Here, the target is partitioned into a number of patches. Then, the appearance of each patch is modeled using a dictionary composed…

Computer Vision and Pattern Recognition · Computer Science 2015-06-18 Ali Zarezade , Hamid R. Rabiee , Ali Soltani-Farani , Ahmad Khajenezhad

The orthogonal matching pursuit (OMP) is an algorithm to solve sparse approximation problems. Sufficient conditions for exact recovery are known with and without noise. In this paper we investigate the applicability of the OMP for the…

Numerical Analysis · Mathematics 2010-10-26 Loic Denis , Dirk A. Lorenz , Dennis Trede