Learning on Manifolds

@inproceedings{Porikli2010LearningOM,
  title={Learning on Manifolds},
  author={Fatih Murat Porikli},
  booktitle={SSPR/SPR},
  year={2010}
}
  • F. Porikli
  • Published in SSPR/SPR 18 August 2010
  • Mathematics
Mathematical formulation of certain natural phenomena exhibits group structure on topological spaces that resemble the Euclidean space only on a small enough scale, which prevents incorporation of conventional inference methods that require global vector norms. More specifically in computer vision, such underlying notions emerge in differentiable parameter spaces. Here, two Riemannian manifolds including the set of affine transformations and covariance matrices are elaborated and their… 

Large-Margin Classification in Hyperbolic Space

TLDR
Hyperbolic SVM, a hyperbolic formulation of support vector machine classifiers, is introduced and its theoretical connection to the Euclidean counterpart is described, allowing end-to-end analyses based on the inherenthyperbolic geometry of the data without resorting to ill-fitting tools developed for Euclidan space.

Tensor Sparse Coding for Positive Definite Matrices

TLDR
This paper proposes a novel sparse coding technique for positive definite matrices, which respects the structure of the Riemannian manifold and preserves the positivity of their eigenvalues, without resorting to vectorization.

Coherence algorithm with a high‐resolution time–time transform and feature matrix for seismic data

Traditional coherence algorithms are often based on the assumption that seismic traces are stationary and Gaussian. However, seismic traces are actually non‐stationary and non‐Gaussian. A constant

Count on Me: Learning to Count on a Single Image

TLDR
An iterative algorithm to locate patches similar to the seeds working in three steps, operating on Lie algebra, and exploiting a mixture of templates to process heterogeneous unstructured images with multiple visual motifs and extremely crowded scenarios with high precision and recall.

A Novel Dynamic System in the Space of SPD Matrices with Applications to Appearance Tracking

TLDR
A novel probabilistic dynamic model in $P_n$ based on Riemannian geometry and probability theory is presented in conjunction with a geometric (intrinsic) recursive filter for tracking a time sequence of SPD matrix measurements in a Bayesian framework.

Algorithms for tracking on the manifold of symmetric positive definite matrices

TLDR
A novel probabilistic dynamic model is proposed in conjunction with an intrinsic recursive filter for tracking a time sequence of SPD matrix measurements in a Bayesian framework and this newly developed filtering method can then be used for the covariance.

References

SHOWING 1-10 OF 15 REFERENCES

A Riemannian Framework for Tensor Computing

TLDR
This paper proposes to endow the tensor space with an affine-invariant Riemannian metric and demonstrates that it leads to strong theoretical properties: the cone of positive definite symmetric matrices is replaced by a regular and complete manifold without boundaries, the geodesic between two tensors and the mean of a set of tensors are uniquely defined.

An introduction to differentiable manifolds and Riemannian geometry

Practical non-parametric density estimation on a transformation group for vision

  • E. MillerC. Chefd'Hotel
  • Mathematics
    2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings.
  • 2003
TLDR
A suitable invariant estimator on the linear group of non-singular matrices with positive determinant is proposed, and results showing the superiority of this estimator to comparable Euclidean estimators in this domain are presented.

Region Covariance: A Fast Descriptor for Detection and Classification

TLDR
A fast method for computation of covariances based on integral images, and the performance of the covariance features is superior to other methods, as it is shown, and large rotations and illumination changes are also absorbed by the covariances matrix.

Regressed Importance Sampling on Manifolds for Efficient Object Tracking

  • F. PorikliPan Pan
  • Computer Science
    2009 Sixth IEEE International Conference on Advanced Video and Signal Based Surveillance
  • 2009
TLDR
Experimental results on synthetic and real sequences clearly demonstrate the improved pose (affine) tracking performance of the proposed method compared with the original regression tracker and particle filters.

A Metric for Covariance Matrices

The paper presents a metric for positive definite covariance matrices. It is a natural expression involving traces and joint eigenvalues of the matrices. It is shown to be the distance coming from a

Lie Groups: An Introduction through Linear Groups

Lie Groups is intended as an introduction to the theory of Lie groups and their representations at the advanced undergraduate or beginning graduate level. It covers the essentials of the subject

Simultaneous multiple 3D motion estimation via mode finding on Lie groups

TLDR
A new method to estimate multiple rigid motions from noisy 3D point correspondences in the presence of outliers is proposed and a mean shift algorithm which estimates modes of the sampled distribution using the Lie group structure of the rigid motions is developed.

Integral histogram: a fast way to extract histograms in Cartesian spaces

  • F. Porikli
  • Computer Science
    2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05)
  • 2005
TLDR
The integral histogram method makes it possible to employ even an exhaustive search process in real-time, which was impractical before, and enables the description of higher level histogram features.

Robust Real-Time Face Detection

TLDR
A new image representation called the “Integral Image” is introduced which allows the features used by the detector to be computed very quickly and a method for combining classifiers in a “cascade” which allows background regions of the image to be quickly discarded while spending more computation on promising face-like regions.