ACM Transactions on Graphics
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
Deep photoIn this paper, we introduce a novel system for browsing, enhancing, and manipulating casual outdoor photographs by combining them with already existing georeferenced digital terrain and urban models. A simple interactive registration process is used to align a photograph with such a model. Once the photograph and the model have been registered, an abundance of information, such as depth, t... ... hiện toàn bộ
ACM Transactions on Graphics - Tập 27 Số 5 - Trang 1-10 - 2008
Dehazing Using Color-LinesPhotographs of hazy scenes typically suffer having low contrast and offer a limited visibility of the scene. This article describes a new method for single-image dehazing that relies on a generic regularity in natural images where pixels of small image patches typically exhibit a 1D distribution in RGB color space, known as color-lines. We derive a local formation model that explains the c... ... hiện toàn bộ
ACM Transactions on Graphics - Tập 34 Số 1 - Trang 1-14 - 2014
Dyna
To look human, digital full-body avatars need to have soft-tissue deformations like those of real people. We learn a model of soft-tissue deformations from examples using a high-resolution 4D capture system and a method that accurately registers a template mesh to sequences of 3D scans. Using over 40,000 scans of ten subjects, we learn how soft-tissue motion causes mesh triang... ... hiện toàn bộ
ACM Transactions on Graphics - Tập 34 Số 4 - Trang 1-14 - 2015
Fitting B-spline curves to point clouds by curvature-based squared distance minimizationComputing a curve to approximate data points is a problem encountered frequently in many applications in computer graphics, computer vision, CAD/CAM, and image processing. We present a novel and efficient method, calledsquared distance minimization (SDM), for computing a planar B-spline curve, closed or open, to approximate a target shape defined by a... ... hiện toàn bộ
ACM Transactions on Graphics - Tập 25 Số 2 - Trang 214-238 - 2006
Image smoothing via L 0 gradient minimization
We present a new image editing method, particularly effective for sharpening major edges by increasing the steepness of transition while eliminating a manageable degree of low-amplitude structures. The seemingly contradictive effect is achieved in an optimization framework making use of
L
0
gra... ... hiện toàn bộ
ACM Transactions on Graphics - Tập 30 Số 6 - Trang 1-12 - 2011
Image deformation using moving least squaresWe provide an image deformation method based on Moving Least Squares using various classes of linear functions including affine, similarity and rigid transformations. These deformations are realistic and give the user the impression of manipulating real-world objects. We also allow the user to specify the deformations using either sets of points or line segments, the later useful for contr... ... hiện toàn bộ
ACM Transactions on Graphics - Tập 25 Số 3 - Trang 533-540 - 2006
Jigsaw image mosaicsThis paper introduces a new kind of mosaic, called Jigsaw Image Mosaic (JIM), where image tiles of arbitrary shape are used to compose the final picture. The generation of a Jigsaw Image Mosaic is a solution to the following problem: given an arbitrarily-shaped container image and a set of arbitrarily-shaped image tiles, fill the container as compactly as possible with tiles of similar col... ... hiện toàn bộ
ACM Transactions on Graphics - Tập 21 Số 3 - Trang 657-664 - 2002
Color harmonizationHarmonic colors are sets of colors that are aesthetically pleasing in terms of human visual perception. In this paper, we present a method that enhances the harmony among the colors of a given photograph or of a general image, while remaining faithful, as much as possible, to the original colors. Given a color image, our method finds the best harmonic scheme for the image colors. It then a... ... hiện toàn bộ
ACM Transactions on Graphics - Tập 25 Số 3 - Trang 624-630 - 2006
Drawing graphs nicely using simulated annealingThe paradigm of simulated annealing is applied to the problem of drawing graphs “nicely.” Our algorithm deals with general undirected graphs with straight-line edges, and employs several simple criteria for the aesthetic quality of the result. The algorithm is flexible, in that the relative weights of the criteria can be changed. For graphs of modest size it produces good results, competit... ... hiện toàn bộ
ACM Transactions on Graphics - Tập 15 Số 4 - Trang 301-331 - 1996
Data-driven structural priors for shape completionAcquiring 3D geometry of an object is a tedious and time-consuming task, typically requiring scanning the surface from multiple viewpoints. In this work we focus on reconstructing complete geometry from a single scan acquired with a low-quality consumer-level scanning device. Our method uses a collection of example 3D shapes to build structural part-based priors that are necessary to compl... ... hiện toàn bộ
ACM Transactions on Graphics - Tập 34 Số 6 - Trang 1-11 - 2015
Tổng số: 50
- 1
- 2
- 3
- 4
- 5