Non-chaotic and chaotic propagation of stationary and dynamic images through MVKS turbulence

Anisoplanatic electromagnetic (EM) propagation across a turbulent atmosphere has been recently examined for an unmodulated carrier propagating over an image-bearing transparency through optical lensing, and for the embedded information inside a carrier recovered using heterodyning and digital demodulation. Carrier modulation yielded better recovery than simple lens-based imaging. A possible mitigation strategy is proposed whereby the image information is encrypted on an RF chaotic carrier, thereafter secondarily embedded onto an optical carrier. Results based on the modified von Karman (MVKS) and the Hufnagel-Valley (H-V) models showed that the signal/image recovery under turbulence is improved compared with non-chaotic propagation. The case of time-varying/dynamic images is also taken up; it is demonstrated via cross-correlation products that turbulence is mitigated by the use of chaotic carrier encryption. Overall, transmission via chaos offers mitigation against distortions due to turbulence along with the security feature inherent via the chaos keys which prevent signal recovery without key-matching.     

Road Extraction from High Resolution Remote Sensing Image based on Shape Analysis with Gestalt Theory

Simulating the psychological experience of human vision，a road extraction model based on the format tower is proposed to extract the road in the high resolution remote sensing image from the perspective of morphology.Firstly，based on the spectral and texture information，the suspected road targets are extracted by using segmentation technology.Then these targets are classified according to their reliability and extract the road targets for each category.Finally，three types of identified road information are verified and merged，and the continuous smooth road extraction results are obtained.Experiments on real high resolution images show that the results are consistent with the visual perception of the human eye，and the overall classification accuracy is higher，indicating that the algorithm is effective and feasible and has good use value.     

基于颜色四通道及空间金字塔的鱼类图像检索

随着计算机视觉技术在海洋水产领域中的应用不断加深，鱼类图像检索在渔业资源调查、鱼类行为学分析等方面发挥了巨大的作用。通过研究发现，鱼类图像的背景信息会对鱼类图像检索造成极大干扰，而且鱼类图像中颜色、纹理、形状等特征由于空间位置信息的缺乏而使检索的准确率不高。为解决以上问题，提出了一种新的基于颜色四通道及空间金字塔的鱼类图像检索算法。首先，提取视觉显著性图将鱼类图像的前景和背景分开，从而减少图像背景对检索的干扰；其次，为了使图像特征包含一定的空间位置信息，利用空间金字塔的理论对图像进行分割，在此基础上，将图像转为HSVG四通道图并提取SURF特征；；最后，得到检索结果。为验证所提算法的有效性，在QUT_fish_data数据集和DLOU_fish_data数据集上对算法的查全率、查准率与经典的HSVG算法和显著性分块算法进行对比：在两个数据集上查准率分别比传统的HSVG算法最多分别提高12%和5%，查全率最多分别提高7%和22%；比传统的显著性分块算法查准率最多分别提高15%和5%，查全率最多分别提高36%和22%；从而证明所提算法是有效的，能有效提升鱼类图像的检索效果。     

Sparse non-convex Lp regularization for cone-beam X-ray luminescence computed tomography

Cone-beam X-ray luminescence computed tomography (CB-XLCT) is an attractive hybrid imaging modality, and it has the potential of monitoring the metabolic processes of nanophosphors-based drugs in vivo. However, the XLCT imaging suffers from a severe ill-posed problem. In this work, a sparse nonconvex L_p (0?p?L₁ regularization. Further, an iteratively reweighted split augmented lagrangian shrinkage algorithm (IRW_SALSA-L_p) was proposed to efficiently solve the non-convex L_p (0?p?p-values (1/16, 1/8, 1/4, 3/8, 1/2, 5/8, 3/4, 7/8) in both 3D digital mouse experiments and in vivo experiments. The results demonstrate that the proposed non-convex methods outperform L₂ and L₁ regularization in accurately recovering sparse targets in CB-XLCT. And among all the non-convex p-values, our L_p(1/4?p?相似文献   

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）等性能优异的先进着色算法而言取得了显著的改进。     

GIS在深圳市三防指挥信息系统中的应用

深圳市三防指挥信息系统利用GIS技术,结合水利(水务)、防汛、抗旱的具体业务,建立了水情遥测数据处 理分系统、工况监测数据处理分系统、水务行业三防信息管理分系统、决策支持分系统、水源优化调度分 系统,提高了现代化管理水平。     

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

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

A Lattice Approach to Image Segmentation

After a formal definition of segmentation as the largest partition of the space according to a criterion σ and a function f, the notion of a morphological connection is reminded. It is used as an input to a central theorem of the paper (Theorem 8), that identifies segmentation with the connections that are based on connective criteria. Just as connections, the segmentations can then be regrouped by suprema and infima. The generality of the theorem makes it valid for functions from any space to any other one. Two propositions make precise the AND and OR combinations of connective criteria. The soundness of the approach is demonstrated by listing a series of segmentation techniques. One considers first the cases when the segmentation under study does not involve initial seeds. Various modes of regularity are discussed, which all derive from Lipschitz functions. A second category of examples involves the presence of seeds around which the partition of the space is organized. An overall proposition shows that these examples are a matter for the central theorem. Watershed and jump connection based segmentations illustrate this type of situation. The third and last category of examples deals with cases when the segmentation occurs in an indirect space, such as an histogram, and is then projected back on the actual space under study. The relationships between filtering and segmentation are then investigated. A theoretical chapter introduces and studies the two notions of a pulse opening and of a connected operator. The conditions under which a family of pulse openings can yield a connected filter are clarified. The ability of segmentations to generate pyramids, or hierarchies, is analyzed. A distinction is made between weak hierarchies where the partitions increase when going up in the pyramid, and the strong hierarchies where the various levels are structured as semi-groups, and particularly as granulometric semi-groups. The last section is based on one example, and goes back over the controversy about “lattice” versus “functional” optimization. The problem is now tackled via a case of colour segmentation, where the saturation serves as a cursor between luminance and hue. The emphasis is put on the difficulty of grouping the various necessary optimizations into a single one.