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

Multi-scale Graph Convolutional Neural Network for Object Recognition from Point Cloud data 2nd

学校读者我要写书评

暂无评论

Multi-scale Graph Convolutional Neural Network for Object Re...

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

Face micro-expression recognition algorithm based on ResNet depth model

学校读者我要写书评

暂无评论

Face micro-expression recognition algorithm based on ResNet ...

6th International Conference on Intelligent Computing and Signal Processing (ICSP)

作者： Liquan Wang Shu Zhan School of Computer and Information Engineering Hefei University of Technology Key Laboratory of Big Data Knowledge Engineering Ministry of Education Hefei China

Micro Expression (ME) is the subtle facial expressions that people show when they express their inner feelings. To address the problem that micro-expression recognition is difficult and less accurate due to the small number of samples and uneven distribution of different categories, we propose a model framework to improve the accuracy of micro-expression recognition. The peak frames containing more key expression information in the micro-expression video sequences are extracted; SE-ResNeXt-50, an improved residual network with SE module, is used to extract features from the peak frames of micro-expressions, where the SE module can better learn the key information in the features, and ResNeXt simplifies the structure by replacing the dense structure with the sparse structure through group convolution, which improves the recognition efficiency. The recognition efficiency is improved by replacing the dense structure with the sparse structure by group convolution. At the same time, the Focal Loss loss function can better solve the model performance problem caused by the imbalance of micro-expression data. Simulation experiments are conducted on the micro-expression dataset CASMEⅡ, and it is found that the improved residual network and peak frame improve the accuracy and F1 value of micro-expression recognition. The improved residual network and peak frame can reduce the effect of small data set, make the model have good fitting effect, and improve the performance of different categories, improve the recognition accuracy of micro-expressions, and have better recognition performance for micro-expression recognition.

关键词：

Ontology-based Categorization of Web Search Results Using YAGO

学校读者我要写书评

暂无评论

Ontology-based Categorization of Web Search Results Using YA...

The Second International Joint Conference on Computational Science and Optimization(CSO 2009)(2009 国际计算科学与优化会议)

作者： Anjian Ren Xiaoyong Du Puwei Wang Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China Beijing 100782 China

One of the major limitations of current search engines is that users could not quickly locate what they want if the input query is too general. Some existing techniques try to cluster web search results into groups so as to user's quick browsing. In this paper, we present a new approach to categorize the web search results by using YAGO ontology. It utilizes the YAGO ontology to automatically generate categories for the user's specific query and classify the search results into appropriate categories. Our experimental results indicate that our method is feasible and effectiveness.

关键词： Ontologies Web search Feedback Image retrieval Information retrieval Image databases Humans Set theory Information systems Radio frequency

Rethinking data-Free Quantization as a Zero-Sum Game

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Qian, Biao Wang, Yang Hong, Richang Wang, Meng Key Laboratory of Knowledge Engineering with Big Data Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology China

data-free quantization (DFQ) recovers the performance of quantized network (Q) without accessing the real data, but generates the fake sample via a generator (G) by learning from full-precision network (P) instead. However, such sample generation process is totally independent of Q, specialized as failing to consider the adaptability of the generated samples, i.e., beneficial or adversarial, over the learning process of Q, resulting into non-ignorable performance loss. Building on this, several crucial questions — how to measure and exploit the sample adaptability to Q under varied bit-width scenarios? how to generate the samples with desirable adaptability to benefit the quantized network? — impel us to revisit DFQ. In this paper, we answer the above questions from a game-theory perspective to specialize DFQ as a zero-sum game between two players — a generator and a quantized network, and further propose an Adaptability-aware Sample Generation (AdaSG) method. Technically, AdaSG reformulates DFQ as a dynamic maximization-vs-minimization game process anchored on the sample adaptability. The maximization process aims to generate the sample with desirable adaptability, such sample adaptability is further reduced by the minimization process after calibrating Q for performance recovery. The Balance Gap is defined to guide the stationarity of the game process to maximally benefit Q. The theoretical analysis and empirical studies verify the superiority of AdaSG over the state-of-the-arts. Our code is available at https://***/hfutqian/AdaSG. Copyright © 2023, The Authors. All rights reserved.

关键词： Game theory

Biggy: An implementation of unified framework for big data management system

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Wu, Yao Guan, Henan Key Laboratory of Data Engineering Knowledge Engineering of Ministry of Education Beijing China School of Information Renmin University of China Beijing China

Various tools, softwares and systems are proposed and implemented to tackle the challenges in big data on different emphases, e.g., data analysis, data transaction, data query, data storage, data visualization, data privacy. In this paper, we propose datar, a new prospective and unified framework for Big data Management System (BDMS) from the point of system architecture by leveraging ideas from mainstream computer structure. We introduce five key components of datar by reviewing the current status of BDMS. datar features with configuration chain of pluggable engines, automatic dataflow on job pipelines, intelligent self-driving system management and interactive user interfaces. Moreover, we present biggy as an implementation of datar with manipulation details demonstrated by four running examples. Evaluations on efficiency and scalability are carried out to show the performance. Our work argues that the envisioned datar is a feasible solution to the unified framework of BDMS, which can manage big data pluggablly, automatically and intelligently with specific functionalities, where specific functionalities refer to input, storage, computation, control and output of big data. Copyright © 2018, The Authors. All rights reserved.

