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

2nd International Conference on Urban Intelligence and Applications, ICUIA 2020

作者： Lu, Qiang Chen, Chao Teng, Jinfeng Zhang, Chunyuan Huang, Yi Xuan, Shanli Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei230009 China School of Computer and Information Hefei University of Technology Hefei230009 China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei230009 China

ISBN: (纸本)9789813346000

How to make robots understand the point cloud data which is collected from the 3D sensor and complete the recognition has become a hot research direction in recent years. In this paper, we propose a new approach to improve the critical robotic capability, semantic understanding of the environment (i.e., 3D object recognition). The convolutional neural network (CNN) method has a very good recognition result in the 2D image domain, but it has certain difficulty in applying irregular and unordered 3D point clouds data. The network for point cloud data generally uses the convolution to realize the extraction of point cloud features by finding the neighborhood features on the point set. Due to the different neighborhood scales caused by the irregularity of 3D point cloud data, we propose a CNN structure that combines multi-scale features. By finding multiple neighborhoods of the point set and establishing local graph extraction features, the stable expression of the local neighborhood is obtained. At the same time, the key point calibration method is added, so that the network can dynamically focus on key point features to improve the recognition result. In a series of analytical experiments, we demonstrate competing results that demonstrate the effectiveness of the network structure. © 2020, Springer Nature Singapore Pte Ltd.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

I-mRMR: Incremental max-relevance, and min-redundancy feature selection 3rd

I-mRMR: Incremental max-relevance, and min-redundancy featur...

引用

3rd APWeb and WAIM Joint Conference on Web and Big data, APWeb-WAIM 2019

作者： Xiu, Yeliang Zhao, Suyun Chen, Hong Li, Cuiping Information of School Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing China

ISBN: (纸本)9783030260743

An incremental method of feature selection based on mutual information, called incremental Max-Relevance, and Min-Redundancy (I-mRMR), is presented. I-mRMR is an incremental version of Max-Relevance, and Min-Redundancy feature selection (mRMR), which is used to handle streaming data or large-scale data. First, Incremental key Instance Set is proposed which composes of the non-distinguished instances by the historical selected features. Second, an incremental feature selection algorithm is designed in which the incremental key instance set, replacing of all the seen instances so far, is used in the process of adding representative features. Since the Incremental key Instance Set is far less than the whole instances, the incremental feature selection by using this key set avoids redundant computation and save computation time and space. Finally, the experimental results show that I-mRMR could significantly or even dramatically reduce the time of feature selection with an acceptable classification accuracy. © 2019, Springer Nature Switzerland AG.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

Robust and Fast Measure of Information via Low-rank Representation

arXiv

引用

arXiv 2022年

作者： Dong, Yuxin Gong, Tieliang Yu, Shujian Chen, Hong Li, Chen School of Computer Science and Technology Xi’an Jiaotong University Xi’an710049 China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Ministry of Education Xi’an710049 China Machine Learning Group UiT - The Arctic University of Norway Norway College of Science Huazhong Agriculture University Wuhan430070 China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Wuhan430070 China

The matrix-based Rényi’s entropy allows us to directly quantify information measures from given data, without explicit estimation of the underlying probability distribution. This intriguing property makes it widely applied in statistical inference and machine learning tasks. However, this information theoretical quantity is not robust against noise in the data, and is computationally prohibitive in large-scale applications. To address these issues, we propose a novel measure of information, termed low-rank matrix-based Rényi’s entropy, based on low-rank representations of infinitely divisible kernel matrices. The proposed entropy functional inherits the specialty of of the original definition to directly quantify information from data, but enjoys additional advantages including robustness and effective calculation. Specifically, our low-rank variant is more sensitive to informative perturbations induced by changes in underlying distributions, while being insensitive to uninformative ones caused by noises. Moreover, low-rank Rényi’s entropy can be efficiently approximated by random projection and Lanczos iteration techniques, reducing the overall complexity from O(n3) to O(n2s) or even O(ns2), where n is the number of data samples and s n. We conduct large-scale experiments to evaluate the effectiveness of this new information measure, demonstrating superior results compared to matrix-based Rényi’s entropy in terms of both performance and computational efficiency. Copyright © 2022, The Authors. All rights reserved.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-based Model Acceleration for Cancer Classification in Whole-Slide Images

