14,561 research outputs found
Hypergraph Modelling for Geometric Model Fitting
In this paper, we propose a novel hypergraph based method (called HF) to fit
and segment multi-structural data. The proposed HF formulates the geometric
model fitting problem as a hypergraph partition problem based on a novel
hypergraph model. In the hypergraph model, vertices represent data points and
hyperedges denote model hypotheses. The hypergraph, with large and
"data-determined" degrees of hyperedges, can express the complex relationships
between model hypotheses and data points. In addition, we develop a robust
hypergraph partition algorithm to detect sub-hypergraphs for model fitting. HF
can effectively and efficiently estimate the number of, and the parameters of,
model instances in multi-structural data heavily corrupted with outliers
simultaneously. Experimental results show the advantages of the proposed method
over previous methods on both synthetic data and real images.Comment: Pattern Recognition, 201
Unsupervised Learning via Mixtures of Skewed Distributions with Hypercube Contours
Mixture models whose components have skewed hypercube contours are developed
via a generalization of the multivariate shifted asymmetric Laplace density.
Specifically, we develop mixtures of multiple scaled shifted asymmetric Laplace
distributions. The component densities have two unique features: they include a
multivariate weight function, and the marginal distributions are also
asymmetric Laplace. We use these mixtures of multiple scaled shifted asymmetric
Laplace distributions for clustering applications, but they could equally well
be used in the supervised or semi-supervised paradigms. The
expectation-maximization algorithm is used for parameter estimation and the
Bayesian information criterion is used for model selection. Simulated and real
data sets are used to illustrate the approach and, in some cases, to visualize
the skewed hypercube structure of the components
Spatial Guilds in the Serengeti Food Web Revealed by a Bayesian Group Model
Food webs, networks of feeding relationships among organisms, provide
fundamental insights into mechanisms that determine ecosystem stability and
persistence. Despite long-standing interest in the compartmental structure of
food webs, past network analyses of food webs have been constrained by a
standard definition of compartments, or modules, that requires many links
within compartments and few links between them. Empirical analyses have been
further limited by low-resolution data for primary producers. In this paper, we
present a Bayesian computational method for identifying group structure in food
webs using a flexible definition of a group that can describe both functional
roles and standard compartments. The Serengeti ecosystem provides an
opportunity to examine structure in a newly compiled food web that includes
species-level resolution among plants, allowing us to address whether groups in
the food web correspond to tightly-connected compartments or functional groups,
and whether network structure reflects spatial or trophic organization, or a
combination of the two. We have compiled the major mammalian and plant
components of the Serengeti food web from published literature, and we infer
its group structure using our method. We find that network structure
corresponds to spatially distinct plant groups coupled at higher trophic levels
by groups of herbivores, which are in turn coupled by carnivore groups. Thus
the group structure of the Serengeti web represents a mixture of trophic guild
structure and spatial patterns, in contrast to the standard compartments
typically identified in ecological networks. From data consisting only of nodes
and links, the group structure that emerges supports recent ideas on spatial
coupling and energy channels in ecosystems that have been proposed as important
for persistence.Comment: 28 pages, 6 figures (+ 3 supporting), 2 tables (+ 4 supporting
Robust Motion Segmentation from Pairwise Matches
In this paper we address a classification problem that has not been
considered before, namely motion segmentation given pairwise matches only. Our
contribution to this unexplored task is a novel formulation of motion
segmentation as a two-step process. First, motion segmentation is performed on
image pairs independently. Secondly, we combine independent pairwise
segmentation results in a robust way into the final globally consistent
segmentation. Our approach is inspired by the success of averaging methods. We
demonstrate in simulated as well as in real experiments that our method is very
effective in reducing the errors in the pairwise motion segmentation and can
cope with large number of mismatches
Multiple structure recovery via robust preference analysis
2noThis paper address the extraction of multiple models from outlier-contaminated data by exploiting preference analysis and low rank approximation. First points are represented in the preference space, then Robust PCA (Principal Component Analysis) and Symmetric NMF (Non negative Matrix Factorization) are used to break the multi-model fitting problem into many single-model problems, which in turn are tackled with an approach inspired to MSAC (M-estimator SAmple Consensus) coupled with a model-specific scale estimate. Experimental validation on public, real data-sets demonstrates that our method compares favorably with the state of the art.openopenMagri, Luca; Fusiello, AndreaMagri, Luca; Fusiello, Andre
Multiple structure recovery with maximum coverage
We present a general framework for geometric model fitting based on a set coverage formulation that caters for intersecting structures and outliers in a simple and principled manner. The multi-model fitting problem is formulated in terms of the optimization of a consensus-based global cost function, which allows to sidestep the pitfalls of preference approaches based on clustering and to avoid the difficult trade-off between data fidelity and complexity of other optimization formulations. Two especially appealing characteristics of this method are the ease with which it can be implemented and its modularity with respect to the solver and to the sampling strategy. Few intelligible parameters need to be set and tuned, namely the inlier threshold and the number of desired models. The summary of the experiments is that our method compares favourably with its competitors overall, and it is always either the best performer or almost on par with the best performer in specific scenarios
Plane-extraction from depth-data using a Gaussian mixture regression model
We propose a novel algorithm for unsupervised extraction of piecewise planar
models from depth-data. Among other applications, such models are a good way of
enabling autonomous agents (robots, cars, drones, etc.) to effectively perceive
their surroundings and to navigate in three dimensions. We propose to do this
by fitting the data with a piecewise-linear Gaussian mixture regression model
whose components are skewed over planes, making them flat in appearance rather
than being ellipsoidal, by embedding an outlier-trimming process that is
formally incorporated into the proposed expectation-maximization algorithm, and
by selectively fusing contiguous, coplanar components. Part of our motivation
is an attempt to estimate more accurate plane-extraction by allowing each model
component to make use of all available data through probabilistic clustering.
The algorithm is thoroughly evaluated against a standard benchmark and is shown
to rank among the best of the existing state-of-the-art methods.Comment: 11 pages, 2 figures, 1 tabl
- …