基于多尺度分解的色调映射算法

针对高动态范围(HDR)图像显示于普通显示设备的问题,提出一种新的基于多尺度分解的色调映射(TM)算法。首先利用局部边缘保留(LEP)滤波器对HDR图像进行多尺度分解,有效平滑了图像的细节同时保留了突出的边缘;根据分解后各层的特点和压缩的要求,提出一个带参数的动态范围压缩函数,通过变化参数以便压缩图像的粗尺度层并增强细尺度层,从而压缩图像的动态范围并增强细节;最后重组各层并恢复颜色,所得到的映射后图像具有良好的视觉效果。实验结果证明,该方法在自然度、结构保真度和整体的质量评价上都要优于Gu等(GU B, LI W J, ZHU M Y, et al. Local edge-preserving multiscale decomposition for high dynamic range image tone mapping ［J］. IEEE Transactions on Image Processing, 2013, 22(1): 70-79)和Yeganeh等(YEGANEH H, WANG Z. Objective quality assessment of tone-mapped images ［J］. IEEE Transactions on Image Processing, 2013, 22(2): 657-667)提出的方法,同时也避免了局部色调映射算法所普遍存在的光晕效应。该算法可以用于HDR图像的色调映射。     

使用超像素分割与图割的网状遮挡物检测算法

针对由于摄影角度受限,一些自然图像被铁丝网、栅栏、外墙玻璃接缝等网状遮挡物所遮挡的问题,提出了一种用于修复此类图像的网状遮挡物检测算法。对于现有算法使用单像素颜色特征和固定形状特征造成对颜色和形状不均的网状遮挡物检测效果不佳的弊端,首先将图像进行超像素分割,引入颜色与纹理直方图的联合特征来描述超像素块,将基于像素分类问题转换成基于超像素的分类问题,抑制了局部颜色变化造成的误分类;然后,使用图割算法将超像素块进行分类,使网状结构能够沿着光滑的边缘进行延伸,不受固定的形状限制,提高了对异形网状结构的检测准确率,并且不依赖Farid等提出的算法（FARID M S,MAHMOOD A,GRANGETTO M.Image de-fencing framework with hybrid inpainting algorithm.Signal,Image and Video Processing,2016,10（7）：1193-1201）所需的人工输入;其次使用新的联合特征训练支持向量机（SVM）分类器并对所有未被分类的超像素块进行分类,得到准确网状遮挡物掩膜;最后,使用SAIST算法对图像进行修复。实验中,获得的网状遮挡物掩膜比Farid等提出的算法所得到的保留了更多的细节,在修复算法不变的同时显著提升了图像修复效果。在使用相同网状遮挡物掩膜的情况下,使用SAIST算法修复得到的图片在峰值信噪比（PSNR）和结构相似性（SSIM）上分别比Farid等提出算法提高了3.06和0.02。新的掩膜检测算法联合SAIST修复算法的总体修复效果对比Farid等提出算法及Liu等提出的算法（LIU Y Y,BELKINA T,HAYS J H,et al.Image de-fencing.Proceedings of the 2008 IEEE Conference on Computer Vision and Pattern Recognition.Washington,DC：IEEE Computer Society,2008：1-8）有了明显提升。实验结果表明,所提算法提升了网状遮挡物的检测准确性,得到了效果更好的去除网状遮挡物的图像。     

Ensemble of online sequential extreme learning machine

Liang et al. [A fast and accurate online sequential learning algorithm for feedforward networks, IEEE Transactions on Neural Networks 17 (6) (2006), 1411–1423] has proposed an online sequential learning algorithm called online sequential extreme learning machine (OS-ELM), which can learn the data one-by-one or chunk-by-chunk with fixed or varying chunk size. It has been shown [Liang et al., A fast and accurate online sequential learning algorithm for feedforward networks, IEEE Transactions on Neural Networks 17 (6) (2006) 1411–1423] that OS-ELM runs much faster and provides better generalization performance than other popular sequential learning algorithms. However, we find that the stability of OS-ELM can be further improved. In this paper, we propose an ensemble of online sequential extreme learning machine (EOS-ELM) based on OS-ELM. The results show that EOS-ELM is more stable and accurate than the original OS-ELM.     

