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

Complex Substation Scene Segmentation Method Based on Optimized Straight Line Detection

学校读者我要写书评

暂无评论

Complex Substation Scene Segmentation Method Based on Optimi...

Chinese Automation Congress (CAC)

作者： Lei Wang Wei Huang Yiping Chen Hao Chen Chuang Liu Jun Yin School of Computer Nanjing University of Posts and Telecommunications Nanjing P. R. China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing P. R. China School of Internet of Things Nanjing University of Posts and Telecommunications Nanjing P. R. China

This paper proposes a scene segmentation method based on optimized line detection to address the difficulty of segmenting spatially independent equipment in complex substation scenes. The method first employs the RANSAC method to simulate the ground plane and extract the ground point cloud. Then, it projects the 3D point cloud scene onto a 2D plane to obtain a 2D image of the substation. Straight line segments of the power line are extracted from the image using the edge detection algorithm and an improved line detection algorithm. The straight line segments that do not belong to the power line are filtered out using the surrounding features of the 3D point corresponding to the 2D point on the line. The power line's straight line segment is extended using the region-growing algorithm. Finally, the power line clustering is completed using European clustering based on the three-dimensional coordinates of the two ends of the power line, thereby completing the scene segmentation. Experimental results show that the proposed method can effectively segment substation equipment. Compared to traditional segmentation methods, this method has an average power line identification accuracy of 14% higher.

关键词：

A hybrid NSGA-II for matching biomedical ontology 14th

学校读者我要写书评

暂无评论

A hybrid NSGA-II for matching biomedical ontology

14th International Conference on intelligent Information Hiding and Multimedia Signal processing, IIH-MSP 2018

作者： Xue, Xingsi Chen, Jie Chen, Junfeng Chen, Dongxu College of Information Science and Engineering Fujian University of Technology FuzhouFujian350118 China Intelligent Information Processing Research Center Fujian University of Technology FuzhouFujian350118 China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology FuzhouFujian350118 China Fujian Key Lab for Automotive Electronics and Electric Drive Fujian University of Technology FuzhouFujian350118 China College of IOT Engineering Hohai University ChangzhouJiangsu China Fujian Medical University Union Hospital FuzhouFujian350001 China

ISBN: (纸本)9783030037444

Over the recent years, ontologies are widely used in the biomedical domains. However, biomedical ontology heterogeneity problem hamper the cooperation between intelligent applications based on biomedical ontologies. It is crucial to establish correspondences between the heterogeneous biomedical concepts in different ontologies, which is so-called biomedical ontology matching. Approaches based on Multi-Objective Evolutionary Algorithm (MOEA), such as NSGA-II, are emerging as a new methodology to solve the ontology matching problem. In this paper, to further improve the quality of biomedical ontology alignments, a hybrid NSGA-II is proposed, which modifies the knee solutions in the Pareto front by using a local search method. Experiment utilizes two biomedical ontology matching tracks provided by Ontology Alignment Evaluation Initiative (OAEI 2017). The experimental results show that our approach outperforms the participants of OAEI 2017 and NSGA-II based ontology matching technique. © Springer Nature Switzerland AG 2019.

关键词： Ontology

Universal deep network for steganalysis of color image based on channel representation

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wei, Kangkang Luo, Weiqi Tan, Shunquan Huang, Jiwu The Guangdong Key Lab of Information Security Technology School of Computer Science and Engineering Sun Yat-Sen University Guangzhou510006 China The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China The Guangdong Key Laboratory of Intelligent Information Processing Shenzhen Key Laboratory of Media Security National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China

Up to now, most existing steganalytic methods are designed for grayscale images, and they are not suitable for color images that are widely used in current social networks. In this paper, we design a universal color image steganalysis network (called UCNet) in spatial and JPEG domains. The proposed method includes preprocessing, convolutional, and classification modules. To preserve the steganographic artifacts in each color channel, in preprocessing module, we firstly separate the input image into three channels according to the corresponding embedding spaces (i.e. RGB for spatial steganography and YCbCr for JPEG steganography), and then extract the image residuals with 62 fixed high-pass filters, finally concatenate all truncated residuals for subsequent analysis rather than adding them together with normal convolution like existing CNN-based steganalyzers. To accelerate the network convergence and effectively reduce the number of parameters, in convolutional module, we carefully design three types of layers with different shortcut connections and group convolution structures to further learn high-level steganalytic features. In classification module, we employ a global average pooling and fully connected layer for classification. We conduct extensive experiments on ALASKA II to demonstrate that the proposed method can achieve state-of-the-art results compared with the modern CNN-based steganalyzers (e.g., SRNet and J-YeNet) in both spatial and JPEG domains, while keeping relatively few memory requirements and training time. Furthermore, we also provide necessary descriptions and many ablation experiments to verify the rationality of the network design. Copyright © 2021, The Authors. All rights reserved.

