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

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Qian Yin Ping Guo Zhi-Yong Yuan Zu-Kuan Wei Wen-Yi Zeng Image Processing & Pattern Recognition Laboratory Beijing Normal University Beijing China School of Computer Science Wuhan University of China Wuhan China School of Comp. Science & Engr. University of Electronic Science and Technology Chengdu China

A theoretical study for modeling technique of the remote sensing image classification based on the minimum description length (MDL) principle is presented in the paper. According to the MDL principle, modeling problem is an optimization procedure to find the shortest expected code length. Kullback-Leibler (KL) divergence is adopted as the system cost function to measure expected codelength, and the codelength will be the model we desired. The advantage of using the MDL principle to build appropriate model is analyzed theoretically, model optimization technique also is described.

关键词： Data models Remote sensing Mathematical model Classification algorithms Computational modeling Equations Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

A novel method of fingerprint minutiae extraction based on Gabor phase

A novel method of fingerprint minutiae extraction based on G...

引用

IEEE International Conference on image processing

作者： Xin Gao Xiaoguang Chen Jia Cao Zirui Deng Chongjin Liu Jufu Feng Key Laboratory of Machine Perception MOE Department of Machine Intelligence School of Electronics Engineering and Computer Science Peking University Beijing China Institute of Image Processing and Pattern Recognition North-China University of Technology Beijing China

In this paper, a novel method of fingerprint minutiae extraction on grey-scale images is proposed based on the Gabor phase field. The novelty of our approach is that the proposed algorithm is performed on the transform domain, i.e. the Gabor phase field of the fingerprint image. This is different from most existing minutiae extraction methods, in which the minutiae are usually extracted from the binarized and thinned fingerprint image. Experimental results on benchmark data sets demonstrate that the proposed algorithm has promising performances.

关键词： Pixel Feature extraction image quality Fingerprint recognition Detectors Frequency estimation Software algorithms

来源：评论

学校读者我要写书评

暂无评论

A New Approach of Color image Quantization

引用

通讯和计算机（中英文版） 2005年第3期2卷 72-76页

作者： HU Xinrong WANG Tianzhen LI Dehua Institute for Pattern Recognition and Artificial Intelligence State Education Commission Laboratory for Image Processing and Intelligence Control HuaZhong Univ. of Science＆Technology WuHan 430074 China Dept. of Computer Science ＆Technology Wuhan Institute of Science＆Technology WuHan 430074 China Institute of linage Processing WuHan Univ. of Technology Wuhan 430070China

来源：评论

学校读者我要写书评

暂无评论

Text scanner with text detection technology on image sequences

Text scanner with text detection technology on image sequenc...

引用

International Conference on pattern recognition

作者： Keechul Jung Kwang In Kim T. Kurata M. Kourogi JungHyun Han Pattern Recognition and Image Processing Laboratory Michigan State University USA Artificial Intelligence Laboratory KAIST South Korea National Institute for Advanced Industrial Science and Technology Japan School of Electrical and Computer Engineering Sung Kyun Kwan University South Korea

ISBN: (纸本)076951695X

We propose a text scanner which detects wide text strings in a sequence of scene images. For scene text detection, we use a multiple-CAMShift algorithm on a text probability image produced by a multi-layer perceptron. To provide enhanced resolution of the extracted text images, we perform the text detection process after generating a mosaic image in a fast and robust image registration method.

关键词： image sequences Layout image registration Cameras Parameter estimation Videos Pixel image processing Robustness Optical character recognition software

来源：评论

学校读者我要写书评

暂无评论

DSA image registration based on multiscale Gabor filters and mutual information

DSA image registration based on multiscale Gabor filters and...

引用

International Conference on Information and Automation (ICIA)

作者： Zhiguo Cao Xiaoxiao Liu Bo Peng Yiu-Sang Moon Key Laboratory of Ministry of Education for Image Processing and Intelligent Control Institute for Pattern Recognition and Artificial Intelligence Huazhong University of Science and Technology Wuhan China Department of Computer Science and Engineering Chinese University of Hong Kong New Territories Hong Kong China

In clinical practice, digital subtraction angiography (DSA) is a powerful technique for the visualization of blood vessels in X-ray image sequences. Different with traditional DSA image registration processes, in our proposed image registration method, the control points are selected from the vessel centerlines using multiscale Gabor filters, and mutual information (MI) is then taken as the similarity criterion to find the correspondences. Experimental results demonstrate our algorithm efficiently yields satisfying registration result for DSA images.

关键词： image registration Gabor filters Mutual information Biomedical imaging Angiography Visualization Displacement control Blood vessels image sequences Pixel

来源：评论

学校读者我要写书评