Nonlinear system modeling and predictive control using the RBF nets-based quasi-linear ARX model

On the basis of the single-input single-output (SISO) RBF-ARX model proposed in previous works [Peng, H., et al. (2003b). Stability analysis of the RBF-ARX model based nonlinear predictive control. In Proceedings of the ECC2003; Peng, H., et al. (2003c). Modeling and control of nonlinear nitrogen oxide decomposition process. In Proceedings of the CDC’03; Peng, H., et al. (2004). RBF-ARX model based nonlinear system modeling and predictive control with application to a NO_x decomposition process. Control Engineering Practice, 12, 191–203; Peng, H., et al. (2007). Nonlinear predictive control using neural nets-based local linearization ARX model—Stability and industrial application. IEEE Transactions on Control Systems Technology, 15, 130–143] the multi-input multi-output (MIMO) RBF-ARX model and its state-space representation are derived to describe the dynamics of a class of multivariable nonlinear systems whose working-point varies with time and which may be linearized around the working-point. The proposed MIMO RBF-ARX model has a basic regression-model structure that is analogous to the linear ARX model structure, and the elements of its regression matrices are composed of Gaussian radial basis function (RBF) neural networks that are dependent on the working-point state of the current system. An off-line estimation approach to parameters and orders of the MIMO RBF-ARX model is presented, and, on the basis of the estimated MIMO RBF-ARX model, a predictive control strategy is designed to control the underlying nonlinear system. A case study on a simulator of a thermal power plant is also given to illustrate the effectiveness of the nonlinear modeling and control method proposed in this paper.     

An evolutionary lion optimization algorithm‐based image compression technique for biomedical applications

Recently, medical image compression becomes essential to effectively handle large amounts of medical data for storage and communication purposes. Vector quantization (VQ) is a popular image compression technique, and the commonly used VQ model is Linde–Buzo–Gray (LBG) that constructs a local optimal codebook to compress images. The codebook construction was considered as an optimization problem, and a bioinspired algorithm was employed to solve it. This article proposed a VQ codebook construction approach called the L2‐LBG method utilizing the Lion optimization algorithm (LOA) and Lempel Ziv Markov chain Algorithm (LZMA). Once LOA constructed the codebook, LZMA was applied to compress the index table and further increase the compression performance of the LOA. A set of experimentation has been carried out using the benchmark medical images, and a comparative analysis was conducted with Cuckoo Search‐based LBG (CS‐LBG), Firefly‐based LBG (FF‐LBG) and JPEG2000. The compression efficiency of the presented model was validated in terms of compression ratio (CR), compression factor (CF), bit rate, and peak signal to noise ratio (PSNR). The proposed L2‐LBG method obtained a higher CR of 0.3425375 and PSNR value of 52.62459 compared to CS‐LBG, FA‐LBG, and JPEG2000 methods. The experimental values revealed that the L2‐LBG process yielded effective compression performance with a better‐quality reconstructed image.     

Shape Interpretation of Second-Order Moment Invariants

The decomposition of an image in a geometrical and a textural part has shown to be a challenging problem with several applications. Since the theoretical breakthrough of Y. Meyer, many variational methods and minimization techniques have been proposed for this task. This paper uses a different approach based on low/high-pass filtering with directional filters. This approach modifies the algorithm proposed in Buades et al. (IEEE Trans Image Process 19(8):1978–1986, 2010) improving its performance near image discontinuities while keeping the simplicity and rapidity of a linear model. Comparisons with variational methods illustrate the flexibility of the proposed algorithm. We illustrate how the proposed method is the only one dealing correctly with frame-by-frame video processing.     

An Efficient Algorithm for ℓ 0 Minimization in Wavelet Frame Based Image Restoration

