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

Learning data-adaptive nonparametric kernels

学校读者我要写书评

暂无评论

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

Correction to: Automatic identification of myopic maculopathy related imaging features in optic disc region via machine learning methods

学校读者我要写书评

暂无评论

Journal of translational medicine 2021年第1期19卷 203页

作者： Yuchen Du Qiuying Chen Ying Fan Jianfeng Zhu Jiangnan He Haidong Zou Dazhen Sun Bowen Xin David Feng Michael Fulham Xiuying Wang Lisheng Wang Xun Xu Department of Automation The Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University (SJTU) 800 Dongchuan RD. Minhang District Shanghai 200240 People's Republic of China. Department of Preventative Ophthalmology Shanghai Eye Diseases Prevention and Treatment Center Shanghai Eye Hospital No. 380 Kangding Road Shanghai 200040 China. Department of Ophthalmology Shanghai Key Laboratory of Ocular Fundus Diseases Shanghai Engineering Center for Visual Science and Photo Medicine Shanghai General Hospital SJTU School of Medicine Shanghai China. National Clinical Research Center for Eye Diseases Shanghai 20080 China. Biomedical and Multimedia Information Technology Research Group School of Computer Science The University of Sydney Sydney NSW 2006 Australia. Department of Molecular Imaging Royal Prince Alfred Hospital and the University of Sydney Sydney Australia. Department of Automation The Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University (SJTU) 800 Dongchuan RD. Minhang District Shanghai 200240 People's Republic of China. lswang@***. Department of Preventative Ophthalmology Shanghai Eye Diseases Prevention and Treatment Center Shanghai Eye Hospital No. 380 Kangding Road Shanghai 200040 China. drxuxun@***. Department of Ophthalmology Shanghai Key Laboratory of Ocular Fundus Diseases Shanghai Engineering Center for Visual Science and Photo Medicine Shanghai General Hospital SJTU School of Medicine Shanghai China. drxuxun@***. National Clinical Research Center for Eye Diseases Shanghai 20080 China. drxuxun@***.

An amendment to this paper has been published and can be accessed via the original article.

关键词：

Two-dimensional Spectral image Calibration Based on Feed-forward Neural Network

学校读者我要写书评

暂无评论

Two-dimensional Spectral Image Calibration Based on Feed-for...

International Joint Conference on Neural Networks

作者： Mingze Li Hasitieer Haerken Ping Guo Fuqing Duan Qian Yin Xin Zheng Image Processing and Pattern Recognition Laboratory Beijing Normal University Beijing 100875 China

ISBN: (纸本)9781509061839

In this paper, we present a novel method on image calibration, utilizing Total Least Square (TLS) method and Feed-forward Neural Network, to solve the aberration problem of LAMOST two-dimensional astronomical spectral images. In our method, training sample set is generated with domain knowledge, from which a number of discrete points are are extracted from spectral images with fiber tracing method, and output vectors are formed by the corresponding calibrated points, obtained by utilizing the TLS method. The Feed-forward Neural Network is trained to obtain the transformation matrix, casting about for the matching relationship between the input and output sets. We also perform comparative experiments on fiber tracing and spectrum extraction results between calibrated spectral images and uncalibrated spectral images, the results show an advantage of higher accuracy and precision by our proposed method.

关键词： Nonlinear distortion Calibration Neural networks Training Optical distortion Imaging

Overview of the CCKS 2019 knowledge graph evaluation track: Entity, relation, event and QA

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Han, Xianpei Wang, Zhichun Zhang, Jiangtao Wen, Qinghua Li, Wenqi Tang, Buzhou Wang, Qi Feng, Zhifan Zhang, Yang Lu, Yajuan Wang, Haitao Chen, Wenliang Shao, Hao Chen, Yubo Liu, Kang Zhao, Jun Wang, Taifeng Zhang, Kezun Wang, Meng Jiang, Yinlin Qi, Guilin Zou, Lei Hu, Sen Zhang, Minhao Lin, Yinnian Chinese Information Processing Laboratory Institute of Software Chinese Academy of Sciences Beijing100190 China School of Artificial Intelligence Beijing Normal University Beijing100875 China 305 Hospital of People’s Liberation Army Beijing100017 China Department of Computer Science and Technology Tsinghua University Beijing100084 China Yidu Cloud Beijing100000 China Harbin Institute of Technology Shenzhen Guangdong518055 China Baidu Beijing100193 China School of Computer Science & Technology Soochow University Suzhou Jiangsu215006 China Gowild Suzhou Jiangsu215002 China National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences Beijing100190 China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing100049 China Ant Financial Hangzhou Zhejiang310000 China School of Computer Science and Engineering Southeast University Nanjing Jiangsu211189 China Key Laboratory of Computer Network Information Integration Southeast University Nanjing Jiangsu211189 China Peking University Beijing100871 China