暂无评论

An evolutionary lion optimization algorithm-based image compression technique for biomedical applications

An evolutionary lion optimization algorithm-based image comp...

引用

作者： Geetha, Karuppaiah Anitha, Veerasamy Elhoseny, Mohamed Kathiresan, Shankar Shamsolmoali, Pourya Selim, Mahmoud M. Department of Computer Science & Engineering MIET Engineering College Tamilnadu India Department of Computer Science and Engineering Imayam College of Engineering Anna University ChennaiTamilnadu India Faculty of Computers and Information Mansoura University Mansoura Egypt Scientific Group for Research and Technology Cairo Egypt Department of Computer Applications Alagappa University Karaikudi India Huawei Technologies Corporate Shanghai China. & Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai China Department of Mathematics Al-Aflaj College of Science and Human Studies Prince Sattam Bin Abdulaziz University Al-Kharj Saudi Arabia

Recently, medical image compression becomes essential to effectively handle large amounts of medical data for storage and communication purposes. Vector quantization (VQ) is a popular image compression technique, and the commonly used VQ model is Linde–Buzo–Gray (LBG) that constructs a local optimal codebook to compress images. The codebook construction was considered as an optimization problem, and a bioinspired algorithm was employed to solve it. This article proposed a VQ codebook construction approach called the L2-LBG method utilizing the Lion optimization algorithm (LOA) and Lempel Ziv Markov chain Algorithm (LZMA). Once LOA constructed the codebook, LZMA was applied to compress the index table and further increase the compression performance of the LOA. A set of experimentation has been carried out using the benchmark medical images, and a comparative analysis was conducted with Cuckoo Search-based LBG (CS-LBG), Firefly-based LBG (FF-LBG) and JPEG2000. The compression efficiency of the presented model was validated in terms of compression ratio (CR), compression factor (CF), bit rate, and peak signal to noise ratio (PSNR). The proposed L2-LBG method obtained a higher CR of 0.3425375 and PSNR value of 52.62459 compared to CS-LBG, FA-LBG, and JPEG2000 methods. The experimental values revealed that the L2-LBG process yielded effective compression performance with a better-quality reconstructed image. © 2020 John Wiley & Sons Australia, Ltd

关键词： Vector quantization

来源：评论

学校读者我要写书评

暂无评论

A regularization approach for instance-based superset label learning

arXiv

引用

arXiv 2019年

作者： Gong, Chen Liu, Tongliang Tang, Yuanyan Yang, Jian Yang, Jie Tao, Dacheng School of Computer Science and Engineering Nanjing University of Science and Technology Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University School of Software Faculty of Engineering and Information Technology University of Technology Sydney UltimoNSW2007 Australia Faculty of Science and Technology University of Macau Macau999078 China College of Computer Science Chongqing University Chongqing400000 China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai200240 China School of Information Technologies Faculty of Engineering and Information Technologies University of Sydney J12/318 Cleveland St DarlingtonNSW2008 Australia

Different from the traditional supervised learning in which each training example has only one explicit label, Superset Label Learning (SLL) refers to the problem that a training example can be associated with a set of candidate labels, and only one of them is correct. Existing SLL methods are either regularization-based or instance-based, and the latter of which has achieved state-of-the-art performance. This is because the latest instance-based methods contain an explicit disambiguation operation that accurately picks up the groundtruth label of each training example from its ambiguous candidate labels. However, such disambiguation operation does not fully consider the mutually exclusive relationship among different candidate labels, so the disambiguated labels are usually generated in a nondiscriminative way, which is unfavorable for the instance-based methods to obtain satisfactory performance. To address this defect, we develop a novel Regularization approach for Instancebased Superset Label (RegISL) learning so that our instancebased method also inherits the good discriminative ability possessed by the regularization scheme. Specifically, we employ a graph to represent the training set, and require the examples that are adjacent on the graph to obtain similar labels. More importantly, a discrimination term is proposed to enlarge the gap of values between possible labels and unlikely labels for every training example. As a result, the intrinsic constraints among different candidate labels are deployed, and the disambiguated labels generated by RegISL are more discriminative and accurate than those output by existing instance-based algorithms. The experimental results on various tasks convincingly demonstrate the superiority of our RegISL to other typical SLL methods in terms of both training accuracy and test accuracy. Copyright © 2019, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

RBP-Former: Joint Prediction of RNA-protein Binding Sites on Full-length RNA Transcripts for Multiple RBPs

RBP-Former: Joint Prediction of RNA-protein Binding Sites on...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Yichong Li Xiaojian Liu Fan Cheng Xiaoyong Pan Yang Yang Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Shanghai China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

