Web服务组合QoS全局优化算法

Web服务技术的发展使得组合Web服务的应用成为可能,组合服务的QoS优化问题的重要性越来越明显。遗传算法与蚁群算法是解决QoS全局优化的两种方法,针对采用蚁群算法进行优化时易出现的收敛速度缓慢及遗传算法易陷入局部最优解、效率不高的问题,结合两种算法的优势,充分发挥蚁群算法正反馈特性与遗传算法的快速全局搜索能力,改善QoS全局优化算法,提高了算法的优化能力,从而更好地解决了Web服务的QoS全局优化问题。     

An almost automatic image fusion scheme for balancing clarity and visual effects

Multimedia Tools and Applications - Multi-focus image fusion aims to combine multiple images with different focuses to form a single sharp image. The basic principle is to first compare the local...     

一种图像置乱的改进算法

提出了一种改进的基于混沌的图像置乱算法.该算法在对图像运用抽样技术预处理的基础上,利用Logistic映射产生的伪随机序列,对图像进行灰度值的变换和全局的块置乱.实验仿真表明,该加密算法具有良好的加密效果,能有效地抵御统计攻击和差分攻击.     

An improved evolutionary algorithm for handling many-objective optimization problems

It has been shown that the multi-objective evolutionary algorithms (MOEAs) act poorly in solving many-objective optimization problems which include more than three objectives. The research emphasis, in recent years, has been put into improving the MOEAs to enable them to solve many-objective optimization problems efficiently. In this paper, we propose a new composite fitness evaluation function, in a novel way, to select quality solutions from the objective space of a many-objective optimization problem. Using this composite function, we develop a new algorithm on a well-known NSGA-II and call it FR-NSGA-II, a fast reference point based NSGA-II. The algorithm is evaluated for producing quality solutions measured in terms of proximity, diversity and computational time. The working logic of the algorithm is explained using a bi-objective linear programming problem. Then we test the algorithm using experiments with benchmark problems from DTLZ family. We also compare FR-NSGA-II with four competitive algorithms from the extant literature to show that FR-NSGA-II will produce quality solutions even if the number of objectives is as high as 20.     

An improved image quality algorithm for exemplar-based image inpainting

Image inpainting is a common technique for repairing image regions that are scratched or damaged. This process involves reconstructing damaged parts and filling-in regions in which data/colour information is missing. There are many potential applications for image inpainting, such as repairing old images, repairing scratched images, removing unwanted objects, and filling-in missing areas. This paper develops an exemplar-based algorithm, one of the most important and popular image inpainting techniques, to fill-in missing regions caused by removing unwanted objects, image compression, scratches, or image transformation via the Internet. The proposed algorithm includes two phases of searching to select the best-matching information. In the first phase, the searching mechanism uses the entire image to find and select the most similar patches using the Euclidean distance. The second phase measures the distance between the location of the selected patches and the location of the patch to be filled. The performance of the proposed approach is evaluated through comprehensive experiments on several well-known images used in this area of research. The experimental results demonstrate the superior performance of the proposed approach over some state-of-the-art approaches in terms of quality in terms of both objective (using the peak signal-to-noise ratio (PSNR) as well as the structural similarity index method (SSIM)) and subjective (i.e., visual) measures.

     

Methods of handling of in-bulk agglomeration layer image representation for granulometric composition assessment

The analysis of methods of images handling is carried out, the method of dynamic threshold division which is based on the calculation of weight coefficient of points in the local area is suggested. The method of adaptive adjustment of the size of the local area of the image representation is carried out to define the threshold value. Also methods of binary recursive filtration and mathematical morphology to reduce interference are introduced. The article is published in the original. Evgenii Valentinovich Ershov. The first pro-rector, head of the department of PC software, professor of the Cherepovetsk State University. Finished postgraduate studies at the North-Western Polytechnic Correspondence Institute (the city of St. Petersburg) in 1993 and defended a Ph.D. thesis on specialty 05.02.11 “Methods of Control and Diagnostics in Mechanical Engineering.” Circle of scientific interests: the development of methods and principles for the building of multi-functional technical vision systems, their mathematical and software support. Five postgraduate students defended theses under his supervision. Author of 170 scientific and teaching works, including 4 monographs, 85 articles, of which 12 were published in reviewed journals, 39 theses of reports, 2 reports on SRD, 3 patents. Took part in 20 scientific and technical conferences in Moscow, St. Petersburg, Cherepovetsk, Kursk, Tambov, Vologda, Tula, Krasnoyarsk, Yoshkar Ola, and Kemerovo. Vera Vital’evna Selivanovskikh. Docent of the department of PC software of the Cherepovetsk State University. Finished postgraduate studies at the Cherepovetsk State University on specialty “Solid-State Physics” in 2000 and began to study the problem of the optic-electronic control over the quality of metallurgical industry products. Defended a Ph.D. thesis on specialty 05.13.06 “Automation and Management of Technological Processes and Productions” in 2007. Author of more than 30 scientific and teaching works, including 1 monograph, 7 articles, of which 2 were published in reviewed journals, 13 theses of reports. Took part in the scientific and technical conferences in Moscow, Cherepovetsk, Kursk, Tambov, Vologda, Tula, Yoshkar Ola. Oksana Georgievna Ganicheva. Docent of the department of PC software of the Cherepovetsk State University. Finished postgraduate studies at the Cherepovetsk State University and defended a Ph.D. thesis on specialty 05.13.06 “Automation and Management of Technological Processes and Productions” in 2007. Circle of scientific interests: the development and perfecting of methods for the optic-electronic control over the quality of metallurgical industry products. Author of more than 30 scientific and teaching works, including 1 monograph, 7 articles, of which 2 were published in reviewed journals, 10 theses of reports. Took part in the scientific and technical conferences in Cherepovetsk, Kursk, Vologda, Tula, Yoshkar Ola.     