Knowledge graph models world knowledge as concepts, entities, and the relationships between them, which has been widely used in many real-world tasks. CCKS 2019 held an evaluation track with 6 tasks and attracted more than 1,600 teams. In this paper we give an overview of the knowledge graph evaluation tract at CCKS 2019. By reviewing the task definition, successful methods, useful resources, good strategies and research challenges associated with each task in CCKS 2019, this paper can provide a helpful reference for developing knowledge graph applications and conducting future knowledge graph researches. Copyright © 2020, The Authors. All rights reserved.

关键词： Knowledge graph

FWLBP: A scale invariant descriptor for texture classification

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Roy, Swalpa Kumar Bhattacharya, Nilavra Chanda, Bhabatosh Chaudhuri, Bidyut B. Ghosh, Dipak Kumar Optical Character Recognition Laboratory Computer Vision and Pattern Recognition Unit Indian Statistical Institute Kolkata700108 India School of Information University of Texas AustinTX78712 United States Image Processing Laboratory Electronics and Communication Sciences Unit Indian Statistical Institute Kolkata700108 India Department of Electronics and Communication Engineering National Institute of Technology Rourkela Rourkela769008 India

In this paper we propose a novel texture descriptor called Fractal Weighted Local Binary pattern (FWLBP). The fractal dimension (FD) measure is relatively invariant to scale-changes, and presents a good correlation with human viewpoint of surface roughness. We have utilized this property to construct a scale-invariant descriptor. Here, the input image is sampled using an augmented form of the local binary pattern (LBP) over three different radii, and then used an indexing operation to assign FD weights to the collected samples. The final histogram of the descriptor has its features calculated using LBP, and its weights computed from the FD image. The proposed descriptor is scale invariant, and is also robust in rotation or reflection, and partially tolerant to noise and illumination changes. In addition, the local fractal dimension is relatively insensitive to the bi-Lipschitz transformations, whereas its extension is adequate to precisely discriminate the fundamental of texture primitives. Experiment results carried out on standard texture databases show that the proposed descriptor achieved better classification rates compared to the state-of-the-art descriptors. Copyright © 2018, The Authors. All rights reserved.

关键词： Fractal dimension

Generalization Properties of hyper-RKHS and its Applications

学校读者我要写书评

暂无评论

arXiv 2018年

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

This paper generalizes regularized regression problems in a hyper-reproducing kernel Hilbert space (hyper-RKHS), illustrates its utility for kernel learning and out-of-sample extensions, and proves asymptotic convergence results for the introduced regression models in an approximation theory view. Algorithmically, we consider two regularized regression models with bivariate forms in this space, including kernel ridge regression (KRR) and support vector regression (SVR) endowed with hyper-RKHS, and further combine divide-and-conquer with Nyström approximation for scalability in large sample cases. This framework is general: the underlying kernel is learned from a broad class, and can be positive definite or not, which adapts to various requirements in kernel learning. Theoretically, we study the convergence behavior of regularized regression algorithms in hyper-RKHS and derive the learning rates, which goes beyond the classical analysis on RKHS due to the non-trivial independence of pairwise samples and the characterisation of hyper-RKHS. Experimentally, results on several benchmarks suggest that the employed framework is able to learn a general kernel function form an arbitrary similarity matrix, and thus achieves a satisfactory performance on classification tasks. Copyright © 2018, The Authors. All rights reserved.

关键词： Approximation theory

A novel panoramic image stitching algorithm based on ORB

学校读者我要写书评

暂无评论

A novel panoramic image stitching algorithm based on ORB

2017 IEEE International Conference on Applied System Innovation, ICASI 2017

作者： Wang, Maosen Niu, Shaozhang Yang, Xuan Beijing Key Lab of Intelligent Telecommunication Software and Multimedia Beijing University of Posts and Telecommunications Beijing100876 China Institute of Image Processing and Pattern Recognition North China University of Technology No.5 Jinyuanzhuang Road Shijingshan District Beijing China

ISBN: (纸本)9781509048977

