检索结果-内蒙古大学图书馆

Asia Pacific Conference on Multimedia and Broadcasting (APMediaCast)

作者： Hussain Dawood Hassan Dawood Ping Guo Image Processing and Pattern Recognition Laboratory Beijing Normal University Beijing China

In this paper, based on Khalimsky grid, a new Random-valued Impulse noise identification and removal method is proposed. Khalimsky grid can presents the neighborhood relationship among the pixels in the sliding window, effectively. The local statistics of Khalimsky grid is used to define an adaptive threshold range to identify the central pixel in current sliding window as noisy or noise free in an iterative way. The identified noisy pixel is replaced by local statistics of propose vertical direction based noise removal method. The performance of the propose method is evaluated on different test images and compared with state-of-the-art methods. Experimental results show that the propose method can identify the impulse noise, as well as can preserve the detailed information of an image, efficiently.

关键词： Noise Noise measurement Tin Multimedia communication Filtering algorithms Asia Digital multimedia broadcasting

来源：评论

学校读者我要写书评

暂无评论

Framelet-based sparse regularization for uneven intensity correction of remote sensing images in a retinex variational framework

引用

Optik 2016年第3期127卷 1184-1189页

作者： Xia Lan Zhiyong Zuo Huanfeng Shen Liangpei Zhang Jing Hu The 10th Institute of China Electronics Technology Group Corporation Chengdu 610036 China The School of Resource and Environmental Sciences Wuhan University Wuhan 430079 China The State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing Wuhan University Wuhan 430079 China National Key Laboratory of Science and Technology on Multispectral Information Processing Institute for Pattern Recognition and Artificial Intelligence Huazhong University of Science and Technology Wuhan 430074 China

Correcting uneven intensity distribution from a single image has long been a challenging problem with remote sensing image. In this paper, an analysis-based sparse prior is employed in the retinex variational framework for the uneven intensity correction of remote sensing images. This sparse regularization model is used to adjust uneven intensity by regularizing the sparsity of the reflectance component under framelet transform. Furthermore, the alternating minimization algorithm and split Bregman method are adopted to solve the framelet-based sparse regularization model. The experiments, with both simulated images and real-life images, show that the proposed model can effectively correct the uneven intensity distribution.

关键词： Framelet Retinex Uneven intensity correction Remote sensing image Split Bregman algorithm

来源：评论

学校读者我要写书评

暂无评论

A Hybrid image Feature Descriptor for Classification

A Hybrid Image Feature Descriptor for Classification

引用

International Conference on Computational Intelligence and Security

作者： Hassan Dawood Hussian Dawood Ping Guo Image Processing and pattern Recognition Laboratory Beijing Normal University Beijing China Department of Computer Engineering University of Engineering and Technology Taxila Pakistan Image Processing and Pattern Recognition Laboratory Beijing Normal University Beijing China

Feature extraction methods have an important role in image classification. In this paper, a hybrid texture feature descriptor is proposed by utilizing the attributes of two complementary features, PRICoLBP and LPQ. PRICoLBP performs well in the case of geometric and photometric variations however it does not properly express the local texture of an image, while LPQ method performs well for the local structure of an image. We propose to use the hybrid scheme by combining the properties of PRICoLBP and LPQ and name it as Pair wise Rotation Invariant Co-occurrence Local Phase Quantization (PRICLPQ). Standard texture and material datasets have been used to verify the robustness of proposed hybrid scheme. The experiments show that the proposed hybrid scheme outperforms the state-of-the-art feature extraction methods like LBP, LPQ, CLBP, LBPV, SIFT, MSLBP, Lazebnik and PRICoLBP in term of accuracy.

关键词： Feature extraction Histograms Robustness Training Quantization (signal) Support vector machines Yttrium

来源：评论

学校读者我要写书评

暂无评论

A comparative study of different feature mapping methods for image annotation

A comparative study of different feature mapping methods for...

引用

International Workshop on Advanced Computational Intelligence (IWACI)

作者： Yiren Wang Hassan Dawood Qian Yin Ping Guo the Image Processing and Pattern Recognition Laboratory Beijing Normal University Beijing China the Image Processing and Pattern Recognition Laboratory Beijing Normal University Beijing China Computer Science Department Beijing Normal University Beijing China

