Satyan R. Coorg

Learn More
Three-dimensional (3-D) modeling of urban environments has numerous applications, including virtual environments, urban planning, and physical simulation. Constructing 3-D models from photographs (images) is thus an important area of research in computer vision, and increasingly, computer graphics. However, despite many years of research, a system that(More)
Extracting 3-dimensional structure from real-world imagery and rendering it from unrestricted viewpoints is an important problem in computer vision, and increasingly, computer graphics. Despite many years of research, a system that automatically recovers realistic 3-D models from images remains elusive; most practical systems require signiicant human input.(More)
We describe a dataset of several thousand calibrated, time-stamped, geo-referenced, high dynamic range color images, acquired under uncontrolled, variable illumination conditions in an outdoor region spanning several hundred meters. The image data is grouped into several regions which have little mutual inter-visibility. For each group, the calibration data(More)
We are developing a system to extract geodetic, tex-tured CAD models from thousands of initially uncontrolled , close-range ground and aerial images of urban scenes. Here we describe one component of the system , which operates after the imagery has been controlled or geo-referenced. This fully automatic component detects signiicant vertical facades in the(More)
We describe an algorithm for generating spherical mosaics from a collection of images acquired from a common optical center. The algorithm takes as input an arbitrary number of partially overlapping images, an adjacency map relating the images, initial estimates of the rotations relating each image to a specified base image, and approximate internal(More)
Suppose G = (V, E) is a graph in which every vertex v E V is associated with a cost c(v). This paper studies the weighted independent perfect domination problem on G, i.e., the problem of finding a subset D of V such that every vertex in V is equal or adjacent to exactly one vertex in D and ~{c(v) : v E D} is minimum. We give an O(IVIIEI) algorithm for the(More)