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

Chinese Control Conference (CCC)

作者： Ao Jiao Yongfu Li Shuyou Yu Zhongwei Cui Key Laboratory of Intelligent Air-Ground Cooperative Control for Universities in Chongqing Chongqing University of Posts and Telecommunications Chongqing China Department of Control Science & Engineering Jilin University Changchun China School of Mathematics and Big Data Guizhou Education University Guiyang China

ISBN: (数字)9789881563903

ISBN: (纸本)9781728165233

This study proposes a distributed nonlinear control algorithm for the heterogeneous connected vehicle (CV) platoon. In particular, in order to capture the nonlinear behavior of vehicle such as stop-and-go phenomena, the effects of the car-following interactions are considered. Besides, the vehicle dynamics of heterogeneous CVs is characterized by using the third-order vehicle dynamics model, and the controller is designed by considering the acceleration difference. In addition, the stability and consensus of the proposed control algorithm is analyzed by using Routh-Hurwitz stability criterion, hence, the negative velocity, negative spacing error and unreasonable acceleration/deceleration can be avoided based on the proposed control algorithm. Finally, the effectiveness and robustness of proposed algorithm is verified by conducting multiple numerical simulation experiments in presence of external disturbances and multiple real vehicle confirmatory experiments.

关键词： Acceleration Topology Vehicle dynamics Heuristic algorithms Stability analysis Convergence Numerical stability

来源：评论

学校读者我要写书评

暂无评论

Self-to-self transitions in open quantum systems:the origin and solutions

Self-to-self transitions in open quantum systems:the origin ...

引用

第三十九届中国控制会议

作者： Fang Gao Yaoxiong Wang Qing Gao Dewen Cao Feng Shuang College of Electrical Engineering Guangxi University Institute of Intelligent Machines Chinese Academy of Sciences School of Automation Science and Electrical Engineering Beihang University Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University University Key Laboratory of Intelligent Perception and Computing of Anhui Province Anqing Normal University

The information of quantum pathways can be extracted in the framework of the Hamiltonianencoding and Observable-decoding *** closed quantum systems,only off-diagonal elements of the Hamiltonian in the Hilbert space is required to be encoded to obtain the desired *** open quantum systems,environment-related terms will appear in the diagonal elements of the Hamiltonian in the Liouville *** diagonal encodings have to be performed to differentiate different pathways,which will lead to self-to-self transitions and inconsistency of pathway amplitudes with Dyson *** this work,a well-designed transformation is proposed to avoid the counterintuitive transitions and the inconsistency,with or without control *** simulations show that the method are consistent with Dyson expansion.

关键词： Self-to-self transitions in open quantum systems:the origin and solutions origin

来源：评论

学校读者我要写书评

暂无评论

RSSD: Object Detection via Attention Regions in SSD Detector

RSSD: Object Detection via Attention Regions in SSD Detector

引用

IEEE International Conference of Safety Produce Informatization (IICSPI)

作者： Shuren Zhou Jia Qiu Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology Changsha China

ISBN: (数字)9781728145662

ISBN: (纸本)9781728145679

This paper designs a module of attention regions in SSD detector for accurate and efficient object detection (RSSD). Different from previous one-stage detection method like SSD which just simply applied the multi-scale head-features and directly extracted from backbone network, for classification and regression, our method aims to strengthen the characterization of head-features further. The parallel encode-to-decode structure is constructed and a computation method of regional distribution on features (R-Softmax) is proposed. What's more, in order to reduce time-costs, the down-sampling layers are shared with the multi-scale layers from backbone network. Our detector performs better on PASCAL VOC datasets (e.g., 78.4% mAP V.S. SSD 76.4% on VOC 07test) and costs 0.001s per image more than SSD.

关键词： Object detection Training Convolution Feature extraction Detectors Proposals Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Non-structured Pruning for Deep-learning based Steganalytic Frameworks

Non-structured Pruning for Deep-learning based Steganalytic ...

引用

Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA)

