融合阴影图和深度划分阴影体的阴影渲染算法

阴影图算法可以简单、快速地渲染硬阴影,但该算法渲染的硬阴影会在边缘区域出现锯齿状走样。受此影响,基于阴影图算法渲染的柔和阴影,在小尺寸半影区域依然可能会出现锯齿状走样。因此,要渲染无走样的柔和阴影,需要精确计算阴影边缘区域的着色点对点光源的可见性。深度划分阴影体算法可以精确地计算着色点对点光源的可见性,但其不仅在效率上不及阴影图算法,还无法实现柔和阴影渲染。针对上述问题,提出一种融合阴影图和深度划分阴影体的阴影渲染算法,对处于阴影边缘区域的着色点,使用深度划分阴影体算法精确计算该着色点对点光源的可见性;对其他着色点,使用阴影图算法快速计算该着色点对点光源的可见性。最后,将着色点的可见性值存储在可见性图中并滤波即可实现无走样柔和阴影的渲染。     

一种基于阴影图的实时软阴影算法

提出了一种基于阴影图技术的实时软阴影生成算法。首先为场景中遮挡物、接收面计算深度缓存,并离散遮挡物成许多微面;接着计算每个微面的阴影深度值,估计微面的可见度;最后计算微面半影范围,将软阴影图投影回场景中,得到实时软阴影。实验结果表明该算法对复杂物体在保证绘制视觉效果的同时,能达到令人满意的帧速率,从而为更复杂场景的实时软阴影绘制提供了有效的解决途径。     

利用反向投影实现的实时软阴影映射算法

基于阴影映射算法,提出一种利用反向投影实现的实时软阴影的新算法。算法对每个光源都产生对应的阴影图,使用阴影图作为对场景的离散化表示,引入可见因子来计算场景点的亮度信息,并采用GPU片元着色、层次阴影图、自适应精度等方法加速阴影渲染。实验表明,算法非常适合于实时渲染复杂、动态的场景,可以很好地处理遮挡物的融合,并且很容易在可编程图形硬件上实现。     

Rendering Soft Shadows using Multilayered Shadow Fins

Generating soft shadows in real time is difficult. Exact methods (such as ray tracing, and multiple light source simulation) are too slow, while approximate methods often overestimate the umbra regions. In this paper, we introduce a new algorithm based on the shadow map method to quickly and highly accurately render soft shadows produced by a light source. Our method builds inner and outer translucent fins on objects to represent the penumbra area inside and outside hard shadows, respectively. The fins are traced into multilayered light space maps to store illuminance adjustment to shadows. The viewing space illuminance buffer is then calculated using those maps. Finally, by blending illuminance and shading, a scene with highly accurate soft shadow effects is produced. Our method does not suffer from umbra overestimation. Physical relations between light, objects and shadows demonstrate the soundness of our approach.     

Predicted Virtual Soft Shadow Maps with High Quality Filtering

In this paper we present a novel image based algorithm to render visually plausible anti‐aliased soft shadows in a robust and efficient manner. To achieve both high visual quality and high performance, it employs an accurate shadow map filtering method which guarantees smooth penumbrae and high quality anisotropic anti‐aliasing of the sharp transitions. Unlike approaches based on pre‐filtering approximations, our approach does not suffer from light bleeding or losing contact shadows. Discretization artefacts are avoided by creating virtual shadow maps on the fly according to a novel shadow map resolution prediction model. This model takes into account the screen space frequency of the penumbrae via a perceptual metric which has been directly established from an appropriate user study. Consequently, our algorithm always generates shadow maps with minimal resolutions enabling high performance while guarantying high quality. Thanks to this perceptual model, our algorithm can sometimes be faster at rendering soft shadows than hard shadows. It can render game‐like scenes at very high frame rates, and extremely large and complex scenes such as CAD models at interactive rates. In addition, our algorithm is highly scalable, and the quality versus performance trade‐off can be easily tweaked.     

方差阴影图中的光渗现象消除算法