一种视觉模型引导的小波域彩色图像盲水印算法*

为了较好地解决水印不可见性与鲁棒性矛盾问题,提出了一种新的彩色图像盲水印算法。将原始彩色图像转换到YCbCr色彩空间,并对各分量进行分块处理及一级离散小波变换,利用人眼视觉特性建立视觉模型并引导水印嵌入到中频系数中。水印的提取简单且不需要原始载体图像和原始水印,鲁棒调控因子的引入协调了算法对各类攻击的抵抗能力。实验结果表明,该算法能较好地平衡不可见性和鲁棒性,并且对诸如剪切、叠加噪声等攻击具有更强的鲁棒性。     

基于人类视觉系统的DCT编码图像后处理算法

分析了块离散余弦变换（BDCT）图像编码的块效应产生原因,基于马尔可夫随机场最大后验估计（MRF-MAP）框架提出了一种有效的自适应去块效应算法。利用人类视觉系统对块效应有掩盖性的特点引入一个块效应可见度函数,根据转换块的边缘信息自适应调整势能函数的阈值,从而尽可能地消除块效应并保护图像的边缘信息。仿真结果表明了该算法的有效性。     

An iterative thresholding algorithm for image segmentation

A thresholding technique is developed for segmenting digital images with bimodal reflectance distributions under nonuniform illumination. The algorithm works in a raster format, thus making it an attractive segmentation tool in situations requiring fast data throughput. The theoretical base of the algorithm is a recursive Taylor expansion of a continuously varying threshold tracking function.     

An image analysis algorithm for dendritic spines

The structure of neuronal dendrites and their spines underlie the connectivity of neural networks. Dendrites, spines, and their dynamics are shaped by genetic programs as well as sensory experience. Dendritic structures and dynamics may therefore be important predictors of the function of neural networks. Based on new imaging approaches and increases in the speed of computation, it has become possible to acquire large sets of high-resolution optical micrographs of neuron structure at length scales small enough to resolve spines. This advance in data acquisition has not been accompanied by comparable advances in data analysis techniques; the analysis of dendritic and spine morphology is still accomplished largely manually. In addition to being extremely time intensive, manual analysis also introduces systematic and hard-to-characterize biases. We present a geometric approach for automatically detecting and quantifying the three-dimensional structure of dendritic spines from stacks of image data acquired using laser scanning microscopy. We present results on the measurement of dendritic spine length, volume, density, and shape classification for both static and time-lapse images of dendrites of hippocampal pyramidal neurons. For spine length and density, the automated measurements in static images are compared with manual measurements. Comparisons are also made between automated and manual spine length measurements for a time-series data set. The algorithm performs well compared to a human analyzer, especially on time-series data. Automated analysis of dendritic spine morphology will enable objective analysis of large morphological data sets. The approaches presented here are generalizable to other aspects of neuronal morphology.     

An adaptive image interpolation algorithm for image/video processing

Image interpolation is one of the key technologies in image/video processing. In this study, a new adaptive image interpolation algorithm is proposed. The objective of the proposed approach is to recover up-sampled image frames from the corresponding decimated (low-resolution) image frames. In the proposed approach, within each iteration, two proposed nonlinear filters are utilized to iteratively generate high-frequency components lost within the decimation procedure. Finally, a post-processing procedure is adopted to reduce the blocking artifacts within the interpolated images. Based on the experimental results obtained in this study, in terms of the average PSNR_p (peak signal-to-noise ratio) in dB and subjective measure of the quality of the interpolated images, the interpolation results by the proposed approach are better than that by three existing interpolation approaches for comparison.     

An enhanced Huffman-PSO based image optimization algorithm for image steganography

