Efficient Example-Based Painting and Synthesis of 2D Directional Texture

We present a new method for converting a photo or image to a synthesized painting following the painting style of an example painting. Treating painting styles of brush strokes as sample textures, we reduce the problem of learning an example painting to a texture synthesis problem. The proposed method uses a hierarchical patch-based approach to the synthesis of directional textures. The key features of our method are: 1) Painting styles are represented as one or more blocks of sample textures selected by the user from the example painting; 2) image segmentation and brush stroke directions defined by the medial axis are used to better represent and communicate shapes and objects present in the synthesized painting; 3) image masks and a hierarchy of texture patches are used to efficiently synthesize high-quality directional textures. The synthesis process is further accelerated through texture direction quantization and the use of Gaussian pyramids. Our method has the following advantages: First, the synthesized stroke textures can follow a direction field determined by the shapes of regions to be painted. Second, the method is very efficient; the generation time of a synthesized painting ranges from a few seconds to about one minute, rather than hours, as required by other existing methods, on a commodity PC. Furthermore, the technique presented here provides a new and efficient solution to the problem of synthesizing a 2D directional texture. We use a number of test examples to demonstrate the efficiency of the proposed method and the high quality of results produced by the method.published_or_final_versio

FluoRender: An application of 2D image space methods for 3D and 4D confocal microscopy data visualization in neurobiology research

Journal Article2D image space methods are processing methods applied after the volumetric data are projected and rendered into the 2D image space, such as 2D filtering, tone mapping and compositing. In the application domain of volume visualization, most 2D image space methods can be carried out more efficiently than their 3D counterparts. Most importantly, 2D image space methods can be used to enhance volume visualization quality when applied together with volume rendering methods. In this paper, we present and discuss the applications of a series of 2D image space methods as enhancements to confocal microscopy visualizations, including 2D tone mapping, 2D compositing, and 2D color mapping. These methods are easily integrated with our existing confocal visualization tool, FluoRender, and the outcome is a full-featured visualization system that meets neurobiologists' demands for qualitative analysis of confocal microscopy data

Stroke Based Painterly Rendering

International audienceMany traditional art forms are produced by an artist sequentially placing a set of marks, such as brush strokes, on a canvas. Stroke based Rendering (SBR) is inspired by this process, and underpins many early and contemporary Artistic Stylization algorithms. This Chapter outlines the origins of SBR, and describes key algorithms for placement of brush strokes to create painterly renderings from source images. The chapter explores both local greedy, and global optimization based approaches to stroke placement. The issue of creative control in SBR is also briefly discussed

Content-aware photo collage using circle packing

published_or_final_versio

Hybrid Silhouette Detection for Real-Time Shadow Volume

In shadow volume, the most expensive computation is silhouette detection. In this paper, the triangular algorithm (TA) and visible-non-visible (VnV) algorithm that are famous algorithms to detect the outline of occluder are renewed. In this paper, we proposed a hybrid algorithm based on TA and VnV, namely Hybrid Silhouette Detection (HSD) algorithm. HSD is an improved algorithm that can recognize silhouette for generating real-time shadow volume. Our algorithm involves detecting silhouette and decreases the cost of implementation for shadow volume rendering. The last shadow volume algorithm using stencil buffer is rewritten and an algorithm for shadow volume using HSD with respect of culling invisible parts of scene is proposed. An accurate mathematical comparison between TA, VnV and HSD algorithms is undertaken. The obtained results confirm superiority of our proposed algorithm in terms of processing and rendering time. Our algorithm can be used in virtual environment to increase the frame per second and to enhance the realistic of games programming

Interactive ray tracing for volume visualization

Journal ArticleWe present a brute-force ray tracing system for interactive volume visualization, The system runs on a conventional (distributed) shared-memory multiprocessor machine. For each pixel we trace a ray through a volume to compute the color for that pixel. Although this method has high intrinsic computational cost, its simplicity and scalability make it ideal for large datasets on current high-end parallel systems