方差阴影图算法使用概率的方法计算像素被遮挡的上限概率,通过对深度图滤波的方法来有效地减少阴影图算法中的走样问题,但在深度比较复杂的场景中方差阴影图算法会出现光渗现象,即在应该是阴影的区域却有了亮度.文中使用最小-最大阴影图来辅助消除方差阴影图中的光渗现象,在对深度纹理进行滤波的同时生成一个最小-最大阴影图;在实时绘制场景时,利用最小-最大阴影图来辅助判断当前片元是否完全处在阴影区域内部,由此生成更真实、更准确的阴影.该算法可以很容易地添加到已有的方差阴影图算法的片元处理程序中,并且不会对原有阴影的柔和边界以及绘制的帧率产生影响.     

Fast,Sub‐pixel Antialiased Shadow Maps

Solving aliasing artifacts is an essential problem in shadow mapping approaches. Many works have been proposed, however, most of them focused on removing the texel‐level aliasing that results from the limited resolution of shadow maps. Little work has been done to solve the pixel‐level shadow aliasing that is produced by the rasterization on the screen plane. In this paper, we propose a fast, sub‐pixel antialiased shadowing algorithm to solve the pixel aliasing problem. Our work is based on the alias‐free shadow maps, which is capable of computing accurate per‐pixel shadow, and only incurs little cost to extend to sub‐pixel accuracy. Instead of direct supersampling the screen space, we take facets to approximate pixels in shadow testing. The shadowed area of one facet is rapidly evaluated by projecting blocker geometry onto a supersampled 2D occlusion mask with bitmasks fusion. It provides a sub‐pixel occlusion sampling so as to capture fine shadow details and features. Furthermore, we introduce the silhouette mask map that limits visibility evaluation to pixels only on the silhouette, which greatly reduces the computation cost. Our algorithm runs entirely on the GPU, achieving real‐time performance and is an order of magnitude faster than the brute‐force supersampling method to produce comparable 32× antialiased shadows.     

Compressed shadow maps

Shadow mapping has been subject to extensive investigation, but previous shadow map algorithms cannot usually generate high-quality shadows with a small memory footprint. In this paper, we present compressed shadow maps as a solution to this problem. A compressed shadow map reduces memory consumption by representing lit surfaces with endpoints of intermediate line segments as opposed to the conventional array-based pixel structures. Compressed shadow maps are only discretized in the vertical direction while the horizontal direction is represented by floating-point accuracy. The compression also helps with the shadow map self-shadowing problems. We compare our algorithm against all of the most popular shadow map algorithms and show, on average, order of magnitude improvements in storage requirements in our test scenes. The algorithm is simple to implement, can be added easily to existing software renderers, and lets us use graphics hardware for shadow visualization.     

Deep Opacity Maps

We present a new method for rapidly computing shadows from semi‐transparent objects like hair. Our deep opacity maps method extends the concept of opacity shadow maps by using a depth map to obtain a per pixel distribution of opacity layers. This approach eliminates the layering artifacts of opacity shadow maps and requires far fewer layers to achieve high quality shadow computation. Furthermore, it is faster than the density clustering technique, and produces less noise with comparable shadow quality. We provide qualitative comparisons to these previous methods and give performance results. Our algorithm is easy to implement, faster, and more memory efficient, enabling us to generate high quality hair shadows in real‐time using graphics hardware on a standard PC.     

深度剥离与GPU结合的近似软影算法

针对基于阴影图算法扩展的一些近似软影算法中存在的只考虑外半影区而导致的本影区过多估计的问题,提出了一种深度剥离与GPU结合的近似软影实时绘制算法。算法利用GPU的几何着色器来提取场景物体的轮廓边并生成内半影和外半影图元,进而得到整个内外半影颜色图和深度图,最终阴影绘制的时候通过参考阴影图和内外半影图来确定每个可见像素的明暗值,从而得到比以往算法较真实的绘制效果,算法完全在GPU中实现。实验结果表明,对相对不复杂的场景,该算法可以生成较真实的软影效果,且绘制帧率完全达到实时。     

基于可编程图形硬件的实时阴影算法及实现