Wavelet frame based models for image restoration have been extensively studied for the past decade (Chan et al. in SIAM J. Sci. Comput. 24(4):1408–1432, 2003; Cai et al. in Multiscale Model. Simul. 8(2):337–369, 2009; Elad et al. in Appl. Comput. Harmon. Anal. 19(3):340–358, 2005; Starck et al. in IEEE Trans. Image Process. 14(10):1570–1582, 2005; Shen in Proceedings of the international congress of mathematicians, vol. 4, pp. 2834–2863, 2010; Dong and Shen in IAS lecture notes series, Summer program on “The mathematics of image processing”, Park City Mathematics Institute, 2010). The success of wavelet frames in image restoration is mainly due to their capability of sparsely approximating piecewise smooth functions like images. Most of the wavelet frame based models designed in the past are based on the penalization of the ? ₁ norm of wavelet frame coefficients, which, under certain conditions, is the right choice, as supported by theories of compressed sensing (Candes et al. in Appl. Comput. Harmon. Anal., 2010; Candes et al. in IEEE Trans. Inf. Theory 52(2):489–509, 2006; Donoho in IEEE Trans. Inf. Theory 52:1289–1306, 2006). However, the assumptions of compressed sensing may not be satisfied in practice (e.g. for image deblurring and CT image reconstruction). Recently in Zhang et al. (UCLA CAM Report, vol. 11-32, 2011), the authors propose to penalize the ? ₀ “norm” of the wavelet frame coefficients instead, and they have demonstrated significant improvements of their method over some commonly used ? ₁ minimization models in terms of quality of the recovered images. In this paper, we propose a new algorithm, called the mean doubly augmented Lagrangian (MDAL) method, for ? ₀ minimizations based on the classical doubly augmented Lagrangian (DAL) method (Rockafellar in Math. Oper. Res. 97–116, 1976). Our numerical experiments show that the proposed MDAL method is not only more efficient than the method proposed by Zhang et al. (UCLA CAM Report, vol. 11-32, 2011), but can also generate recovered images with even higher quality. This study reassures the feasibility of using the ? ₀ “norm” for image restoration problems.     

基于快速置换和可选择像素扩散的医疗图像加密算法的安全性分析

图像加密算法的安全性是最基本和最重要的。医疗图像加密是保护患者隐私的一种手段,分析医疗图像加密算法的安全性,对设计医疗图像加密算法、增强算法的安全性和促进医疗图像加密算法的应用非具有常重要的意义。最近,Hua等提出了一种基于快速置换和可选择像素扩散的医疗图像加密方案。加密方案的一个关键操作是在图像的四周插入随机值,然后通过置乱使得随机值分散到整幅图像,最后通过扩散混乱等操作加密整幅图像。每次加密都会产生不同的随机值,即使加密相同的图像,每次加密得到的密文也不一样,这就保证了“一次一密”的加密效果。文中采用差分分析和选择密文攻击,从理论上详细地分析了Hua等提出的算法。首先分析解密过程,通过差分分析构造明文-密文的线性关系,并根据构造的线性关系建立密码本;然后使用密码本攻击便可破解该算法。密码本的大小与图像尺寸相关,若密文图像的尺寸为M×N,则构造的密码本包含(M×N+1)个明文-密文对。仿真实验验证了理论分析的正确性。为了提高该算法的安全性,抵抗文中提出的密码本攻击,进一步提出了一种基于差分分析的改进方案。该方案引入了与明文相关的置换矩阵。仿真实验结果和统计分析结果表明,改进方案不仅继承了原算法的优点,而且具有很好的抗差分攻击能力。     

An improved search algorithm for vector quantization using mean pyramid structure

Vector quantization (VQ) is a well-known data compression technique. In the codebook design phase as well as the encoding phase, given a block represented as a vector, searching the closest codeword in the codebook is a time-consuming task. Based on the mean pyramid structure and the range search approach, an improved search algorithm for VQ is presented in this paper. Conceptually, the proposed algorithm has the bandpass filter effect. Each time, using the derived formula, the search range becomes narrower due to the elimination of some portion of the previous search range. This reduces search times and improves the previous result by Lee and Chen (A fast search algorithm for vector quantization using mean pyramids of codewords. IEEE Trans. Commun. 43(2/3/4), (1995) 1697–1702). Some experimental results demonstrate the computational advantage of the proposed algorithm.     

Robust template tracking with drift correction

