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

A structural description: ordered AND/OR graph

Journal of Information and Computational science 2013年第11期10卷 3323-3330页

作者： Chen, Jie Zhang, Yanping Zhao, Shu School of Computer Science and Technology Anhui University Hefei 230039 China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei 230039 China

In the real word, the complex problems usually have netted structure, namely netted problems. The general methods to solve this kind of problems are based on the sequence structural description or tree structural description of problem. But the netted structure of complex problem cannot be simple pictured by sequence or tree. To precisely describe the structure of netted problem and simplify the solution procedure, ordered AND/OR graph is proposed in this paper to depict the problem structure. The graph has the hierarchy of tree structure, as well as nodes in this graph have AND relation and OR relation. More importantly, among the siblings from the same father node there exits order relationships. In this paper, an applicable example is given, and experiments show that the description of structure of netted problem is effective. © 2013 Binary Information Press.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Gabor Filters for Degraded Document Image Binarization

Gabor Filters for Degraded Document Image Binarization

引用

International Workshop on Frontiers in Handwriting Recognition

作者： Abdenour Sehad Youcef Chibani Mohamed Cheriet ESI Ecole nationale Supérieure d'Informatique Oued-Smar Algiers Algeria Faculty of Electronics and Computer Science Speech Communication and Signal Processing Laboratory University of Science and Technology Houari Boumediene Algiers Algeria ETS Ecole de Technologie Supérieure Montréal QC Canada

Most of the classical methods for degraded document binarization are based on the pixel gray level intensity or on simple pixel neighborhood information such as mean or variance to compute the binarization threshold. Moreover, these information are extracted from the spatial domain of the document image which are not very discriminative. In this paper, we propose to estimate texture information based on Gabor filters for ancient degraded documents. First, the dominant slant angle of the document image script is computed by using the Fourier transform. Then, this dominant angle is used within a weighted sum of angles in a Gabor filter bank in order to capture more efficiently the document image foreground (text). This information, combined with the variance and the mean extracted respectively from spatial and frequency domains are used for estimating the binarization threshold. Three variants are used for evaluating the performance of Gabor filter bank, which are based on Niblack's, Sauvola's, and Wolf's thresholds. Experimental results conducted on DIBCO Datasets show that the proposed method is more appropriate for poor contrasted documents and ink-bleed through degradations.

关键词： Degradation Frequency-domain analysis Gabor filters Feature extraction Ink Estimation Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

Face recognition algorithm based on improved facial model

Face recognition algorithm based on improved facial model

引用

International Conference on Natural Computation (ICNC)

作者： Chengyun Liu Zhenxue Chen Faliang Chang Kaifang Wang Key Laboratory of Intelligent Computing & Signal Processing Anhui University Hefei P. R. China School of Control Science & Engineering Shandong University Jinan P. R. China Jiangsu Key Laboratory of Image and Video Understanding for Social Safety Nanjing University of Science and Technology Nanjing P. R. China

ISBN: (纸本)9781479951529

Face recognition is one of typical biometric identification method, which has a great prospect in secure authentication system, file management, human-computer interaction and social security. This paper proposes gray-scale characteristics and creates facial templates to recognize faces method based on a given number of samples. Firstly, it selects the method of building template according to the number of samples to create the facial template image; then, it will compare the difference of first-order edge entropy between recognition image and the template image and find the best match result; finally, the recognition result is output. Experimental results show that the proposed algorithm has good recognition effect on face recognition under non-constraint conditions.

关键词： Face recognition Face Entropy Lighting Image edge detection

来源：评论

学校读者我要写书评

暂无评论

Azimuth resolution improvement of spaceborne SAR images with nearly nonoverlapped doppler bandwidth

Azimuth resolution improvement of spaceborne SAR images with...

引用

IET International Radar Conference 2013

作者： Liu, Yan-Yang Li, Zhen-Fang Suo, Zhi-Yong Bao, Zheng National Key Laboratory of Science and Technology on Radar Signal Processing Xidian Univ. Xi'an Shanxi 710071 China

