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

International Conference on Computer and Management

作者： Liang, Meilian Liang, Binmei Shao, Zehui Xu, Xiaodong School of Mathematics and Information Science Guangxi University Nanning 530004 China Key Laboratory of Pattern Recognition and Intelligent Information Processing School of Information Science and Technology Chengdu University Chengdu 610106 China Guangxi Academy of Sciences Nanning 530007 China

ISBN: (纸本)9781424492831

Fault tolerance is a central issue in the design and implementation of interconnection networks for large parallel systems. Connection probability of a network is a good network fault tolerance measure. For a mesh of given size and node failure probability, the gap between the known upper and lower bounds on the connection probability is often very large. In this paper we design algorithms to estimate the connection probability for 2-D meshes by Monte Carlo methods. The experiment is carefully designed and performed, and the simulation results give good estimates of the connection probability for 2-D meshes and can be used to evaluate the known lower and upper bounds on connection probability for 2-D meshes. ©2011 IEEE.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised learning in nonstationary environments

Semi-supervised learning in nonstationary environments

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Gregory Ditzler Robi Polikar Signal Processing and Pattern Recognition Laboratory in the Electrical & Computer Engineering Department Rowan University Glassboro NJ USA

Learning in nonstationary environments, also called learning concept drift, has been receiving increasing attention due to increasingly large number of applications that generate data with drifting distributions. These applications are usually associated with streaming data, either online or in batches, and concept drift algorithms are trained to detect and track the drifting concepts. While concept drift itself is a significantly more complex problem than the traditional machine learning paradigm of data coming from a fixed distribution, the problem is further complicated when obtaining labeled data is expensive, and training must rely, in part, on unlabelled data. Independently from concept drift research, semi-supervised approaches have been developed for learning from (limited) labeled and (abundant) unlabeled data; however, such approaches have been largely absent in concept drift literature. In this contribution, we describe an ensemble of classifiers based approach that takes advantage of both labeled and unlabeled data in addressing concept drift: available labeled data are used to generate classifiers, whose voting weights are determined based on the distances between Gaussian mixture model components trained on both labeled and unlabeled data in a drifting environment.

关键词： Classification algorithms Data models Clustering algorithms Training data Training Testing Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Interactive object segmentation using iterative adjustable graph cut

Interactive object segmentation using iterative adjustable g...

引用

2011 IEEE Visual Communications and Image processing, VCIP 2011

作者： Shi, Ran Liu, Zhi Xue, Yinzhu Zhang, Xiang School of Communication and Information Engineering Shanghai University Shanghai 200072 China Key Laboratory of Advanced Display and System Application Shanghai University Ministry of Education Shanghai 200072 China Institute of Image Processing and Pattern Recognition Shanghai Jiaotong University Shanghai 200240 China

ISBN: (纸本)9781457713200

Interactive object segmentation is widely used for extracting any user-interested objects from natural images. A common problem with many interactive segmentation approaches is that the object segmentation quality is degraded due to inaccurate object/background seeds provided by the user. This paper proposes an iterative adjustable graph cut to efficiently solve this problem. First, object/background seeds are initialized based on the object segmentation result obtained with the user-specified scribbles as the interactive input. Then, an iterative seed adjustment scheme is exploited to correct inaccurate seeds and extract new suitable seeds via graph cut, in which the balancing weight between energy terms are adaptively updated to protect stable seeds and speedup the iteration process. Finally, suitable seeds are obtained and graph cut is used to segment the objects. Experimental results demonstrate the better segmentation performance of our approach even if user provides rather rough seeds. © 2011 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

New lower bounds for two multicolor vertex Folkman numbers

New lower bounds for two multicolor vertex Folkman numbers

引用

International Conference on Computer and Management

作者： Shao, Zehui Liang, Meilian He, Jiandong Xu, Xiaodong School of Information Science and Technology Chengdu University Chengdu 610106 China Key Laboratory of Pattern Recognition and Intelligent Information Processing Sichuan Province China School of Mathematics and Information Science Guangxi University Nanning 530004 China Guangxi Academy of Sciences Nanning 530007 China