阴影在增强三维场景真实感方面起着非常重要的作用。随着计算机图形硬件的发展,利用可编程图形硬件加速并提高渲染效果已经成为主要发展趋势。基于当前可编程图形硬件技术,针对目前shadow maps算法存在的问题,提出了一种根据场景特征程序自动生成合适偏移量的实时的阴影生成算法,该算法很好的改善了阴影渲染效果,防止了走样。最后给出了算法基于GLSL着色语言的实现代码。     

Light Space Cascaded Shadow Maps Algorithm for Real Time Rendering

Owing to its generality and efficiency.Cascaded Shadow Maps(CSMs) has an important role in real-time shadow rendering in large scale and complex virtual environments.However,CSMs suffers from redundant rendering problem—objects are rendered undesirably to different shadow map textures when view direction and light direction are not perpendicular.In this paper,we present a light space cascaded shadow maps algorithm.The algorithm splits a scene into non-intersecting layers in light space,and generates one shadow map for each layer through irregular frustum clipping and scene organization,ensuring that any shadow sample point never appears in multiple shadow maps.A succinct shadow determination method is given to choose the optimal shadow map when rendering scenes.We also combine the algorithm with stable cascaded shadow maps and soft shadow algorithm to avoid shadow flicking and produce soft shadows.The results show that the algorithm effectively improves the efficiency and shadow quality of CSMs by avoiding redundant rendering. and can produce high-quality shadow rendering in large scale dynamic environments with real-time performance.     

视野驱动的自适应阴影图

阴影图是当前实时阴影绘制中的一种经典算法。该算法基于图像空间,当有限分辨率的阴影图映射到较大场景中时,就会由于采样不足造成锯齿形变走样。提出了一种实时的反走样阴影图算法,该算法首先获取当前视点所能够看到的场景范围,然后绘制该范围内的阴影图,并映射到场景中生成实时阴影。该方法同经典的阴影图算法相比,避免了场景中不必要的阴影绘制,提高了阴影图的利用率,反走样的效果很好。而且,该方法只需要绘制一到两幅阴影图,算法的实时性很强,可以满足一个上百万面片的大规模场景中实时阴影绘制的需要。     

A quadratic spline approximation using detail multi-layer for soft shadow generation in augmented reality

Implementation of shadows is crucial to enhancement of images in AR environments. Without shadows, virtual objects would look floating over the scene resulting in unrealistic rendering of AR environments. Casting hard shadows would provide only spatial information while soft shadows help improve realism of AR environments. Several algorithms have been proposed to render realistic shadows which often incurred high computational costs. Little attention has been directed towards the balanced trade-off between shadow quality and computational costs. In this study, two approaches are proposed: Quadratic Spline Interpolation (QSI) to soften the outline of the shadow and Detail Multi-Layer (DML) technique to optimize the volume of computations for the generation of soft shadows based on real light sources. QSI estimates boarder hard shadow samples while DML involves three main phases: real light sources estimation, soft shadow production and reduction of the complexity of 3-Dimensional objects’ shadows. To be more precise, a reflective hemisphere is used to capture real light and to create an environment map. The Median Cut algorithm is implemented to locate the direction of real light sources on the environment map. Subsequently, the original hard shadows are retrieved and a sample of multilayer hard shadows is produced where each layer has its unique size and colour. These layers overlap to produce soft shadows based on the real light sources’ directions. Finally, the Level of Details (LOD) algorithm is implemented to increase the efficiency of soft shadows by decreasing the complexity of vertex transformations. The proposed technique is tested using three samples of multilayer hard shadows with varying numbers of light sources generated from the Median Cut algorithm. The experimental results show that the proposed technique successfully produces realistic soft shadows at low computational costs.     

结合区域配对的室外阴影检测

