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

Journal of Combinatorial Mathematics and Combinatorial Computing 2014年 91卷 107-113页

作者： Xu, Xiaodong Liang, Meilian Shao, Zehui Guangxi Academy of Sciences Nanning530007 China School of Mathematics and Information Science Guangxi University Nanning530004 China Key Laboratory of Pattern Recognition and Intelligent Information Processing Institutions of Higher Education of Sichuan Province China School of Information Science and Technology Chengdu University Chengdu610106 China

A sequence {ai |1 ≤ i ≤ k} of integers is a weak Sidon sequence if the sums ai + aj are all different for any i i |1 ≤ i ≤ k} such that 1 ≤ a1k ≤ n. Let the weak Sidon number G(k) = min{n | g(n) = k}. In this note, g(n) and G(k) are studied, and g(n) is computed for n ≤ 172, based on which the weak Sidon number G(k) is determined for up to k = 17.

关键词： Combinatorial mathematics

来源：评论

学校读者我要写书评

暂无评论

New logistics distribution route dispatching mode based on genetic algorithm-ant colony algorithm

引用

Computer Modelling and New Technologies 2014年第10期18卷 313-318页

作者： Yi, Fasheng Li, Xiaoling Yuan, Jimin School of Computer Science and Technology Chengdu University Chengdu China University Key Laboratory of Pattern Recognition and Intelligent information Processing Chengdu China The Department Computer Engineering Chengdu Aeronautic Vocational and Technical College Chengdu China

For multi-target route optimization with constraint conditions, the mathematical model for logistics distribution route optimization is built to accelerate response speed of logistics enterprises to customers, improve service quality, and strengthen the satisfaction of customers, and a new algorithm with the combination of genetic and ant colony algorithms is proposed to solve the selection issues of such logistics route. Initial pheromone is formed with genetic algorithm, based on which the optimal solution is rapidly sought with ant colony algorithm, and complementary advantages are achieved between above two algorithms. Application examples and simulations are available for calculation, and the results show that such algorithm is practical and effective to optimize logistics distribution route.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

-labeling for brick product graphs

引用

Journal of Combinatorial Optimization 2014年第2期31卷 447-462页

作者： Shao, Zehui Xu, Jin Yeh, Roger K. School of Information Science and Technology Chengdu University Chengdu China Key Laboratory of Pattern Recognition and Intelligent Information Processing Institutions of Higher Education of Sichuan Province Chengdu China School of Electronic Engineering and Computer Science Peking University Beijing China Department of Applied Mathematics Feng Chia University Taichung Taiwan

Let $$G=(V, E)$$ be a graph. Denote $$d_G(u, v)$$ the distance between two vertices $$u$$ and $$v$$ in $$G$$ . An $$L(2, 1)$$ -labeling of $$G$$ is a function $$f: V \rightarrow \{0,1,\cdots \}$$ such that for any two vertices $$u$$ and $$v$$ , $$|f(u)-f(v)| \ge 2$$ if $$d_G(u, v) = 1$$ and $$|f(u)-f(v)| \ge 1$$ if $$d_G(u, v) = 2$$ . The span of $$f$$ is the difference between the largest and the smallest number in $$f(V)$$ . The $$\lambda $$ -number of $$G$$ , denoted $$\lambda (G)$$ , is the minimum span over all $$L(2,1 )$$ -labelings of $$G$$ . In this article, we confirm Conjecture 6.1 stated in X. Li et al. (J Comb Optim 25:716–736, 2013) in the case when (i) $$\ell $$ is even, or (ii) $$\ell \ge 5$$ is odd and $$0 \le r \le 8$$ .

关键词：

来源：评论

学校读者我要写书评

暂无评论

A robust CPD approach based on shape context

A robust CPD approach based on shape context

引用

Chinese Control Conference (CCC)

作者： Yawen Yang Zhang Peng Peng Yu Qiao Jie Yang Sheng Zheng Wang The Key Laboratory of Ministry of Education for System Control and Information Processing Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai CN Merchant Marine College Shanghai Maritime University Shanghai CN

