Support vector regression based color image restoration in YUV color space

A support vector regression(SVR) based color image restoration algorithm is proposed.The test color images are firstly mapped into the YUV color space,and then SVR is applied to build up a theoretical model between the degraded images and the original one.Performance comparisons of the proposed algorithm versus traditional filtering algorithms are given.Experimental results show that the proposed algorithm has better performance than traditional filtering algorithms and has less computation time than iterat...     

基于遗传算法的二维QR码图像识别

基元识别是二维码图像识别中的一个关键问题，提出了基于遗传算法的QR码识别方法．首先建立QR码待识别模式模型，据此进行遗传算法，通过实例进行图像识别．该方法抓住了QR码基元的重要特征，利用改进遗传算法，可以提高QR码图像的识别效率．     

Exploiting Local and Global Characteristics for Contrast Based Visual Saliency Detection

Visual saliency is an important cue in human visual system to identify salient region in the image;it can be useful in many applications including image retrieval,object recognition,image segmentation,etc.Image contrast has been used as an effective feature to detect visual salient region.However,the conventional contrast measures either in spectral domain or in spatial domain fail to give sufficient consideration towards the local and global characteristics of the image.This paper presents a visual saliency detection algorithm based on a novel contrast measurement.This measurement extracts the spectral information of image block using the 2D discrete Fourier transform(DFT),and combines with the total variation(TV)of image block in spatial domain.The proposed algorithm is used to perform salient region detection in the image,and compared with state-of-the-art algorithms.The experimental results from the MSRA dataset validate the effectiveness of the proposed algorithm.     

基于图像分割的图像检索新方法

利用信息熵理论,提出了一种新的相似性图像检索方法.首先,分割图像,抽取图像的分块颜色信息;再计算图像之间的颜色互信息来确定它们的相似度.与其他的颜色特征描述方法相比,该方法该算法具有抗噪声能力强、精确度高等优点.     

Compressive sensing reconstruction based on weighted directional total variation

Directionality of image plays a very important role in human visual system and it is important prior information of image. In this paper we propose a weighted directional total variation model to reconstruct image from its finite number of noisy compressive samples. A novel self-adaption, texture preservation method is designed to select the weight. Inspired by majorization-minimization scheme, we develop an efficient algorithm to seek the optimal solution of the proposed model by minimizing a sequence of quadratic surrogate penalties. The numerical examples are performed to compare its performance with four state-of-the-art algorithms. Experimental results clearly show that our method has better reconstruction accuracy on texture images than the existing scheme.     

Sequential similarity detection algorithm based on image edge feature

Abstract： This paper proposes a new sequential similarity detection algorithm （SSDA）, which can overcome matching error caused by grayscale distortion; meanwhile, time consumption is much less than that of regular algorithms based on image feature. The algorithm adopts Sobel operator to deal with subgraph and template image, and regards the region which has maximum relevance as final result. In order to solve time-consuming problem existing in original algorithm, a coarse-to-fine matching method is put forward. Besides, the location correlation keeps updating and remains the minimum value in the whole scanning process, which can significantly decrease time consumption. Experiments show that the algorithm proposed in this article can not only overcome gray distortion, but also ensure accuracy. Time consumption is at least one time orders of magnitude shorter than that of primal algorithm.     

基于重选择流形排序的图像检索

在研究已有基于流形排序图像检索算法存在问题的基础上,提出一种基于重选择流形排序的图像检索算法,此算法可以在节约时间的同时,进一步提高检索结果的精度,并在实际图像数据库中的实验结果验证了此算法的有效性.     

遗传算法在图像分割中的应用

图像分割是图像分析的预处理阶段,被认为是计算机视觉中的一个瓶颈.基于扩展的Otsu最优阈值图像分割方法,提出用一种改进遗传算法进行图像分割的方法,并给出了遗传算法中参数的设定.仿真结果表明,改进算法的计算速度不仅明显优于传统的Otsu方法,而且算法的分割效果也很好.     

A Subsection Shared Restoration Method for Long-Haul WDM Networks

A novel restoration scheme, Parted Path Shared Restoration (PPSR), was proposed. The major idea of PPSR is the strategy of ‘parted disposal‘. PPSR keeps the advantage of Path Based Shared Restoration (PBSR) in utilization of capacity. In addition, the restoration time of PPSR is much less than that of PBSR. Furthermore, a satisfaction function was proposed to estimate the performance of PPSR. This function takes the utilization of capacity and restoration time, into a harmonious and uniform frame. Through theoretical analysis and computer simulation, the performance of PPSR was demonstrated.     

Kullback-leibler测度在盲目反褶积中的应用

利用Likas等处理图像恢复的变分法来讨论地震记录反演中的盲目反褶积问题.利用Kullback-leibler信息测度获得一个非常有用的统计函数(即变分函数),此函数的极值点就含有所要求的子波及反射系数序列,并且拟订出求此泛数极值点的一套算法.     

Kullback-leibler测度在盲目反褶积中的应用

利用Likas等处理图像恢复的变分法来讨论地震记录反演中的盲目反褶积问题.利用Kullback-leibler信息测度获得一个非常有用的统计函数(即变分函数),此函数的极值点就含有所要求的子波及反射系数序列,并且拟订出求此泛数极值点的一套算法.     

New Iris Localization Method Based on Chaos Genetic Algorithm

