Complex Wavelet Bases, Steerability, and the Marr-Like Pyramid

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In this paper we revisit the kernel density estimation problem: given a kernel K(x, y) and a dataset of n points in high dimensional Euclidean space, prepare a data structure that can quickly output, given a query q, a (1 + epsilon)-approximation to mu := ...

Random binning features, introduced in the seminal paper of Rahimi and Recht '07, are an efficient method for approximating a kernel matrix using locality sensitive hashing. Random binning features provide a very simple and efficient way to approximate the ...

This thesis focuses on developing efficient algorithmic tools for processing large datasets. In many modern data analysis tasks, the sheer volume of available datasets far outstrips our abilities to process them. This scenario commonly arises in tasks incl ...

Kernel methods are fundamental tools in machine learning that allow detection of non-linear dependencies between data without explicitly constructing feature vectors in high dimensional spaces. A major disadvantage of kernel methods is their poor scalabili ...

High frequency wind time series measured at different heights from the ground (from 1.5 to 25.5 meters) in an urban area were investigated by using the variance of the coefficients of their wavelet transform. Two ranges of scales were identified, sensitive ...

The dominant approach for learning local patch descriptors relies on small image regions whose scale must be properly estimated a priori by a keypoint detector. In other words, if two patches are not in correspondence, their descriptors will not match. A s ...

Strong gravitational lensing offers a wealth of astrophysical information on the background source it affects, provided the lensed source can be reconstructed as if it was seen in the absence of lensing. In the present work, we illustrate how sparse optimi ...

In this paper, a learning-based image compression method that employs wavelet decomposition as a preprocessing step is presented. The proposed convolutional autoencoder is trained end-to-end to yield a target bitrate smaller than 0.15 bits per pixel across ...

Despite the advances in single-image super resolution using deep convolutional networks, the main problem remains unsolved: recovering fine texture details. Recent works in super resolution aim at modifying the training of neural networks to enable the rec ...

Complex Wavelet Bases, Steerability, and the Marr-Like Pyramid

Chat with Graph Search

Kernel Density Estimation through Density Constrained Near Neighbor Search

Scaling up Kernel Ridge Regression via Locality Sensitive Hashing

Fourier Sampling in Signal Processing and Numerical Linear Algebra

Oblivious Sketching of High-Degree Polynomial Kernels

Wavelet variance scale-dependence as a dynamics discriminating tool in high-frequency urban wind speed time series

Beyond Cartesian Representations for Local Descriptors

Sparse Lens Inversion Technique (SLIT): lens and source separability from linear inversion of the source reconstruction problem

Learning-Based Image Compression using Convolutional Autoencoder and Wavelet Decomposition

A comparative study on wavelets and residuals in deep super resolution