Learn More
We present a novel method for content-aware image resizing based on optimization of a well-defined image distance function, which preserves both the important regions and the global visual effect (the background or other decorative objects) of an image. The method operates by joint use of seam carving and image scaling. The principle behind our method is(More)
This paper presents a novel tree-based cost aggregation method for dense stereo matching. Instead of employing the minimum spanning tree (MST) and its variants, a new tree structure, " Segment-Tree " , is proposed for non-local matching cost aggregation. Conceptually, the segment-tree is constructed in a three-step process: first, the pixels are grouped(More)
One significant problem in tile-based texture synthesis is the presence of conspicuous seams in the tiles. The reason is that the sample patches employed as primary patterns of the tile set may not be well stitched if carelessly picked. In this paper, we introduce an optimized approach that can stably generate an ω-tile set of high pattern diversity(More)
In this paper, we address the following research problem: How can we generate a meaningful split grammar that explains a given facade layout? To evaluate if a grammar is meaningful, we propose a cost function based on the description length and minimize this cost using an approximate dynamic programming framework. Our evaluation indicates that our framework(More)
Rendering the structural color of natural objects or modern industrial products in the 3D environment is not possible with RGB-based graphics platforms and software and very time consuming, even with the most efficient spectra representation based methods previously proposed. Our framework allows computing full spectra light object interactions only when it(More)
One significant problem in tile-based texture synthesis is the selection of sample patches. The reason is that the tiling process may produce results with poor quality when the sample patches used to fill the tiles can not find good cutting pathes at the merging stage. In this paper, we use Genetic Algorithm to find the best group of sample patches from a(More)
This paper presents an effective method that simulates the ink diffusion process with visual plausible effects and real-time performance. Our algorithm updates the dynamic ink volume with a hybrid grid-particle representation: the fluid velocity field is calculated with a low-resolution grid structure, while the highly detailed ink effects are controlled(More)