This paper present a new method based on Chaos Genetic Algorithm (CGA) to localize the human iris in a given image. First, the iris image is preprocessed to estimate the range of the iris localization, and then CGA is used to extract the boundary of the iris. Simulation results show that the proposed algorithms is efficient and robust, and can achieve sub pixel precision. Because Genetic Algorithms (GAs) can search in a large space, the algorithm does not need accurate estimation of iris center for subsequent localization, and hence can lower the requirement for original iris image processing. On this point, the present localization algirithm is superior to Daugman‘s algorithm.     

A Novel Automatic Method for Removal of Flicker in Video

Intensity flicker is a common form of degradation in archived film. Most algorithms on this distortion are complicated and uncontrolled. This paper presented a discrete mathematical model of flicker, designed a block-based estimation method of the model＇s parameters according to their features of intensity variation in large area. With this estimation result it constructed a compensation model to repair the current frame. This restoration approach is full automatic and the repair process of current frame does not need the information of frames behind it. The algorithm was realized to establish a simple and adjustable repair system. The experimental results show that the proposed algorithm can remove most intensity flicker and preserve tho wanted effects.     

A POCS-Based Algorithm for Blocking Artifacts Reduction

Introduction Block-based discrete cosine transform(BDCT) is considered to be a basic tool in bothstill and moving image compression standards,such as JPEG, H.261/263, and MPEG, owing toits near-optimal energy compaction property andmoderate hardware complexity. However, sinceeach N×N block is coded independently, the re-constructed images would exhibit annoying discon-tinuities along block boundaries at low bit rate,which are often referred to as the“blocking arti-facts”in the transfo…     

基于差分模型的无控制DEM差异探测方法

为了提高现有方法的性能，提出了基于差分模型的无控制数字高程模型（DEM）差异探测的新方法，并成功地用于普歪沟泥石流地区地表变形探测（该区变形面积超过50％）．该方法在LZD算法（最小高差法）的基础上引入差分模型，兼顾了观测值的数值及其相互关系的影响，显著提了高算法的差异探测性能．结果表明，新方法的匹配精度比目前代表性的采用肌估计的LZD算法（M-LZD）和采用最小平方中位数的LZD算法（LMSLZD）的精度高．     

面向地震应急的救援路径规划模型

地震灾害场景下,面向应急的救援路径规划需要兼顾救援效率和交通抢通对救援的影响,以支撑有限交通资源的高效利用,避免交通拥堵或瘫痪耽误应急救援行动.通过定义面向应急需求的交通网络、交通路线的通行成本和交通线的通过性等,对救援与抢通路径规划问题进行了描述;将最优救援路径和最优交通抢通方案作为该问题的约束条件,基于双层优化方法建立了双层路径规划模型以实现集成优化并构建了模型求解方法.经案例仿真分析,本文提出的救援路径规划模型可以生成准确、高效的应急救援与交通抢通集成方案,可以为具有针对性的交通管制措施的拟定提供科学依据,助力地震应急救援行动的顺利实施.     

Active Contours and Mumford-Shah Segmentation Based on Level Sets

IntroductionThe basic idea in active contour models orsnakes is to evolve a curve,subject to constraintsfrom a given image,in order to detect objects inthat image.For instance,starting with a curvearound the object to be detected,the curve movestoward its interior normal and has to stop on theboundary of the object.LetΩ be a bounded open subset of R2 ,with Ω its boundary. Let u0 ∶Ω→ R be a given image,and C( s)∶ [0 ,1 ]→ R2 be a parameterized curve. Inthe classical snakes and active…     

Latent Supportive Utility of Irrelevant Attributes in Feature Selection

This paper proposed a novel feature selection method LUIFS (latent utility of irrelevant feature selection) that not only selects the relevant features, but also targets at discovering the latent useful irrelevant attributes by measuring their supportive importance to other attributes. The method minimizes the information lost and simultaneously maximizes the final classification accuracy. The classification error rates of the LUIFS method on 16 real-life datasets from UCI machine learning repository were evaluated using the ID3, Nave-Bayes, and IB (instance-based classifier) learning algorithms, respectively; and compared with those of the same algorithms with no feature selection (NoFS), feature subset selection (FSS), and correlation-based feature selection (CFS). The empirical results demonstrate that the LUIFS can improve the performance of learning algorithms by taking the latent relevance for irrelevant attributes into consideration, and hence including those potentially important attributes into the optimal feature subset for classification.     

震后恢复期物资配送中的多周期选址-联运问题

震后恢复期的物资配送是一项复杂的系统工程,针对震后恢复期两级救援物资 配送系统中的多品种物资、多运输方式、多周期决策等特征,提出了一个以系统总费用最 小为目标的混合整数线性规划模型,用以解决震后恢复期救援物流系统中的选址-联运 问题.针对该模型的特点,设计了一种结合启发式规则的分周期、分阶段解码的混合遗传 算法. 以“5.12”汶川大地震恢复期救援物资保障过程构建算例,对该模型和算法进行了实 例验证. 结果表明,该算法具有较好的性能,可以有效解决震后恢复期物资配送中的多周 期选址-联运问题.     

HIERARCHICAL CONTENT BASED IMAGE RETRIEVAL

ＩｎｔｒｏｄｕｃｔｉｏｎＡｔｒａｄｅｍａｒｋｉｍａｇｅｄａｔａｂａｓｅｉｓａｓｅｔｏｆｔｒａｄｅ－ｍａｒｋｐｉｃｔｕｒｅｓ．Ｕｓｕａｌｙｉｔｉｓｔｈｅｄｕｔｙｏｆｐａｔｅｎｔａｎｄｔｒａｄｅｍａｒｋｏｆｉｃｅｔｏｅｓｔａｂｌｉｓｈａｎｄｍａｎａｇｅｔ...