paper-with-me

Papers

Auto-adaptative Laplacian Pyramids for High-dimensional Data Analysis

2013-11-26 · Ángela Fernández, Neta Rabin, Dalia Fishelov, José R. Dorronsoro

Non-linear dimensionality reduction techniques such as manifold learning algorithms have become a common way for processing and analyzing high-dimensional patterns that often have attached a target that corresponds to the value of an unknown function. Their application to new points consists in two steps: first, embedding the new data point into the low dimensional space and then, estimating the function value on the test point from its neighbors in the embedded space. However, finding the low dimension representation of a test point, while easy for simple but often not powerful enough procedures such as PCA, can be much more complicated for methods that rely on some kind of eigenanalysis, such as Spectral Clustering (SC) or Diffusion Maps (DM). Similarly, when a target function is to be evaluated, averaging methods like nearest neighbors may give unstable results if the function is noisy. Thus, the smoothing of the target function with respect to the intrinsic, low-dimensional representation that describes the geometric structure of the examined data is a challenging task. In this paper we propose Auto-adaptive Laplacian Pyramids (ALP), an extension of the standard Laplacian Pyramids model that incorporates a modified LOOCV procedure that avoids the large cost of the standard one and offers the following advantages: (i) it selects automatically the optimal function resolution (stopping time) adapted to the data and its noise, (ii) it is easy to apply as it does not require parameterization, (iii) it does not overfit the training set and (iv) it adds no extra cost compared to other classical interpolation methods. We illustrate numerically ALP's behavior on a synthetic problem and apply it to the computation of the DM projection of new patterns and to the extension to them of target function values on a radiation forecasting problem over very high dimensional patterns.

📄 PDF Abstract BibTeX arXiv:1311.6594

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringDimensionality ReductionVocal Bursts Intensity Prediction

Methods 이 논문이 사용한 방법론

PCA Principle Components Analysis (PCA) is an unsupervised method primary used for dimensionality reduction within machine learning. PCA is calculated via a singular value…

Similar Papers 제목 키워드 기반

Properties of Laplacian Pyramids for Extension and Denoising

2019-09-17 · William Leeb

We analyze the Laplacian pyramids algorithm of Rabin and Coifman for extending and denoising a function sampled on a discrete set of points. We provide mild conditions under which the algorithm converges, and prove stabi…

Denoising

Gaussian Fourier Pyramid for Local Laplacian Filter

2022-06-08 · Yuto Sumiya, Tomoki Otsuka, Yoshihiro Maeda, Norishige Fukushima

Multi-scale processing is essential in image processing and computer graphics. Halos are a central issue in multi-scale processing. Several edge-preserving decompositions resolve halos, e.g., local Laplacian filtering (L…

Data Augmentation for Histopathological Images Based on Gaussian-Laplacian Pyramid Blending

2020-01-31 · Steve Tsham Mpinda Ataky, Jonathan de Matos, Alceu de S. Britto Jr., Luiz E. S. Oliveira 외

Data imbalance is a major problem that affects several machine learning (ML) algorithms. Such a problem is troublesome because most of the ML algorithms attempt to optimize a loss function that does not take into account…

Data Augmentation

Unsupervised Representation Learning with Laplacian Pyramid Auto-encoders

2018-01-16 · Qilu Zhao, Zongmin Li

Scale-space representation has been popular in computer vision community due to its theoretical foundation. The motivation for generating a scale-space representation of a given data set originates from the basic observa…

Representation Learning

A Bayesian Variational principle for dynamic Self Organizing Maps

2022-08-24 · Anthony Fillion, Thibaut Kulak, François Blayo

We propose organisation conditions that yield a method for training SOM with adaptative neighborhood radius in a variational Bayesian framework. This method is validated on a non-stationary setting and compared in an hig…