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

Nearness of subtly different digital images

Conference on Rough Sets and Knowledge Technology, RSKT 2011

作者： Puzio, Leszek Peters, James F. Computational Intelligence Laboratory Department of Electrical and Computer Engineering University of Manitoba Winnipeg MB R3T 5V6 Canada Department of Information Systems and Applications University of Information Technology and Management ul. H.Sucharskiego 2 35-225 Rzeszow Poland School of Mathematics and Computer/Information Sciences University of Hyderabad Central Univ. P.O. Hyderabad 500046 India

ISBN: (纸本)9783642365041

The problem considered in this article is how to measure the nearness or apartness of digital images in cases where it is important to detect subtle changes in the contour, position, and spatial orientation of bounded regions. The solution of this problem results from an application of anisotropic (direction dependent) wavelets and a tolerance near set approach to detecting similarities in pairs of images. A wavelet-based tolerance Nearness Measure (tNM) makes it possible to measure fine-grained differences in shapes in pairs of images. The application of the proposed method focuses on image sequences extracted from hand-finger movement videos. Each image sequence consists of hand-finger movements recorded during rehabilitation exercises. The nearness of pairs of images from such sequences is measured to check the extent that normal hand-finger movement differs from arthritic hand-finger movement. Experimental results of the proposed approach are reported, here. The contribution of this article is an application of an anisotropic wavelet-based tNM in classifying arthritic hand-finger movement images in terms of their degree of nearness to or apartness from normal hand-finger movement images. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Anisotropy

来源：评论

学校读者我要写书评

暂无评论

Weighted-permutation entropy: A complexity measure for time series incorporating amplitude information

引用

Physical Review E 2013年第2期87卷 022911-022911页

作者： Bilal Fadlallah Badong Chen Andreas Keil José Príncipe Computational NeuroEngineering Laboratory Department of Electrical and Computer Engineering University of Florida Gainesville Florida 32611 USA Institute of Artificial Intelligence and Robotics Xi'an Jiaotong University Xi'an 710049 China NIMH Center for the Study of Emotion and Attention Department of Psychology University of Florida Gainesville Florida 32611 USA

Permutation entropy (PE) has been recently suggested as a novel measure to characterize the complexity of nonlinear time series. In this paper, we propose a simple method to address some of PE's limitations, mainly its inability to differentiate between distinct patterns of a certain motif and the sensitivity of patterns close to the noise floor. The method relies on the fact that patterns may be too disparate in amplitudes and variances and proceeds by assigning weights for each extracted vector when computing the relative frequencies associated with every motif. Simulations were conducted over synthetic and real data for a weighting scheme inspired by the variance of each pattern. Results show better robustness and stability in the presence of higher levels of noise, in addition to a distinctive ability to extract complexity information from data with spiky features or having abrupt changes in magnitude.

关键词： PERMUTATIONS ENTROPY TIME series analysis NOISE MATHEMATICAL statistics

来源：评论

学校读者我要写书评

暂无评论

Associated near sets of merotopies

引用

14th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2012

作者： Peters, James F. Ramanna, Sheela Computational Intelligence Laboratory Department of Electrical and Computer Engineering Univ. of Manitoba E1-526 75A Chancellor's Circle Winnipeg MB R3T 5V6 Canada Applied Computer Science Univ. of Winnipeg 515 Portage Ave. Winnipeg MB R3D 2E9 Canada

ISBN: (纸本)9783642317088

This paper introduces associated near sets of distance functions called merotopies. An associated set of a function is a collection containing members with one or more common properties. This study has important implications in discerning patterns shared by members of an associated set. The focus in this paper is on defining and characterising distance functions relative to structures that are collections of sufficiently near (or apart) rough sets. Naimpally-Peters-Tiwari distance functions define approach spaces that are extended metric spaces. An important side-effect of this work is the discovery of various patterns that arise from the descriptions (perceptions) of associated set members. An application of the proposed approach is given in the context of camouflaged objects. © 2012 Springer-Verlag.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

ICFHR 2012 Competition on Handwritten Document Image Binarization (H-DIBCO 2012)

ICFHR 2012 Competition on Handwritten Document Image Binariz...

引用

International Workshop on Frontiers in Handwriting Recognition

作者： Ioannis Pratikakis Basilis Gatos Konstantinos Ntirogiannis Department of Electrical and Computer Engineering Democritus University of Thrace Xanthi Greece Computational Intelligence Laboratory NCSRDemokritos Institute of Informatics and Telecommunications Athens Greece Department of Informatics and Telecommunications National and Kapodistrian University of Athens Athens Greece

H-DIBCO 2012 is the International Document Image Binarization Competition which is dedicated to handwritten document images organized in conjunction with ICFHR 2012 conference. The objective of the contest is to identify current advances in handwritten document image binarization using meaningful evaluation performance measures. This paper reports on the contest details including the evaluation measures used as well as the performance of the 24 submitted methods along with a short description of each method.

关键词： Educational institutions Image edge detection Clustering algorithms Distortion measurement Filtering algorithms PSNR Informatics

来源：评论

学校读者我要写书评

暂无评论

Bee Colonies as Model for Multimodal Continuous Optimization: The OptBees Algorithm

Bee Colonies as Model for Multimodal Continuous Optimization...

引用

IEEE Congress on Evolutionary Computation

作者： Renato Dourado Maia Leandro Nunes de Castro Walmir Matos Caminhas Department of Computer Science State University of Montes Claros Montes Claros Brazil Natural Computing Laboratory (LCoN) Faculty of Electrical Engineering and Computer Science Mackenzie University ?o Paulo Brazil Computational Intelligence Laboratory Department of Electronic Engineering Federal University of Minas Gerais Belo Horizonte Brazil