关键词： Steganography

Robust unsupervised feature selection by nonnegative sparse subspace learning

学校读者我要写书评

暂无评论

Neurocomputing 2019年 334卷 156-171页

作者： Wei Zheng Hui Yan Jian Yang School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing PR China School of Computer Engineering Jinling Institute of Technology Nanjing PR China PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education and Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology Key Laboratory of Trusted Cloud Computing and Big Data Analysis Nanjing Xiaozhuang University Nanjing PR China

Sparse subspace learning has been demonstrated to be effective in data mining and machine learning. In this paper, we cast the unsupervised feature selection scenario as a matrix factorization problem from the viewpoint of sparse subspace learning. By minimizing the reconstruction residual, the learned feature weight matrix with the l 2,1 -norm and the non-negative constraints not only removes the irrelevant features, but also captures the underlying low dimensional structure of the data points. Meanwhile in order to enhance the model's robustness, l 1 -norm error function is used to resistant to outliers and sparse noise. An efficient iterative algorithm is introduced to optimize this non-convex and non-smooth objective function and the proof of its convergence is given. Although, there is a subtraction item in our multiplicative update rule, we validate its non-negativity. The superiority of our model is demonstrated by comparative experiments on various original datasets with and without malicious pollution.

关键词： Subspace learning Non-negative matrix factorization Unsupervised feature selection

Unveiling Optimal SDG Pathways: An Innovative Approach Leveraging Graph Pruning and Intent Graph for Effective Recommendations

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Yu, Zhihang Wang, Shu Zhu, Yunqiang Yuan, Wen Dai, Xiaoliang Zou, Zhiqiang College of Computer Nanjing University of Posts and Telecommunications Nanjing210023 China State Key Laboratory of Resources and Environmental Information System Institute of Geographic Sciences and Natural Resources Research Chinese Academy of Sciences Beijing China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210023 China University of Chinese Academy of Sciences Beijing China

The recommendation of appropriate development pathways, also known as ecological civilization patterns for achieving Sustainable Development Goals (namely, sustainable development patterns), are of utmost importance for promoting ecological, economic, social, and resource sustainability in a specific region. To achieve this, the recommendation process must carefully consider the region's natural, environmental, resource, and economic characteristics. However, current recommendation algorithms in the field of computer science fall short in adequately addressing the spatial heterogeneity related to environment and sparsity of regional historical interaction data, which limits their effectiveness in recommending sustainable development patterns. To overcome these challenges, this paper proposes a method called User Graph after Pruning and Intent Graph (UGPIG). Firstly, we utilize the high-density linking capability of the pruned User Graph to address the issue of spatial heterogeneity neglect in recommendation algorithms. Secondly, we construct an Intent Graph by incorporating the intent network, which captures the preferences for attributes including environmental elements of target regions. This approach effectively alleviates the problem of sparse historical interaction data in the region. Through extensive experiments, we demonstrate that UGPIG outperforms state-of-the-art recommendation algorithms like KGCN, KGAT, and KGIN in sustainable development pattern recommendations, with a maximum improvement of 9.61% in Top-3 recommendation performance. Copyright © 2023, The Authors. All rights reserved.

关键词： Sustainable development

The minority matters: a diversity-promoting collaborative metric learning algorithm 22

学校读者我要写书评

暂无评论

The minority matters: a diversity-promoting collaborative me...

Proceedings of the 36th International Conference on Neural Information processing Systems

作者： Shilong Bao Qianqian Xu Zhiyong Yang Yuan He Xiaochun Cao Qingming Huang State Key Laboratory of Information Security Institute of Information Engineering CAS and School of Cyber Security University of Chinese Academy of Sciences Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS School of Computer Science and Tech. University of Chinese Academy of Sciences Alibaba Group School of Cyber Science and Technology Shenzhen Campus Sun Yat-sen University Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Laboratory of Big Data Mining and Knowledge Management CAS and Peng Cheng Laboratory

ISBN: (纸本)9781713871088

Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems (RS), closing the gap between metric learning and Collaborative Filtering. Following the convention of RS, existing methods exploit unique user representation in their model design. This paper focuses on a challenging scenario where a user has multiple categories of interests. Under this setting, we argue that the unique user representation might induce preference bias, especially when the item category distribution is imbalanced. To address this issue, we propose a novel method called Diversity-Promoting Collaborative Metric Learning (DPCML), with the hope of considering the commonly ignored minority interest of the user. The key idea behind DPCML is to include a multiple set of representations for each user in the system. Based on this embedding paradigm, user preference toward an item is aggregated from different embeddings by taking the minimum item-user distance among the user embedding set. Furthermore, we observe that the diversity of the embeddings for the same user also plays an essential role in the model. To this end, we propose a Diversity Control Regularization Scheme (DCRS) to accommodate the multi-vector representation strategy better. Theoretically, we show that DPCML could generalize well to unseen test data by tackling the challenge of the annoying operation that comes from the minimum value. Experiments over a range of benchmark datasets speak to the efficacy of DPCML.

