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

International Conference on Computer and Management (CAMAN)

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

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.

关键词： Mesh networks Fault tolerance Fault tolerant systems Upper bound Monte Carlo methods Computers Simulation

来源：评论

学校读者我要写书评

暂无评论

Handwritten Chinese character segmentation using a two-stage approach

Handwritten Chinese character segmentation using a two-stage...

引用

International Conference on Document Analysis and recognition

作者： Shuyan Zhao Zheru Chi Pengfei Shi Qing Wang Institute of Image Processing and Pattern Recognition Shanghai Jiaotong University Shanghai China Centre for Multimedia Signal Processing Department of Electronic and Information Engineering Hong Kong Polytechnic University Hong Kong China Department of Electronic and Information Engineering Hong Kong Polytechnic University Hong Kong China Department of Computer Science and Engineering Northwestern Polytechnical University Xi'an China

ISBN: (纸本)0769512631

Correct segmentation of handwritten Chinese characters is crucial to the successful recognition. However, because of the many difficulties involved, little work has been done in this area. In this paper, a two-stage approach is addressed to segment unconstrained handwritten Chinese character strings. A string is first coarsely segmented according to the background skeleton and vertical projection after a proper image preprocessing. At the fine segmentation stage that follows, the strokes that may contain segmentation points are first identified. The feature points are then extracted from candidate strokes and taken as segmentation point candidates through each of which a segmentation path may be formed. Geometric features are extracted and fuzzy decision rules learned from examples are used to evaluate the segmentation paths. By using this two-stage segmentation approach, we can achieve both good performance and efficiency in segmenting unconstrained handwritten Chinese characters.

关键词： image segmentation Character recognition pattern recognition Handwriting recognition Signal processing image processing Computer science Electronic mail image recognition Skeleton

来源：评论

学校读者我要写书评

暂无评论

Adaptive dynamic loading and unloading mechanism applied to development environment for image processing algorithm

Adaptive dynamic loading and unloading mechanism applied to ...

引用

2011 International Conference on Computer Science and Service System, CSSS 2011

作者： Lu, Haifeng Zhang, Tianxu Yan, Wei Cheng, Zhao State Key Laboratory for Multispectral Information Processing Technologies Institute for Pattern Recognition and Artificial Intelligence Huazhong University of Science and Technology Wuhan 430074 China Department of Technology Hubei Daily Media Group Wuhan 430077 China

ISBN: (纸本)9781424497638

An advanced development environment contributes to research process greatly. This paper presents a novel adaptive dynamic loading and unloading mechanism applied to development environment for image processing algorithm and two implementation methods of the mechanism. Based on the inherent characteristic of variable arguments of functions in programming language and explicit linking technique for dynamic link library (DLL), the mechanism is to integrate the image processing algorithm into the DLL file which is independent from the development environment, and to make the development environment identify the normative algorithm DLL and load functions of image processing algorithm successfully when needed. The proposed mechanism has been implemented in a development environment written by C/C++ language. The results show that the development environment based on the novel mechanism can improve work efficiency by making researchers only focus on the development of image processing algorithm rather than the other inefficient and repetitive work. At the same time the standardability, reusability and confidentiality of image processing algorithm can be promoted greatly. This mechanism is also applicable to other similar systems. © 2011 IEEE.

关键词： Reusability

来源：评论

学校读者我要写书评

暂无评论

Mixed one-bit compressive sensing with application to overexposure correction for CT reconstruction

arXiv

引用

arXiv 2017年

作者： Huang, Xiaolin Xia, Yan Shi, Lei Huang, Yixing Yan, Ming Hornegger, Joachim Maier, Andreas Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai China Department of Radiology Stanford University CA United States School of Mathematical Sciences Fudan University Shanghai China Pattern Recognition Lab of Friedrich-Alexander-Universität Erlangen-Nürnberg Erlangen Germany Department of Computational Mathematics Science and Engineering Michigan State University MI United States

When a measurement falls outside the quantization or measurable range, it becomes saturated and cannot be used in classical reconstruction methods. For example, in C-arm angiography systems, which provide projection radiography, fluoroscopy, digital subtraction angiography, and are widely used for medical diagnoses and interventions, the limited dynamic range of C-arm flat detectors leads to overexposure in some projections during an acquisition, such as imaging relatively thin body parts (e.g., the knee). Aiming at overexposure correction for computed tomography (CT) reconstruction, we in this paper propose a mixed one-bit compressive sensing (M1bitCS) to acquire information from both regular and saturated measurements. This method is inspired by the recent progress on one-bit compressive sensing, which deals with only sign observations. Its successful applications imply that information carried by saturated measurements is useful to improve recovery quality. For the proposed M1bit-CS model, alternating direction methods of multipliers is developed and an iterative saturation detection scheme is established. Then we evaluate M1bit-CS on one-dimensional signal recovery tasks. In some experiments, the performance of the proposed algorithms on mixed measurements is almost the same as recovery on unsaturated ones with the same amount of measurements. Finally, we apply the proposed method to overexposure correction for CT reconstruction on a phantom and a simulated clinical image. The results are promising, as the typical streaking artifacts and capping artifacts introduced by saturated projection data are effectively reduced, yielding significant error reduction compared with existing algorithms based on extrapolation. Copyright © 2017, The Authors. All rights reserved.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