Point matching is an important component of image registration. Recent years, Coherent Point Drift (CPD) method becomes a very popular point matching approach. CPD treats point matching as a probability estimation problem and speeds up the process of matching a lot. In this method, one set of points are thought to be sampled from a Gaussian Mixture Model (GMM), which is centered by the other set of points. However, CPD is sensitive to outliers and noises, especially when the noise ratio increased or the number of outliers gets much high. To deal with this problem, we introduce shape context into the step of searching for matching points and then improve the form of prior probabilities of GMM in this paper. The main idea of our method is that if the most points in a data set are likely to be matched to a particular centroid, this Gaussian component should be have a more influence to GMM. Therefore, we set prior probability of GMM with the similarity between GMM components and the data set. And the computation of similarity is based on shape context. The experiments on 2D and 3D images show that when noise ratio is low, our method performs as well as CPD does, but as the ratio increased, our method is more robust and satisfactory than CPD.

关键词： Noise Shape Testing Context Robustness Three-dimensional displays Marine animals

来源：评论

学校读者我要写书评

暂无评论

An Improvement to Genetic Algorithms for Multimodal Optimization in Noisy Environments: Re-evaluation of All Individuals per Generation

An Improvement to Genetic Algorithms for Multimodal Optimiza...

引用

International Conference on Computational Intelligence and Communication Networks (CICN)

作者： Junhua Li Peng Liu Linxia Zhou Ming Li Key Laboratory of Jiangxi Province for Image Processing and Pattern Recognition Nanchang Hang Kong University Nanchang China School of Information Engineering Nanchang Hang Kong University Nanchang China

ISBN: (纸本)9781479969302

Optimization in noisy environments is regard as a favorite application domains of genetic algorithms. Different methods for reducing the influence of noise are presented and discussed. A new fitness evaluation method is proposed that reevaluates all survival individuals each generation. Compared with re-sampling and population sizing, the new evaluation approach shows higher probability of searching to the global extremum area and precision of convergence. These results demonstrate that the proposed method is effective for reducing noise effects.

关键词： Noise Noise measurement Genetic algorithms Optimization Sociology Statistics Convergence

来源：评论

学校读者我要写书评

暂无评论

Salient object detection via color contrast and color distribution

Salient object detection via color contrast and color distri...

引用

11th Asian Conference on Computer Vision, ACCV 2012

作者： Fu, Keren Gong, Chen Yang, Jie Zhou, Yue Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Shanghai 200240 China

ISBN: (纸本)9783642373305

In this paper, we take the advantages of color contrast and color distribution to get high quality saliency maps. The overall procedure flow of our unified framework contains superpixel pre-segmentation, color contrast and color distribution computation, combination, final refinement and then object segmentation. During color contrast saliency computation, we combine two color systems and then introduce the using of distribution prior before saliency smoothing. It works to select correct color components. In addition, we propose a novel saliency smoothing procedure that is based on superpixel regions and is realized in color space. This processing step leads to total object being highlighted evenly, contributing to high quality color contrast saliency maps. Finally, a new refinement approach is utilized to eliminate artifacts and recover unconnected parts in the combined saliency maps. In visual comparison, our method produces higher quality saliency maps which stress out the total object meanwhile suppress background clutters. Both qualitative and quantitative experiments show our approach outperforms 8 state-of-the-art methods, achieving the highest precision rate 96% (3% improvement from the current highest), when evaluated via one of the most popular data sets [1]. Excellent content-aware image resizing also can be achieved with our saliency maps. © 2013 Springer-Verlag.

关键词： Superpixels

来源：评论

学校读者我要写书评

暂无评论

3D model retrieval using density-based silhouette descriptor

3D model retrieval using density-based silhouette descriptor

引用

2nd International Conference on pattern recognition Applications and Methods, ICPRAM 2013

作者： Tang, Qi Yang, Xin Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai 200240 China

