混合软影绘制算法

实时软影映射算法能够使用一张阴影映射图绘制出复杂动态场景的真实的软影效果.结合物体空间和图像空间的算法,提出一种在物体空间中提取面光源轮廓边的方法;然后利用面光源轮廓边的属性,提出一个在图像空间中确定轮廓边像素走向的方法;最后反投影拟合的轮廓边计算最终的几何可见性.实验结果表明,本文算法减少了提取轮廓边的消耗,提高了绘制效率;增加了拟合轮廓边的精度,提高了绘制效果.     

快速反投影软影绘制算法

针对已有的软阴影映射技术允许在使用一张阴影贴图的条件下对复杂的动态场景实时渲染出比较真实的软影,而在处理大面积软影时算法的执行效率不高的问题,通过创建一种新的边界存储结构,提出了一种快速软影生成算法.该算法是一种3遍算法:第一遍从光源中心计算场景的深度图;第二遍采用边缘提取算子对深度图进行滤波,找到所有可能的边界点;第...     

基于GPU的近似软影实时绘制

通过对阴影图算法进行扩展,提出一种完全基于GPU的近似软影实时绘制算法,它是一种3遍算法:第一遍从光源中心计算场景的深度图;第二遍采用几何着色器提取物体的轮廓边,同时在轮廓边上生成新的几何图元,利用硬件自动插值功能向外绘制线性近似半影图,并根据第一遍得到的深度图在像素着色器中对背面轮廓形成的半影区进行剔除;对于重叠的半影区设定片元的伪深度值,利用硬件进行自动融合.第三遍分别查询深度图和半影图,确定场景的本影区以及半影区中像素的亮度,从而得到面光源照射下场景的近似软影效果.     

多层阴影图轮廓边背投软影算法

在场景深度和物体分布复杂时,针对轮廓边背投软影算法中的可见性因子计算存在误差,从而导致过阴影和光渗等绘制瑕疵的问题,提出一种基于掩码的多层阴影图遮挡物轮廓边背投软影算法.该算法通过计算光源掩码的深度复杂函数获得更准确的可见性因子,解决了轮廓边背投软影算法中存在的过阴影问题;将光源掩码计算与多层阴影图结合以解决光渗问题,最终生成更高质量的光滑软影.实验结果表明,在保证绘制效率的前提下,文中算法可以产生更为准确、真实的软影效果.     

高质量快速百分比邻近滤波软影算法

在基于实时绘制的各种应用中,百分比邻近滤波软影算法可以高效地绘制视觉真实的软影效果.针对该算法中存在的3个主要问题,提出一种具有高质量阴影滤波的高效百分比邻近滤波软影算法.首先通过多尺度阴影图数据结构精简搜索区域,提升了遮挡物深度估计的正确性;然后使用基于GPU的线性四叉树遍历算法快速计算遮挡物平均深度,节省了大量的纹理采样开销,大大提高算法效率;最后采用光滑阴影滤波算法,解决了百分比邻近滤波算法中的走样瑕疵.将文中算法集成入多阴影图算法框架可以取得接近物理真实的软影效果.实验结果表明,该算法在效率和阴影质量方面均取得了显著的进步.     

基于轮廓拟合的新风格书法字合成

限于当前有限的数字书法资源,书法数据库中有时不一定有用户所需风格的书法字图像。针对这个问题,提出了基于两个书法字轮廓合成一系列具有中间风格的新书法字的方法。首先提取同一字不同风格的两个样本字的轮廓,接着用贝塞尔曲线拟合轮廓,再把矢量化轮廓字并归一化以获取可比性;然后,通过形状匹配法找到两个书法字对应的轮廓点对,选取关键点作为控制点,合成具有中间风格的书法字矢量轮廓;最后,用填充算法填充轮廓得到一个新风格的书法字。     

基于区域生长的鱼眼图像轮廓提取算法

以图像二值化为前提,使用基于区域生长的改进算法,获取图像轮廓,实现鱼眼图像校正,克服鱼眼图像轮廓区域内出现大量黑色像素使面积统计算法失效的缺点。仿真实验表明,该算法精度高、效率高,能够获得满意的校正结果。     

基于局部增强与区域拟合的活动轮廓模型

针对活动轮廓模型在分割弱边缘图像及严重的灰度不均匀图像方面存在轮廓曲线不能很好地演化到目标边界等问题,提出了一种基于局部增强与区域拟合的活动轮廓模型。首先,利用局部区域增强方法将原始图像转换为新图像,以增强图像的对比度。其次,利用统计信息计算图像的区域拟合能量。然后,加入正则项以避免演化轮廓重新初始化,提高图像分割效率。最后,通过灰度不均匀的合成图像和真实图像的实验,验证了该算法的有效性。     

基于边的自适应实时三维跟踪

针对缺乏纹理特征的物体,提出了一种基于边的自适应实时三维跟踪方法。在已知物体三维模型的情况下,通过基于历史运动信息的物体边缘检测与跟踪,可以有效准确地求解出摄像机的外参。基于并扩展了现有的基于边的实时跟踪算法,其主要工作体现在以下三个方面： 1）提出自适应阈值和基于历史信息估计当前帧的运动趋势的方法,从而提高边匹配算法在快速运动时的稳定性;2）提出一种基于随机抽样一致性（RANSAC）的边匹配策略,可以有效剔除误匹配的边,从而提高复杂模型的跟踪稳定性;3）利用抽取轮廓边的算法将边跟踪算法从CAD模型扩展到一般的面片模型。实验结果证明了该方法的鲁棒高效,能够满足增强现实、虚拟装配等应用需求。     

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

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

Variance Soft Shadow Mapping

