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

学校读者我要写书评

暂无评论

Ball k-means

arXiv 2020年

作者： Xia, Shuyin Peng, Daowan Meng, Deyu Zhang, Changqing Wang, Guoyin Chen, Zizhong Wei, Wei Department of Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongqing400065 China National Engineering Laboratory for Algorithm and Analysis Technologiy on Big Data Xian Jiaotong University Xi'an710049 China College of Intelligence and Computing Tianjin University 300072 China Department of Computer Science and Engineering University of California Riverside 900 University Avenue RiversideCA92521 United States School of Computer Science and Engineering Xi'an University of Technology Xi'an710048 China

This paper presents a novel accelerated exact k-means algorithm called the Ball k-means algorithm, which uses a ball to describe a cluster, focusing on reducing the point-centroid distance computation. The Ball k-means can accurately find the neighbor clusters for each cluster resulting distance computations only between a point and its neighbor clusters centroids instead of all centroids. Moreover, each cluster can be divided into a stable area and an active area, and the later one can be further divided into annulus areas. The assigned cluster of the points in the stable area is not changed in the current iteration while the points in the annulus area will be adjusted within a few neighbor clusters in the current iteration. Also, there are no upper or lower bounds in the proposed Ball k-means. Furthermore, reducing centroid-centroid distance computation between iterations makes it efficient for large k clustering. The fast speed, no extra parameters and simple design of the Ball k-means make it an all-around replacement of the naive k-means algorithm. Copyright © 2020, The Authors. All rights reserved.

关键词： K-means clustering

A Localization Method of High Energy Transients for All-Sky Gamma-Ray Monitor

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Zhao, Yi Xue, Wangchen Xiong, Shaolin Luo, Qi Wang, Yuanhao Liu, Jiacong Yu, Heng Zhao, Xiaoyun Huang, Yue Liao, Jinyuan Sun, Jianchao Li, Xiaobo Yi, Qibin Cai, Ce Xiao, Shuo Xie, Shenglun Zheng, Chao Zhang, Yanqiu Wang, Chenwei Tan, Wenjun Guo, Zhiwei Li, Chaoyang An, Zhenghua Chen, Gang Du, Yanqi Gao, Min Gong, Ke Guo, Dongya He, Jiang He, Jianjian Li, Bing Li, Gang Li, Xinqiao Liang, Jing Liang, Xiaohua Liu, Yaqing Ma, Xiang Qiao, Rui Song, Liming Song, Xinying Sun, Xilei Wang, Jin Wang, Ping Wen, Xiangyang Wu, Hong Xu, Yanbing Yang, Sheng Zhang, Dali Zhang, Fan Zhang, Hongmei Zhang, Peng Zhang, Shu Zhang, Zhen Zheng, Shijie Zhang, Keke Han, Xingbo Wu, Haiyan Hu, Tai Geng, Hao Lu, Gaopeng Xu, Wei Lyu, Fanchao Zhang, Hongbo Lu, Fangjun Zhang, Shuangnan Department of Astronomy Beijing Normal University Beijing100875 China Key Laboratory of Particle Astrophysics Institute of High Energy Physics Chinese Academy of Sciences Beijing100049 China University of Chinese Academy of Sciences Beijing100049 China School of Physics and Optoelectronics Xiangtan University Hunan Xiangtan411105 China College of Physics Hebei Normal University Shijiazhuang050024 China Guizhou Provincial Key Laboratory of Radio Astronomy and Data Processing Guizhou Normal University Guiyang550001 China School of Physics and Electronic Science Guizhou Normal University Guiyang550001 China Institute of Astrophysics Central China Normal University Wuhan430079 China College of physics Sciences Technology Hebei University Baoding071002 China Physics and Space Science College China West Normal University Nanchong637002 China School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China College of Electronic and information Engineering Tongji University Shanghai201804 China Innovation Academy for Microsatellites of Chinese Academy of Sciences Shanghai201304 China National Space Science Center Chinese Academy of Sciences Beijing100190 China School of Earth and Space Sciences University of Science and Technology of China Hefei230026 China Electronic Information School Wuhan University Hubei Wuhan430072 China Key Laboratory of Transportation Meteorology of China Meteorological Administration Nanjing Joint China Key Laboratory of Middle Atmosphere and Global Environment Observation Institute of Atmospheric Physics Chinese Academy of Sciences Beijing100029 China