关键词：

ITrace: An implicit trust inference method for trust-aware collaborative filtering

学校读者我要写书评

暂无评论

AIP Conference Proceedings 2018年第1期1955卷

作者： Xu He Bin Liu Kejia Chen School of Computer Science Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing Jiangsu 210023 China

The growth of Internet commerce has stimulated the use of collaborative filtering (CF) algorithms as recommender systems. A CF algorithm recommends items of interest to the target user by leveraging the votes given by other similar users. In a standard CF framework, it is assumed that the credibility of every voting user is exactly the same with respect to the target user. This assumption is not satisfied and thus may lead to misleading recommendations in many practical applications. A natural countermeasure is to design a trust-aware CF (TaCF) algorithm, which can take account of the difference in the credibilities of the voting users when performing CF. To this end, this paper presents a trust inference approach, which can predict the implicit trust of the target user on every voting user from a sparse explicit trust matrix. Then an improved CF algorithm termed iTrace is proposed, which takes advantage of both the explicit and the predicted implicit trust to provide recommendations with the CF framework. An empirical evaluation on a public dataset demonstrates that the proposed algorithm provides a significant improvement in recommendation quality in terms of mean absolute error.

关键词：

iSplit LBI: Individualized partial ranking with ties via split LBI

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Xu, Qianqian Sun, Xinwei Yang, Zhiyong Cao, Xiaochun Huang, Qingming Yao, Yuan Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS Microsoft Research Asia State Key Laboratory of Information Security Institute of Information Engineering CAS School of Cyber Security University of Chinese Academy of Sciences School of Computer Science and Tech. University of Chinese Academy of Sciences Key Laboratory of Big Data Mining and Knowledge Management CAS Peng Cheng Laboratory Department of Mathematics Hong Kong University of Science and Technology Hong Kong

Due to the inherent uncertainty of data, the problem of predicting partial ranking from pairwise comparison data with ties has attracted increasing interest in recent years. However, in real-world scenarios, different individuals often hold distinct preferences. It might be misleading to merely look at a global partial ranking while ignoring personal diversity. In this paper, instead of learning a global ranking which is agreed with the consensus, we pursue the tie-aware partial ranking from an individualized perspective. Particularly, we formulate a unified framework which not only can be used for individualized partial ranking prediction, but also be helpful for abnormal user selection. This is realized by a variable splitting-based algorithm called iSplitLBI. Specifically, our algorithm generates a sequence of estimations with a regularization path, where both the hyperparameters and model parameters are updated. At each step of the path, the parameters can be decomposed into three orthogonal parts, namely, abnormal signals, personalized signals and random noise. The abnormal signals can serve the purpose of abnormal user selection, while the abnormal signals and personalized signals together are mainly responsible for individual partial ranking prediction. Extensive experiments on simulated and real-world datasets demonstrate that our new approach significantly outperforms state-of-the-art alternatives. The code is now availiable at https://***/qianqianxu010/ NeurIPS2019-iSplitLBI. Copyright © 2019, The Authors. All rights reserved.

关键词： Forecasting

Contrastive Learning for Robust Android Malware Familial Classification

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wu, Yueming Dou, Shihan Zou, Deqing Yang, Wei Qiang, Weizhong Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China University of Texas at Dallas Dallas United States National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Due to its open-source nature, Android operating system has been the main target of attackers to exploit. Malware creators always perform different code obfuscations on their apps to hide malicious activities. Features extracted from these obfuscated samples through program analysis contain many useless and disguised features, which leads to many false negatives. To address the issue, in this paper, we demonstrate that obfuscation-resilient malware family analysis can be achieved through contrastive learning. The key insight behind our analysis is that contrastive learning can be used to reduce the difference introduced by obfuscation while amplifying the difference between malware and other types of malware. Based on the proposed analysis, we design a system that can achieve robust and interpretable classification of Android malware. To achieve robust classification, we perform contrastive learning on malware samples to learn an encoder that can automatically extract robust features from malware samples. To achieve interpretable classification, we transform the function call graph of a sample into an image by centrality analysis. Then the corresponding heatmaps can be obtained by visualization techniques. These heatmaps can help users understand why the malware is classified as this family. We implement IFDroid and perform extensive evaluations on two datasets. Experimental results show that IFDroid is superior to state-of-the-art Android malware familial classification systems. Moreover, IFDroid is capable of maintaining a 98.4% F1 on classifying 69,421 obfuscated malware samples. © 2021, CC0.

关键词： Android (operating system)