Uncertainty-based Model Acceleration for Cancer Classificati...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Zeyu Gao Anyu Mao Jialun Wu Yang Li Chunbao Wang Caixia Ding Tieliang Gong Chen Li School of Computer Science and Technology Xi’an Jiaotong University Xi’an China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Xi’an China Department of Pathology the First Affiliated Hospital of Xi’an Jiaotong University Xi’an China Department of Pathology Shaanxi Provincial Cancer Hospital Xi’an China

ISBN: (数字)9781665468190

ISBN: (纸本)9781665468206

Computational Pathology (CPATH) offers the possibility for highly accurate and low-cost automated pathological diagnosis. However, the high time cost of model inference is one of the main issues limiting the application of CPATH methods. Due to the large size of Whole-Slide Image (WSI), commonly used CPATH methods divided a WSI into a large number of image patches at relatively high magnification, then predicted each image patch individually, which is time-consuming. In this paper, we propose a novel Uncertainty-based Model Acceleration (UMA) method for reducing the time cost of model inference, thereby relieving the deployment burden of CPATH applications. Enlightened by the slide-viewing process of pathologists, only a few high-uncertain regions are regarded as “suspicious” regions that need to be predicted at high magnification, and most of the regions in WSI are predicted at low magnification, thereby reducing the times of image patch extraction and prediction. Meanwhile, uncertainty estimation ensures prediction accuracy at low magnification. We take two fundamental CPATH classification tasks (i.e., cancer region detection and subtyping) as examples. Extensive experiments on two large-scale renal cell carcinoma classification datasets demonstrate that our UMA can significantly reduce the time cost of model inference while maintaining competitive classification performance.

关键词： Pathology Costs Uncertainty Limiting Hospitals Biological system modeling Computational modeling

来源：评论

学校读者我要写书评

暂无评论

SVT-Net: Super Light-Weight Sparse Voxel Transformer for Large Scale Place Recognition

arXiv

引用

arXiv 2021年

作者： Fan, Zhaoxin Song, Zhenbo Liu, Hongyan Lu, Zhiwu He, Jun Du, Xiaoyong Key Laboratory of Data Engineering Knowledge Engineering of MOE School of Information Renmin University of China Beijing100872 China Gaoling School of Artificial Intelligence Renmin University of China Beijing100872 China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Department of Management Science and Engineering Tsinghua University Beijing100084 China

Simultaneous Localization and Mapping (SLAM) and Autonomous Driving are becoming increasingly more important in recent years. Point cloud-based large scale place recognition is the spine of them. While many models have been proposed and have achieved acceptable performance by learning short-range local features, they always skip long-range contextual properties. Moreover, the model size also becomes a serious shackle for their wide applications. To overcome these challenges, we propose a super light-weight network model termed SVT-Net. On top of the highly efficient 3D Sparse Convolution (SP-Conv), an Atom-based Sparse Voxel Transformer (ASVT) and a Cluster-based Sparse Voxel Transformer (CSVT) are proposed respectively to learn both short-range local features and long-range contextual features. Consisting of ASVT and CSVT, SVT-Net can achieve state-of-the-art performance in terms of both recognition accuracy and running speed with a super-light model size (0.9M parameters). Meanwhile, for the purpose of further boosting efficiency, we introduce two simplified versions, which also achieve state-of-the-art performance and further reduce the model size to 0.8M and 0.4M respectively. Copyright © 2021, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

SEA: Sentence encoder assembly for video retrieval by textual queries

