Digital Image Access & Retrieval

The 33th Annual Clinic on Library Applications of Data Processing, held at the University of Illinois at Urbana-Champaign in March of 1996, addressed the theme of "Digital Image Access & Retrieval." The papers from this conference cover a wide range of topics concerning digital imaging technology for visual resource collections. Papers covered three general areas: (1) systems, planning, and implementation; (2) automatic and semi-automatic indexing; and (3) preservation with the bulk of the conference focusing on indexing and retrieval.published or submitted for publicatio

Free To Be You and Me? Copyright and Constraint

Joseph P. Fishman’s Creating Around Copyright advances a provocative thesis: some restrictions on creativity can spur the development of additional creative solutions, and (some level of) copyright might be one of those restrictions. If Picasso was right that “forcing yourself to use restricted means is the sort of restraint that liberates invention,” then being forced by law to use restricted means might do the same thing, ultimately leading to more varied and thus more valuable works. At the outset, it’s important to know the baseline against which we ought to evaluate Fishman’s claims. Most copyright restrictionists, of whom I count myself one, don’t want to eliminate all copyright law. Fishman’s argument is directed at creators who want to take an existing work and do something with it — incorporate parts of it into a new creative work or make a derivative work based on it. Because the question is the proper scope of copyright as applied to these works, the comparison should not be to a world without copyright, but should instead focus on the marginal effects of expanding or contracting copyright’s definitions of substantial similarity and derivative works. Once the question is properly framed, I have concerns about the major analogies Fishman uses — patent law and experimental evidence about other types of constraints on creativity — as well as his model of the rational creator

Modal logics are coalgebraic

Applications of modal logics are abundant in computer science, and a large number of structurally different modal logics have been successfully employed in a diverse spectrum of application contexts. Coalgebraic semantics, on the other hand, provides a uniform and encompassing view on the large variety of specific logics used in particular domains. The coalgebraic approach is generic and compositional: tools and techniques simultaneously apply to a large class of application areas and can moreover be combined in a modular way. In particular, this facilitates a pick-and-choose approach to domain specific formalisms, applicable across the entire scope of application areas, leading to generic software tools that are easier to design, to implement, and to maintain. This paper substantiates the authors' firm belief that the systematic exploitation of the coalgebraic nature of modal logic will not only have impact on the field of modal logic itself but also lead to significant progress in a number of areas within computer science, such as knowledge representation and concurrency/mobility

Why walking the dog takes time: Frechet distance has no strongly subquadratic algorithms unless SETH fails

The Frechet distance is a well-studied and very popular measure of similarity of two curves. Many variants and extensions have been studied since Alt and Godau introduced this measure to computational geometry in 1991. Their original algorithm to compute the Frechet distance of two polygonal curves with n vertices has a runtime of O(n^2 log n). More than 20 years later, the state of the art algorithms for most variants still take time more than O(n^2 / log n), but no matching lower bounds are known, not even under reasonable complexity theoretic assumptions. To obtain a conditional lower bound, in this paper we assume the Strong Exponential Time Hypothesis or, more precisely, that there is no O*((2-delta)^N) algorithm for CNF-SAT for any delta > 0. Under this assumption we show that the Frechet distance cannot be computed in strongly subquadratic time, i.e., in time O(n^{2-delta}) for any delta > 0. This means that finding faster algorithms for the Frechet distance is as hard as finding faster CNF-SAT algorithms, and the existence of a strongly subquadratic algorithm can be considered unlikely. Our result holds for both the continuous and the discrete Frechet distance. We extend the main result in various directions. Based on the same assumption we (1) show non-existence of a strongly subquadratic 1.001-approximation, (2) present tight lower bounds in case the numbers of vertices of the two curves are imbalanced, and (3) examine realistic input assumptions (c-packed curves)

Computing the Similarity Between Moving Curves

In this paper we study similarity measures for moving curves which can, for example, model changing coastlines or retreating glacier termini. Points on a moving curve have two parameters, namely the position along the curve as well as time. We therefore focus on similarity measures for surfaces, specifically the Fr\'echet distance between surfaces. While the Fr\'echet distance between surfaces is not even known to be computable, we show for variants arising in the context of moving curves that they are polynomial-time solvable or NP-complete depending on the restrictions imposed on how the moving curves are matched. We achieve the polynomial-time solutions by a novel approach for computing a surface in the so-called free-space diagram based on max-flow min-cut duality

Spatially independent martingales, intersections, and applications

We define a class of random measures, spatially independent martingales, which we view as a natural generalisation of the canonical random discrete set, and which includes as special cases many variants of fractal percolation and Poissonian cut-outs. We pair the random measures with deterministic families of parametrised measures $\{\eta_t\}_t$, and show that under some natural checkable conditions, a.s. the total measure of the intersections is H\"older continuous as a function of $t$. This continuity phenomenon turns out to underpin a large amount of geometric information about these measures, allowing us to unify and substantially generalize a large number of existing results on the geometry of random Cantor sets and measures, as well as obtaining many new ones. Among other things, for large classes of random fractals we establish (a) very strong versions of the Marstrand-Mattila projection and slicing results, as well as dimension conservation, (b) slicing results with respect to algebraic curves and self-similar sets, (c) smoothness of convolutions of measures, including self-convolutions, and nonempty interior for sumsets, (d) rapid Fourier decay. Among other applications, we obtain an answer to a question of I. {\L}aba in connection to the restriction problem for fractal measures.Comment: 96 pages, 5 figures. v4: The definition of the metric changed in Section 8. Polishing notation and other small changes. All main results unchange