作者： Qiushi Li Zilong Shao Shunquan Tan Jishen Zeng Bin Li Shenzhen Key Laboratory of Media Security Guangdong Key Laboratory of Intelligent Information Processing National Engineering Laboratory for Big Data System Computing Technology Shenzhen China

ISBN: (数字)9781728132488

ISBN: (纸本)9781728132495

Image steganalysis aims to discriminate innocent cover images and those suspected stego images embedded with secret message. Recently, increasing advanced deep neural networks have been proposed and used in image steganalysis. Though those deep learning models can gain superior performance, they also result in redundancy of computational resource and memory storage. In this paper, we apply a non-structured pruning method to prune XuNet2 and SRNet - the two state-of-the-art deep-learning framework in the field of JPEG image steganalysis. We obtain the priorities of the connections among neurons according to a certain criterion, then keep those significant weights and prune those nonsignificant ones in the meantime. We have conducted extensive experiments on BOSSBase and BOWS image dataset. The experimental results demonstrate that our proposed non-structured pruning method can significantly reduce the cost of computation and storage required by the original deep-learning frameworks without affecting their detection accuracy.

关键词： Transform coding Training Convolution Computer architecture Computational modeling Brain modeling Testing

来源：评论

学校读者我要写书评

暂无评论

Design of Command and Dispatch System for Automatic Reading of Meter Images in Substations by UAV Inspection Photos

Computing Open

引用

Computing Open 2024年第2期computing-open卷

作者： Guanghong Deng Liangpei Lin Baihao Lin Wenlong Jing Xiaodan Zhao Yong Li Rui Yang Shidun Xie Pengfeng Wei GuangDong Engineering Technology Research Center of UAV Remote Sensing Network Guangzhou iMapCloud Intelligent Technology Co. Ltd. Guangzhou 510095 P. R. China Guangdong Province Engineering Laboratory for Geographic Spatiotemporal Big Data Key Laboratory of Guangdong for Utilization of Remote Sensing and Geographical Information System Guangdong Open Laboratory of Geospatial Information Technology and Application Guangzhou Institute of Geography Guangdong Academy of Sciences Guangzhou 510070 P. R. China Foshan iMapCloud Intelligent Technology Co. Ltd. Foshan 528251 P. R. China

The application of the combination of unmanned aerial vehicles (UAVs) and artificial intelligence is a hot topic in the intelligent inspection of substations, and meter reading is a very challenging task. This paper proposes a method based on the combination of YOLOv6n object detection and Deeplabv3 + image segmentation and performs post-processing on the segmented images to obtain meter readings. First, YOLOv6n is used to detect the meter area of the aerial image and classify the meters. Second, the detected meter images are fed into the image segmentation model. The backbone network of the Deeplabv3 + algorithm is improved by using the MobileNetv3 network, which not only effectively extracts pointers and scales, but also makes the model more lightweight. Third, License Plate Recognition Network (LPRNet) is used to recognize digital meter images. In order to solve the problem of inaccurate pointer meter readings, to begin with, the segmented image is corroded; in addition, the circular dial area is flattened into a rectangular area by concentric circle sampling method. Finally, the meter reading is calculated by the position of the pointer, the scale and the total range of the meter. The post-processing part uses numba to optimize the inference speed. The experimental results show that in two datasets, The mean average precision of 50 (mAP50) accuracy of the YOLOv6n model using this method reached 99.71% and 98.60%, respectively, and the inference speed of a single image was 17.1 ms and 13.2 ms, respectively. The mean intersection over union (mIoU) of the image segmentation model reached 82.00%, 74.73%, 73.50%, 82.26% and 73.20%, respectively, and the single segmentation speed reached 33.7 ms. The LPRNet model has a recognition accuracy of 99.17% and a single image inference speed of 14.7 ms. At the same time, several mainstream object detection and semantic segmentation algorithms are compared. The experimental results show that the method in this paper greatly im

关键词： Object detection image segmentation YOLOv6n Deeplabv3 + meter reading

来源：评论

学校读者我要写书评

暂无评论