For a graph G, G → (a1, a2, · · ·, ar)v means that in every r-coloring of the vertices in G, there exists a monochromatic ai-clique of color i for some i∈{1, 2, · · ·, r}. The vertex Fo... 详细信息

ISBN: (纸本)9781424492831

For a graph G, G → (a1, a2, · · ·, ar)v means that in every r-coloring of the vertices in G, there exists a monochromatic ai-clique of color i for some i∈{1, 2, · · ·, r}. The vertex Folkman number is defined as Fv(a1, a2, ···, ar;k) = min{|V(G)|: G → (a1, a2, ···, ar)v and Kk G}. In general, computing lower and upper bounds for vertex Folkman numbers is difficult. In this note, based on theoretical analysis and computation, we show that Fv(2, 3, 3;4) ≥ 19 and Fv(3, 3, 3;4) ≥ 24, and suggest a cyclic graph of order 91 which may give an upper bound for Fv(3, 3, 3;4). ©2011 IEEE.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Maintaining imbalance highly dependent medical data using dirichlet process data generation

Maintaining imbalance highly dependent medical data using di...

引用

International Conference on Digital Information Management (ICDIM)

作者： Tieta Antaresti Mohamad Ivan Fanany Aniati Murni Arymurthy Pattern Recognition Image Processing and Content-Based Image Retrieval Laboratory Faculty of Computer Science Universitas Indonesia Depok Indonesia

The existence of imbalanced data between one class and another class is an important issue to be considered in a classification problem. One of the well-known data balancing technique is the artificial oversampling, which increase the size of datasets. In this research, multinomial classification was applied to classify some recorded features obtained from a single ECG (electrocardiograph) sensor. Therefore, a Dirichlet process, a dirichlet distribution of cumulative distribution function of each data partition, was needed to model the distribution of the new generated data by also considering the statistical properties of the previous data. Data balancing process had given the result of 77.21% classification accuracy (CA), and 90.9% area under ROC curve (AUC).

关键词： Electrocardiography Accuracy Diseases Data models Bayesian methods Sleep apnea Machine learning

来源：评论

学校读者我要写书评

暂无评论

Threshold selection using partial structural similarity

International Journal of Digital Content Technology and its ...

引用

International Journal of Digital Content Technology and its Applications 2011年第7期5卷 397-407页

作者： Lu, Haifeng Zhang, Tianxu Yan, Luxin State Key Laboratory for Multi spectral Information Processing Technologies Institute for Pattern Recognition and Artificial Intelligence Huazhong University of Science and Technology Wuhan 430074 China

A novel image threshold selection approach based on structural similarity (SSIM) is proposed. The thresholded image is obtained first, then comparison regions are extracted based on the local variance of the neighborhood of the thresholded image. Due to the characteristic of comparison regions, the conventional SSIM expression is simplified as a nonparametric form, and the partial SSIM (PSSIM) is defined. The optimal threshold is selected by maximizing the PSSIM criterion function at last. Besides the introduction of a novel approach, this is also the first attempt to expand the application scope of SSIM to range image thresholding in general. The proposed approach has an advantage over thresholding methods based on the histogram. The method was tested on a variety of images including the synthetic image and real images. Experimental results show that the proposed approach achieves better applicability, preferable ability for extracting object and better anti-noise capability than popular methods.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

A new circle targets extraction method from high resolution remote sensing imagery

A new circle targets extraction method from high resolution ...

引用

International Workshop on Advanced Computational Intelligence (IWACI)

作者： Z. Chen J. G. Liu G. Y. Wang Intelligence Control Institute for Pattern Recognition and Artificial Intelligence and Multi-Spectral Information Processing State Key Laboratory Huazhong University of Science and Technology China Intelligence Control Institute for Pattern Recognition and Artificial Intelligence and Multi-Spectral Information Processing State Key Laboratory Huazhong University of Science and Technology China