We present variance soft shadow mapping (VSSM) for rendering plausible soft shadow in real‐time. VSSM is based on the theoretical framework of percentage‐closer soft shadows (PCSS) and exploits recent advances in variance shadow mapping (VSM). Our new formulation allows for the efficient computation of (average) blocker distances, a common bottleneck in PCSS‐based methods. Furthermore, we avoid incorrectly lit pixels commonly encountered in VSM‐based methods by appropriately subdividing the filter kernel. We demonstrate that VSSM renders high‐quality soft shadows efficiently (usually over 100 fps) for complex scene settings. Its speed is at least one order of magnitude faster than PCSS for large penumbra.     

Exponential Soft Shadow Mapping

In this paper we present an image‐based algorithm to render visually plausible anti‐aliased soft shadows in real time. Our technique employs a new shadow pre‐filtering method based on an extended exponential shadow mapping theory. The algorithm achieves faithful contact shadows by adopting an optimal approximation to exponential shadow reconstruction function. Benefiting from a novel overflow free summed area table tile grid data structure, numerical stability is guaranteed and error filtering response is avoided. By integrating an adaptive anisotropic filtering method, the proposed algorithm can produce high quality smooth shadows both in large penumbra areas and in high frequency sharp transitions, meanwhile guarantee cheap memory consumption and high performance.     

Revectorization-Based Soft Shadow Mapping

In this paper, we present revectorization-based soft shadow mapping, an algorithm that enables the rendering of visually plausible anti-aliased soft shadows in real time. In revectorization-based shadow mapping, shadow silhouettes are anti-aliased and filtered on the basis of a discontinuity space. By replacing the filtering step of the theoretical framework of the percentage-closer soft shadow algorithm by a revectorization-based filtering algorithm, we are able to provide anti-aliasing mainly for near contact shadows or small penumbra sizes generated from low-resolution shadow maps. Moreover, we present a screen-space variant of our technique that generates visually plausible soft shadows with an overhead of only in processing time, when compared to the fastest soft shadow algorithms proposed in the literature, but that introduces shadow overestimation artefacts in the final rendering.     

Stochastic Soft Shadow Mapping

In this paper, we extend the concept of pre‐filtered shadow mapping to stochastic rasterization, enabling real‐time rendering of soft shadows from planar area lights. Most existing soft shadow mapping methods lose important visibility information by relying on pinhole renderings from an area light source, providing plausible results only for small light sources. Since we sample the entire 4D shadow light field stochastically, we are able to closely approximate shadows of large area lights as well. In order to efficiently reconstruct smooth shadows from this sparse data, we exploit the analogy of soft shadow computation to rendering defocus blur, and introduce a multiplane pre‐filtering algorithm. We demonstrate how existing pre‐filterable approximations of the visibility function, such as variance shadow mapping, can be extended to four dimensions within our framework.     

High-Quality Adaptive Soft Shadow Mapping

The recent soft shadow mapping technique [ [GBP06] ] allows the rendering in real-time of convincing soft shadows on complex and dynamic scenes using a single shadow map. While attractive, this method suffers from shadow overestimation and becomes both expensive and approximate when dealing with large penumbrae. This paper proposes new solutions removing these limitations and hence providing an efficient and practical technique for soft shadow generation. First, we propose a new visibility computation procedure based on the detection of occluder contours, that is more accurate and faster while reducing aliasing. Secondly, we present a shadow map multi-resolution strategy keeping the computation complexity almost independent on the light size while maintaining high-quality rendering. Finally, we propose a view-dependent adaptive strategy, that automatically reduces the screen resolution in the region of large penumbrae, thus allowing us to keep very high frame rates in any situation.     

Packet-based Hierarchal Soft Shadow Mapping

Recent soft shadow mapping techniques based on back-projection can render high quality soft shadows in real time. However, real time high quality rendering of large penumbrae is still challenging, especially when multilayer shadow maps are used to reduce single light sample silhouette artifact. In this paper, we present an efficient algorithm to attack this problem. We first present a GPU-friendly packet-based approach rendering a packet of neighboring pixels together to amortize the cost of computing visibility factors. Then, we propose a hierarchical technique to quickly locate the contour edges, further reducing the computation cost. At last, we suggest a multi-view shadow map approach to reduce the single light sample artifact. We also demonstrate its higher image quality and higher efficiency compared to the existing depth peeling approaches.     

Soft Textured Shadow Volume

Efficiently computing robust soft shadows is a challenging and time consuming task. On the one hand, the quality of image-based shadows is inherently limited by the discrete property of their framework. On the other hand, object-based algorithms do not exhibit such discretization issues but they can only efficiently deal with triangles having a constant transmittance factor. This paper addresses this limitation. We propose a general algorithm for the computation of robust and accurate soft shadows for triangles with a spatially varying transmittance. We then show how this technique can be efficiently included into object-based soft shadow algorithms. This results in unified object-based frameworks for computing robust direct shadows for both standard and perforated triangles in fully animated scenes.     

三角形重建的几何阴影图算法

针对阴影图算法中的走样和深度偏移的问题,使用离散的场景原始三角面片来表示和记录阴影遮挡物的信息,提出一种几何阴影图算法.由于遮挡物的深度值能够通过这种原始的连续几何进行精确地重构,解决了透视走样和投影走样的问题;只需要一个相对较小、取值稳定的深度偏移值来获得较好的接触阴影效果,同时避免自阴影的问题;为了降低算法中三角形几何的冗余存储,提出一种基于GPU的几何缓存压缩算法作为算法的选项;最后使用一种打包的阴影计算算法来进一步降低算法的访存开销;为了解决几何信息不完整所造成的阴影瑕疵,对于这一类像素使用线性外插的算法来估计其深度值.实验结果表明,文中算法能够高效地绘制出高质量的阴影.