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

IEEE Nuclear science Symposium and Medical Imaging Conference

作者： Lei Fan Bowen Song Xianfeng Gu Zhengrong Liang Departments of Radiology and Computer Science Stony Brook University Stony Brook NY USA Departments of Radiology and Applied Math and Statistics Stony Brook University Stony Brook NY USA Department of Computer Science Stony Brook University Stony Brook NY USA Departments of Radiology Computer Science and Biomedical Engineering Stony Brook University Stony Brook NY USA

Feature extraction and classification are two important parts in computer-aided detection (CAD) of abnormalities. For feature selection, typically we are interested in determining which, of a large number of potentially redundant or noisy features, are most discriminative for classification. Graph embedding is a relatively new category of feature selection methods. It uses a graph structure to model the geometric and discriminant structure of the data manifold. It has obvious advantages over other conventional feature selection methods like Principal Component Analysis (PCA). However, it does not properly incorporate prior labeling information like Partial Least Square (PLS) does. In this paper, we deal with feature selection for CAD of colonic polyps with graph embedding method in a semi-supervised style (SemiGE), which considers the label information as additional constraints. Specifically, we constrain the space of solutions that we explore only to contain embedding results which are consistent with the labels. Experiments were conducted on patients' datasets to compare its performance with other conventional and popular feature selection methods. The results illustrated that this presented SemiGE strategy outperforms all other exciting feature selection methods, such as PCA, PLS, etc. On the other hand, the well-known support vector machine (SVM) classifier has been widely used in CAD of colonic polyps in computed tomography conlonography (CTC). Several kernel functions have been implemented for the SVM classifier. Each kernel function affects noticeably to the classifying performance and variable performance has been observed among the kernel functions. A traditional implementation strategy and all the previous applications of SVM only preselect a kernel function (e.g., RBF, Sigmoid, .etc). This kind of pre-selection approach fails to provide a kernel function which is adaptive to the experimental data. In this paper, we introduce an improved SVM-based classifi

关键词： CAD ROC AUC

来源：评论

学校读者我要写书评

暂无评论

Understanding social behavior evolutions through agent-based modeling

Understanding social behavior evolutions through agent-based...

引用

IEEE International Conference on Multimedia Computing and Systems (ICMCS)

作者： Mohamed Nemiche Vicent Cavero Rafael Pla Lopez Equipe de recherches Mathématiques appliquées Génie Informatique et Multimédia Ibn Zohr University Agadir Morocco Department of Computer Science University of Valencia Spain Department of Applied Mathematics University of Valencia Spain

ISBN: (纸本)9781467315180

Agent-based social simulation as a computational approach to social simulation has been largely used to explore social phenomena. The purpose of this paper is to describe a theoretical model of transmission and evolution of social behaviors in a network of artificial societies (artificial world) using agent-based modeling technology. In this model, each agent (society) is subdivided into social behaviors where individual and social learning occur. The agent-agent interactions are carried out by their social behaviors; otherwise the agent-environment interactions through consumption of ecological resources by its social behaviors in repression and satisfaction. We distinguish social behaviors by their repressive capacity and their technical satisfaction. Preliminary results of the model generate several evolutions, but we will focus on the two most important types: firstly, evolutions where the system (all living-agents) will end in a state of “globalization”; i.e. where one social behavior predominates the entire system; secondly, evolutions where an Ecological Hecatomb takes place during the globalization with the repressive social behavior. The model is implemented in java language; its simulation can help to understand the implied processes in humanity's evolution and their trajectories.

关键词： Multimedia communication Biological system modeling

来源：评论

学校读者我要写书评

暂无评论

Natural image denoising: Optimality and inherent bounds

Natural image denoising: Optimality and inherent bounds

引用

作者： Levin, Anat Nadler, Boaz Department of Computer Science and Applied Math Weizmann Institute of Science Israel

ISBN: (纸本)9781457703942