目的 针对现有大多数阴影检测算法在检测细长阴影、自阴影、区分阴影与暗色像素等方面的不足,提出一种新的结合区域配对的阴影检测算法.方法 首先通过均值漂移算法和canny检测算法,分割图像得到每个独立的区域;然后从每个区域中提取纹理和亮度建立单个区域的阴影模型,再从区域对中提取纹理直方图的距离、颜色比(分别在RGB和Lab空间下)以及HSI空间下H和I两通道的比值等特征建立区域对的阴影模型;最后根据上述两个模型运用图割理论检测阴影.结果 实验结果表明,本文算法在阴影检测上的准确率高达85.2%,远高于其他算法,检测速度也比其他算法快34%左右.该算法不仅能有效地检测细长阴影和自阴影,还能较好地区分阴影与暗色像素.结论 提出了一种新的阴影检测算法,通过区域配对的方法实时处理单幅室外图像.实验结果表明,该算法在检测细长阴影、自阴影以及区分阴影与暗色像素等方面有良好的效果.     

基于阴影图的阴影生成算法研究现状

阴影效果在计算机图形的真实感显示中非常重要,而阴影图算法又是阴影算法的主流.文中对阴影图算法展开了系统的研究,特别是对该领域近几年的发展进行综述,从阴影图数量、参数化和内容三个方面总结归纳了各类阴影图算法的基本思想、特点及其应用环境.综合考虑以上三个方面后对特定的场景选择合适的阴影图算法,除了选择场景外,还包括光源类型、内存消耗、实时性要求、硬件支持及特殊阴影要求等.最后结合当前的技术发展和应用需求展望了阴影图领域未来的研究方向.     

基于数据修正的实时阴影反走样算法

基于百分比渐近滤波（PCF）算法,提出一种改进的实时阴影反走样算法——数据修正PCF算法,其主要思想是在双线性插值滤波前对插值的数据进行必要的修正,从而消除阴影中的一些锯齿形走样现象．该算法利用像素渲染器PS2．0在图形硬件上实现．从实例图片可以看出,文中算法产生的许多阴影边界走样现象得到了明显的改善．     

Penumbra masks

Computation of physically-based shadows can be significantly accelerated by limiting computations into regions where penumbras appear. In this paper, we present a general penumbra detection method that efficiently bounds regions where penumbras occur in a shared projection plane of an area light source. We introduce a novel area filling operator, which allows effective and conservative area masking with respect to all viewpoints, i.e., sampling points within a planar polygonal light source. The area filling operator uses a point sprite rendering technique on a set of silhouette boundaries to create a penumbra mask, which is essentially a modified occlusion map. We show how to efficiently test the geometry and screen-space pixels against the penumbra mask. An important advantage of our method is that we can separate lit and umbra regions, and thus drive various soft shadow algorithms to focus their computational efforts into potential penumbras. Due to the relative simplicity of computations, penumbra masks can be efficiently generated with graphics hardware. As an example, we accelerate shadow map supersampling to demonstrate significant speedups that utilizations of penumbra masks provide.     

Filtering Multi‐Layer Shadow Maps for Accurate Soft Shadows

In this paper, we introduce a novel technique for pre‐filtering multi‐layer shadow maps. The occluders in the scene are stored as variable‐length lists of fragments for each texel. We show how this representation can be filtered by progressively merging these lists. In contrast to previous pre‐filtering techniques, our method better captures the distribution of depth values, resulting in a much higher shadow quality for overlapping occluders and occluders with different depths. The pre‐filtered maps are generated and evaluated directly on the GPU, and provide efficient queries for shadow tests with arbitrary filter sizes. Accurate soft shadows are rendered in real‐time even for complex scenes and difficult setups. Our results demonstrate that our pre‐filtered maps are general and particularly scalable.     

Tessellation‐Independent Smooth Shadow Boundaries

We propose an efficient and light‐weight solution for rendering smooth shadow boundaries that do not reveal the tessellation of the shadow‐casting geometry. Our algorithm reconstructs the smooth contours of the underlying mesh and then extrudes shadow volumes from the smooth silhouettes to render the shadows. For this purpose we propose an improved silhouette reconstruction using the vertex normals of the underlying smooth mesh. Then our method subdivides the silhouette loops until the contours are sufficiently smooth and project to smooth shadow boundaries. This approach decouples the shadow smoothness from the tessellation of the geometry and can be used to maintain equally high shadow quality for multiple LOD levels. It causes only a minimal change to the fill rate, which is the well‐known bottleneck of shadow volumes, and hence has only small overhead.