24,303 research outputs found
A Static Optimality Transformation with Applications to Planar Point Location
Over the last decade, there have been several data structures that, given a
planar subdivision and a probability distribution over the plane, provide a way
for answering point location queries that is fine-tuned for the distribution.
All these methods suffer from the requirement that the query distribution must
be known in advance.
We present a new data structure for point location queries in planar
triangulations. Our structure is asymptotically as fast as the optimal
structures, but it requires no prior information about the queries. This is a
2D analogue of the jump from Knuth's optimum binary search trees (discovered in
1971) to the splay trees of Sleator and Tarjan in 1985. While the former need
to know the query distribution, the latter are statically optimal. This means
that we can adapt to the query sequence and achieve the same asymptotic
performance as an optimum static structure, without needing any additional
information.Comment: 13 pages, 1 figure, a preliminary version appeared at SoCG 201
Bound and Conquer: Improving Triangulation by Enforcing Consistency
We study the accuracy of triangulation in multi-camera systems with respect
to the number of cameras. We show that, under certain conditions, the optimal
achievable reconstruction error decays quadratically as more cameras are added
to the system. Furthermore, we analyse the error decay-rate of major
state-of-the-art algorithms with respect to the number of cameras. To this end,
we introduce the notion of consistency for triangulation, and show that
consistent reconstruction algorithms achieve the optimal quadratic decay, which
is asymptotically faster than some other methods. Finally, we present
simulations results supporting our findings. Our simulations have been
implemented in MATLAB and the resulting code is available in the supplementary
material.Comment: 8 pages, 4 figures, Submitted to IEEE Transactions on Pattern
Analysis and Machine Intelligenc
Point triangulation through polyhedron collapse using the l∞ norm
Multi-camera triangulation of feature points based on a minimisation of the overall l(2) reprojection error can get stuck in suboptimal local minima or require slow global optimisation. For this reason, researchers have proposed optimising the l(infinity) norm of the l(2) single view reprojection errors, which avoids the problem of local minima entirely. In this paper we present a novel method for l(infinity) triangulation that minimizes the l(infinity) norm of the l(infinity) reprojection errors: this apparently small difference leads to a much faster but equally accurate solution which is related to the MLE under the assumption of uniform noise. The proposed method adopts a new optimisation strategy based on solving simple quadratic equations. This stands in contrast with the fastest existing methods, which solve a sequence of more complex auxiliary Linear Programming or Second Order Cone Problems. The proposed algorithm performs well: for triangulation, it achieves the same accuracy as existing techniques while executing faster and being straightforward to implement
Pre-processing for Triangulation of Probabilistic Networks
The currently most efficient algorithm for inference with a probabilistic
network builds upon a triangulation of a network's graph. In this paper, we
show that pre-processing can help in finding good triangulations
forprobabilistic networks, that is, triangulations with a minimal maximum
clique size. We provide a set of rules for stepwise reducing a graph, without
losing optimality. This reduction allows us to solve the triangulation problem
on a smaller graph. From the smaller graph's triangulation, a triangulation of
the original graph is obtained by reversing the reduction steps. Our
experimental results show that the graphs of some well-known real-life
probabilistic networks can be triangulated optimally just by preprocessing; for
other networks, huge reductions in their graph's size are obtained.Comment: Appears in Proceedings of the Seventeenth Conference on Uncertainty
in Artificial Intelligence (UAI2001
On Deletion in Delaunay Triangulation
This paper presents how the space of spheres and shelling may be used to
delete a point from a -dimensional triangulation efficiently. In dimension
two, if k is the degree of the deleted vertex, the complexity is O(k log k),
but we notice that this number only applies to low cost operations, while time
consuming computations are only done a linear number of times.
This algorithm may be viewed as a variation of Heller's algorithm, which is
popular in the geographic information system community. Unfortunately, Heller
algorithm is false, as explained in this paper.Comment: 15 pages 5 figures. in Proc. 15th Annu. ACM Sympos. Comput. Geom.,
181--188, 199
Fast Optimal Transport Averaging of Neuroimaging Data
Knowing how the Human brain is anatomically and functionally organized at the
level of a group of healthy individuals or patients is the primary goal of
neuroimaging research. Yet computing an average of brain imaging data defined
over a voxel grid or a triangulation remains a challenge. Data are large, the
geometry of the brain is complex and the between subjects variability leads to
spatially or temporally non-overlapping effects of interest. To address the
problem of variability, data are commonly smoothed before group linear
averaging. In this work we build on ideas originally introduced by Kantorovich
to propose a new algorithm that can average efficiently non-normalized data
defined over arbitrary discrete domains using transportation metrics. We show
how Kantorovich means can be linked to Wasserstein barycenters in order to take
advantage of an entropic smoothing approach. It leads to a smooth convex
optimization problem and an algorithm with strong convergence guarantees. We
illustrate the versatility of this tool and its empirical behavior on
functional neuroimaging data, functional MRI and magnetoencephalography (MEG)
source estimates, defined on voxel grids and triangulations of the folded
cortical surface.Comment: Information Processing in Medical Imaging (IPMI), Jun 2015, Isle of
Skye, United Kingdom. Springer, 201
- …