Fast and reliable localization of high-energy transients is crucial for characterizing the burst properties and guiding the follow-up observations. Localization based on the relative counts of different detectors has been widely used for all-sky gamma-ray monitors. There are two major methods for this counts distribution localization: χ2 minimization method and the Bayesian method. Here we propose a modified Bayesian method that could take advantage of both the accuracy of the Bayesian method and the simplicity of the χ2 method. With comprehensive simulations, we find that our Bayesian method with Poisson likelihood is generally more applicable for various bursts than χ2 method, especially for weak bursts. We further proposed a location-spectrum iteration approach based on the Bayesian inference, which could alleviate the problems caused by the spectral difference between the burst and location templates. Our method is very suitable for scenarios with limited computation resources or time-sensitive applications, such as in-flight localization software, and low-latency localization for rapid follow-up observations. Copyright © 2022, The Authors. All rights reserved.

关键词： Gamma rays

A personalized privacy protection data uploading scheme for mobile crowdsensing 2

学校读者我要写书评

暂无评论

A personalized privacy protection data uploading scheme for ...

2nd IEEE International Conference on Industrial Internet Cloud, ICII 2019

作者： Ma, Rong Chen, Lei Xiong, Jinbo Tian, Youliang Li, Qi Liu, Ximeng Fujian Provincial Key Laboratory of Network Security and Cryptology College of Mathematics and Informatics Fujian Normal University Fuzhou350117 China College of Engineering and Computing Georgia Southern University GA30458 United States Guizhou Provincial Key Laboratory of Public Big Data Guizhou University Guiyang550025 China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Fujian Provincial Key Laboratory of Information Security of Network Systems College of Mathematics and Computer Science Fuzhou University Fuzhou350108 China

ISBN: (纸本)9781728129778

Mobile crowdsensing is a typical application of the Industrial Internet of hings and brings a promising opportunity to construct powerful industrial systems and services. The existing privacy protection schemes usually adopt a unified privacy protection policy for all sensing data due to lack of effective privacy metrics, thereby resulting in excessive or insufficient protection of privacy information and low accuracy of sensing data. To tackle these issues, in this paper, we propose a personalized privacy protection data uploading (PPDU) scheme based on game theory and sensing user's historical spatio-temporal data. In PPDU, a personalized privacy measurement algorithm is designed to obtain the personalized privacy degree of user sensing data. Based on the privacy degree, a user uploading behavior game is designed by employing an incomplete information game, and a game-based spatio-temporal sensing data uploading method is proposed for user privacy protection. Simulation experiments with real trajectory data show that the PPDU scheme makes a reasonable balance between retaining high quality of crowdsensing service and protecting user's privacy. © 2019 IEEE.

关键词： Game theory

NERank+: a graph-based approach for entity ranking in document collections

学校读者我要写书评

暂无评论

计算机科学前沿 2018年第3期12卷 504-517页

作者： Chengyu WANG Guomin ZHOU Xiaofeng HE Aoying ZHOU Shanghai Key Laboratory of Trustworthy Computing School of Computer Science and Software EngineeringEast China Normal University Shanghai 200062 China Department of Computer and Information Technology Zhejiang Police College Hangzhou 310053 China School of Data Science and Engineering East China Normal University Shanghai 200062 China

Most entity ranking research aims to retrieve a ranked list of entities from a Web corpus given a user *** rank order of entities is determined by the relevance between the query and contexts of ***,entities can be ranked directly based on their relative importance in a document collection,independent of any *** this paper,we introduce an entity ranking algorithm named NERank+.Given a document collection,NERank+ first constructs a graph model called Topical Tripartite Graph,consisting of document,topic and entity *** design separate ranking functions to compute the prior ranks of entities and topics,respectively.A meta-path constrained random walk algorithm is proposed to propagate prior entity and topic ranks based on the graph *** evaluate NERank+ over real-life datasets and compare it with *** results illustrate the effectiveness of our approach.

关键词： entity ranking Topical Tripartite Graph prior rank estimation meta-path constrained random walk

Micro-supervised disturbance learning: A perspective of representation probability distribution

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Chu, Jielei Liu, Jing Wang, Hongjun Meng, Hua Gong, Zhiguo Li, Tianrui The School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu611756 China The School of Business Sichuan University Sichuan Chengdu610065 China The State Key Laboratory of Internet of Things for Smart City Department of Computer and Information Science University of Macau China

