摘要：
Glass bottles are widely used as containers in the food and beverage industry, especially for beer and carbonated beverages. As the key part of a glass bottle, the bottle bottom and its quality are closely related to product safety. Therefore, the bottle bottom must be inspected before the bottle is used for packaging. In this paper, an apparatus based on machine vision is designed for real-time bottle bottom inspection, and a framework for the defect detection mainly using saliency detection and template matching is presented. Following a brief description of the apparatus, our emphasis is on the image analysis. First, we locate the bottom by combining Hough circle detection with the size prior, and we divide the region of interest into three measurement regions: central panel region, annular panel region, and annular texture region. Then, a saliency detection method is proposed for finding defective areas inside the central panel region. A multiscale filtering method is adopted to search for defects in the annular panel region. For the annular texture region, we combine template matching with multiscale filtering to detect defects. Finally, the defect detection results of the three measurement regions are fused to distinguish the quality of the tested bottle bottom. The proposed defect detection framework is evaluated on bottle bottom images acquired by our designed apparatus. The experimental results demonstrate that the proposed methods achieve the best performance in comparison with many conventional methods.
摘要：
Traditional image object classification and detection algorithms and strategies cannot meet the problem of video image acquisition and processing. Deep learning deliberately simulates the hierarchical structure of human brain, and establishes the mapping from low-level signals to high-level semantics, so as to achieve hierarchical feature representation of data. Deep learning technology has powerful visual information processing ability, which has become the forefront technology and domestic and international research hotspots to deal with this challenge. In order to solve the problem of target space location in video surveillance system, time-consuming and other problems, in this paper, we propose the algorithm based on RNN-LSTM deep learning. At the same time, according to the principle of OpenGL perspective imaging and photogrammetry consistency, we use 3D scene simulation imaging technology, relying on the corresponding relationship between video images and simulation images we locate the target object. In the 3D virtual scene, we set up the virtual camera to simulate the imaging processing of the actual camera, and the pixel coordinates in the video image of the surveillance target are substituted into the simulation image, next, the spatial coordinates of the target are inverted by the inverse process of the virtual imaging. The experimental results show that the detection of target objects has high accuracy, which has an important reference value for outdoor target localization through video surveillance images.
通讯机构：
[Li, Lang] H;Hengyang Normal Univ, Hunan Prov Key Lab Intelligent Informat Proc & Ap, Hengyang 421002, Peoples R China.;Hengyang Normal Univ, Coll Comp Sci & Technol, Hengyang 421002, Peoples R China.
关键词：
Block cipher;Internet of Things;Involution;Lightweight cryptography;SPN structure
摘要：
In past few years, as security ciphers in the Internet of Things (IoT), the research of lightweight block cipher has attracted tremendous attention in cryptography. The SPN structure has been widely used in the design of block cipher. However, the encryption and decryption processes of ciphers based on the SPN structure are different. We design a new SPN structure, which is perfect for lightweight block cipher. The new SPN structure makes that the encryption process is the same as decryption. Moreover, input and output data directions are the same for encryption and decryption processes. Thus, the same process can absolutely be shared in decryption and encryption both for software and hardware implementation. Further, we propose a family of involutional lightweight block cipher, called Loong, based on the proposed SPN structure and components. Rigorous analysis indicates that Loong is of high security against cryptanalysis, especially the differential attack and linear attack. As shown by our experiments and comparisons, Loong is compact in hardware environment and is suitable for the IoT.
摘要：
Information security has become increasingly important with the rapid development of mobile devices and internet. An efficient encryption system is a key to this end. In this paper, we propose an image encryption method based on the cross diffusion of two chaotic maps. We use two chaotic sequences, namely the Logistic map and the Chebyshev map, for key generation which has larger security key space than single one. Moreover, we use these two sequences for further image encryption diffusion which decreases the correlation of neighboring pixels significantly. We conduct extensive experiments on several well-known images like Lena, Baboon, Koala, etc. Experimental results show that our algorithm has the characteristics of large key space, fast, robust to statistic attack, etc.
摘要：
By applying contraction mapping theorem and Gronwall's inequality on time scale, we establish some sufficient conditions on the existence and global exponential stability of periodic solutions for a kind of stochastic fuzzy cellular neural networks on time scales. Moreover an example is presented to illustrate the feasibility of our results obtained.
摘要：
During past few years, some lightweight block ciphers have been proposed. These lightweight block ciphers take single encryption method that either uses Substitution-Permutation (SP) network structure or Feistel network structure to encrypt. In this paper, we have designed a different encryption method that takes both SP network structure and Feistel network structure to encrypt. Current SP network has a limitation that the encryption and decryption processes are dissimilar. To solve this problem, we have employed involution related properties of the nonlinear and linear components to modify SP network structure. The modified one enables the encryption and decryption program or circuit to work as the Feistel network structure. Additionally, we have implemented a MixRows in SP network structure. Then we instantiate these three novel ideas into the lightweight block cipher called SFN. We have carried out the security evaluation and the hardware and software experiments to it. The result shows that compared to other lightweight block ciphers, SFN has more advantages in terms of being immune to attacks. Also, SFN is not only compact in hardware environment but also efficient in software platforms.
作者机构：
[Wen, Guilin; Zhou, Huaan; Chen, Zhong] Hunan Univ, State Key Lab Adv Design & Mfg Vehicle Body, Changsha 410082, Hunan, Peoples R China.;[Chen, Zhong] Hengyang Normal Univ, Coll Comp Sci & Technol, Hengyang 421002, Peoples R China.;[Wen, Guilin; Zhou, Huaan; Chen, Zhong] Hunan Univ, Key Lab Adv Design & Simulat Tech Special Equipme, Minist Educ, Changsha 410082, Hunan, Peoples R China.;[Chen, Junyao] Hengyang Normal Univ, Dept Phys & Elect Informat Sci, Hengyang 421002, Peoples R China.;[Chen, Junyao] Ajou Univ, Coll Informat Technol, Suwon 16499, South Korea.
通讯机构：
[Chen, Zhong] H;Hunan Univ, State Key Lab Adv Design & Mfg Vehicle Body, Changsha 410082, Hunan, Peoples R China.
关键词：
Arctangent function series;Multi-scroll attractor;Rucklidge system
摘要：
A new method for generating M × N-grid double-scroll Rucklidge chaotic attractors is presented. By designing arctangent function series to construct a nonlinear function, which replace the state variables x, y of the Rucklidge system, a new M × N-grid double-scroll chaotic system is created. The formation mechanism of this M × N-grid double-scroll chaotic model is further investigated. Moreover, some basic properties are theoretically analyzed and numerically simulated, including equilibria and their stability, Lyapunov exponents and bifurcation diagram. This system can be widely utilized in secure communication and data encryption.
关键词：
Time Series;Similarity/Dissimilarity Analysis;Principal Component Analysis;Fast Fourier Transformation;Protein Sequence
摘要：
In this paper, a novel method to analyze the similarity/dissimilarity of protein sequences based on Principal Component Analysis-Fast Fourier Transformation (PCA-FFT) is proposed, in which, the PCA is utilized to transform protein sequences into time series and the FFT is utilized to analyze the time series while considering them as signals. To test the effectiveness of our newly proposed method, it is applied to analyze the similarity/dissimilarity of 16 different ND5 protein sequences and 29 different spike protein sequences, respectively. Furthermore, the correlation analysis is presented for comparing with others methods, and the simulation results show that it has better performances in the aspects of computation complexity and recognition degree than some existing methods.
作者机构：
[Wang, Dong] South China Agr Univ, Coll Math & Informat, Guangzhou, Guangdong, Peoples R China.;[Zou, Changqing] Hengyang Normal Univ, Coll Comp Sci & Technol, Hengyang, Peoples R China.;[Tan, Ping; Zou, Changqing] Simon Fraser Univ, Sch Comp Sci, Burnaby, BC, Canada.;[Li, Guiqing] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou, Guangdong, Peoples R China.;[Su, Zhuo; Gao, Chengying] Sun Yat Sen Univ, Natl Engn Res Ctr Digital Life, Sch Data & Comp Sci, Guangzhou, Guangdong, Peoples R China.
会议名称：
25th Pacific Conference on Computer Graphics and Applications (Pacific Graphics)
会议时间：
OCT 16-19, 2017
会议地点：
Taipei, TAIWAN
会议主办单位：
[Wang, Dong] South China Agr Univ, Coll Math & Informat, Guangzhou, Guangdong, Peoples R China.^[Zou, Changqing] Hengyang Normal Univ, Coll Comp Sci & Technol, Hengyang, Peoples R China.^[Zou, Changqing;Tan, Ping] Simon Fraser Univ, Sch Comp Sci, Burnaby, BC, Canada.^[Li, Guiqing] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou, Guangdong, Peoples R China.^[Gao, Chengying;Su, Zhuo] Sun Yat Sen Univ, Natl Engn Res Ctr Digital Life, Sch Data & Comp Sci, Guangzhou, Guangdong, Peoples R China.
摘要：
A chaotic model for generating multi-directional multi-scroll attractors via hyperbolic tangent function series is proposed in this paper. The dynamical mechanisms of this chaotic model are further investigated, including M-scroll, MxN-grid scroll, MxNxL-grid scroll chaotic attractors. Moreover, the dynamical behaviors of this system are theoretically analyzed and numerically simulated, such as equilibria and their stability,.Lyapunov exponents and bifurcation diagrams. This system can be widely used in data encryption and secure communication. (C) 2016 Elsevier GmbH. All rights reserved.
摘要：
We propose a new ultra-lightweight block cipher, QTL. The 64 bits block cipher QTL supports 64 and 128 bits keys. To solve the slow diffusion of the traditional Feistel-type structures we have used a new variant of generalized Feistel network structure in design of the QTL. Traditional Feistel-type structures change only half of block messages in an iterative round, but our structure overcomes this disadvantage and changes all block messages. Thus, our structure has the fast diffusion of the Substitution Permutation Networks (SPNs) structures, which improves the security of lightweight block cipher in Feistel-type structures. Moreover, QTL algorithm has the same encryption and decryption processes, so it will occupy less area in resource-constrained applications. Furthermore, to reduce the cost of energy consumption in hardware implementation of the cipher while maintaining security, we decide not to use a key schedule. We show that QTL offers an adequate security level against classic analyses. Our hardware implementation for the 64 and the 128 bits keys modes only require 1025.52 and 1206.52 gate equivalents, respectively. QTL achieves high security and compact implementation in hardware. QTL is one of the most competitive ultra-lightweight block ciphers, which is suitable for extremely constrained devices. (C) 2016 Elsevier B.V. All rights reserved.
摘要：
We propose a mesh saliency detection approach using absorbing Markov chain. Unlike most of the existing methods based on some center-surround operator, our method employs feature variance to obtain insignificant regions and considers both background and foreground cues. Firstly, we partition an input mesh into a set of segments using Ncuts algorithm and then each segment is over segmented into patches based on Zernike coefficients. Afterwards, some background patches are selected by computing feature variance within the segments. Secondly, the absorbed time of each node is calculated via absorbing Markov chain with the background patches as absorbing nodes, which gives a preliminary saliency measure. Thirdly, a refined saliency result is generated in a similar way but with foreground nodes extracted from the preliminary saliency map as absorbing nodes, which inhibits the background and efficiently enhances salient foreground regions. Finally, a Laplacian-based smoothing procedure is utilized to spread the patch saliency to each vertex. Experimental results demonstrate that our scheme performs competitively against the state-of-the-art approaches.
摘要：
Purpose - The purpose of this paper is to develop a compressive sensing (CS) algorithm for noisy solder joint imagery compression and recovery. A fast gradient-based compressive sensing (FGbCS) approach is proposed based on the convex optimization. The proposed algorithm is able to improve performance in terms of peak signal noise ratio (PSNR) and computational cost. Design/methodology/approach - Unlike traditional CS methods, the authors first transformed a noise solder joint image to a sparse signal by a discrete cosine transform (DCT), so that the reconstruction of noisy solder joint imagery is changed to a convex optimization problem. Then, a so-called gradient-based method is utilized for solving the problem. To improve the method efficiency, the authors assume the problem to be convex with the Lipschitz gradient through the replacement of an iteration parameter by the Lipschitz constant. Moreover, a FGbCS algorithm is proposed to recover the noisy solder joint imagery under different parameters. Findings - Experiments reveal that the proposed algorithm can achieve better results on PNSR with fewer computational costs than classical algorithms like Orthogonal Matching Pursuit (OMP), Greedy Basis Pursuit (GBP), Subspace Pursuit (SP), Compressive Sampling Matching Pursuit (CoSaMP) and Iterative Re-weighted Least Squares (IRLS). Convergence of the proposed algorithm is with a faster rate O(kk) instead of O(1/k). Practical implications - This paper provides a novel methodology for the CS of noisy solder joint imagery, and the proposed algorithm can also be used in other imagery compression and recovery. Originality/value - According to the CS theory, a sparse or compressible signal can be represented by a fewer number of bases than those required by the Nyquist theorem. The new development might provide some fundamental guidelines for noisy imagery compression and recovering.
期刊：
Journal of Instrumentation,2016年11(2):T02002-T02002 ISSN：1748-0221
通讯作者：
Tan, Y.
作者机构：
[Tan, Y.] Hengyang Normal Univ, Coll Phys & Elect Engn, Hengyang 421008, Peoples R China.;[Tokonami, S.] Hirosaki Univ, Inst Radiat Emergency Med, Dept Radiat Phys, Hirosaki, Aomori 0368564, Japan.;[Liu, H.] Hengyang Normal Univ, Coll Comp Sci & Technol, Hengyang 421008, Peoples R China.;[Kearfott, K. J.] Univ Michigan, Dept Nucl Engn & Radiol Sci, Ann Arbor, MI 48109 USA.
通讯机构：
[Tan, Y.] H;Hengyang Normal Univ, Coll Phys & Elect Engn, Hengyang 421008, Peoples R China.
关键词：
Data processing methods;Models and simulations;Spectrometers;Simulation methods and programs
摘要：
222Rn and 220Rn can be used as tracers of groundwater or submarine springs, and 222Rn in water also could indicate indoor radon problems in some regions. The half-life of 222Rn is long enough that its concentration may remain significant during transit over relatively long distances, while that of 220Rn is not. Prior research revealed that it took about 15 min for the radon to achieve gas equilibrium at a water flow rate of 17.5 L min−1, which is approximately equivalent to the time required for the 222Rn-218Po pair to approach radioactive equilibrium and is limiting in terms of measurements of sudden radon concentration change. In this work, an algorithm is applied to improve the continuous tracing of radon concentrations in the field environment. Results of a laboratory experiment analyzed applying the analysis method illustrated its ability to allow immediate identification of sharp concentration increases. In this paper we find that a precipitous drop in radon concentrations lead to improper corrected values as the result of measurement uncertainties prior to the drop, and a method using zero instead negative values for reducing the uncertainties under such condition also is proposed.