arXiv

引用

arXiv 2020年

作者： Li, Xirong Zhou, Fangming Xu, Chaoxi Ji, Jiaqi Yang, Gang Key Lab of Data Engineering and Knowledge Engineering AI & Media Computing Lab School of Information Renmin University of China Beijing100872 China

Retrieving unlabeled videos by textual queries, known as Ad-hoc Video Search (AVS), is a core theme in multimedia data management and retrieval. The success of AVS counts on cross-modal representation learning that encodes both query sentences and videos into common spaces for semantic similarity computation. Inspired by the initial success of previously few works in combining multiple sentence encoders, this paper takes a step forward by developing a new and general method for effectively exploiting diverse sentence encoders. The novelty of the proposed method, which we term Sentence Encoder Assembly (SEA), is two-fold. First, different from prior art that use only a single common space, SEA supports text-video matching in multiple encoder-specific common spaces. Such a property prevents the matching from being dominated by a specific encoder that produces an encoding vector much longer than other encoders. Second, in order to explore complementarities among the individual common spaces, we propose multi-space multi-loss learning. As extensive experiments on four benchmarks (MSR-VTT, TRECVID AVS 2016-2019, TGIF and MSVD) show, SEA surpasses the state-of-the-art. In addition, SEA is extremely ease to implement. All this makes SEA an appealing solution for AVS and promising for continuously advancing the task by harvesting new sentence encoders. © 2020, CC-BY.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

Deep Representation of Hierarchical Semantic Attributes for Zero-shot Learning

Deep Representation of Hierarchical Semantic Attributes for ...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Zhaocheng Zhang Gang Yang School of Information Renmin University of China Beijing China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China Beijing China

ISBN: (数字)9781728169262

ISBN: (纸本)9781728169279

On account of a large scale of dataset need to be annotated to fit for specific tasks, Zero-Shot Learning(ZSL) has invoked so much attention and got significant progress in recent research due to the prevalence of deep neural networks. At present, ZSL is mainly solved through the utilization of auxiliary information, such as semantic attributes and text descriptions. And then, we can employ the mapping method to bridge the gap between visual and semantic space. However, due to the lack of effective use of auxiliary information, this problem has not been solved well. Inspired by previous work, we consider that visual space can be used as the embedding space to get a stronger ability to express the precise characteristics of semantic information. Meanwhile, we take into account that there are some noise attributes in the annotated information of public datasets that need to be processed. Based on these considerations, we propose an end-to-end method with convolutional architecture, instead of conventionally linear projection, to provide a deep representation for semantic information to solve ZSL. Semantic features would express more detailed and precise information after being feed into our method. Besides, we use word embedding to generate some superclasses for original classes and propose a new loss function for these superclasses to assist in training. Experiments show that our method can get decent improvements for ZSL and Generalized Zero-Shot Learning(GZSL) on several public datasets.

关键词： Semantics Visualization Training Testing Task analysis Neural networks Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

Research progress of CDT 8

Research progress of CDT

引用

8th International Conference on Bioinformatics and Biomedical Science, ICBBS 2019

作者： Yuting, Gao Shutong, Shen Sanhong, Deng School of Information Management Nanjing University China Key Laboratory of Data Engineering and Knowledge Services in Jiangsu China

ISBN: (纸本)9781450372510

With the high mortality rate for the cases of malignant tumors, the discovery and early treatment of cancer is critical to improving the 5-year survival rate of cancer. The biggest challenge in control and prevention is how to detect tumors as early as possible, so that the most effective means can be used for treatment. With the help of the WOS database, researchers found that liquid biopsy, genetic material/protein expression and computer imaging play an important role in cancer detection. Through analysis of the history and current status of cancer detection technology development, this paper also aims to provide guidance for the clinical practice of current cancer screening and provide inspiration for future technological development. © 2019 Association for Computing Machinery.

关键词： Gene expression

来源：评论