The goal of natural image denoising is to estimate a clean version of a given noisy image, utilizing prior knowledge on the statistics of natural images. The problem has been studied intensively with considerable progress made in recent years. However, it seems that image denoising algorithms are starting to converge and recent algorithms improve over previous ones by only fractional dB values. It is thus important to understand how much more can we still improve natural image denoising algorithms and what are the inherent limits imposed by the actual statistics of the data. The challenge in evaluating such limits is that constructing proper models of natural image statistics is a long standing and yet unsolved problem. To overcome the absence of accurate image priors, this paper takes a non parametric approach and represents the distribution of natural images using a huge set of 1010 patches. We then derive a simple statistical measure which provides a lower bound on the optimal Bayesian minimum mean square error (MMSE). This imposes a limit on the best possible results of denoising algorithms which utilize a fixed support around a denoised pixel and a generic natural image prior. Our findings suggest that for small windows, state of the art denoising algorithms are approaching optimality and cannot be further improved beyond 0.1dB values. © 2011 IEEE.

关键词： Image denoising

来源：评论

学校读者我要写书评

暂无评论

Sustaining economic exploitation of complex ecosystems in computational models of coupled human-natural networks 26

Sustaining economic exploitation of complex ecosystems in co...

引用

26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference, AAAI-12 / IAAI-12

作者： Martinez, Neo D. Tonin, Perrine Bauer, Barbara Rael, Rosalyn C. Singh, Rahul Yoon, Sangyuk Yoon, Ilmi Dunne, Jennifer A. Pacific Ecoinformatics and Computational Ecology Lab. 1604 McGee Avenue Berkeley CA United States Center for Applied Math Ecole Polytechnique CNRS Route de Saclay 91128 Palaiseau Cedex France Düsternbrooker Weg 20 D 24105 Kiel Germany Computer Science Department San Francisco State University San Francisco CA United States Santa Fe Institute 1399 Hyde Park Road Santa Fe NM United States

ISBN: (纸本)9781577355687

Understanding ecological complexity has stymied scientists for decades. Recent elucidation of the famously coined "devious strategies for stability in enduring natural systems" has opened up a new field of computational analyses of complex ecological networks where the nonlinear dynamics of many interacting species can be more realistically modeled and understood. Here, we describe the first extension of this field to include coupled human natural systems. This extension elucidates new strategies for sustaining extraction of biomass (e.g., fish, forests, fiber) from ecosystems that account for ecological complexity and can pursue multiple goals such as maximizing economic profit, employment and carbon sequestration by ecosystems. Our more realistic modeling of ecosystems helps explain why simpler "maximum sustainable yield" bioeconomic models underpinning much natural resource extraction policy leads to less profit, biomass, and biodiversity than predicted by those simple models. Current research directions of this integrated natural and social science include applying artificial intelligence, cloud computing, and multiplayer online games. Copyright © 2012, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： Ecosystems

来源：评论

学校读者我要写书评

暂无评论

Natural Image Denoising: Optimality and Inherent Bounds

Natural Image Denoising: Optimality and Inherent Bounds

引用

IEEE Conference on computer Vision and Pattern Recognition

作者： Anat Levin Boaz Nadler Department of Computer Science and Applied Math The Weizmann Institute of Science

ISBN: (纸本)9781457703942

The goal of natural image denoising is to estimate a clean version of a given noisy image, utilizing prior knowledge on the statistics of natural images. The problem has been studied intensively with considerable progress made in recent years. However, it seems that image denoising algorithms are starting to converge and recent algorithms improve over previous ones by only fractional dB values. It is thus important to understand how much more can we still improve natural image denoising algorithms and what are the inherent limits imposed by the actual statistics of the data. The challenge in evaluating such limits is that constructing proper models of natural image statistics is a long standing and yet unsolved problem. To overcome the absence of accurate image priors, this paper takes a non parametric approach and represents the distribution of natural images using a huge set of 10~(10) patches. We then derive a simple statistical measure which provides a lower bound on the optimal Bayesian minimum mean square error (MMSE). This imposes a limit on the best possible results of denoising algorithms which utilize a fixed support around a denoised pixel and a generic natural image prior. Our findings suggest that for small windows, state of the art denoising algorithms are approaching optimality and cannot be further improved beyond ～ 0.1dB values.

关键词： image denoising Noisy Image fixed pivot DATA(STATISTICS) images optimality Mean square error Converge Prior Learning Noise reduction

来源：评论

学校读者我要写书评

暂无评论

New construction of ensemble classifiers for imbalanced datasets

New construction of ensemble classifiers for imbalanced data...

引用

2010 IEEE International Conference on Intelligent Systems and Knowledge Engineering, ISKE 2010

作者： Zhai, Yun Yang, Bingru Ma, Nan Ruan, Da School of Information Engineering University of Science and Technology Beijing Beijing China College of Computer Science Liaocheng University Liaocheng China College of Information Beijing Union University Beijing China Department of Applied Math and Computer Science Ghent University Krijgslaan Belgium