Genetic Programming and Evolvable Machines - It is crucial in the field of image steganography to find an algorithm for hiding information by using various combinations of compression techniques....     

一种高效的服务组合优化算法

随着功能性属性相同而非功能性属性各异的Web服务的大量涌现,如何在服务组合业务流程中为各个任务选择相应的组件服务以达到组合服务的QoS(quality of service)最大化,并在此基础上满足不同用户的需求,已成为了国内外研究的热点.由于该问题的复杂性(NP-hard),目前存在的大多数方法都并不十分适合需要相对精确、实时决策的Web服务组合系统.因此,本文提出了一种基于凸包构建的组合服务优化算法(CM-HEU)用以解决QoS感知的服务组合优化问题.CM-HEU首先通过对组合服务中的每组任务进行凸包构建,以减少搜索空间.然后通过对初始解向量的多次升级和一次降级操作以达到全局优化的目标.实验表明:相对于现阶段存在的一些主流方法,CM-HEU不仅能得到一个比较理想的结果,并且具有良好的效率.     

An adaptive single-point algorithm for global numerical optimization

This paper describes a novel algorithm for numerical optimization, called Simple Adaptive Climbing (SAC). SAC is a simple efficient single-point approach that does not require a careful fine-tunning of its two parameters. SAC algorithm shares many similarities with local optimization heuristics, such as random walk, gradient descent, and hill-climbing. SAC has a restarting mechanism, and a powerful adaptive mutation process that resembles the one used in Differential Evolution. The algorithms SAC is capable of performing global unconstrained optimization efficiently in high dimensional test functions. This paper shows results on 15 well-known unconstrained problems. Test results confirm that SAC is competitive against state-of-the-art approaches such as micro-Particle Swarm Optimization, CMA-ES or Simple Adaptive Differential Evolution.     

An efficient dynamical evolutionary algorithm for global optimization

In this paper, we introduce a new dynamical evolutionary algorithm (DEA) that aims to find the global optimum and give the theoretical explanation from statistical mechanics. The algorithm has been evaluated numerically using a wide set of test functions which are nonlinear, multimodal and multidimensional. The numerical results show that it is possible to obtain global optimum or more accurate solutions than other methods for the investigated hard problems.     

基于全局图像结构信息的Seam Carving算法*

本文提出了一种基于全局图像结构信息的Seam Carving算法,它根据像素的重要性修改图像尺寸和比例。通过从图像提取特定方向的边缘结构信息,再利用每个像素的梯度信息,从全局和局部两方面定义新的像素能量计算函数,以此来阻止Seam通路与特定方向图像边缘的交叉,避免边缘像素的不一致位移,以此保持图像的边缘结构。实验结果证明,本文算法减少了处理后图像的结构形变,有效改进了Seam Carving算法的处理效果。     

An optimized phase-shifting algorithm for depth image acquisition

Multimedia Tools and Applications - As developing science and technology, traditional two-dimensional computer vision cannot meet the people’s needs for the three-dimensional recognition, and...     

一种矿井巷道图像边缘检测算法

针对传统的Canny算法在处理模糊的矿井巷道图像时存在边缘提取效果较差的问题,提出了一种基于小波变换和Canny算法的矿井巷道图像边缘检测算法。该算法首先对矿井巷道原始图像做小波分解,获得低频图像和高频图像,从而避免模糊图像对边缘检测效果的影响;然后采用Canny算法计算低频图像和高频图像的一阶差分,获得低频图像和高频图像的梯度图,通过计算局部梯度最大值,获得高频图像和低频图像的边缘图;当高频图像的边缘图上出现间断点时,在低频图像的边缘图中检测该点的8点邻域,寻找连接点,即可得到完整的矿井巷道边缘检测图。实验结果表明,与传统的Canny算法相比,该算法能够检测到较多的图像边缘点,具有较好的边缘连接效果。     

An improved clustering analyzing algorithm for image index

This paper provides a survey of current clustering analysis in image indexing at first, then the problems are solved and the new directions in the future in this domain are pointed out. In the end, it proposes a new clustering algorithm with the combination of k-means clustering algorithm, genetic algorithm and chaotic optimization, a new idea of dimensionality reduction.     

一种改进的桥梁图像分水岭分割算法

针对传统分水岭分割方法存在的过分割问题,提出了一种改进的桥梁图像分水岭分割算法。该算法首先对桥梁裂缝图像进行高低帽形态学滤波,并运用多尺度梯度算子提取梯度图像,在分水岭变换之前使用自适应的标记提取方法对区域极小值进行标定,然后对初步分水岭分割的过分割区域使用改进fisher距离的区域合并算法进行合并,取散度作为停止度量。实验表明,该算法减少了分水岭算法的过分割现象,提高了桥梁图像分割的精确性,具有很好的鲁棒性和适应性。