Results 1 - 10
of
142
Directional Statistics and Shape Analysis
, 1995
"... There have been various developments in shape analysis in the last decade. We describe here some relationships of shape analysis with directional statistics. For shape, rotations are to be integrated out or to be optimized over whilst they are the basis for directional statistics. However, various c ..."
Abstract
-
Cited by 335 (12 self)
- Add to MetaCart
There have been various developments in shape analysis in the last decade. We describe here some relationships of shape analysis with directional statistics. For shape, rotations are to be integrated out or to be optimized over whilst they are the basis for directional statistics. However, various concepts are connected. In particular, certain distributions of directional statistics have emerged in shape analysis, such a distribution is Complex Bingham Distribution. This paper first gives some background to shape analysis and then it goes on to directional distributions and their applications to shape analysis. Note that the idea of using tangent space for analysis is common to both manifold as well. 1 Introduction Consider shapes of configurations of points in Euclidean space. There are various contexts in which k labelled points (or "landmarks") x 1 ; :::; x k in IR m are given and interest is in the shape of (x 1 ; :::; x k ). Example 1 The microscopic fossil Globorotalia truncat...
Estimating and Interpreting the Instantaneous Frequency of a Signal
- Proceedings of the IEEE
, 1992
"... The frequency of a sinusoidal signal is a well defined quantity. However, often in practice, signals are not truly sinusoidal, or even aggregates of sinusoidal components. Nonstationary signals in particular do not lend themselves well to decomposition into sinusoidal components. For such signals, t ..."
Abstract
-
Cited by 80 (1 self)
- Add to MetaCart
The frequency of a sinusoidal signal is a well defined quantity. However, often in practice, signals are not truly sinusoidal, or even aggregates of sinusoidal components. Nonstationary signals in particular do not lend themselves well to decomposition into sinusoidal components. For such signals, the notion of frequency loses its effectiveness, and one needs to use a parameter which accounts for the time-varying nature of the process. This need has given rise to the idea of instantaneous frequency. The instantaneous frequency (IF) of a signal is a parame-ter which is often of significant practical importance. In many situations such as seismic, radar, sonar, communications, and biomedical applications, the IF is a good descriptor of some physical phenomenon. This paper discusses the concept of instantaneous frequency, its definitions, and the correspondence between the various mathe-matical models formulated for representation of IF. The paper also considers the extent to which the IF corresponds to our intuitive expectation of reality. A historical review of the successive attempts to define the IF is presented. Then the relationships between the IF and the group-delay, analytic signal, and bandwidth-time (BT) product are explored, as well as the relationship with time-frequency distribu-tions. Finally, the notions of monocomponent and multicomponent signals, and instantaneous bandwidth are discussed. It is shown that all these notions are well described in the context of the theory presented. I.
Clustering Based on Conditional Distributions in an Auxiliary Space
- Neural Computation
, 2001
"... We study the problem of learning groups or categories that are local ..."
Abstract
-
Cited by 77 (22 self)
- Add to MetaCart
We study the problem of learning groups or categories that are local
Vanishing point calculation as a statistical inference on the unit sphere
- In Proc. ICCV
, 1990
"... \Lambda In this paper vanishing point computation is characterized as a statistical estimation problem on the unit sphere; in particular as the estimation of the polar axis of an equatorial distribution. This framework facilitates the construction of confidence regions for 3D line orientation. ..."
Abstract
-
Cited by 53 (6 self)
- Add to MetaCart
\Lambda In this paper vanishing point computation is characterized as a statistical estimation problem on the unit sphere; in particular as the estimation of the polar axis of an equatorial distribution. This framework facilitates the construction of confidence regions for 3D line orientation.
A Unified Framework for Model-based Clustering
- Journal of Machine Learning Research
, 2003
"... Model-based clustering techniques have been widely used and have shown promising results in many applications involving complex data. This paper presents a unified framework for probabilistic model-based clustering based on a bipartite graph view of data and models that highlights the commonaliti ..."
Abstract
-
Cited by 43 (6 self)
- Add to MetaCart
Model-based clustering techniques have been widely used and have shown promising results in many applications involving complex data. This paper presents a unified framework for probabilistic model-based clustering based on a bipartite graph view of data and models that highlights the commonalities and differences among existing model-based clustering algorithms. In this view, clusters are represented as probabilistic models in a model space that is conceptually separate from the data space. For partitional clustering, the view is conceptually similar to the ExpectationMaximization (EM) algorithm. For hierarchical clustering, the graph-based view helps to visualize critical/important distinctions between similarity-based approaches and model-based approaches.
From Laplace To Supernova Sn 1987a: Bayesian Inference In Astrophysics
, 1990
"... . The Bayesian approach to probability theory is presented as an alternative to the currently used long-run relative frequency approach, which does not offer clear, compelling criteria for the design of statistical methods. Bayesian probability theory offers unique and demonstrably optimal solutions ..."
Abstract
-
Cited by 42 (2 self)
- Add to MetaCart
. The Bayesian approach to probability theory is presented as an alternative to the currently used long-run relative frequency approach, which does not offer clear, compelling criteria for the design of statistical methods. Bayesian probability theory offers unique and demonstrably optimal solutions to well-posed statistical problems, and is historically the original approach to statistics. The reasons for earlier rejection of Bayesian methods are discussed, and it is noted that the work of Cox, Jaynes, and others answers earlier objections, giving Bayesian inference a firm logical and mathematical foundation as the correct mathematical language for quantifying uncertainty. The Bayesian approaches to parameter estimation and model comparison are outlined and illustrated by application to a simple problem based on the gaussian distribution. As further illustrations of the Bayesian paradigm, Bayesian solutions to two interesting astrophysical problems are outlined: the measurement of wea...
Performance Assessment through Bootstrap
- IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1997
"... A new performance evaluation paradigm for computer vision systems is proposed. In real situation, the complexity of the input data and/or of the computational procedure can make traditional error propagation methods infeasible. The new approach exploits a resampling technique recently introduced i ..."
Abstract
-
Cited by 34 (3 self)
- Add to MetaCart
A new performance evaluation paradigm for computer vision systems is proposed. In real situation, the complexity of the input data and/or of the computational procedure can make traditional error propagation methods infeasible. The new approach exploits a resampling technique recently introduced in statistics, the bootstrap. Distributions for the output variables are obtained by perturbing the nuisance properties of the input, i.e., properties with no relevance for the output under ideal conditions. From these bootstrap distributions, the confidence in the adequacy of the assumptions embedded into the computational procedure for the given input is derived. As an example, the new paradigm is applied to the task of edge detection. The performance of several edge detection methods is compared both for synthetic data and real images. The confidence in the output can be used to obtain an edgemap independent of the gradient magnitude.
Means and Averaging in the Group of Rotations
, 2002
"... In this paper we give precise definitions of different, properly invariant notions of mean or average rotation. Each mean is associated with a metric in SO(3). The metric induced from the Frobenius inner product gives rise to a mean rotation that is given by the closest special orthogonal matrix to ..."
Abstract
-
Cited by 34 (1 self)
- Add to MetaCart
In this paper we give precise definitions of different, properly invariant notions of mean or average rotation. Each mean is associated with a metric in SO(3). The metric induced from the Frobenius inner product gives rise to a mean rotation that is given by the closest special orthogonal matrix to the usual arithmetic mean of the given rotation matrices. The mean rotation associated with the intrinsic metric on SO(3) is the Riemannian center of mass of the given rotation matrices. We show that the Riemannian mean rotation shares many common features with the geometric mean of positive numbers and the geometric mean of positive Hermitian operators. We give some examples with closed-form solutions of both notions of mean.
MML clustering of multi-state, Poisson, von Mises circular and Gaussian distributions
- Statistics Computing
, 2000
"... Minimum Message Length (MML) is an invariant Bayesian point estimation technique which is also statistically consistent and efficient. We provide a brief overview of MML inductive inference ..."
Abstract
-
Cited by 29 (8 self)
- Add to MetaCart
Minimum Message Length (MML) is an invariant Bayesian point estimation technique which is also statistically consistent and efficient. We provide a brief overview of MML inductive inference
On Representing Edge Structure for Model Matching
- In CVPR
, 2001
"... We show how a novel, non-linear representation of edge structure can be used to improve the performance of model matching algorithms and object verification/recognition tasks. Rather than represent the image structure using intensity values or gradients, we use a measure which indicates the orientat ..."
Abstract
-
Cited by 28 (4 self)
- Add to MetaCart
We show how a novel, non-linear representation of edge structure can be used to improve the performance of model matching algorithms and object verification/recognition tasks. Rather than represent the image structure using intensity values or gradients, we use a measure which indicates the orientation of structures at each pixel, together with an indication of how reliable the orientation estimate is. Orientations in flat, noisy regions tend to be penalised whereas those near strong edges are favoured. We demonstrate that this representation leads to more accurate and reliable matching between models and new images, and leads to better recognition/verification of faces in an access control task.