According to the drawback of the traditional circle target extraction algorithm from high resolution remote sensing imagery used by Hough Transform, such as computation complexity, low efficiency and etc, a new circle target extraction method is proposed in this paper which can extract multiple circle targets with different radius at one time. First, the Average Absolute Difference is implemented to enhance the edge of the circle targets and suppress the noise of the background. Secondly, the locally self-adaptive segmentation algorithm is implemented to obtain the binary image. Thirdly, the thinning algorithm based on model computation is implanted to obtain the single pixel edge of the circle targets and in order to reduce the computation times in the following process. Furthermore, a pruning algorithm is necessary; finally, a modified Hough transform algorithm is proposed to obtain the circle targets. The experimental results demonstrate that the new circle targets algorithm can extract the multiple circle targets quickly and accurately, which has three advantages: low time consuming, high detection rate, robust to noise and fragmentary boundaries.

关键词： Transforms Image edge detection Noise Skeleton Image segmentation Remote sensing Accuracy

来源：评论

学校读者我要写书评

暂无评论

A new contour tracing method in a binary image

A new contour tracing method in a binary image

引用

International Conference on Multimedia Technology

作者： Lie Kang Sheng Zhong Fang Wang State Key Laboratory for Multispectral Information Processing Technologies Institute for Pattern Recognition and Artificial Intelligence Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781612847719

This paper presents a novel fast single-pass contour tracing algorithm in a binary image. The proposed algorithm is viewed as follow steps: firstly a set of contour segments of all object contours can be generated and traced in a top-down line scan fashion; then all contour segments are employed to be integrated into respective intact contours; finally all results are converted into the chain code as the final output. This algorithm can extract multiple contours of an image in one pass and never lose any outer and inner contour of object region. It is faster on implementation. Experiments results prove those advantages.

关键词： Algorithm design and analysis Image segmentation Signal processing algorithms Shape Labeling Lakes pattern recognition

来源：评论

学校读者我要写书评

暂无评论

A novel method concerning about image transition region extraction and segmentation

A novel method concerning about image transition region extr...

引用

International Conference on Multimedia Technology

作者： Fang Wang Tianxu Zhang Jinpeng Deng State Key Laboratory for Multispectral Information Processing Technologies Institute for Pattern Recognition and Artificial Intelligence Huazhong University of Science and Technology Wuhan China

According to the feature that the gray distribution of the transition region (locating between the objects and the background) is more scattered than that of the regions of targets or background in an image, this paper proposes a novel method concerning about transition region extraction and segmentation, which is based on local variance of different areas of an image. The experiments indicate that the proposed approach can achieve better segmentation results than the local complexity method (one of the previous methods for extracting transition region).What's more, the novel approach outperforms the local complexity method about more complete and more accurate transition regions, less interference from backgrounds, more detail information of segmented targets, clearer and better segmented targets, easier calculation, and higher processing speed.

关键词： Image segmentation Complexity theory Feature extraction Histograms Data mining Image edge detection Gray-scale

来源：评论

学校读者我要写书评

暂无评论

A Novel Approach to Edge Detection of Color Image Based on Quaternion Fractional Directional Differentiation

A Novel Approach to Edge Detection of Color Image Based on Q...

引用

The 2011 International Conference on Automation and Robotics(ICAR 2011)

作者： Chaobang Gao Jiliu Zhou Fangnian Lang Qiang Pu Chang Liu College of Computer Science and Technology Chengdu University School of Computer Science Sichuan University Key Laboratory of Pattern Recognition and Intelligent Information Processing

In this paper, we denote a color image by a quaternion function, then find edge points by solving the maximum of quaternion fractional directional differentiation(QFDD)'s norm. This method is called edge detection based on QFDD. Experiments indicate that the method has special advantages. Comparing with Canny, LOG, Sobel, and general fractional differentiation, we discover that QFDD has fewer false negatives in the textured regions and is also better at detecting edges which are partially defined by texture, which means we will obtain better results in the interesting regions by QFDD and these results are more consistent with the characteristics of human visual system.

关键词： quaternion fractional differentiation QFDD norm similarity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：