Distributed high dimensional information theoretical image registration via random projections

Authors:
ZoltáN Szabó;AndráS Lrincz
Affiliations:
Eötvös Loránd University, Department of Software Technology and Methodology, Pázmány Péter sétány 1/C, Budapest, H-1117, Hungary;Eötvös Loránd University, Department of Software Technology and Methodology, Pázmány Péter sétány 1/C, Budapest, H-1117, Hungary
Venue:
Digital Signal Processing
Year:
2012

Citing 20
Cited 0

The Johnson-Lindenstrauss Lemma and the sphericity of some graphs

Journal of Combinatorial Theory Series A
Elements of information theory

Elements of information theory
Approximate nearest neighbors: towards removing the curse of dimensionality

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An optimal algorithm for approximate nearest neighbor searching fixed dimensions

Journal of the ACM (JACM)
Random projection in dimensionality reduction: applications to image and text data

Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Database-friendly random projections: Johnson-Lindenstrauss with binary coins

Journal of Computer and System Sciences - Special issu on PODS 2001
Experiments with random projections for machine learning

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
An algorithmic theory of learning: Robust concepts and random projection

Machine Learning
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Very sparse random projections

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Reducing High-Dimensional Data by Principal Component Analysis vs. Random Projection for Nearest Neighbor Classification

ICMLA '06 Proceedings of the 5th International Conference on Machine Learning and Applications
Undercomplete Blind Subspace Deconvolution

The Journal of Machine Learning Research
Nonlinear Estimators and Tail Bounds for Dimension Reduction in l1 Using Cauchy Random Projections

The Journal of Machine Learning Research
On variants of the Johnson–Lindenstrauss lemma

Random Structures & Algorithms
Fast Parallel Estimation of High Dimensional Information Theoretical Quantities with Low Dimensional Random Projection Ensembles

ICA '09 Proceedings of the 8th International Conference on Independent Component Analysis and Signal Separation
Accelerating Feature Based Registration Using the Johnson-Lindenstrauss Lemma

MICCAI '09 Proceedings of the 12th International Conference on Medical Image Computing and Computer-Assisted Intervention: Part I
Fast Keypoint Recognition Using Random Ferns

IEEE Transactions on Pattern Analysis and Machine Intelligence
Experiments with random projection

UAI'00 Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence
High-Dimensional normalized mutual information for image registration using random lines

WBIR'06 Proceedings of the Third international conference on Biomedical Image Registration
Survey: Reservoir computing approaches to recurrent neural network training

Computer Science Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

Information theoretical measures, such as entropy, mutual information, and various divergences, exhibit robust characteristics in image registration applications. However, the estimation of these quantities is computationally intensive in high dimensions. On the other hand, consistent estimation from pairwise distances of the sample points is possible, which suits random projection (RP) based low dimensional embeddings. We adapt the RP technique to this task by means of a simple ensemble method. To the best of our knowledge, this is the first distributed, RP based information theoretical image registration approach. The efficiency of the method is demonstrated through numerical examples.