摘要:
A mobile device having the capability of performing real-time location recognition with assistance from a server is provided. The approximate geophysical location of the mobile device is uploaded to the server. Based on the mobile device's approximate geophysical location, the server responds by sending the mobile device a message comprising a classifier and a set of feature descriptors. This can occur before an image is captured for visual querying. The classifier and feature descriptors are computed during an offline training stage using techniques to minimize computation at query time. The classifier and feature descriptors are used to perform visual recognition in real-time by performing the classification on the mobile device itself.
摘要:
A two-dimensional blur kernel is computed for a digital image by first estimating a sharp image from the digital image. The sharp image is derived from the digital image by sharpening at least portions of the digital image. The two-dimensional blur function is computed by minimizing an optimization algorithm that estimates the blur function.
摘要:
Multi-spline image blending technique embodiments are presented which generally employ a separate low-resolution offset field for every image region being blended, rather than a single (piecewise smooth) offset field for all the regions to produce a visually consistent blended image. Each of the individual offset fields is smoothly varying, and so is represented using a low-dimensional spline. A resulting linear system can be rapidly solved because it involves many fewer variables than the number of pixels being blended.
摘要:
Over the past few years there has been a dramatic proliferation of digital cameras, and it has become increasingly easy to share large numbers of photographs with many other people. These trends have contributed to the availability of large databases of photographs. Effectively organizing, browsing, and visualizing such .seas. of images, as well as finding a particular image, can be difficult tasks. In this paper, we demonstrate that knowledge of where images were taken and where they were pointed makes it possible to visualize large sets of photographs in powerful, intuitive new ways. We present and evaluate a set of novel tools that use location and orientation information, derived semi-automatically using structure from motion, to enhance the experience of exploring such large collections of images.
摘要:
A computer input device includes a camera for capturing an image of a pattern on a surface. A processor in the computer input device determines equations for lines from the image of the pattern, applies the line equations to a transform to form transformed line equations, and uses the transformed line equations to determine the height of the computer input device above the surface.
摘要:
The system of the invention aligns a set plural overlapping images useful in constructing a mosaic by performing patch-based alignment of the set of overlapping images to produce a set of warped images, performing block adjustment of the set of warped images to produce a set of block-adjusted images, and then performing pair-wise motion-based local warping of the set of block-adjusted images.
摘要:
The texture map construction method and apparatus of the invention constructs, from a set of overlapping images, a texture map divisible into plural faces. This is accomplished for each one of the plural faces by computing a texture mapping transform which maps between pixel locations in the texture map and a three-dimensional coordinate system. For each image of the set, an image transform is computed which maps between pixel locations in the image and the three-dimensional coordinate system. For each image of the set, the texture mapping transform and the image transform are combined to produce a texture map-to-image space transform mapping between pixel locations in the image and pixel locations in the texture map. For each one of the pixel locations in the one face of the texture map, the system computes from the texture map-to-image space transform a pixel value of a pixel location in the image corresponding to the one pixel location in the one face of the texture map. This produces a set of image pixel values from the set of overlapping images for the one pixel location in the texture space. Finally, the set of image pixel values are blended to produce a composite pixel value for the one pixel location in the one face of the texture map.
摘要:
A technology is described for performing structure from motion for unordered images of a scene with multiple object instances. An example method can include obtaining a pairwise match graph using interest point detection for obtaining interest points in images of the scene to identify pairwise image matches using the interest points. Multiple metric two-view and three-view partial reconstructions can be estimated by performing independent structure from motion computation on a plurality of match-pairs and match-triplets selected from the pairwise match graph. Pairwise image matches can be classified into correct matches and erroneous matches using expectation maximization to generate geometrically consistent match labeling hypotheses and a scoring function to evaluate the match labeling hypotheses. A structure from motion computation can then be performed on the subset of match pairs which have been inferred as correct.
摘要:
A two-dimensional blur kernel is computed for a digital image by first estimating a sharp image from the digital image. The sharp image is derived from the digital image by sharpening at least portions of the digital image. The two-dimensional blur function is computed by minimizing an optimization algorithm that estimates the blur function.
摘要:
A “Finite Element Preconditioner” provides locally adapted hierarchical basis functions for preconditioning large data optimization problems. For example, a few of the many typical graphics applications that make use of iterative optimization solutions include tone mapping, gradient domain blending, colorization, and scattered data interpolation. Preconditioning image data for such optimization problems allows those image optimization problems to be solved using less computational overhead and therefore to produce better quality image outputs with less computational overhead. The Finite Element Preconditioner evaluates data, such as image data, to adapt hierarchical basis functions to inhomogeneous problems for preconditioning large optimization problems. Specifically, the Finite Element Preconditioner evaluates the local structure of a coefficient matrix derived from the data and performs a recursive set of variable eliminations, combined with a simplification of the resulting coarse level problems to obtain bases better suited for problems with inhomogeneous (spatially varying) data, smoothness, and boundary constraints.