Extraction Of Feature Lines On Surface Meshes Based On Discrete Morse Theory

We present an approach for extracting extremal feature lines of scalar indicators on surface meshes, based on discrete Morse Theory. By computing initial Morse‐Smale complexes of the scalar indicators of the mesh, we obtain a candidate set of extremal feature lines of the surface. A hierarchy of Morse‐Smale complexes is computed by prioritizing feature lines according to a novel criterion and applying a cancellation procedure that allows us to select the most significant lines. Given the scalar indicators on the vertices of the mesh, the presented feature line extraction scheme is interpolation free and needs no derivative estimates. The technique is insensitive to noise and depends only on one parameter: the feature significance. We use the technique to extract surface features yielding impressive, non photorealistic images.     

Characterization for High Dynamic Range Imaging

In this paper we present a new practical camera characterization technique to improve color accuracy in high dynamic range (HDR) imaging. Camera characterization refers to the process of mapping device‐dependent signals, such as digital camera RAW images, into a well‐defined color space. This is a well‐understood process for low dynamic range (LDR) imaging and is part of most digital cameras — usually mapping from the raw camera signal to the sRGB or Adobe RGB color space. This paper presents an efficient and accurate characterization method for high dynamic range imaging that extends previous methods originally designed for LDR imaging. We demonstrate that our characterization method is very accurate even in unknown illumination conditions, effectively turning a digital camera into a measurement device that measures physically accurate radiance values — both in terms of luminance and color — rivaling more expensive measurement instruments.     

MC/DC Test Data Generation Algorithm Based on Whale Genetic Algorithm

The automatic generation of test data is a key step in realizing automated testing. Most automated testing tools for unit testing only provide test case execution drivers and cannot generate test data that meets coverage requirements. This paper presents an improved Whale Genetic Algorithm for generating test data required for unit testing MC/DC coverage. The proposed algorithm introduces an elite retention strategy to avoid the genetic algorithm from falling into iterative degradation. At the same time, the mutation threshold of the whale algorithm is introduced to balance the global exploration and local search capabilities of the genetic algorithm. The threshold is dynamically adjusted according to the diversity and evolution stage of current population, which positively guides the evolution of the population. Finally, an improved crossover strategy is proposed to accelerate the convergence of the algorithm. The improved whale genetic algorithm is compared with genetic algorithm, whale algorithm and particle swarm algorithm on two benchmark programs. The results show that the proposed algorithm is faster for test data generation than comparison methods and can provide better coverage with fewer evaluations, and has great advantages in generating test data.     

基于生成对抗网络的知识蒸馏数据增强

在图像分类和工业视觉检测过程中,缺陷样本量少导致神经网络分类器训练效率低及检测精度差,直接采用原始的离散标签又无法使网络分类器学习到不同类别间的相似度信息。针对上述问题,在区域丢弃算法的基础上,提出一种基于生成对抗网络的知识蒸馏数据增强算法。使用补丁对丢弃区域进行填补,减少区域丢弃产生的非信息噪声。在补丁生成网络中,保留生成对抗网络的编码器-解码器结构,利用编码器卷积层提取特征,通过解码器对特征图上采样生成补丁。在样本标签生成过程中,采用知识蒸馏算法中的教师-学生训练模式,按照交叉检验方式训练教师模型,根据教师模型生成的软标签对学生模型的训练进行指导,提高学生模型对特征的学习能力。实验结果表明,与区域丢弃算法相比,该算法在CIFAR-100、CIFAR-10数据集图像分类任务上的Top-1 Err、Top-5 Err分别降低3.1、0.8、0.5、0.6个百分点,在汽车转向器轴承数据集语义分割任务上的平均交并比和识别准确率分别提高2.8、2.3个百分点。     

Improving the SMAC atmospheric correction code by analysis of Meteosat Second Generation NDVI and surface reflectance data