The instability is shown in the existing methods of representation learning based on Euclidean distance under a broad set of conditions. Furthermore, the scarcity and high cost of labels prompt us to explore more expressive representation learning methods which depends on the labels as few as possible. To address these issues, the small-perturbation ideology is firstly introduced on the representation learning model based on the representation probability distribution. The positive small-perturbation information (SPI) which only depend on two labels of each cluster is used to stimulate the representation probability distribution and then two variant models are proposed to fine-tune the expected representation distribution of RBM, namely, Micro-supervised Disturbance GRBM (Micro-DGRBM) and Micro-supervised Disturbance RBM (Micro-DRBM) models. The Kullback-Leibler (KL) divergence of SPI is minimized in the same cluster to promote the representation probability distributions to become more similar in Contrastive Divergence (CD) learning. In contrast, the KL divergence of SPI is maximized in the different clusters to enforce the representation probability distributions to become more dissimilar in CD learning. To explore the representation learning capability under the continuous stimulation of the SPI, we present a deep Micro-supervised Disturbance Learning (Micro-DL) framework based on the Micro-DGRBM and Micro-DRBM models and compare it with a similar deep structure which has not any external stimulation. Experimental results demonstrate that the proposed deep Micro-DL architecture shows better performance in comparison to the baseline method, the most related shallow models and deep frameworks for clustering. © 2020, CC0.

关键词： Probability distributions

CMR×Recon: An open cardiac MRI dataset for the competition of accelerated image reconstruction

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wang, Chengyan Lyu, Jun Wang, Shuo Qin, Chen Guo, Kunyuan Zhang, Xinyu Yu, Xiaotong Li, Yan Wang, Fanwen Jin, Jianhua Shi, Zhang Xu, Ziqiang Tian, Yapeng Hua, Sha Chen, Zhensen Liu, Meng Sun, Mengting Kuang, Xutong Wang, Kang Wang, Haoran Li, Hao Chu, Yinghua Yang, Guang Bai, Wenjia Zhuang, Xiahai Wang, He Qin, Jing Qu, Xiaobo Human Phenome Institute Fudan University Shanghai China School of Nursing The Hong Kong Polytechnic University Hong Kong Digital Medical Research Center School of Basic Medical Sciences Fudan University Shanghai China Department of Electrical and Electronic Engineering & I-X Imperial College London United Kingdom Department of Electronic Science Fujian Provincial Key Laboratory of Plasma and Magnetic Resonance National Institute for Data Science in Health and Medicine Institute of Artificial Intelligence Xiamen University Xiamen China Department of Radiology Ruijin Hospital Shanghai Jiao Tong University School of Medicine Shanghai China Department of Bioengineering/˜Imperial-X Imperial College London United Kingdom School of Data Science Fudan University Shanghai China Department of Radiology Zhongshan Hospital Fudan University Shanghai China School of Health Science and Engineering University of Shanghai for Science and Technology Shanghai China Department of Computer Science The University of Texas Dallas United States Department of Cardiovascular Medicine Ruijin Hospital Lu Wan Branch Shanghai Jiao Tong University School of Medicine Shanghai China Institute of Science and Technology for Brain-Inspired Intelligence Fudan University Shanghai200433 China Simens Healthineers Ltd. China Department of Brain Sciences Imperial College London London United Kingdom Department of Computing Imperial College London London United Kingdom

Cardiac magnetic resonance imaging (CMR) has emerged as a valuable diagnostic tool for cardiac diseases. However, a limitation of CMR is its slow imaging speed, which causes patient discomfort and introduces artifacts in the images. There has been growing interest in deep learning-based CMR imaging algorithms that can reconstruct high-quality images from highly under-sampled k-space data. However, the development of deep learning methods requires large training datasets, which have not been publicly available for CMR. To address this gap, we released a dataset that includes multi-contrast, multi-view, multi-slice and multi-coil CMR imaging data from 300 subjects. Imaging studies include cardiac cine and mapping sequences. Manual segmentations of the myocardium and chambers of all the subjects are also provided within the dataset. Scripts of state-of-the-art reconstruction algorithms were also provided as a point of reference. Our aim is to facilitate the advancement of state-of-the-art CMR image reconstruction by introducing standardized evaluation criteria and making the dataset freely accessible to the research community. Researchers can access the dataset at https://***/#!Synapse:syn51471091/wiki/. Copyright © 2023, The Authors. All rights reserved.

关键词： Image reconstruction

An Iteratively Optimized Patch Label Inference Network for Automatic Pavement Distress Detection

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Tang, Wenhao Huang, Sheng Zhao, Qiming Li, Ren Huangfu, Luwen Ministry of Education Key Laboratory of Dependable Service Computing in Cyber Physical Society Chongqing400044 China The School of Big Data and Software Engineering Chongqing University Chonqqing400044 China Chongqing Jiaotong University 400074 China Fowler College of Business San Diego State University San DiegoCA92182 United States