ISBN: (纸本)9781849196031

This paper deals with the azimuth resolution improvement problems via the coherent combination of the SAR images with nearly zero-overlapped Doppler bandwidth, which corresponding to large along-track baseline. Prior to the combination of the images, the phase bias contributions from the atmospheric propagation delays and baseline measurement errors should be calibrated. The interferogram of the azimuth pre-filtered SAR images are adopted in the classical method, whose performance falls down when the overlapped spectra comes to zero. In this paper, the maximum sharpness optimization is adopted to deal this situation. The proposed method has been tested by processing the real data.

关键词： Synthetic aperture radar

来源：评论

学校读者我要写书评

暂无评论

Method for convergent projective non-negative matrix factorization

引用

Journal of Information and Computational science 2013年第6期10卷 1847-1854页

作者： Hu, Lirui Wu, Jianguo Wang, Lei Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei 230039 China School of Computer Science and Technology Nantong University Nantong 226019 China School of Computer Science and Technology Anhui University Hefei 230039 China

In order to solve the problem of algorithm convergence in Projective Non-negative Matrix Factorization (P-NMF), a method, called Convergent Projective Non-negative Matrix Factorization (CP-NMF), is proposed. In CP-NMF, an objective function of Frobenius norm is defined. The Taylor series expansion and the Newton iteration formula of solving root are used. An iterative algorithm for basis matrix is derived, and a proof of algorithm convergence is provided. Experimental results show that the convergence speed of the algorithm is higher, however it is affected by the initial value of the basis matrix;relative to Non-negative Matrix Factorization (NMF), the orthogonality and the sparseness of the basis matrix are better, however the reconstructed results of data show that the basis matrix is still approximately orthogonal;in face recognition, there is higher recognition accuracy. The method for CP-NMF is effective. Copyright © 2013 Binary Information Press.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Application and method of feature extraction for approximate orthogonal non-negative matrix factorization

引用

Journal of Computational Information Systems 2013年第2期9卷 805-812页

作者： Hu, Lirui Wu, Jianguo Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei 230039 China School of Computer Science and Technology Nantong University Nantong 226019 China School of Computer Science and Technology Anhui University Hefei 230039 China

In order to get effectively feature vectors of samples, a method of feature extraction is proposed based on non-negative matrix factorization (NMF) with approximate orthogonal constraint. An objective function is defined to impose approximate orthogonal constraint, in addition to the non-negative constraint in the standard NMF. An algorithm of iterative update for basis matrix and weight matrix in non-negative matrix factorization is derived, and then computational method of feature vectors is gotten. A proof of the convergence of the algorithm is provided. Empirical results of handwritten character recognition show that there is high recognition accuracy if only the rank of the basis matrix is set correctly. The method of feature extraction is useful to get essential feature of sample, and is effective to recognition when the structures of the handwritten characters are obviously different. Copyright © 2013 Binary Information Press.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Multi-granular model to solve netted problem

引用

Journal of Computational Information Systems 2013年第19期9卷 7919-7927页

作者： Chen, Jie Zhang, Yanping Zhao, Shu Liu, Lulu School of Computer Science and Technology Anhui University Hefei 230039 China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei 230039 China Department of Computer Science and Technology Hefei Normal University Hefei 230061 China

The complex problems usually have netted structure, namely netted problems. The generally solving methods are based on sequence-searching or tree-searching of this kind of problems. But the structure of netted problems isn't merely sequence or tree. The Multi-granular Model was proposed in this paper which is put forward based on granular transaction of Quotient Space Theory. The whole problem is represented as a directed graph. Firstly, this graph was projected by constraints of original problem into coarse-grained spaces. Then granular decomposition is used to clear up the circle paths in new graph. In optimal quotient space, we search the answers according to the ordered sequence which is got by traversing the result of granular decomposition. In this paper, an applicable example is given and experiment contrasted with traditional tree searching method shows that this algorithm spends less time complexity and smaller space complexity. © 2013 Binary Information Press.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Event-Triggered Sampling Observer based Control Design with Application to Networked Visual Servoing Control Systems