Automatic image annotation and tagging is necessary for indexing and searching of images using querying a text. It is widely used in search engines like Google, Yahoo, Baidu, etc. Fast image Tagging (FastTag) algorithm is proposed to accelerate image annotation process, while keeping the precision of automatic image annotation results. Feature mapping is used to map image features vectors onto higher dimensional feature space. Feature mapping methods plays an important role in automatic image annotation. In this paper, we have compared 6 kernels, among which four kernels are used in homogeneous feature mapping and two kernels are used in discriminative tree based feature mapping, to investigate which feature mapping performs better for automatic image annotation. The performance of these methods has been analyzed by conducting intensive experiments on three different datasets as used by FastTag algorithm in their experiments. We have found that the homogeneous feature mapping with χ 2 kernel is more suitable when used in FastTag algorithm in terms of precision, recall, FI score and N+ measures, and with a relatively acceptable performance.

关键词： Phase change materials Search engines Kernel Indexing Histograms

来源：评论

学校读者我要写书评

暂无评论

Blind source separation with evolution based KICA

Blind source separation with evolution based KICA

引用

Asia Pacific Conference on Multimedia and Broadcasting (APMediaCast)

作者： Peng Wu Qian Yin Ping Guo Image Processing and Pattern Recognition Laboratory Beijing Normal University Beijing China Shandong Provincial Key Laboratory of Network based Intelligent Computing University of Jinan Jinan China

ISBN: (纸本)9781479979684

Kernel independent component analysis (KICA) has been widely used in the field of blind source separation. The selection of kernel function and its parameters plays an important role in KICA algorithm performance. An optimal kernel model should be rich enough to well map the given samples. However, users usually use a singular kernel based model in their experiments, which leads to a suboptimal kernel model. In order to solve this problem, we propose the evolution based multiple kernel independent component analysis (EMKICA), in which a convex combination of multiple base kernels is used instead of single kernel of KICA. The combination weights are learned by particle swarm optimization algorithm. Firstly, we elaborate the basic theory of KICA and concept of EMKICA, also the combination form of the composition kernel used in EMKICA. Secondly, we describe the presentation of the individuals in the particle swarm optimization algorithm, the settings of the evaluation function and general algorithm. Finally, we evaluate the separation ability of EMKICA on three different data sets including one-dimensional mixed signals, composite images and images with reflection. The experimental results verify the effectiveness of EMKICA.

关键词： Kernel Independent component analysis Algorithm design and analysis Multimedia communication Correlation Optimization Asia

来源：评论

学校读者我要写书评

暂无评论

A New Method for recognition Partially Occluded Curved Objects under Affine Transformation

A New Method for Recognition Partially Occluded Curved Objec...

引用

International Conference on Intelligent System and Knowledge Engineering, ISKE

作者： GuiMei Zhang JiYuan Xu JianXin Liu Key Laboratory of Image Processing and Pattern Recognition Nanchang Hangkong University Jiangxi Province China School of Mechanical Engineering and Automation Xihua University Chengdu Sichuan China

A new method dealing with recognition of partially occluded and affine distortion objects is presented. The method is designed for objects with smooth curved boundary. It divides an object into affine-invariant parts based on the feature point. And a new approach for matching each part is presented in this paper. Robust Hausdorff distance (RHD) is introduced to measure the similarity between feature points set of model and that of target. In terms of the new RHD, the optimal affine transform can be estimated. And then the sub-curve match pairs are calculated based on the optimal affine transformation. The experimental results show proposed algorithm are capable of coping with partial occlusion and affine transformation.

关键词： Transforms Shape Robustness pattern recognition image recognition Mathematical model Distortion

来源：评论

学校读者我要写书评

暂无评论

Improved global optical flow estimation with mean shift algorithm for target detection

引用

International Journal of Wireless and Mobile Computing 2015年第4期8卷 323-328页

作者： Wang, Zhonghua Li, Chunyong Liu, Qingping Key Laboratory of Jiangxi Province for Image Processing and Pattern Recognition Nanchang Hangkong University Nanchang Jiangxi Province330063 China School of Information and Engineering Nanchang Hangkong University Nanchang Jiangxi Province330063 China

In view of the problem that the global optical flow algorithm cannot acquire accurate motion parameter estimation at a low-gradient value, an improved method has been presented in order to enhance the self-adaptive ability. The proposed method is divided into three steps: firstly, the Gaussian filter is used to restrain the background noise;secondly, the optical basic constraint weighted function is modified to acquire targets area;finally, the morphological filtering and mean shift segmentation algorithm is adopted to reduce the false alarm rate. Compared with other algorithms, the experiment results show that the proposed method can improve the self-adaptive ability and the detection rate. © 2015 Inderscience Enterprises Ltd.