ISBN: (纸本)9789898565419

In this paper we present a new content-based retrieval descriptor, density-based silhouette descriptor (DBS). It characterizes a 3D object with multivariate probability functions of its 2D silhouette features. The new descriptor is computationally efficient and induces a permutation property that guarantees invariance at the matching stage. Also, it is insensitive to small shape perturbations and mesh resolution. The retrieval performance on several 3D databases shows that the DBS provides state-of-art discrimination over a broad and heterogeneous set of shape categories.

关键词： Probability density function

来源：评论

学校读者我要写书评

暂无评论

Multiple kernel learning method using MRMR criterion and kernel alignment

Multiple kernel learning method using MRMR criterion and ker...

引用

20th International Conference on Neural information processing, ICONIP 2013

作者： Wu, Peng Duan, Fuqing Guo, Ping Image Processing and Pattern Recognition Laboratory Beijing Normal University Beijing 100875 China Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of Jinan Jinan 250022 China

ISBN: (纸本)9783642420535

Multiple kernel learning (MKL) is a widely used kernel learning method, but how to select kernel is lack of theoretical guidance. The performance of MKL is depend on the users' experience, which is difficult to choose the proper kernels in practical applications. In this paper, we propose a MKL method based on minimal redundant maximal relevance criterion and kernel alignment. The main feature of this method compared to others in the literature is that the selection of kernels is considered as a feature selection issue in the Hilbert space, and can obtain a set of base kernels with the highest relevance to the target task and the minimal redundancies among themselves. Experimental results on several benchmark classification data sets show that our proposed method can enhance the performance of MKL. © Springer-Verlag 2013.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Mining top-K Frequent and Flexible pattern from sequences

Mining top-K Frequent and Flexible Pattern from sequences

引用

2013 IEEE Conference Anthology, ANTHOLOGY 2013

作者： Junyan, Zhang Fan, Min Information Science and Technology College Chengdu University China University Key Laboratory of Pattern Recognition and Intelligent Information Processing Sichuan Province Chengdu China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China

ISBN: (纸本)9781479916603

pattern Mining is a popular issue in biological sequence analysis. With the introduction of wildcard gaps, more interesting patterns can be mined. In this paper, we propose a new definition related to pattern frequency, under which the Apriori property holds. We define a pattern mining problem called Ming top-K Frequent patterns (MFP), where gaps are mined instead of specified. Compared with existing problems, MFP does not require any domain knowledge of the user. However, theoretical analysis and experimental results show that MFP favors inflexible patterns. We then define another problem where the flexibility threshold of each gap is specified by the user. The problem is called Mining top-K Frequent and Flexible patterns (MF2P). We develop algorithm with polynomial complexities for both problems. patterns can grow from both sides. Some interesting biological patterns mined by our algorithms are discussed. © 2013 IEEE.

关键词： Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

Robust visual tracking based on online learning of joint sparse dictionary

Robust visual tracking based on online learning of joint spa...

引用

6th International Conference on Machine Vision, ICMV 2013

作者： Li, Qiaozhe Qiao, Yu Yang, Jie Bai, Li Key Laboratory of Ministry of Education for System Control and Information Processing Institute of Image Processing and Pattern Recognition Shanghai Jiaotong University Shanghai China School of Computer Science University of Nottingham Nottingham United Kingdom

ISBN: (纸本)9780819499967

In this paper, we propose a robust visual tracking algorithm based on online learning of a joint sparse dictionary. The joint sparse dictionary consists of positive and negative sub-dictionaries, which model foreground and background objects respectively. An online dictionary learning method is developed to update the joint sparse dictionary by selecting both positive and negative bases from bags of positive and negative image patches/templates during tracking. A linear classifier is trained with sparse coefficients of image patches in the current frame, which are calculated using the joint sparse dictionary. This classifier is then used to locate the target in the next frame. Experimental results show that our tracking method is robust against object variation, occlusion and illumination change. © 2013 SPIE.

关键词： E-learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：