Assessment of local strain field in adhesive layer of an unsymmetrically repaired CFRP panel using digital image correlation

The present study focuses on experimental investigation of through the thickness displacement and strain field in thin adhesive layer in single sided (unsymmetrical) patch repaired CFRP (carbon fiber reinforced polymer) panel under tensile load. Digital image correlation (DIC) technique is employed to acquire the displacement and strain (longitudinal, peel and shear) field. Experimental determination of shear transfer length based on shear strain field obtained from DIC is introduced to estimate the optimum overlap length which is an essential parameter in patch design for the repair of CFRP structures. Further, DIC experiment with magnified optics is performed to get an insight into complex and localized strain field over thin adhesive layer especially at critical zones leading to damage initiation. The failure mechanism, load displacement behavior, damage initiation and propagation are closely monitored using DIC. The influence of patch edge tapering on strain distribution in adhesive layer is also investigated. The DIC successfully captures the global and localized strain field at critical zones over thin adhesive layer and further helps in monitoring the damage based on strain anomalies. Strains are found to have maximum magnitude at the patch overlap edge and the shear strain level in adhesive layer is higher than the peel strain. Normal tapering increases the peel strain and has negligible influence on shear strain level in adhesive layer. The recommended overlap length is found to be consistent with the recommendation in the literature. Whole field strain pattern and the overlap length obtained from experiment are further compared with the finite element analysis results and they appear to be in good coherence.     

Image Super-Resolution Based on Generative Adversarial Networks: A Brief Review

Single image super resolution (SISR) is an important research content in the field of computer vision and image processing. With the rapid development of deep neural networks, different image super-resolution models have emerged. Compared to some traditional SISR methods, deep learning-based methods can complete the superresolution tasks through a single image. In addition, compared with the SISR methods using traditional convolutional neural networks, SISR based on generative adversarial networks (GAN) has achieved the most advanced visual performance. In this review, we first explore the challenges faced by SISR and introduce some common datasets and evaluation metrics. Then, we review the improved network structures and loss functions of GAN-based perceptual SISR. Subsequently, the advantages and disadvantages of different networks are analyzed by multiple comparative experiments. Finally, we summarize the paper and look forward to the future development trends of GAN-based perceptual SISR.     

基于密集神经网络的灰度图像着色算法

针对在灰度图像着色领域中，传统算法信息提取率不高、着色效果不理想的问题，提出了基于密集神经网络的灰度图像着色算法，以实现改善着色效果，让人眼更好地观察图片信息的目的。利用密集神经网络的信息提取高效性，构建并训练了一个端到端的深度学习模型，对图像中的各类信息及特征进行提取。训练网络时与原图像进行对比，以逐渐减小网络输出结果的信息、分类等各类型的损失。训练完成后，只需向网络输入一张灰度图片，即可生成一张颜色饱满、鲜明逼真的彩色图片。实验结果表明，引入密集网络后，可有效改善着色过程中的漏色、细节信息损失、对比度低等问题，所提算法着色效果较基于VGG网络及U-Net、双流网络结构、残差网络（ResNet）等性能优异的先进着色算法而言取得了显著的改进。     

一种改进的颜色匹配对图像检索算法

以子块直方图彩色图像检索算法为基础， 分析了进一步利用图像空间相似信息的颜色匹配对检索算法的性能。在子块直方图的构成、直方图距离值的归类等方面提出了行之有效的改进方法；给出了子块大小、相似度阈值等参数选择的优化原则，使查准率、查全率等检索性能指标得到了较大的提高，得出了几个有用的结论并形成了实验系统。     

Adsp-21060的主机接口在实时图像处理中的应用

简要介绍了数字信号处理器Adsp 2 10 6 0和大规模可编程逻辑器件EP1K5 0。详细讨论了Adsp 2 10 6 0的主机接口工作模式以及一个实时图像跟踪处理器的硬件组成原理 ,在这个系统中EP1K5 0充当了主机。调试结果表明 ,所提出的硬件结构设计思想工作效率高 ,完全能够胜任实时图像处理的实际需要。     

一种分析碳酸盐岩孔隙系统数字图像的新方法

碳酸盐岩的孔隙类型多，孔径变化范围大，孔隙系统结构复杂，研究难度大。长期以来，是利用光学显微镜法、毛细管压力分析法、岩石孔隙系统复制法和图像分析仪法等方法或其中几种方法配合来研究碳酸盐岩孔隙系统。随着计算机图像技术的迅速发展和日益完善，借助该项技术通过碳酸盐岩孔隙系统数字图像来研究碳酸盐岩孔隙系统已经成为现实。文章提出一种研究碳酸盐岩孔隙系统数字图像的新方法。通过样品光薄片的光学显微镜（OM）数字图像和环境扫描电子显微镜（ESEM）数字图像二值化识别孔隙；构造孔隙度、孔隙贡献率和孔隙形状参数的计算公式用于数字图像分析，得到孔隙大小分布和孔隙形状分布。在此基础上，总结碳酸盐岩孔隙参数对其渗透率的控制作用。与传统的孔隙系统研究方法相比，该方法与计算机图像技术紧密结合，具有定量、快速的明显优势。     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.     

抵御已知/选择明文攻击的混沌图像加密算法

论文在对现有一类典型图像混沌加密算法的分析基础上,提出了一种改进的图像混沌加密算法。该算法引入小波变换,可以有效地克服一些混沌加密算法不能抵御已知/选择明文攻击的缺陷。     

彩色AC-PDP运动图像仿真系统的开发

开发了彩色AC-PDP运动图像仿真系统,通过利用本系统的运动图像仿真功能可以对现有的各种显示技术、与子场有关的各种因素进行仿真及比较,为人们开发提高彩色AC-PDP图像显示质量的新型技术及子场提供了理论上的依据;通过利用本系统的Gamma特性研究功能可以对彩色AC-PDP中视频信号的反Gamma特性进行研究,并对反Gamma相关编码进行子场逼近,为选择符合要求的子场编码提供了判据.     

刑事图像技术的应用与研究

刑事图像技术是刑事科学的重要组成部分：是检验、固定痕迹物证的一种方法。刑事图像的重大应用在于扩大人类的视野，显示肉眼看不到或看不清的重要细节，以便揭露和证实犯罪。