关键词： Optical flows

来源：评论

学校读者我要写书评

暂无评论

Research on DNA sequence homology based on second order Markov model

引用

Journal of Fiber Bioengineering and Informatics 2015年第3期8卷 539-546页

作者： Zhang, Junyan Yang, Chenhui College of Computer Science Chengdu University Chengdu China Key Laboratory of Pattern Recognition and Intelligent Information Processing of Sichuan Chengdu University Chengdu China

DNA sequence homology is a critical and fundamental problem in bioinformatics. In this paper, we solve this problem by use of the second order Markov modal instead of traditional sequence alignment because DNA character sequence meets the Markov properties. Hence, the characteristics of DNA sequences are represented by using their two-step transition probabilities matrices. The similarity degree measurement between two different DNA sequences is defined. Our DSHM algorithm is put forward which is implemented by MyEclipse. The contrast experiments are done between DSHM and other two methods. The experimental results show that DSHM algorithm can determine DNA sequence homology correctly in the more effective way. © 2015 Binary Information Press & Textile Bioengineering and Informatics Society.

关键词： DNA sequences

来源：评论

学校读者我要写书评

暂无评论

An image fusion method of multi-scale image based on HMM and genetic algorithms

引用

Journal of Computational Information Systems 2015年第12期11卷 4367-4374页

作者： Jiang, Zetao Wu, Donghui The Institute of Computer Science and Engineering Guilin University of Electronic Technology Guilin China The Key Lab of Image Processing and Pattern Recognition of Jiangxi Province Nanchang Hangkong University Nanchang China

At present, in the field of pixel-level image fusion, researchers tend to treat each pixel independently, which destroys the relationship between the images to be fused. In view of this defects, this paper aims to propose a method for multi-scale image fusion based on Genetic Algorithm (GA) under the guidance of Hidden Markov Model (HMM). This fusion method is set on the following principles. First of all, the wavelet transformation (WT) of the two images to be fused will be conducted. And then establish HMM for the fusion coefficients from high to low in descending hierarchical order. Finally, guided by HMM, the author applies GA to searching hierarchically for the optimal fusion coefficient. With this method, the best fusion effect will be achieved. This method take good advantage of the correlation information between the images to be fused so as to improve the fidelity and accuracy of the fusion. Given this, the author makes an empirical analysis on this fusion method, which proves to be feasible and effective. ©, 2015, Binary Information Press. All right reserved.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

An improved K-OPT local search algorithm for the vertex separator problem

引用

Journal of Computational and Theoretical Nanoscience 2015年第11期12卷 4942-4958页

作者： Zhang, Zhiqiang Shao, Zehui Key Laboratory of Pattern Recognition and Intelligent Information Processing Institutions of Higher Education of Sichuan Province China School of Computer Science Chengdu University Chengdu610106 China

A vertex separator in an undirected graph is a subset of the vertices, whose removal disconnects the graph in at least two nonempty connected components. Given a connected undirected graph G = (V ,E) with |V| = n, an integer 1 ≤ b ≤ n, the vertex separator problem (VSP) asks to find a partition of V into disjoint sets A, B, C, with A and B nonempty, such that (1) E contains no edge (i, j) with i A, j ? B, (2) max{|A|} |B|} = b, (3) |C| is minimized. The vertex separator problem is a classic NP complete problem. It is widely applied to circuit design, computer network communication, protein combination in bioinformatics, etc. At present there has already been exact algorithm to search vertex separator of undirected graph, while there are only few heuristic algorithms. Aiming at the VSP and a solution design for heuristic algorithm, this paper designs an improved K-OPT local search algorithm. In order to compare the searching efficiency of a variety of heuristic algorithms for VSP, this paper also designs simulated annealing algorithm and variable neighborhood search algorithm, and performs comparative experiments on these algorithms using DIMACS graph, MATRIXMARKET graph, MIPLIB graph. The experimental results show that the improved K-OPT local search algorithm goes the best. In the experiment, using improved K-OPT local search algorithm, existing Relax-and-Cut algorithm is further compared, whose experimental results show that in some graph tests, the improved K-OPT local search algorithm goes better than Relax-and-Cut algorithm. © 2015 American Scientific Publishers.

关键词： Undirected graphs

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：