Results 1 
5 of
5
Photobook: ContentBased Manipulation of Image Databases
, 1995
"... We describe the Photobook system, which is a set of interactive tools for browsing and searching images and image sequences. These query tools differ from those used in standard image databases in that they make direct use of the image content rather than relying on text annotations. Direct search o ..."
Abstract

Cited by 463 (0 self)
 Add to MetaCart
We describe the Photobook system, which is a set of interactive tools for browsing and searching images and image sequences. These query tools differ from those used in standard image databases in that they make direct use of the image content rather than relying on text annotations. Direct search on image content is made possible by use of semanticspreserving image compression, which reduces images to a small set of perceptuallysignificant coefficients. We describe three types of Photobook descriptions in detail: one that allows search based on appearance, one that uses 2D shape, and a third that allows search based on textural properties. These image content descriptions can be combined with each other and with textbased descriptions to provide a sophisticated browsing and search capability. In this paper we demonstrate Photobook on databases containing images of people, video keyframes, hand tools, fish, texture swatches, and 3D medical data.
Convexity Problems on Meshes with Multiple Broadcasting
 Journal of Parallel and Distributed Computing
, 1992
"... Our contribution is twofold. First, we show that \Omega\Gammaat/ n) is a time lower bound on the CREWPRAM and the mesh with multiple broadcasting for the tasks of computing the perimeter, the area, the diameter, the width, the modality, the smallestarea enclosing rectangle, and the largestarea in ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
Our contribution is twofold. First, we show that \Omega\Gammaat/ n) is a time lower bound on the CREWPRAM and the mesh with multiple broadcasting for the tasks of computing the perimeter, the area, the diameter, the width, the modality, the smallestarea enclosing rectangle, and the largestarea inscribed triangle of a convex ngon. We show that the same time lower bound holds for the tasks of detecting whether a convex ngon lies inside another as well as for computing the maximum distance between two convex ngons. We obtain our time lower bound results for the CREWPRAM by using a novel technique involving geometric constructions. These constructions allow us to reduce the wellknown OR problem to each of the geometric problems of interest. We then port these time lower bounds to the mesh with multiple broadcasting using simulation results. Our second contribution is to show that the \Omega\Gammae/1 n) time lower bound is tight by providing O(log n) time algorithms to solve these p...
TimeOptimal NearestNeighbor Computations on Enhanced Meshes
 Proc. PARLE
, 1994
"... The AllNearest Neighbor problem (ANN, for short) is stated as follows: given a set S of points in the plane, determine for every point in S, a point that lies closest to it. The ANN problem is central to VLSI design, computer graphics, pattern recognition, and image processing, among others. In th ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
The AllNearest Neighbor problem (ANN, for short) is stated as follows: given a set S of points in the plane, determine for every point in S, a point that lies closest to it. The ANN problem is central to VLSI design, computer graphics, pattern recognition, and image processing, among others. In this paper we propose timeoptimal algorithms to solve the ANN problem for an arbitrary set of points in the plane and also for the special case in which the points are vertices of a convex polygon. Both our algorithms run on meshes with multiple broadcasting. We first establish an\Omega\Gamma/30 n) time lower bound for the task of solving an arbitrary npoint instance of the ANN problem, even if the points are the vertices of a convex polygon. This lower bound holds for both the CREWPRAM and for the mesh with multiple broadcasting. Next, we show that the bound is tight by exhibiting algorithms solving the problem in O(log n) time on a mesh with multiple broadcasting of size n \Theta n. Keyw...
Programmable Arithmetic Devices for High Speed Digital Signal Processing
"... The high throughput computation requirements of realtime digital signal processing (dsp) systems usually dictate hardware intensive solutions. Often attendant to hardware approaches are problems of high development costs, slow turnaround, susceptibility to errors, and difficulty in testing and debu ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The high throughput computation requirements of realtime digital signal processing (dsp) systems usually dictate hardware intensive solutions. Often attendant to hardware approaches are problems of high development costs, slow turnaround, susceptibility to errors, and difficulty in testing and debugging, all of which tend to inhibit the rapid implementation of such systems. Research is underway into the synthesis of application specific hardware to aid the system designer by automatically generating hardware that is "correct by construction". The creation of configurable, prefabricated hardware that has been designed for high speed computations forms part of this research and is the main topic of this thesis. This work contains a survey of some typical realtime dsp algorithms drawn from video and speech processing and summarizes the particular computation challenges posed by this class of algorithms. Currently available hardware choices and their tradeoffs and limitations are discu...
Photobook: ContentBased Manipulation of Image Databases
, 1994
"... We describe the Photobook system, which is a set of interactive tools for browsing and searching images and image sequences. These query tools differ from those used in standard image databases in that they make direct use of the image content rather than relying on text annotations. Direct search o ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We describe the Photobook system, which is a set of interactive tools for browsing and searching images and image sequences. These query tools differ from those used in standard image databases in that they make direct use of the image content rather than relying on text annotations. Direct search on image content is made possible by use of semanticspreserving image compression, which reduces images to a small set of perceptuallysignificant coefficients. We describe three types of Photobook descriptions in detail: one that allows search based on appearance, one that uses 2D shape, and a third that allows search based on textural properties. These image content descriptions can be combined with each other and with textbased descriptions to provide a sophisticated browsing and search capability. In this paper we demonstrate Photobook on databases containing images of people, video keyframes, hand tools, fish, texture swatches, and 3D medical data. 1 Introduction: The Problem Digita...