Consistent and Complementary Graph Regularized Multi-view Subspace Clustering

arXiv

引用

arXiv 2020年

作者： Zheng, Qinghai Zhu, Jihua Li, Zhongyu Pang, Shanmin Wang, Jun Chen, Lei School of Software Engineering Xi’an Jiaotong University Xi’an710049 China Shanghai Institute for Advanced Communication and Data Science School of Communication and Information Engineering Shanghai University Shanghai200444 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210023 China

This study investigates the problem of multi-view clustering, where multiple views contain consistent information and each view also includes complementary information. Exploration of all information is crucial for good multi-view clustering. However, most traditional methods blindly or crudely combine multiple views for clustering and are unable to fully exploit the valuable information. Therefore, we propose a method that involves consistent and complementary graph-regularized multi-view subspace clustering (GRMSC), which simultaneously integrates a consistent graph regularizer with a complementary graph regularizer into the objective function. In particular, the consistent graph regularizer learns the intrinsic affinity relationship of data points shared by all views. The complementary graph regularizer investigates the specific information of multiple views. It is noteworthy that the consistent and complementary regularizers are formulated by two different graphs constructed from the first-order proximity and second-order proximity of multiple views, respectively. The objective function is optimized by the augmented Lagrangian multiplier method in order to achieve multi-view clustering. Extensive experiments on six benchmark datasets serve to validate the effectiveness of the proposed method over other state-of-the-art multi-view clustering methods. Copyright © 2020, The Authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

LUneXt: Simple and Efficient U-shaped Network Design for Medical Image Segmentation with Nonlinear Activation

Computing Open

引用

Computing Open 2024年第2期computing-open卷

作者： Guanghong Deng Bing Yu Wenlong Jing Yong Li Xiaodan Zhao GuangDong Engineering Technology Research Center of UAV Remote Sensing Network Guangzhou iMapCloud Intelligent Technology Co. Ltd. Guangzhou 510095 P. R. China Guangdong Province Engineering Laboratory for Geographic Spatiotemporal Big Data Key Laboratory of Guangdong for Utilization of Remote Sensing and Geographical Information System Guangdong Open Laboratory of Geospatial Information Technology and Application Guangzhou Institute of Geography Guangdong Academy of Sciences Guangzhou 510070 P. R. China Foshan iMapCloud Intelligent Technology Co. Ltd. Foshan 528251 P. R. China

Medical image segmentation has always been a challenging task. This paper proposes a new LUneXt medical image segmentation model based on the characteristics analysis of medical image data sets and testing of different nonlinear activation units. Both normalized activations for the original negative input image activation have good optimization capabilities for the tokenization module parameters proposed in the original UneXt model. Using different activation coefficients for different foreground and background areas has achieved better results. The experimental results of this paper on the Breast Ultrasound Images (BUSI) data set reached an intersection over union (IoU) value of 62.64%, a Dice value of 76.12%, and a single inference speed of 807.57 ms. The experimental IoU value of the International Skin Imaging Collaboration (ISIC 2018) data set reached 82.95%, and the Dice value reached 90.50%. The single inference speed reached 842.58 ms. The LUneXt model is more robust than other models. While improving model performance, it does not introduce higher computational complexity and does not have a major impact on the processing speed of a single image.

关键词： Image segmentation medical images neural networks activation function

来源：评论

学校读者我要写书评

暂无评论

Triplet Deep Subspace Clustering via Self-Supervised data Augmentation

Triplet Deep Subspace Clustering via Self-Supervised Data Au...

引用

IEEE International Conference on data Mining (ICDM)

作者： Zhao Zhang Xianzhen Li Haijun Zhang Yi Yang Shuicheng Yan Meng Wang School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) & Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China School of Computer Science and Technology Soochow University Suzhou China Harbin Institute of Technology (Shenzhen) Shenzhen China Centre for Artificial Intelligence University of Technology Sydney Sydney NSW Australia Sea AI Lab (SAIL) & National University of Singapore Singapore

ISBN: (纸本)9781665423991

