543 research outputs found
Pushing the Limits of 3D Color Printing: Error Diffusion with Translucent Materials
Accurate color reproduction is important in many applications of 3D printing,
from design prototypes to 3D color copies or portraits. Although full color is
available via other technologies, multi-jet printers have greater potential for
graphical 3D printing, in terms of reproducing complex appearance properties.
However, to date these printers cannot produce full color, and doing so poses
substantial technical challenges, from the shear amount of data to the
translucency of the available color materials. In this paper, we propose an
error diffusion halftoning approach to achieve full color with multi-jet
printers, which operates on multiple isosurfaces or layers within the object.
We propose a novel traversal algorithm for voxel surfaces, which allows the
transfer of existing error diffusion algorithms from 2D printing. The resulting
prints faithfully reproduce colors, color gradients and fine-scale details.Comment: 15 pages, 14 figures; includes supplemental figure
A Coloring Algorithm for Disambiguating Graph and Map Drawings
Drawings of non-planar graphs always result in edge crossings. When there are
many edges crossing at small angles, it is often difficult to follow these
edges, because of the multiple visual paths resulted from the crossings that
slow down eye movements. In this paper we propose an algorithm that
disambiguates the edges with automatic selection of distinctive colors. Our
proposed algorithm computes a near optimal color assignment of a dual collision
graph, using a novel branch-and-bound procedure applied to a space
decomposition of the color gamut. We give examples demonstrating the
effectiveness of this approach in clarifying drawings of real world graphs and
maps
Digital Color Imaging
This paper surveys current technology and research in the area of digital
color imaging. In order to establish the background and lay down terminology,
fundamental concepts of color perception and measurement are first presented
us-ing vector-space notation and terminology. Present-day color recording and
reproduction systems are reviewed along with the common mathematical models
used for representing these devices. Algorithms for processing color images for
display and communication are surveyed, and a forecast of research trends is
attempted. An extensive bibliography is provided
New software for comparing the color gamuts generated by printing technologies
In the color industry, it is vital to know the color gamut of a given device. Several tools for visualizing and comparing color gamuts are available but they each have some drawbacks. Therefore, the aim of this work was to develop and validate new software for comparing the color gamuts generated by printing devices; we also developed an automated color measurement system. The software simultaneously represents the gamuts in the 3D CIELAB space. It also calculates the Gamut Comparison Index and the volume using two algorithms (Convex Hull and Alpha Shapes). To evaluate the performance of our software, we first compared the results it obtained for the color gamuts with those from other comparison methods such as representation in the CIE 1931 chromaticity diagram or other color spaces. Next, we used Interactive Color Correction in 3 Dimensions (ICC3D) software to compare the gamut representations and volumes. Our software allowed us to identify differences between color gamuts that were not discriminated by other methods. This new software will enable the study and comparison of gamuts generated by different printing technologies and using different printing substrates, International Color Consortium profiles, inks, and light sources, thereby helping to achieve high quality color images.Optics Group (FQM151, University of Granada)University of Granada (pre-doctoral contract, Training Programme for Research Staff, FPU)Funding for open access charge: University of Granada/CBU
A multi-projector CAVE system with commodity hardware and gesture-based interaction
Spatially-immersive systems such as CAVEs provide users with surrounding worlds by projecting 3D models on multiple screens around the viewer. Compared to alternative immersive systems such as HMDs, CAVE systems are a powerful tool for collaborative inspection of virtual environments due to better use of peripheral vision, less sensitivity to tracking errors, and higher communication possibilities among users. Unfortunately, traditional CAVE setups require sophisticated equipment including stereo-ready projectors and tracking systems with high acquisition and maintenance costs. In this paper we present the design and construction of a passive-stereo, four-wall CAVE system based on commodity hardware. Our system works with any mix of a wide range of projector models that can be replaced independently at any time, and achieves high resolution and brightness at a minimum cost. The key ingredients of our CAVE are a self-calibration approach that guarantees continuity across the screen, as well as a gesture-based interaction approach based on a clever
combination of skeletal data from multiple Kinect sensors.Preprin
Patternshop: Editing Point Patterns by Image Manipulation
Point patterns are characterized by their density and correlation. While
spatial variation of density is well-understood, analysis and synthesis of
spatially-varying correlation is an open challenge. No tools are available to
intuitively edit such point patterns, primarily due to the lack of a compact
representation for spatially varying correlation. We propose a low-dimensional
perceptual embedding for point correlations. This embedding can map point
patterns to common three-channel raster images, enabling manipulation with
off-the-shelf image editing software. To synthesize back point patterns, we
propose a novel edge-aware objective that carefully handles sharp variations in
density and correlation. The resulting framework allows intuitive and
backward-compatible manipulation of point patterns, such as recoloring,
relighting to even texture synthesis that have not been available to 2D point
pattern design before. Effectiveness of our approach is tested in several user
experiments.Comment: 14 pages, 16 figure
Quasiconvex Programming
We define quasiconvex programming, a form of generalized linear programming
in which one seeks the point minimizing the pointwise maximum of a collection
of quasiconvex functions. We survey algorithms for solving quasiconvex programs
either numerically or via generalizations of the dual simplex method from
linear programming, and describe varied applications of this geometric
optimization technique in meshing, scientific computation, information
visualization, automated algorithm analysis, and robust statistics.Comment: 33 pages, 14 figure
Spectral methods for multimodal data analysis
Spectral methods have proven themselves as an important and versatile tool in a wide range of problems in the fields of computer graphics, machine learning, pattern recognition, and computer vision, where many important problems boil down to constructing a Laplacian operator and finding a few of its eigenvalues and eigenfunctions. Classical examples include the computation of diffusion distances on manifolds in computer graphics, Laplacian eigenmaps, and spectral clustering in machine learning. In many cases, one has to deal with multiple data spaces simultaneously. For example, clustering multimedia data in machine learning applications involves various modalities or ``views'' (e.g., text and images), and finding correspondence between shapes in computer graphics problems is an operation performed between two or more modalities. In this thesis, we develop a generalization of spectral methods to deal with multiple data spaces and apply them to problems from the domains of computer graphics, machine learning, and image processing. Our main construction is based on simultaneous diagonalization of Laplacian operators. We present an efficient numerical technique for computing joint approximate eigenvectors of two or more Laplacians in challenging noisy scenarios, which also appears to be the first general non-smooth manifold optimization method. Finally, we use the relation between joint approximate diagonalizability and approximate commutativity of operators to define a structural similarity measure for images. We use this measure to perform structure-preserving color manipulations of a given image
- …