New design for 9/7-tap wavelet filter and its VLSI implementation

引用

Jisuanji Xuebao/Chinese Journal of Computers 2008年第3期31卷 411-418页

作者： Tian, Xin Tan, Yi-Hua Tian, Jin-Wen State Key Laboratory for Multi-Spectral Information Processing Technologies Institute for Pattern Recognition and Artificial Intelligence Wuhan 430074 China

This paper designs a new kind of lifting 9-7-tap wavelet filter with binary characteristics and presents a high speed VLSI structure for the wavelet filter. The coefficients of the lifting filters are binary numbers, so it can simplify the VLSI design. The test results for compression performances have shown that the new filter is good almost as CDF97 under PSNR. when the data has a finite accuracy, it may have a better performance than CDF97. The filter can be implemented with using adders and shifters. Therefore the hardware resources can be saved and the critical path can be shortened. According to using the folding technology and the retiming technology, the architecture of the design can be transformed into a kind of embedded folding architecture which leads to the parallel computation of addition operations. So the critical path can be shortened to nearly the time of a addition operation and the utilization of the hardware resources also has a good performance. Simulation results show that the max working frequency could almost reach 250 MHz which is the four times by the CDF97;The occupied logic cell is reduced by 66.7 compared with the CDF97+4 stages pipeline. So it is especially suitable for the high speed VLSI design.

关键词： VLSI circuits

来源：评论

学校读者我要写书评

暂无评论

Analysis of Least Squares Regularized Regression in Reproducing Kernel Kreın Spaces

arXiv

引用

arXiv 2020年

