Coarse-to-fine Manifold Learning
نویسندگان
چکیده
In this paper we consider a sequential, coarse-to-fine estimation of a piecewise constant function with smooth boundaries. Accurate detection and localization of the boundary (a manifold) is the key aspect of this problem. In general, algorithms capable of achieving optimal performance require exhaustive searches over large dictionaries that grow exponentially with the dimension of the observation domain. The computational burden of the search hinders the use of such techniques in practice, and motivates our work. We consider a sequential, coarse-to-fine approach that involves first examining the data on a coarse grid, and then refining the analysis and approximation in regions of interest. Our estimators involve an almost linear-time (in two dimensions) sequential search over the dictionary, and converge at the same near-optimal rate as estimators based on exhaustive searches. Specifically, for two dimensions, our algorithm requiresO(n) operations for an n-pixel image, much less than the traditional wedgelet approaches, which require O(n) operations.
منابع مشابه
Coarse Ricci Curvature with Applications to Manifold Learning
Consider a sample of n points taken i.i.d from a submanifold of Euclidean space. This defines a metric measure space. We show that there is an explicit set of scales tn → 0 such that a coarse Ricci curvature at scale tn on this metric measure space converges almost surely to the coarse Ricci curvature of the underlying manifold.
متن کاملCoarse Ricci curvature and the manifold learning problem
Abstract. We consider the framework used by Bakry and Emery in their work on logarithmic Sobolev inequalities to define a notion of coarse Ricci curvature on smooth metric measure spaces alternative to the notion proposed by Y. Ollivier. We discuss applications of our construction to the manifold learning problem, specifically to the statistical problem of estimating the Ricci curvature of a su...
متن کاملManifold Coarse Graining for Online Semi-supervised Learning
When the number of labeled data is not sufficient, SemiSupervised Learning (SSL) methods utilize unlabeled data to enhance classification. Recently, many SSL methods have been developed based on the manifold assumption in a batch mode. However, when data arrive sequentially and in large quantities, both computation and storage limitations become a bottleneck. In this paper, we present a new sem...
متن کاملzoning of flood hazard in Nowshahr city using machine learning models
The aim of this study is to predict and model flood hazard in the city of Nowshahr, Mazandaran province using machine learning models. The criteria and indicators affecting flood hazard were identified based on the review of resources, and then the indicators were converted into rasters in ArcGIS environment, and finally standardized by fuzzy method for use in the models. K-nearest neighbor ...
متن کاملCoarse-to-Fine Inference and Learning for First-Order Probabilistic Models
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and vision applications. However, no coarse-to-fine inference or learning methods have been developed for general first-order probabilistic domains, where the potential gains are even higher. We present our Coarse-to-Fine Probabi...
متن کامل