In order to obtain high quality data, the correction of atmospheric perturbations acting upon land surface reflectance measurements recorded by a space-based sensor is an important topic within remote sensing. For many years the Second Simulation of the Satellite Signal in the Solar Spectrum (6S) radiative transfer model and the Simplified Method for Atmospheric Correction (SMAC) codes have been used for this atmospheric correction, but previous studies have shown that in a number of situations the quality of correction provided by the SMAC is low. This paper describes a method designed to improve the quality of the SMAC atmospheric correction algorithm through a slight increase in its computational complexity. Data gathered from the SEVIRI aboard Meteosat Second Generation (MSG) is used to validate the additions to SMAC, both by comparison to simulated data corrected using the highly accurate 6S method and by comparison to in-situ and 6S corrected SEVIRI data gathered for two field sites in Africa. The additions to the SMAC are found to greatly increase the quality of atmospheric correction performed, as well as broaden the range of atmospheric conditions under which the SMAC can be applied. When examining the Normalised Difference Vegetation Index (NDVI), the relative difference between SMAC and in-situ values decreases by 1.5% with the improvements in place. Similarly, the mean relative difference between SMAC and 6S reflectance values decreases by a mean of 13, 14.5 and 8.5% for Channels 1, 2 and 3 respectively. Furthermore, the processing speed of the SMAC is found to remain largely unaffected, with only a small increase in the time taken to process a full SEVIRI scene. Whilst the method described within this paper is only applicable to SEVIRI data, a similar approach can be applied to other data sources than SEVIRI, and should result in a similar accuracy improvement no matter which instrument supplies the original data.     

Algorithm,software, and hardware optimizations for Delaunay mesh generation on simultaneous multithreaded architectures

This article focuses on the optimization of PCDM, a parallel, two-dimensional (2D) Delaunay mesh generation application, and its interaction with parallel architectures based on simultaneous multithreading (SMT) processors. We first present the step-by-step effect of a series of optimizations on performance. These optimizations improve the performance of PCDM by up to a factor of six. They target issues that very often limit the performance of scientific computing codes. We then evaluate the interaction of PCDM with a real SMT-based SMP system, using both high-level metrics, such as execution time, and low-level information from hardware performance counters.     

军工软件测试管理与文档生成工具的研究与实现

本文从军工软件测试流程出发,探讨了军工测试管理与文档生成工具的研究与实现。文章首先对军工测试管理工具软件系统架构、软件设计模型进行分析,并以此为基础,对军工软件测试管理工具的服务器端、客户端、文档生成工具进行设计与实现。实现的军工软件测试管理与文档生成工具很大程度上解决了现有工具存在的中文本地化支持不好、测试用例管理不稳定、与现有军工测试流程不符、操作复杂、不能生成军工测试各阶段文档等问题,并已在实际的军工测试项目中得到广泛应用。     

Replica Exchange Light Transport

We solve the light transport problem by introducing a novel unbiased Monte Carlo algorithm called replica exchange light transport, inspired by the replica exchange Monte Carlo method in the fields of computational physics and statistical information processing. The replica exchange Monte Carlo method is a sampling technique whose operation resembles simulated annealing in optimization algorithms using a set of sampling distributions. We apply it to the solution of light transport integration by extending the probability density function of an integrand of the integration to a set of distributions. That set of distributions is composed of combinations of the path densities of different path generation types: uniform distributions in the integral domain, explicit and implicit paths in light (particle/photon) tracing, indirect paths in bidirectional path tracing, explicit and implicit paths in path tracing, and implicit caustics paths seen through specular surfaces including the delta function in path tracing. The replica‐exchange light transport algorithm generates a sequence of path samples from each distribution and samples the simultaneous distribution of those distributions as a stationary distribution by using the Markov chain Monte Carlo method. Then the algorithm combines the obtained path samples from each distribution using multiple importance sampling. We compare the images generated with our algorithm to those generated with bidirectional path tracing and Metropolis light transport based on the primary sample space. Our proposing algorithm has better convergence property than bidirectional path tracing and the Metropolis light transport, and it is easy to implement by extending the Metropolis light transport.     

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.