Event-Triggered Sampling Observer based Control Design with ...

引用

第三十二届中国控制会议

作者： Wang Haoping Tian Yang Nicolai Christov Sino-French Joint Laboratory of Automation and Signal Processing School of Automation Nanjing University of Science and Technology LAGIS-CNRS UMR 8219 Lille University of Science and Technology

ISBN: (纸本)9789881563835

The present paper deals with a new continuous undelayed state observer based trajectory tracking approach by using only the sampled and delayed measurements where the sampling period and delayed value are variable and unknown. This proposed event-triggered sampling observer based control, which is derived by using the theory of a particular hybrid systems called Piecewise Continuous Systems, has a very simple structure and can be easily implemented to the networked visual servoing control systems. To show the proposed method performance, a numerical application example is introduced.

关键词： Networked visual servoing control systems, Piecewise continuous systems, Piecewise continuous controller

来源：评论

学校读者我要写书评

暂无评论

Extracting commuting patterns in railway networks through matrix decompositions

Extracting commuting patterns in railway networks through ma...

引用

International Conference on Control, Automation, Robotics and Vision (ICARCV)

作者： Shashank Jere Justin Dauwels Muhammad Tayyab Asif Nikola Mitro Vie Andrzej Cichocki Patrick Jaillet School of Electrical and Electronic Engineering Nanyang Technological University Singapore Nanyang Technological University Singapore Singapore SG Laboratory for Advanced Brain Signal Processing RIKEN Brain Science Institute Japan Laboratory for Information and Decision Systems MIT Cambridge MA USA Center for Future Urban Mobility Singapore-MIT Alliance for Research and Technology Singapore

With the rise in the population of the world's cities, understanding the dynamics of commuters' transportation patterns has become crucial in the planning and management of urban facilities and services. In this study, we analyze how commuter patterns change during different time instances such as between weekdays and weekends. To this end, we propose two data mining techniques, namely Common Orthogonal Basis Extraction (COBE), and Joint and Individual Variation Explained (JIVE) for Integrated Analysis of Multiple Data Types and apply them to smart card data available for passengers in Singapore. We also discuss the issues of model selection and interpretability of these methods. The joint and individual patterns can help transportation companies optimize their resources in light of changes in commuter mobility behavior.

关键词： Joints Computational modeling Smart cards Transportation Complexity theory Matrix decomposition Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Optimal Tracking Control for Ship Course Using Approximate Dynamic Programming Method

Optimal Tracking Control for Ship Course Using Approximate D...

引用

第三十二届中国控制会议

作者： XIE Qingqing LUO Bin TAN Fuxiao School of Computer Science and Technology Anhui University Key Laboratory of Intelligent Computing ＆ Signal Processing Ministry of EducationAnhui University School of Computer and Information Fuyang Teachers college

ISBN: (纸本)9781479900305

Dynamic programming(DP) is not a useful tool for solving many control problems because of its complexity in computation. In this paper,we propose Approximate Dynamic Programming(ADP) optimal control strategy for ship course trajectory tracking control *** system transformation,we convert the optimal tracking problem into designing a infinite-horizon optimal regulator for the tracking error ***-dependent Heuristic Dynamic programming(ADHDP) technique,as one form of ADR is presented to obtain the infinite-horizon optimal tracking *** the ship course optimal tracking control simulation results,we can see that the ADHDP controller makes the performance index and the control sequence for the error dynamics converge to the optimal *** BP neural networks are used as parametric structures to implement ADHDP *** two neural networks aim at approximating the cost function and the control law,respectively.

关键词： Optimal Tracking Control Approximate Dynamic Programming ADHDP Ship Course

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：