We propose an efficient robust version of the Lucas–Kanade template matching algorithm. The robust weights used by the algorithm are based on evidence which is accumulated over many frames. We also present a robust extension of the algorithm proposed by Matthews et al. [Matthews, I., Ishikawa, T., Baker, S., 2004. The template update problem. IEEE Trans. Pattern Anal. Machine Intell. 26 (6), 810–815] which corrects the template drift. We demonstrate that in terms of tracking accuracy, the robust version of the drift-correcting algorithm outperforms the original algorithm, while remaining still extremely fast.     

Performance Evaluation of GAP-RBF Network in Channel Equalization

A Growing and Pruning Radial Basis Function (GAP-RBF) network has been recently proposed by Huang et al. [IEEE Transactions on Systems, Man and Cybernetics-Part B: Cybernetics, 34(6) (2004), 2284–2292]. However, its performance in signal processing areas is not clear yet. In this paper, GAP-RBF network is used for solving the communication channel equalization problem. The simulation results demonstrate that GAP-RBF equalizer outperforms other equalizers such as recurrent neural network and MRAN on linear and nonlinear channel model in terms of bit error rate.     

带H1正则项的C-V模型

C-V模型(CHAN T F, VESE L A. Active contours without edges. IEEE Transactions on Image Processing, 2001, 10(2): 266-277)是一个著名的基于区域的图像分割模型。它对活动轮廓的初始化和噪声不敏感,但分割的图像的范围不够广泛。因此,运用理论分析与实验相结合的方法,在C-V模型中添加H1正则项,对其进行了改进,提出了一个新颖的图像分割的能量泛函,并推导出了以偏微分方程形式表示的基于区域的自适应插值拟合的活动轮廓模型。实验表明：该模型能够分割某些原来C-V模型不适用的图像,它对初始轮廓的大小、位置的敏感性较小,抗噪性较强。     

Delay optimal coteries on regular symmetric networks

Coteries, introduced by Garcia-Molina and Barbara [Journal for the Association for Computing Machinery, 32 (4) (1985) 841], are an important and effective tool for enforcing mutual exclusion in distributed systems. Communication delay is an important performance measure for a coterie. Fu et al. [IEEE Transactions on Parallel and Distributed Systems, 8 (1) (1997) 59] emphasize that while calculating communication delay, the actual distances between different sites in a network must be taken into account and using this idea, obtain delay optimal coteries for trees, rings and hypercubes. Also, topology of an interconnection network plays an important role in the performance of a distributed system. For certain applications, it is desirable that the degree of each node in the interconnection network is the same. Constant Degree Four Cayley Graphs introduced by Vadapalli and Srimani [IEEE Transactions on Parallel and Distributed Systems 7(2) (1996) 26] provide an ideal topology for such applications. They are regular, have a logarithmic diameter and a node connectivity of four. In this paper, we prove that no coterie on an arbitrary network can have a delay of less than half the diameter of the network and use this result to obtain delay optimal coteries on regular symmetric networks with special reference to constant degree four Cayley interconnection-network.     

Computation of Minimal Siphons in Petri Nets Using Problem Partitioning Approaches

A large amount of research has shown the vitality of siphon enumeration in the analysis and control of deadlocks in various resource-allocation systems modeled by Petri nets(PNs).In this paper,we propose an algorithm for the enumeration of minimal siphons in PN based on problem decomposition.The proposed algorithm is an improved version of the global partitioning minimal-siphon enumeration(GPMSE)proposed by Cordone et al.(2005)in IEEE Transactions on Systems,Man,and Cybernetics-Part A:Systems and Humans,which is widely used in the literature to compute minimal siphons.The experimental results show that the proposed algorithm consumes lower computational time and memory compared with GPMSE,which becomes more evident when the size of the handled net grows.     

一种基于不可复制功能的RFID认证协议的安全性分析