学校读者我要写书评

暂无评论

High-Resolution Natural Image Matting by Refining Low-resolution Alpha Mattes

引用

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society 2025年 PP卷 PP页

作者： Xianmin Ye Yihui Liang Mian Tan Fujian Feng Lin Wang Han Huang College of Data Science and Information Engineering Guizhou Minzu University Guiyang China Guizhou Key Laboratory of Pattern Recognition and Intelligent System Guizhou Minzu University Guiyang China School of Computer Science Zhongshan Institute University of Electronic Science and Technology of China Zhongshan China Guizhou Key Laboratory of Pattern Recognition and Intelligent System and the College of Data Science and Information Engineering Guizhou Minzu University Guiyang China School of Software Engineering South China University of Technology Guangzhou China Key Laboratory of Big Data and Intelligent Robot (SCUT) MOE of China Guangzhou China Guangdong Engineering Center for Large Model and GenAI Technology Guangzhou China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

High-resolution natural image matting plays an important role in image editing, film-making and remote sensing due to its ability of accurately extract the foreground from a natural background. However, due to the complexity brought about by the proliferation of resolution, the existing image matting methods cannot obtain high-quality alpha mattes on high-resolution images in reasonable time. To overcome this challenge, we introduce a high-resolution image matting framework based on alpha matte refinement from low-resolution to high-resolution (HRIMF-AMR). The proposed framework transforms the complex high-resolution image matting problem into low-resolution image matting problem and high-resolution alpha matte refinement problem. While the first problem is solved by adopting an existing image matting method, the latter is addressed by applying the Detail Difference Feature Extractor (DDFE) designed as a part of our work. The DDFE extracts detail difference features from high-resolution images by measuring the image feature difference between high-resolution images and low-resolution images. The low-resolution alpha matte is refined according to the extracted detail difference feature, providing the high-resolution alpha matte. In addition, the Matte Detail Resolution Difference (MDRD) loss is introduced to train the DDFE, which imposes an additional constraint on the extraction of detail difference features with mattes. Experimental results show that integrating HRIMF-AMR significantly enhances the performance of existing matting methods on high-resolution images of Transparent-460 and Alphamatting. Project page: https://***/yexianmin/HRAMR-Matting.

关键词： Feature extraction Image resolution Image color analysis Optimization Remote sensing Clustering algorithms Accuracy Visualization Transforms Training

来源：评论

学校读者我要写书评

暂无评论

Toward PTNET Network Topology Analysis and Routing Algorithm Design 6th

Toward PTNET Network Topology Analysis and Routing Algorithm...

引用

6th International Conference on data Science, ICDS 2019

作者： Han, Zhijie Zhang, Qingfang Du, Xiaoyu Guo, Kun He, Mingshu Institute of Data and Knowledge Engineering Henan University KaifengHenan475004 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Network NanjingJiangsu210003 China School of Computer and Information Engineering Henan University KaifengHenan475004 China University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9789811528095

In recent years, data center network is used for transmission, storage and processing of big data, which plays an important role for applications in cloud computing and CDN distribution. Network topology and routing algorithm are its core research content and key technical issues. The traditional network topology is difficult to guarantee the quality of service in scalability and fault tolerance. The server-centric data center network topology can ensure the scale of the data center network by recursively increasing the number of network nodes and links. relative to the Dcell, BCube, and BCCC typical network topology, PTNet network as a typical representative of a new type of the server-centric data center network topology, which has more advantages in scalability, fault tolerance and so on. Multicast and broadcast in data center network have more application scenarios and use value. For example, the video conference online, multimedia remote education and other development are inseparable from the application and promotion of network multicast and broadcast. So it is necessary to research the routing algorithms of multicast and broadcast in the network. Based on the deep research of PTNet network, this paper analyzes and researches the network topology, multicast and broadcast routing algorithm. © Springer Nature Singapore Pte Ltd 2020.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：