关键词： Big data

Adaptive data-Free Quantization

学校读者我要写书评

暂无评论

arXiv 2023年

data-free quantization (DFQ) recovers the performance of quantized network (Q) without accessing the original data, but generates the fake sample via a generator (G) by learning from full-precision network (P), which, however, is totally independent of Q, overlooking the adaptability of the knowledge from generated samples, i.e., informative or not to the learning process of Q, resulting into the overflow of generalization error. Building on this, several critical questions - how to measure the sample adaptability to Q under varied bit-width scenarios? how to generate the samples with large adaptability to improve Q's generalization? whether the largest adaptability is the best? To answer the above questions, in this paper, we propose an Adaptive data-Free Quantization (AdaDFQ) method, which revisits DFQ from a zero-sum game perspective upon the sample adaptability between two players - a generator and a quantized network. Following this viewpoint, we further define the disagreement and agreement samples to form two boundaries, where the margin is optimized to address the over-and-under fitting issues, so as to generate the samples with adaptive adaptability to Q. Our AdaDFQ reveals: 1) the largest adaptability is NOT the best for sample generation to benefit Q's generalization;2) the knowledge of the generated sample should not be informative to Q only, but also related to the category and distribution information of the training data for P. The theoretical and empirical analysis validate the advantages of AdaDFQ over the state-of-the-arts. Our code is available at https://***/hfutqian/AdaDFQ. Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

Query-Aware Complex Object Buffer Management in XML Information Retrieval

学校读者我要写书评

暂无评论

Query-Aware Complex Object Buffer Management in XML Informat...

International Asia-Pacific Web Conference (APWEB)

作者： Qiushi Li Qiuyue Wang Shan Wang Key Laboratory of Ministry of Education of Data Engineering and Knowledge Engineering Beijing China School of Information Renmin University of China Beijing China

In this paper, we analyse the data access characteristics of a typical XML information retrieval system and propose a new query aware buffer replacement algorithm based on prediction of Minimum Reuse Distance (MRD for short). The algorithm predicts an object's next reference distance according to the retrieval system's running status and replaces the objects that have maximum reuse distances. The factors considered in the replacement algorithm include the access frequency, creation cost, and size of objects, as well as the queries being executed. By taking into account the queries currently running or queuing in the system, MRD algorithm can predict more accurately the reuse distances of index data objects.

关键词： Information management XML Information retrieval Tree data structures Indexing Prediction algorithms Algorithm design and analysis Frequency data analysis Information analysis

HelPal: A Search System for Mobile Crowd Service

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Wu, Yao Wu, Tianzhen Xiong, Ziyi Wu, Yuncheng Chen, Hong Li, Cuiping Zhang, Xiaoying Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education Beijing China School of Information Renmin University of China Beijing China

Proliferation of ubiquitous mobile devices makes location based services prevalent. Mobile users are able to volunteer as providers of specific services and in the meanwhile to search these services. For example, drivers may be interested in tracking available nearby users who are willing to help with motor repair or are willing to provide travel directions or first aid. With the diffusion of mobile users, it is necessary to provide scalable means of enabling such users to connect with other nearby users so that they can help each other with specific services. Motivated by these observations, we design and implement a general location based system HelPal for mobile users to provide and enjoy instant service, which is called mobile crowd service. In this demo, we introduce a mobile crowd service system featured with several novel techniques. We sketch the system architecture and illustrate scenarios via several cases. Demonstration shows the user-friendly search interface for users to conveniently find skilled and qualified nearby service providers. Copyright © 2017, The Authors. All rights reserved.

关键词： Location based services

Achieving efficient and secure range query in two-tiered wireless sensor networks

学校读者我要写书评

暂无评论

Achieving efficient and secure range query in two-tiered wir...

International Workshop on Quality of Service

作者： Xiaoying Zhang Lei Dong Hui Peng Hong Chen Deying Li Cuiping Li Ministry of Education Key Laboratory of Data Engineering and Knowledge Engineering Beijing China School of Information Renmin University of China Beijing China

ISBN: (纸本)9781479950058

Wireless sensor network is an important part of the Internet of Things. Preservation of privacy and integrity in wireless sensor networks is extremely urgent and challenging. To address this problem, we propose in this paper an efficient and secure range query protocol in two-tiered wireless sensor networks introducing master nodes. Our proposal not only prevents adversaries from gaining sensitive information of both queries issued by users and data collected by sensor nodes but also allows the sink to verify whether results are valid. It offers confidentiality of queries and data by constructing a special code, provides integrity verification by the correlation among data and also enables efficient query processing. Finally, theoretical analysis and simulation results confirm the security and efficiency of our proposal.

关键词： Protocols Wireless sensor networks Equations Privacy data privacy Security Quality of service