image stitching technique is to integrate multiple images with overlapping regions into a complete image with a wide viewing angle, less distortion, and no obvious suture. image stitching could be used for global positioning and robot autonomous navigation without changing the hardware. SIFT feature and SURF feature are the classical algorithm in the image stitching. But they have the long time-consuming problem. Facing this problem, a novel fast image stitching algorithm based on ORB (Oriented FAST and Rotated BRIEF) features is proposed in this paper. The algorithm firstly selects ORB algorithm which adds the direction information to the FAST detector for image feature extracting and matching. Secondly, RASANC (Random Sample Consensus) algorithm is used to eliminate false matching points. Finally, weighted average method is used to speed up the image fusion. Experimental results show that the stitching effect of the algorithm in this paper is the same as that of SIFT algorithm and SURF algorithm. The two obvious advantages of our algorithm include: (1) stitching speed is much faster than that of Shift and Surf;(2)The algorithm is robust to external parameters of camera. So the proposed algorithm is hopefully applied to some handed electrical devices. © 2017 IEEE.

关键词： image fusion

3D RoI-aware U-net for accurate and efficient colorectal tumor segmentation

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Huang, Yi-Jie Dou, Qi Wang, Zi-Xian Liu, Li-Zhi Jin, Ying Li, Chao-Feng Wang, Lisheng Chen, Hao Xu, Rui-Hua Institute of Image Processing and Pattern Recognition Department of Automation Shanghai Jiao Tong University China Imsight Medical Technology Co. Ltd. China Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong Sun Yat-sen University Cancer Center State Key Laboratory of Oncology in South China Collaborative Innovation Center for Cancer Medicine Guangzhou China

Segmentation of colorectal cancerous regions from 3D Magnetic Resonance (MR) images is a crucial procedure for radiotherapy which conventionally requires accurate delineation of tumour boundaries at an expense of labor, time and reproducibility. While deep learning based methods serve good baselines in 3D image segmentation tasks, small applicable patch size limits effective receptive field and degrades segmentation performance. In addition, Regions of interest (RoIs) localization from large whole volume 3D images serves as a preceding operation that brings about multiple benefits in terms of speed, target completeness, reduction of false positives. Distinct from sliding window or non-joint localization-segmentation based models, we propose a novel multitask framework referred to as 3D RoI-aware U-Net (3D RU-Net), for RoI localization and in-region segmentation where the two tasks share one backbone encoder network. With the region proposals from the encoder, we crop multi-level RoI in-region features from the encoder to form a GPU memory-efficient decoder for detail-preserving segmentation and therefore enlarged applicable volume size and effective receptive field. To effectively train the model, we designed a Dice formulated loss function for the global-to-local multi-task learning procedure. Based on the efficiency gains demonstrated by the proposed method, we went on to ensemble models with different receptive fields to achieve even higher performance costing minor extra computational expensiveness. Extensive experiments were subsequently conducted on 64 cancerous cases with a four-fold cross-validation, and the results showed significant superiority in terms of accuracy and efficiency over conventional state-of-the art frameworks. In conclusion, the proposed method has a huge potential for extension to other 3D object segmentation tasks from medical images due to its inherent generalizability. The code for the proposed method is publicly available. Copyright ©

关键词： Signal encoding

Edgy salient local binary patterns in inter-plane relationship for image retrieval in Diabetic Retinopathy

学校读者我要写书评

暂无评论

Procedia Computer Science 2017年 115卷 440-447页

作者： Gajanan M. Galshetwar Laxman M. Waghmare Anil B. Gonde Subrahmanyam Murala Center of Excellence in Signal and Image Processing (COESIP) Department of ECE SGGSIET Nanded Maharashtra 431606 India Computer Vision and Pattern Recognition Laboratory Department of Electrical Engineering IIT Ropar Rupnagar 140001 India

In this paper, a novel approach for content based image retrieval (CBIR) in diabetic retinopathy (DR) is proposed. The concept of salient point selection and inter-plane relationship technique is used. Salient points are selected from edgy image and later using inter-planer relationship, Local Binary patterns (LBPs) are calculated using the salient point as a center pixel. Our approach enhanced the results as we used color features in combination with LBP features. Experimentation is carried out on MESSIDOR database of 1200 retinal images, proposed approach has average precision of 57.82% as compared to the earlier approach whose average precision is 53.70%.

关键词： Content-Based image retrieval (CBIR) Diabetic Retinopathy (DR) Edgy Salient points Local Binary patterns (LBPs)