35,636 research outputs found
Discrepancy bounds for low-dimensional point sets
The class of -nets and -sequences, introduced in their most
general form by Niederreiter, are important examples of point sets and
sequences that are commonly used in quasi-Monte Carlo algorithms for
integration and approximation. Low-dimensional versions of -nets and
-sequences, such as Hammersley point sets and van der Corput sequences,
form important sub-classes, as they are interesting mathematical objects from a
theoretical point of view, and simultaneously serve as examples that make it
easier to understand the structural properties of -nets and
-sequences in arbitrary dimension. For these reasons, a considerable
number of papers have been written on the properties of low-dimensional nets
and sequences
Multidimensional sampling for simulation and integration: measures, discrepancies, and quasi-random numbers
This is basically a review of the field of Quasi-Monte Carlo intended for
computational physicists and other potential users of quasi-random numbers. As
such, much of the material is not new, but is presented here in a style
hopefully more accessible to physicists than the specialized mathematical
literature. There are also some new results: On the practical side we give
important empirical properties of large quasi-random point sets, especially the
exact quadratic discrepancies; on the theoretical side, there is the exact
distribution of quadratic discrepancy for random point sets.Comment: 51 pages. Full paper, including all figures also available at:
ftp://ftp.nikhef.nl/pub/preprints/96-017.ps.gz Accepted for publication in
Comp.Phys.Comm. Fixed some typos, corrected formula 108,figure 11 and table
Cell-based approach for 3D reconstruction from incomplete silhouettes
Shape-from-silhouettes is a widely adopted approach to compute accurate 3D reconstructions of people or objects in a multi-camera environment. However, such algorithms are traditionally very sensitive to errors in the silhouettes due to imperfect foreground-background estimation or occluding objects appearing in front of the object of interest. We propose a novel algorithm that is able to still provide high quality reconstruction from incomplete silhouettes. At the core of the method is the partitioning of reconstruction space in cells, i.e. regions with uniform camera and silhouette coverage properties. A set of rules is proposed to iteratively add cells to the reconstruction based on their potential to explain discrepancies between silhouettes in different cameras. Experimental analysis shows significantly improved F1-scores over standard leave-M-out reconstruction techniques
From van der Corput to modern constructions of sequences for quasi-Monte Carlo rules
In 1935 J.G. van der Corput introduced a sequence which has excellent uniform
distribution properties modulo 1. This sequence is based on a very simple
digital construction scheme with respect to the binary digit expansion.
Nowadays the van der Corput sequence, as it was named later, is the prototype
of many uniformly distributed sequences, also in the multi-dimensional case.
Such sequences are required as sample nodes in quasi-Monte Carlo algorithms,
which are deterministic variants of Monte Carlo rules for numerical
integration. Since its introduction many people have studied the van der Corput
sequence and generalizations thereof. This led to a huge number of results.
On the occasion of the 125th birthday of J.G. van der Corput we survey many
interesting results on van der Corput sequences and their generalizations. In
this way we move from van der Corput's ideas to the most modern constructions
of sequences for quasi-Monte Carlo rules, such as, e.g., generalized Halton
sequences or Niederreiter's -sequences
Termination of (many) 4-dimensional log flips
We prove that any sequence of 4-dimensional log flips that begins with a klt
pair (X,D) such that -(K+D) is numerically equivalent to an effective divisor,
terminates. This implies termination of flips that begin with a log Fano pair
and termination of flips in a relative birational setting. We also prove
termination of directed flips with big K+D. As a consequence, we prove
existence of minimal models of 4-dimensional dlt pairs of general type,
existence of 5-dimensional log flips, and rationality of Kodaira energy in
dimension 4.Comment: 13 pages; a minor change in the proof of Thm.4.
Improved ESP-index: a practical self-index for highly repetitive texts
While several self-indexes for highly repetitive texts exist, developing a
practical self-index applicable to real world repetitive texts remains a
challenge. ESP-index is a grammar-based self-index on the notion of
edit-sensitive parsing (ESP), an efficient parsing algorithm that guarantees
upper bounds of parsing discrepancies between different appearances of the same
subtexts in a text. Although ESP-index performs efficient top-down searches of
query texts, it has a serious issue on binary searches for finding appearances
of variables for a query text, which resulted in slowing down the query
searches. We present an improved ESP-index (ESP-index-I) by leveraging the idea
behind succinct data structures for large alphabets. While ESP-index-I keeps
the same types of efficiencies as ESP-index about the top-down searches, it
avoid the binary searches using fast rank/select operations. We experimentally
test ESP-index-I on the ability to search query texts and extract subtexts from
real world repetitive texts on a large-scale, and we show that ESP-index-I
performs better that other possible approaches.Comment: This is the full version of a proceeding accepted to the 11th
International Symposium on Experimental Algorithms (SEA2014
- …