We present a novel deep learning framework named the Iteratively Optimized Patch Label Inference Network (IOPLIN) for automatically detecting various pavement distresses that are not solely limited to specific ones, such as cracks and potholes. IOPLIN can be iteratively trained with only the image label via the Expectation-Maximization Inspired Patch Label Distillation (EMIPLD) strategy, and accomplish this task well by inferring the labels of patches from the pavement images. IOPLIN enjoys many desirable properties over the state-of-the-art single branch CNN models such as GoogLeNet and EfficientNet. It is able to handle images in different resolutions, and sufficiently utilize image information particularly for the high-resolution ones, since IOPLIN extracts the visual features from unrevised image patches instead of the resized entire image. Moreover, it can roughly localize the pavement distress without using any prior localization information in the training phase. In order to better evaluate the effectiveness of our method in practice, we construct a large-scale Bituminous Pavement Disease Detection dataset named CQU-BPDD consisting of 60,059 high-resolution pavement images, which are acquired from different areas at different times. Extensive results on this dataset demonstrate the superiority of IOPLIN over the state-of-the-art image classification approaches in automatic pavement distress detection. The source codes of IOPLIN are released on https://***/DearCaat/ioplin, and the CQU-BPDD dataset is able to be accessed on https://***/CQU-BPDD/. © 2020, CC BY-NC-SA.

关键词： Large dataset

Asymptotic properties of zeros for discrete-time linear systems with backward triangle sampled-and-hold using delta operator

学校读者我要写书评

暂无评论

Asymptotic properties of zeros for discrete-time linear syst...

Chinese Automation Congress (CAC)

作者： Minghui Ou Shan Liang Xiaobin Wu Zhiyong Yang Hehuan Ran School of Big Data and Internet of Things of Chongqing Vocational Institute of Engineering College of Automation of Chongqing University Chongqing China College of Automation of Chongqing University The Key Laboratory of Dependable Service Computing in Cyber Physical Society of Ministry of Education Chongqing China State Grid Chongqing Shiqu Electric Power Supply Branch Chongqing China

ISBN: (数字)9781728176871

ISBN: (纸本)9781728176888

This article focuses on a well-studied theoretical problem that, for rapid sampling, a continuous-time system with minimum-phase properties may become a non-minimum phase discrete-time system in the discretization process. The properties of zeros for discrete-time linear models in the field of digital control when using the special shift operator was considered in this paper. From the former relevant studies one can know that the backward triangle sample-and-hold (BTSH) as an alternative hold method to discretize the continuous-time systems has an advantage over ZOH in stabilizing sampling zeros for linear system with classical forward shift operator. In this article, we deduce the exact sampled-data model of linear system using delta operator to replace forward shift operator in the case of BTSH. Furthermore, the expressions and properties of zeros for the corresponding discrete-time system are derived.

关键词： Control systems Linear systems Discrete-time systems Process control Numerical models Signal reconstruction Internet of Things

Localization of Deep Inpainting Using High-Pass Fully Convolutional Network

学校读者我要写书评

暂无评论

Localization of Deep Inpainting Using High-Pass Fully Convol...

International Conference on Computer Vision (ICCV)

作者： Haodong Li Jiwu Huang Guangdong Key Laboratory of Intelligent Information Processing and Shenzhen Key Laboratory of Media Security National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society China

ISBN: (数字)9781728148038

ISBN: (纸本)9781728148045

Image inpainting has been substantially improved with deep learning in the past years. Deep inpainting can fill image regions with plausible contents, which are not visually apparent. Although inpainting is originally designed to repair images, it can even be used for malicious manipulations, e.g., removal of specific objects. Therefore, it is necessary to identify the presence of inpainting in an image. This paper presents a method to locate the regions manipulated by deep inpainting. The proposed method employs a fully convolutional network that is based on high-pass filtered image residuals. Firstly, we analyze and observe that the inpainted regions are more distinguishable from the untouched ones in the residual domain. Hence, a high-pass pre-filtering module is designed to get image residuals for enhancing inpainting traces. Then, a feature extraction module, which learns discriminative features from image residuals, is built with four concatenated ResNet blocks. The learned feature maps are finally enlarged by an up-sampling module, so that a pixel-wise inpainting localization map is obtained. The whole network is trained end-to-end with a loss addressing the class imbalance. Extensive experimental results evaluated on both synthetic and realistic images subjected to deep inpainting have shown the effectiveness of the proposed method.

关键词： Forensics Feature extraction Convolution Kernel Machine learning Computer vision Probability