Continuous Levels‐of‐Detail and Visual Abstraction for Seamless Molecular Visualization

Molecular visualization is often challenged with rendering of large molecular structures in real time. We introduce a novel approach that enables us to show even large protein complexes. Our method is based on the level‐of‐detail concept, where we exploit three different abstractions combined in one visualization. Firstly, molecular surface abstraction exploits three different surfaces, solvent‐excluded surface (SES), Gaussian kernels and van der Waals spheres, combined as one surface by linear interpolation. Secondly, we introduce three shading abstraction levels and a method for creating seamless transitions between these representations. The SES representation with full shading and added contours stands in focus while on the other side a sphere representation of a cluster of atoms with constant shading and without contours provide the context. Thirdly, we propose a hierarchical abstraction based on a set of clusters formed on molecular atoms. All three abstraction models are driven by one importance function classifying the scene into the near‐, mid‐ and far‐field. Moreover, we introduce a methodology to render the entire molecule directly using the A‐buffer technique, which further improves the performance. The rendering performance is evaluated on series of molecules of varying atom counts.     

Panorama light‐field imaging

We present a novel approach to recording and computing panorama light fields. In contrast to previous methods that estimate panorama light fields from focal stacks or naive multi‐perspective image stitching, our approach is the first that processes ray entries directly and does not require depth reconstruction or matching of image features. Arbitrarily complex scenes can therefore be captured while preserving correct occlusion boundaries, anisotropic reflections, refractions, and other light effects that go beyond diffuse reflections of Lambertian surfaces.     

Learning Natural Colors for Image Recoloring

We present a data‐driven method for automatically recoloring a photo to enhance its appearance or change a viewer's emotional response to it. A compact representation called a RegionNet summarizes color and geometric features of image regions, and geometric relationships between them. Correlations between color property distributions and geometric features of regions are learned from a database of well‐colored photos. A probabilistic factor graph model is used to summarize distributions of color properties and generate an overall probability distribution for color suggestions. Given a new input image, we can generate multiple recolored results which unlike previous automatic results, are both natural and artistic, and compatible with their spatial arrangements.     

Pathline glyphs

Visualization of pathlines is common and highly relevant for the analysis of unsteady flow. However, pathlines can intersect, leading to visual clutter and perceptual issues. This makes it intrinsically difficult to provide expressive visualizations of the entire domain by an arrangement of multiple pathlines, in contrast to well‐established streamline placement techniques. We present an approach to reduce these problems. It is inspired by glyph‐based visualization and small multiples: we partition the domain into cells, each corresponding to a downscaled version of the entire domain. Inside these cells, a single downscaled pathline is drawn. On the overview scale, our pathline glyphs lead to emergent visual patterns that provide insight into time‐dependent flow behavior. Zooming‐in allows us to analyze individual pathlines in detail and compare neighboring lines. The overall approach is complemented with a context‐preserving zoom lens and interactive pathline‐based exploration. While we primarily target the visualization of 2D flow, we also address the extension to 3D. Our evaluation includes several examples, comparison to other flow visualization techniques, and a user study with domain experts.     

基于特征融合的核量化图像分类方法

局部特征和全局特征是图像的两种重要的特征描述,在图像分类时起着至关重要的作用。据此提出一种通过融合全局与局部特征核量化图像分类方法。首先,分析全局特征及局部特征各自优缺点,并对图像进行特征提取;其次,通过核方法将特征映射到适当的高维空间中,来进行码书的获取与量化,并进行特征的融合以更好地对图像进行描述;最后,采用基于直方图交叉核的支持向量机对获取的量化特征进行分类。通过实验证明了所提出的方法的可行性。     

Euclidean Distance Mapping for computing microstructural gradients at interfaces in composite materials

This paper presents an image analysis procedure using Euclidean Distance Mapping to compute microstructural gradients at interfaces in composite materials. This method is capable of producing phase distribution plots at single pixel strip width very quickly and efficiently. Compared to conventional dilation-subtraction strip analysis, the new method is faster, more flexible and is not constrained by feature geometry and boundary conditions. This allows for truly random and unbiased sampling. The new method was applied to investigate microstructural gradients at the interfacial transition zone (ITZ) of an ordinary Portland cement concrete. The average results show strong gradients in anhydrous cement and detectable porosity at the ITZ, but this is highly variable from location to location. The overall ITZ characteristics depend on the amount of calcium hydroxide deposited on aggregate particles. The new method was able to measure the effect of these calcium hydroxide deposits on the porosity gradient, which has not been reported before.     

基于MultiLayer水平集的脑MRI图像分割框架

提出了一种新的自动初始化水平集的方法和基于MultiLayer水平集的活动轮廓模型。该模型同时进行偏移场去除和图像分割,因此可以有效地克服灰度不均匀性的影响。最后利用了大脑皮层的距离信息,在框架中增加了厚度约束项。实验结果显示,相比著名的LBF模型,该框架不但可以获得更高的分割精度,而且分割时间也大大减少。     

低熵图像序列无损压缩

大规模的云渲染技术带来了大量的三维图形渲染数据。为了减小集群渲染产生的图像序列数据的传输以及存储代价,针对渲染图像序列低熵的特点,基于字典编码技术提出了降低数据局部复杂性的无损数据压缩方案。该方案通过数据重排技术来大大提高数据的局部冗余度,从而提高数据无损压缩效率。为了进一步解决大规模图像序列的压缩耗时问题,提出了一种云计算平台上的分布式图像压缩处理方案,充分利用现有云计算中Map/Reduce计算模型实现了分布式编码方案。实验结果证明,对于渲染产生的大规模低熵图像序列,提出的方案能够有效提高编码率并减少编码时间。     

快速鲁棒特征算法的CUDA加速优化

提出一种基于统一计算设备架构(Compute Unified Device Architecture,CUDA)的快速鲁棒特征(Speed-up Robust Feature,SURF)图像匹配算法。分析了SURF算法的并行性,在图像处理单元(Graphics Processing Unit,GPU)的线程映射和内存模型方面对算法的构建尺度空间、特征点提取、特征点主方向的确定、特征描述子的生成及特征匹配5个步骤进行CUDA加速优化。实验表明,相比适用于CPU的SURF算法,文中提出的适用于GPU的SURF算法在处理30MB的图片时性能提高了33倍。适用于GPU的SURF算法拓展了SURF算法在遥感等领域的快速应用,尤其是大影像的快速配准。