Deep subspace clustering (DSC) with the auto-encoder and self-expression layer is of great concern due to encouraging performance. However, existing methods usually adopt a “single-task” strategy based on a single dataset, without considering other related tasks or data. As such, they cannot discover other useful information to improve the clustering task. Besides, the local structure preservation of the latent codes in mapping is usually ignored. In this paper, we therefore present an effective “multi-task” strategy via the self-supervised data augmentation, and propose a new end-to-end trainable Triplet Deep Subspace Clustering Network (TDSC-net). Specifically, TDSC-net firstly generates triplet data (i.e., anchor, positive and negative data) from input data by a spectral clustering module and a self-supervised data augmentation module. This can enable it to inherit the merits of self-supervised learning and multitask learning implicitly. After that, TDSC-net builds a triplet deep autoencoder network with a self-expression layer, which takes the triplet data as input, where they share the common network layers (i.e., autoencoder and self-expression layers) over the triple tasks for complementary learning and mutual supervision. A triplet loss is also included to retain the local information of deep latent codes, which will also benefit the self-expression. Furthermore, TDSC-net separates the self-expression layer from decoding process to improve the efficiency of reconstruction. Extensive results on several public datasets demonstrate the effectiveness of our triplet-task DSC strategy.

关键词： Codes Conferences Multitasking Decoding data mining Task analysis

来源：评论

学校读者我要写书评

暂无评论

Cycle extendability of hamiltonian strongly chordal graphs

arXiv

引用

arXiv 2020年

作者： Rong, Guozhen Li, Wenjun Wang, Jianxin Yang, Yongjie School of Computer Science and Engineering Central South University Changsha China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology Changsha China Faculty of Human and Business Sciences Saarland University Saarbrücken Germany

In 1990, Hendry conjectured that all Hamiltonian chordal graphs are cycle extendable. After a series of papers confirming the conjecture for a number of graph classes, the conjecture is yet refuted by Lafond and Seamone in 2015. Given that their counterexamples are not strongly chordal graphs and they are all only 2-connected, Lafond and Seamone asked the following two questions: (1) Are Hamiltonian strongly chordal graphs cycle extendable? (2) Is there an integer k such that all k-connected Hamiltonian chordal graphs are cycle extendable? Later, a conjecture stronger than Hendry’s is proposed. In this paper, we resolve all these questions in the negative. On the positive side, we add to the list of cycle extendable graphs two more graph classes, namely, Hamiltonian 4-FAN-free chordal graphs where every induced K5 − e has true twins, and Hamiltonian {4-FAN, A}-free chordal graphs. Copyright © 2020, The Authors. All rights reserved.

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

Throughput Maximization for UAV-Enabled data Collection

Throughput Maximization for UAV-Enabled Data Collection

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Junchao Gong Xiaojun Zhu Lijie Xu College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing China

ISBN: (数字)9781728199160

ISBN: (纸本)9781728192369

In this paper, we consider a scenario where an unmanned aerial vehicle (UAV) collects data from a set of nodes placed on a two-dimensional (2-D) plane. The UAV flies along a given line to collect data. To prevent transmission collisions, only one node is allowed to transmit data to the UAV at any time, and the number of nodes that can transmit data to the UAV cannot exceed a specified number to avoid frequent switches. The problem is to select a subset of nodes and schedule their transmission time to maximize the UAV's throughput. After formulating the problem, we find that it is difficult to solve due to mixture of real variables and integer variables. We then propose to decompose the problem into subproblems, and give a polynomial time algorithm to solve each subproblem to optimality. We then get an exact algorithm by solving all subproblems. Unfortunately, due to an exponential number of subproblems, the overall running time is exponential with respect to the input size. We then propose two polynomial-time suboptimal algorithms to solve the problem, both of which explore a polynomial number of subproblems. Simulations show that the suboptimal algorithms perform comparably with the exponential-time exact algorithm, while the running time is much smaller.

关键词： Schedules Heuristic algorithms Two dimensional displays data collection Throughput Unmanned aerial vehicles Sensors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：