224,488 research outputs found

    Data Structure Lower Bounds for Document Indexing Problems

    Get PDF
    We study data structure problems related to document indexing and pattern matching queries and our main contribution is to show that the pointer machine model of computation can be extremely useful in proving high and unconditional lower bounds that cannot be obtained in any other known model of computation with the current techniques. Often our lower bounds match the known space-query time trade-off curve and in fact for all the problems considered, there is a very good and reasonable match between the our lower bounds and the known upper bounds, at least for some choice of input parameters. The problems that we consider are set intersection queries (both the reporting variant and the semi-group counting variant), indexing a set of documents for two-pattern queries, or forbidden- pattern queries, or queries with wild-cards, and indexing an input set of gapped-patterns (or two-patterns) to find those matching a document given at the query time.Comment: Full version of the conference version that appeared at ICALP 2016, 25 page

    Hallucinating optimal high-dimensional subspaces

    Full text link
    Linear subspace representations of appearance variation are pervasive in computer vision. This paper addresses the problem of robustly matching such subspaces (computing the similarity between them) when they are used to describe the scope of variations within sets of images of different (possibly greatly so) scales. A naive solution of projecting the low-scale subspace into the high-scale image space is described first and subsequently shown to be inadequate, especially at large scale discrepancies. A successful approach is proposed instead. It consists of (i) an interpolated projection of the low-scale subspace into the high-scale space, which is followed by (ii) a rotation of this initial estimate within the bounds of the imposed ``downsampling constraint''. The optimal rotation is found in the closed-form which best aligns the high-scale reconstruction of the low-scale subspace with the reference it is compared to. The method is evaluated on the problem of matching sets of (i) face appearances under varying illumination and (ii) object appearances under varying viewpoint, using two large data sets. In comparison to the naive matching, the proposed algorithm is shown to greatly increase the separation of between-class and within-class similarities, as well as produce far more meaningful modes of common appearance on which the match score is based.Comment: Pattern Recognition, 201

    Volume Holographic Hyperspectral Imaging

    Get PDF
    A volume hologram has two degenerate Bragg-phase-matching dimensions and provides the capability of volume holographic imaging. We demonstrate two volume holographic imaging architectures and investigate their imaging resolution, aberration, and sensitivity. The first architecture uses the hologram directly as an objective imaging element where strong aberration is observed and confirmed by simulation. The second architecture uses an imaging lens and a transmission geometry hologram to achieve linear two-dimensional optical sectioning and imaging of a four-dimensional (spatial plus spectral dimensions) object hyperspace. Multiplexed holograms can achieve simultaneously three-dimensional imaging of an object without a scanning mechanism

    A Dialogue of Multipoles: Matched Asymptotic Expansion for Caged Black Holes

    Full text link
    No analytic solution is known to date for a black hole in a compact dimension. We develop an analytic perturbation theory where the small parameter is the size of the black hole relative to the size of the compact dimension. We set up a general procedure for an arbitrary order in the perturbation series based on an asymptotic matched expansion between two coordinate patches: the near horizon zone and the asymptotic zone. The procedure is ordinary perturbation expansion in each zone, where additionally some boundary data comes from the other zone, and so the procedure alternates between the zones. It can be viewed as a dialogue of multipoles where the black hole changes its shape (mass multipoles) in response to the field (multipoles) created by its periodic "mirrors", and that in turn changes its field and so on. We present the leading correction to the full metric including the first correction to the area-temperature relation, the leading term for black hole eccentricity and the "Archimedes effect". The next order corrections will appear in a sequel. On the way we determine independently the static perturbations of the Schwarzschild black hole in dimension d>=5, where the system of equations can be reduced to "a master equation" - a single ordinary differential equation. The solutions are hypergeometric functions which in some cases reduce to polynomials.Comment: 47 pages, 12 figures, minor corrections described at the end of the introductio
    • …
    corecore