ISBN: (纸本)9781424467907

Learning in the presence of data imbalances presents a great challenge to machine learning. Imbalanced data sets represent a significant problem because the corresponding classifier has a tendency to ignore samples which have smaller representation in the training sets. In this paper, we propose an ensemble-based learning algorithm as a new ensemble classifier model called as SVM-C5.0 Ensemble Classifier Model, SCECM. SCECM adopts a differentiated sampling rate algorithm (DSRA) based on an improved Adaboost algorithm and further employs unique classifier-selection strategy, novel classifier integration approach and original classification decision-making method. Comparative experimental results show that the proposed approach improves performance for the minority class while preserving the ability to recognize examples from the majority classes. © 2010 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Analyzing environmental samples in nuclear safeguards evaluation by a cumulative belief degrees approach 9

Analyzing environmental samples in nuclear safeguards evalua...

引用

Computational Intelligence Foundations and Applications - 9th International Fuzzy Logic and Intelligent Technologies in Nuclear science Conference, FLINS 2010

作者： Kabak, Özgür Ruan, Da Boeretang 200 Mol2400 Belgium Department of Industrial Engineering Istanbul Technical University Maçka Istanbul34357 Turkey Department of Applied Math. and Computer Science Ghent University Gent9000 Belgium

ISBN: (纸本)9814324698

In this study we apply a cumulative belief degrees approach to an environmental sampling example in nuclear safeguards evaluation. Transformation formulas for each indicator are defined for distinguishing anthropogenic natural uranium from mineral uranium. An order weighted averaging operator-based aggregation method is proposed to make a final decision. The methodology is illustrated by a numerical example. © 2010 by World Scientific Publishing Co. Pte. Ltd.

关键词： Fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

Co-clustering of image segments using convex optimization applied to EM neuronal reconstruction

Co-clustering of image segments using convex optimization ap...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Shiv N. Vitaladevuni Ronen Basri Howard Hughes Medical Institute USA Department of Computer Science and Applied Math. Weizmann Institute of Science Israel

This paper addresses the problem of jointly clustering two segmentations of closely correlated images. We focus in particular on the application of reconstructing neuronal structures in over-segmented electron microscopy images. We formulate the problem of co-clustering as a quadratic semi-assignment problem and investigate convex relaxations using semidefinite and linear programming. We further introduce a linear programming method with manageable number of constraints and present an approach for learning the cost function. Our method increases computational efficiency by orders of magnitude while maintaining accuracy, automatically finds the optimal number of clusters, and empirically tends to produce binary assignment solutions. We illustrate our approach in simulations and in experiments with real EM data.

关键词： Image segmentation Image reconstruction Linear programming Electron microscopy Cost function Biomedical imaging computer science Application software Computational efficiency Computational modeling

来源：评论

学校读者我要写书评

暂无评论

New Construction of Ensemble Classifiers for Imbalanced Datasets

New Construction of Ensemble Classifiers for Imbalanced Data...

引用

The 2010 International Conference on Intelligent Systems and Knowledge Engineering(第五届智能系统与知识工程国际会议)

作者： Yun Zhai Bingru Yang Nan Ma Da Ruan School of Information Engineering University of Science and Technology Beijing Beijing China Colle School of Information Engineering University of Science and Technology Beijing Beijing China School of Information Engineering University of Science and Technology Beijing Beijing China Colleg Department of Applied Math and Computer Science Ghent University Krijgslaan Belgium

关键词： Classification algorithms Accuracy Support vector machines Training Data mining Educational institutions Machine learning

来源：评论

学校读者我要写书评

暂无评论

Counting Homomorphisms to Sparse Graphs

引用

Electronic Notes in Discrete mathematics 2009年 34卷 393-397页

作者： Nešetřil, Jaroslav de Mendez, Patrice Ossona Department of Applied Mathematics Institute for Theoretical Computer Science Charles University Prague Czech Republic Centre d'Analyse et de Mathématique Sociales C.N.R.S. E.H.E.S.S. Paris France

We define nowhere dense and somewhere dense classes by means of counting of homomorphisms from test graphs. This seems to be bridging the gap between existential and counting theorems (for graph homomorphisms) and it ... 详细信息

关键词： boolean query counting graph homomorphism nowhere dense class tree-depth

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：