基于不可复制功能(PUF)的射频识别(RFID)认证协议是近年来的研究热点。2011年,Bassil等在ITST国际会议上提出了一种新的基于PUF的RFID认证协议(BASSIL R, EL-BEAINO W, KAYSSI A, et al. A PUF-based ultra-lightweight mutual-authentication RFID protocol [C]// 2011 International Conference on Internet Technology and Secured Transactions. Piscataway: IEEE, 2011: 495-499)。分析了该认证协议的安全性,通过假设敌手参与协议,指出其不能抵抗密钥泄露攻击、跟踪攻击,也不能抵抗阅读器冒充攻击以及同步破坏攻击;同时描述了这些攻击的细节,并给出了它们的成功概率和计算复杂度。     

An efficient algorithm for optimal control of PWA systems with polyhedral performance indices

We present an algorithm for the computation of explicit optimal control laws for piecewise affine (PWA) systems with polyhedral performance indices. The algorithm is based on dynamic programming (DP) and represents an extension of ideas initially proposed in Kerrigan and Mayne [(2003). Optimal control of constrained, piecewise affine systems with bounded disturbances. In Proceedings of the 41st IEEE conference on decision and control, Las Vegas, Nevada, USA, December], and Baoti? et al. [(2003). A new algorithm for constrained finite time optimal control of hybrid systems with a linear performance index. In Proceedings of European control conference, Cambridge, UK, September]. Specifically, we show how to exploit the underlying geometric structure of the optimization problem in order to significantly improve the efficiency of the off-line computations. An extensive case study is provided, which clearly indicates that the algorithm proposed in this paper may be preferable to other schemes published in the literature.     

New progressive image transmission based on quadtree and shading approach with resolution control

Employing the quadtree and Gouraud shading approach, this paper first presents a modified image compression method called the QSC. Then, based on the proposed compression method, a new progressive image transmission (PIT) scheme is presented. In the proposed PIT scheme, the encoding algorithm partitions all the quadtree nodes into several disjoint subsets such that the resolution of nodes in each subset must be in the specified interval. The decoding algorithm reconstructs the partitioned quadtree from coarse to the required quality stage by stage. Experimental results reveal that under the similar peak signal to noise ratio (PSNR) and bits per pixel (bpp), the proposed PIT scheme has a better feature-preserving capability when compared to the reduced-difference pyramid PIT scheme [Optic. Eng. 28 (7) (1989) 708] and the progressive JPEG [JPEB: Still Image Data Compression Standard, New York, 1993].     

Routing direction determination in regular networks based on configurable circuits

We consider the problem of finding short paths in a regular network such as a k-ary n-cube. This problem is a basic aspect of routing and has to be implemented with a very high performance for cluster and parallel computer networks. To achieve this, a scalable reconfigurable circuit is proposed that covers many popular topologies at acceptable cost. As a demonstration, the application to a modestly complex topology is shown in detail (“Multi-Mesh” introduced by Das et al. [D. Das, M. De, B.P. Sinha, A network topology with multiple meshes, IEEE Transactions on Computers 48 (5) (1999) 536–551]).

The achieved flexibility is much higher than that of previously reported reconfigurable circuits for the same purpose such as interval routing [R.B. Tan, J. van Leeuwen, Compact routing methods: a survey, in: Proceedings of the Colloquium on Structural Information and Communication Complexity (SICC94), School of Computer Science, Carleton University, Ottawa, 1995, pp. 99–109] or bit-pattern-associative routing [D.H. Summerville, J.G. Delgado-Frias, S. Vassiliadis, A flexible bit-pattern-associative router for interconnection networks, IEEE Transactions on Parallel and Distributed Systems 7 (5) (1996) 477–485]. The proposed circuit extends the domain of application-specific reconfigurable circuits beyond the areas of signal processing and cryptography, where most work is currently done.     

云存储访问控制方案的安全性分析与改进

对Tang等（TANG Y,LEE P,LUI J,et al. Secure overlay cloud storage with access control and assured deletion. IEEE Transactions on Dependable and Secure Computing,2012,9（6)：903-916）提出的一种云存储的细粒度访问控制方案进行安全性分析,发现其存在不能抵抗合谋攻击的问题,并给出了具体的攻击方法。针对该方案安全性方面的不足,利用基于属性的加密算法抗合谋攻击的特性,对使用访问树结构的密文策略加密（CP-ABE）算法进行改进,使改进后的算法能够直接运用到云存储访问控制方案中而不需要对云存储服务器进行任何修改,同时可实现细粒度的访问控制和用户数据的彻底删除。最后基于判断双向性Deffie-Hellman（DBDH）假设,证明了该方案在选择明文攻击下的安全性,并通过将方案运用到实际的云环境中进行分析后证明改进后的方案能够抵抗合谋攻击。