RNA-binding proteins (RBPs) are essential for gene expression, and the complex RNA-protein interaction mechanisms require analysis of global RNA information. Therefore, accurate prediction of RBP binding sites on full-length RNA transcripts is crucial for understanding these mechanisms and their roles in diseases. While machine learning methods can predict RBP binding to RNA fragments, extending this to full-length transcripts presents challenges due to sequence length and data imbalance. In this paper, we introduce RBP-Former, a binding site joint prediction model designed specifically for full-length RNA transcripts that can be used for multiple RBPs. This model processes information at both coarse and fine-grained levels to fully exploit sequence data and its interactions with multiple RBPs. We develop multi-level imbalance learning strategies, achieving favorable results on imbalanced data. Our method outperforms existing methods in predicting binding sites on full-length RNA transcripts for multiple RBPs, demonstrating its effectiveness in handling imbalanced label and sample distributions.

关键词： Proteins Protein engineering Accuracy RNA Machine learning Predictive models Data models Gene expression Bioinformatics Diseases

来源：评论

学校读者我要写书评

暂无评论

Learning data-adaptive nonparametric kernels

arXiv

引用

arXiv 2018年

作者： Liu, Fanghui Huang, Xiaolin Gong, Chen Yang, Jie Li, Li Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Department of Automation Tsinghua University

Kernel methods have been extensively used in a variety of machine learning tasks such as classification, clustering, and dimensionality reduction. For complicated practical tasks, the traditional kernels, e.g., Gaussian kernel and sigmoid kernel, or their combinations are often not sufficiently flexible to fit the data. In this paper, we present a Data-Adaptive Nonparametric Kernel (DANK) learning framework in a data-driven manner. To be specific, in model formulation, we impose an adaptive matrix on the kernel/Gram matrix in an entry-wise strategy. Since we do not specify the formulation of the adaptive matrix, each entry in the adaptive matrix can be directly and flexibly learned from the data. Therefore, the solution space of the learned kernel is largely expanded, which makes our DANK model flexible to capture the data with different local statistical properties. Specifically, the proposed kernel learning framework can be seamlessly embedded to support vector machines (SVM) and support vector regression (SVR), which has the capability of enlarging the margin between classes and reducing the model generalization error. Theoretically, we demonstrate that the objective function of our DANK model embedded in SVM/SVR is gradient-Lipschitz continuous. Thereby, the training process for kernel and parameter learning in SVM/SVR can be efficiently optimized in a unified framework. Further, to address the scalability issue in nonparametric kernel learning framework, we decompose the entire optimization problem in DANK into several smaller easy-to-solve problems, so that our DANK model can be efficiently approximated by this partition. The effectiveness of this approximation is demonstrated by both empirical studies and theoretical guarantees. Experimentally, the proposed DANK model embedded in SVM/SVR achieves encouraging performance on various classification and regression benchmark datasets when compared with other representative kernel learning based algorithms. Copyrig

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Multi-level graph convolutional network with automatic graph learning for hyperspectral image classification

arXiv

引用

arXiv 2020年

作者： Wan, Sheng Gong, Chen Pan, Shirui Yang, Jie Yang, Jian PCA Lab Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Jiangsu Key Laboratory of Image Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai200240 China Faculty of Information Technology Monash University ClaytonVIC3800 Australia

Nowadays, deep learning methods, especially the Graph Convolutional Network (GCN), have shown impressive performance in hyperspectral image (HSI) classification. However, the current GCN-based methods treat graph construction and image classification as two separate tasks, which often results in suboptimal performance. Another defect of these methods is that they mainly focus on modeling the local pairwise importance between graph nodes while lack the capability to capture the global contextual information of HSI. In this paper, we propose a Multi-level GCN with Automatic Graph Learning method (MGCN-AGL) for HSI classification, which can automatically learn the graph information at both local and global levels. By employing attention mechanism to characterize the importance among spatially neighboring regions, the most relevant information can be adaptively incorporated to make decisions, which helps encode the spatial context to form the graph information at local level. Moreover, we utilize multiple pathways for local-level graph convolution, in order to leverage the merits from the diverse spatial context of HSI and to enhance the expressive power of the generated representations. To reconstruct the global contextual relations, our MGCN-AGL encodes the long range dependencies among image regions based on the expressive representations that have been produced at local level. Then inference can be performed along the reconstructed graph edges connecting faraway regions. Finally, the multi-level information is adaptively fused to generate the network output. In this means, the graph learning and image classification can be integrated into a unified framework and benefit each other. Extensive experiments have been conducted on three real-world hyperspectral datasets, which are shown to outperform the state-of-the-art methods. Copyright © 2020, The Authors. All rights reserved.

关键词： image classification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：