作者： Liu, Fanghui Shi, Lei Huang, Xiaolin Yang, Jie Suykens, Johan A.K. Department of Electrical Engineering [ESAT-STADIUS KU Leuven LeuvenB-3001 Belgium Institute of Image Processing and Pattern Recognition Institute of Medical Robotics Shanghai Jiao Tong University Shanghai China Shanghai Key Laboratory for Contemporary Applied Mathematics School of Mathematical Sciences Fudan University Shanghai China

In this paper, we study the asymptotical properties of least squares regularized regression with indefinite kernels in reproducing kernel Kreın spaces (RKKS). The classical approximation analysis cannot be directly applied to study its asymptotical behavior under the framework of learning theory as this problem is in essence non-convex and outputs stationary points. By introducing a bounded hyper-sphere constraint to such non-convex regularized risk minimization problem, we theoretically demonstrate that this problem has a globally optimal solution with a closed form on the sphere, which makes our approximation analysis feasible in RKKS. Accordingly, we modify traditional error decomposition techniques, prove convergence results for the introduced hypothesis error based on matrix perturbation theory, and derive learning rates of such regularized regression problem in RKKS. Under some conditions, the derived learning rates in RKKS are the same as that in reproducing kernel Hilbert spaces (RKHS), which is actually the first work on approximation analysis of regularized learning algorithms in RKKS. Copyright © 2020, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Single landmark based self-localization of mobile robots

Single landmark based self-localization of mobile robots

引用

Canadian Conference on Computer and Robot Vision, CRV

作者： A. Bais R. Sablatnig J. Gu Robotics Research Group Department of Electrical and Computer Engineering Dalhousie University Halifax Canada Institute of Computer Technology University of Technology Vienna Vienna Austria Pattern Recognition and Image Processing Group Institute of Computer Aided Automation University of Technology Vienna Vienna Austria

In this paper we discuss landmark based absolute localization of tiny autonomous mobile robots in a known environment. Landmark features are naturally occurring as it is not allowed to modify the environment with special navigational aids. These features are sparse in our application domain and are frequently occluded by other robots. This makes simultaneous acquisition of two or more landmarks difficult. Therefore, we propose a system that requires a single landmark feature. The algorithm is based on range measurement of a single landmark from two arbitrary points whose displacement can be measured using dead-reckoning sensors. Range estimation is done with a stereo vision system. Simulation results show that the robot can localize itself if it can estimates range of the same landmark from two different position and if the displacement between the two position is known.

关键词： Mobile robots Robot sensing systems Robot vision systems Cameras Navigation Position measurement Robotics and automation Displacement measurement Educational robots Goniometers

来源：评论

学校读者我要写书评

暂无评论

Transfer Learning of Fuzzy Spatio-Temporal Rules in the NeuCube Brain-Inspired Spiking Neural Network: A Case Study on EEG Spatio-temporal Data

TechRxiv

引用

TechRxiv 2022年

作者： Kasabov, Nikola K. Tan, Yongyao Doborjeh, Maryam Tu, Enmei Yang, Jie School of Engineering Computer and Mathematical Science KEDRI Auckland University of Technology New Zealand Intelligent Systems Research Centre University of Ulster United Kingdom Bulgarian Academy of Sciences Bulgaria Institute of Image Processing and Pattern Recognition Shanghai Jiao Tiong University China

The paper demonstrates for the first time that a brain-inspired spiking neural network (SNN) architecture can be used not only to learn spatio-temporal data, but also to extract fuzzy spatio-temporal rules from such data and to update these rules incrementally in a transfer learning mode. We propose a method, where a SNN model learns incrementally new time-space data related to new classes/tasks/categories, always utilising some previously learned knowledge, and presents the evolved knowledge as fuzzy spatio-temporal rules. Similarly, to how the brain manifests transfer learning, these SNN models do not need to be restricted in number of layers, neurons in each layer, etc. as they adopt self-organising learning principles. The continuously evolved fuzzy rules from spatio-temporal data are interpretable for a better understanding of the processes that generate the data. The proposed method is based on a brain-inspired SNN architecture NeuCube and is illustrated on tasks of incremental and transfer learning and knowledge transfer using spatio-temporal EEG data measuring brain activity, when persons performing tasks in space and time. The method is a general one and opens the field to create new types of adaptable and explainable AI systems for applications across domain areas, e.g. brain-machine interfaces, robotics, speech and sound processing, cognitive studies and the creation of lifelong-learning cognitive machines. © 2022, CC BY.

关键词： Brain

来源：评论

学校读者我要写书评

暂无评论

Random features for kernel approximation: A survey on algorithms, theory, and beyond

arXiv

引用

arXiv 2020年

作者： Liu, Fanghui Huang, Xiaolin Chen, Yudong Suykens, Johan A.K. KU Leuven LeuvenB-3001 Belgium Institute of Image Processing and Pattern Recognition Institute of Medical Robotics Shanghai Jiao Tong University Shanghai200240 China School of Operations Research and Information Engineering Cornell University IthacaNY14850 United States

The class of random features is one of the most popular techniques to speed up kernel methods in large-scale problems. Related works have been recognized by the NeurIPS Test-of-Time award in 2017 and the ICML Best Paper Finalist in 2019. The body of work on random features has grown rapidly, and hence it is desirable to have a comprehensive overview on this topic explaining the connections among various algorithms and theoretical results. In this survey, we systematically review the work on random features from the past ten years. First, the motivations, characteristics and contributions of representative random features based algorithms are summarized according to their sampling schemes, learning procedures, variance reduction properties and how they exploit training data. Second, we review theoretical results that center around the following key question: how many random features are needed to ensure a high approximation quality or no loss in the empirical/expected risks of the learned estimator. Third, we provide a comprehensive evaluation of popular random features based algorithms on several large-scale benchmark datasets and discuss their approximation quality and prediction performance for classification. Last, we discuss the relationship between random features and modern over-parameterized deep neural networks (DNNs), including the use of high dimensional random features in the analysis of DNNs as well as the gaps between current theoretical and empirical results. This survey may serve as a gentle introduction to this topic, and as a users' guide for practitioners interested in applying the representative algorithms and understanding theoretical results under various technical assumptions. We hope that this survey will facilitate discussion on the open problems in this topic, and more importantly, shed light on future research directions. Copyright © 2020, The Authors. All rights reserved.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

A Riemannian Residual Learning Mechanism for SPD Network

A Riemannian Residual Learning Mechanism for SPD Network

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Zhenyu Cai Rui Wang Tianyang Xu Xiaojun Wu Josef Kittler School of Artificial Intelligence and Computer Science Jiangnan University Wuxi China Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Wuxi China Centre for Vision Speech and Signal Processing University of Surrey Guildford U.K.

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

The generalization of Euclidean network paradigm to the Riemannian manifolds has attracted much attention for offering useful geometric representations in processing manifold-valued data in recent years. However, the information degradation during data compression mapping hinders Riemannian networks from going deeper, and there are very few solutions specifically designed for this problem. Given the remarkable success of deep Residual learning in Euclidean networks, a novel Riemannian residual learning mechanism (RRLM) is proposed in the context of Symmetric Positive Definite (SPD) manifolds, enabling the characterization of deep spatiotemporal features while preserving the manifold properties. Based on RRLM, a stack of SPD manifold-constrained residual-like blocks is designed on the tail of the original SPDNet(backbone) for the sake of conducting deep Riemannian residual learning. For simplicity, we refer to the network architecture introduced above as Riemannian residual SPD network (ResSPDNet). The experimental results achieved on three types of visual classification tasks, i.e., facial emotion recognition, drone recognition, and action recognition, demonstrate that our method can achieve improved accuracy with a deepened network structure.

关键词： Manifolds Learning systems Degradation Emotion recognition Visualization Accuracy Face recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：