ISBN: (纸本)9781467315104

This paper presents the OptBees, an optimization algo-rithm inspired by the processes of collective decision-making by bee colonies. The algorithm was designed with the objective of generat-ing and maintaining diversity, promoting a multimodal search and obtaining multiple local optima without losing the ability of global optimization, thus representing an innovation compared with exis-tent bee-inspired algorithms. It has been tested in five of the twen-ty-five minimization problems proposed for the Optimization Competition of Real Parameters of the CEC 2005 Special Session on Real-Parameter Optimization, held in the 2005 IEEE Congress on Evolutionary Computation (CEC). The results obtained suggest the suitability of the algorithm to exploit multimodality of prob-lems, being successful in the generation and maintenance of diversi-ty and achieving good quality results in global optimization.

关键词： sociobiology insects bees collective decision-making optimization multimodality diversity

来源：评论

学校读者我要写书评

暂无评论

A GPU based parallel Hierarchical Fuzzy ART clustering

A GPU based parallel Hierarchical Fuzzy ART clustering

引用

2011 International Joint Conference on Neural Network, IJCNN 2011

作者： Kim, Sejun Wunsch, Donald C. Applied Computational Intelligence Laboratory Department of Electrical and Computer Engineering Missouri University of Science and Technology Rolla MO 65409 United States Department of Electrical and Computer Engineering Missouri University of Science and Technology Rolla MO 65409 United States

ISBN: (纸本)9781457710865

Hierarchical clustering is an important and powerful but computationally extensive operation. Its complexity motivates the exploration of highly parallel approaches such as Adaptive Resonance Theory (ART). Although ART has been implemented on GPU processors, this paper presents the first hierarchical ART GPU implementation we are aware of. Each ART layer is distributed in the GPU's multiprocessors and is trained simultaneously. The experimental results show that for deep trees, the GPU's performance advantage is significant. © 2011 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Solving constrained optimization problems by an improved particle swarm optimization

Solving constrained optimization problems by an improved par...

引用

2011 2nd International Conference on Innovations in Bio-inspired Computing and Applications, IBICA 2011

作者： Sun, Chaoli Zeng, Jianchao Chu, Shuchuan Roddick, John F. Pan, Jengshyang Complex System and Computational Intelligence Laboratory Taiyuan University of Science and Technology Taiyuan Shanxi China School of Computer Science Engineering and Mathematics Flinders University Australia Department of Electronic Engineering National Kaohsiung University of Applied Sciences Kaohsiung Taiwan

ISBN: (纸本)9781457712197

Constrained optimization problems compose a large part of real-world applications. More and more attentions have gradually been paid to solve this kind of problems. An improved particle swarm optimization (IPSO) algorithm based on feasibility rules is presented in this paper to solve constrained optimization problems. The average velocity of the swarm and the best history position in the particle's neighborhood are introduced as two turbulence factors, which are considered to influence the fly directions of particles, into the algorithm so as not to converge prematurely. The performance of IPSO algorithm is tested on 13 well-known benchmark functions. The experimental results show that the proposed IPSO algorithm is simple, effective and highly competitive. © 2011 IEEE.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Perceptual tolerance intersection

引用

Lecture Notes in computer Science

作者： Wasilewski, Piotr Peters, James F. Ramanna, Sheela Computational Intelligence Laboratory Department of Electrical and Computer Engineering Univ. of Manitoba 75A Chancellor's Circle Winnipeg MB R3T 5V6 Canada Department of Applied Computer Science University of Winnipeg Winnipeg MB R3B 2E9 Canada

ISBN: (纸本)9783642183010

This paper elaborates on the introduction of perceptual tolerance intersection of sets as an example of a near set operation. Such operations are motivated by the need to consider similarities between digital images viewed as disjoint sets of points. The proposed approach is in keeping with work by E.C. Zeeman on tolerance spaces and visual perception and work by J.H. Poincaré on sets of similar sensations used to define representative spaces (aka tolerance spaces) such as visual, tactile and motile spaces. Perceptual tolerance intersection of sets is a direct consequence of recent work on near sets. The theory of perceptual set intersection has many practical applications such as a solution to the problem of how one goes about measuring the closeness of digital images. The main contribution of this article is a description-based approach to formulating perceptual set intersections between disjoint sets that resemble each other. A practical application of the proposed approach is the discovery of resemblances between sets of points in digital image regions that represent tolerance rough sets. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

A GPU based Parallel Hierarchical Fuzzy ART clustering

A GPU based Parallel Hierarchical Fuzzy ART clustering

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Sejun Kim Donald C. Wunsch Applied Computational Intelligence Laboratory Department of Electrical & Computer Engineering Missouri University of Science & Technology Rolla MO USA Department of Electrical & Computer Engineering Missouri University of Science & Technology Rolla MO USA

关键词： Subspace constraints Graphics processing unit Kernel Training Programming Educational institutions Neural networks

来源：评论

学校读者我要写书评

暂无评论

Sufficiently near sets of neighbourhoods

引用

6th International Conference on Rough Sets and Knowledge Technology, RSKT 2011

作者： Peters, James F. Computational Intelligence Laboratory Department of Electrical and Computer Engineering Univ. of Manitoba E1-526 75A Chancellor's Circle Winnipeg MB R3T 5V6 Canada

ISBN: (纸本)9783642244247

The focus of this paper is on sets of neighbourhoods that are sufficiently near each other as yet another way to consider near sets. This study has important implications in M. Katětov's approach to topologising a set. A pair of neighbourhoods of points are sufficiently near, provided that the Čech distance between the neighbourhoods is less than some number Ε. Sets of neighbourhoods are sufficiently near, provided the Čech distance between the sets of neighbourhoods is less than some number Ε. © 2011 Springer-Verlag.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：