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

Efficient Urban Tree Species Classification via Multirepresentation Fusion of Mobile Laser Scanning data

IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing 2025年 18卷 11451-11468页

作者： Ma, Yinchi Luan, Peng Zhang, Yujie Liu, Bo Zhang, Lijie Hebei Agricultural University College of Information Science and Technology Baoding071001 China Hebei Key Laboratory of Agricultural Big Data Baoding071001 China Hebei Agricultural University College of Mechatronical and Electrical Engineering Baoding071000 China

Urban tree species identification is crucial for forest management and ecosystem assessment. Mobile laser scanning (MLS) provides significant advantages for this task through its flexibility in navigating complex urban environments with spatial constraints. However, MLS-based classification faces challenges, such as intricate canopy structures, incomplete point clouds from urban occlusions, and intraspecies variations. This study presents tree morphology multirepresentation fusion network, integrating 3-D point cloud data with 2-D projections for enhanced tree species classification. The framework employs a backpack-mounted MLS system to capture high-quality point cloud data. The core architecture features an adaptive hierarchical sampling module extracting multiscale geometric features, followed by a cross-view fusion module that implements stagewise fusion of 3-D structural information with 2-D representations. This fusion strategy not only leverages established 2-D feature extraction pipelines, but also addresses sparsity issues in point cloud projections. The method was validated on a diverse dataset of eight urban tree species (seven broadleaf and one coniferous species). Quantitative assessment yielded 98.57% F1-score and 98.77% overall accuracy with moderate computational resources (2.25M parameters, 1.11G FLOPs), demonstrating significant improvements over existing methods. The proposed workflow achieves a balance between classification accuracy and processing efficiency, making it suitable for large-scale urban tree inventory applications. © 2008-2012 IEEE.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Underwater target recognition based on adaptive multi-feature fusion network

引用

Multimedia Tools and Applications 2025年第10期84卷 7297-7317页

作者： Pan, Xiaoying Sun, Jia Feng, TianHao Lei, MingZhu Wang, Hao Zhang, WuXia Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an710121 China Xi’an Key Laboratory of Big Data and Intelligent Computing Xi’an710121 China School of Computer Science and Technology Xi’an University of Post & Telecommunications Xi’an710121 China

Due to the complexity of the underwater environment, underwater acoustic target recognition is more challenging than ordinary target recognition, and has become a hot topic in the field of underwater acoustics research. In recent years, deep learning has been widely used in underwater recognition due to its powerful feature learning capabilities. However, most deep learning-based underwater target recognition methods use only the time-frequency domain features of signals, ignoring the frequency domain image features of signals. Additionally, they only use simple summation or splicing strategies to fuse and discriminate the extracted features, which leads to limited improvement in the accuracy of underwater target recognition. To address these issues, this paper proposes an underwater target recognition method based on an adaptive multi-feature fusion network. The method consists of a data pre-processing module, a multi-dimensional feature extraction module, and an adaptive multi-feature fusion module. In the multi-dimensional feature extraction module, the long short time memory network (LSTM) and the one-dimensional convolutional neural network (1DCNN) are used to extract the time-frequency features of the underwater signal. Furthermore, the two-dimensional convolutional neural network (2DCNN) is used to extract the image features in the frequency domain. The adaptive multi-feature fusion module uses an attention mechanism for adaptive weighted fusion to make full use of the learned features. The effectiveness of the proposed method is validated on the ShipEar dataset, and the recognition accuracy reaches 94.92%, which is higher than other existing methods. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

A data representation method using distance correlation

引用

Frontiers of Computer Science 2025年第1期19卷 1-14页

作者： Xinyan LIANG Yuhua QIAN Qian GUO keyin ZHENG Institute of Big Data Science and Industry Shanxi UniversityTaiyuan 030006China Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education Shanxi UniversityTaiyuan 030006China School of Computer Science and Technology Taiyuan University of Science and TechnologyTaiyuan 030024China Shanxi Key Laboratory of Big Data Analysis and Parallel Computing Taiyuan University of Science and TechnologyTaiyuan 030024China

Association in-between features has been demonstrated to improve the representation ability of data. However, the original association data reconstruction method may face two issues: the dimension of reconstructed data is undoubtedly higher than that of original data, and adopted association measure method does not well balance effectiveness and efficiency. To address above two issues, this paper proposes a novel association-based representation improvement method, named as AssoRep. AssoRep first obtains the association between features via distance correlation method that has some advantages than Pearson’s correlation coefficient. Then an improved matrix is formed via stacking the association value of any two features. Next, an improved feature representation is obtained by aggregating the original feature with the enhancement matrix. Finally, the improved feature representation is mapped to a low-dimensional space via principal component analysis. The effectiveness of AssoRep is validated on 120 datasets and the fruits further prefect our previous work on the association data reconstruction.

关键词： association representation distance correlation classification

来源：评论

学校读者我要写书评

暂无评论

Granular Sequential Three-Way Decision for Specific Decision Classes

引用

IEEE Transactions on Fuzzy Systems 2025年第5期33卷 1650-1663页

作者： Cheng, Yunlong Yang, Xiuhua Zhang, Qinghua Shao, Yabin Wang, Guoyin Chongqing University of Posts and Telecommunications School of Science Chongqing400065 China Chongqing University of Posts and Telecommunications Chongqing Key Laboratory of Tourism Multisource Data Perception and Decision Ministry of Culture and Tourism Key Laboratory of Big Data Intelligence Computing Chongqing Key Laboratory of Computational Intelligence Chongqing400065 China

Sequential three-way decision (S3WD) is an efficient granular computing paradigm for dealing with uncertain problems. However, it is primarily oriented to all decision classes, which contradicts the fact that decisions are typically for the specific decision classes. Meanwhile, most S3WD models hide the topological structure of the granules, leading to difficulties in semantic interpretation. To address the issues, integrating model construction, attribute reduction and knowledge extraction, a general framework of granular sequential three-way decision (GrS3WD) for the specific decision classes is proposed to improve semantic interpretation and computational efficiency. First, a two-stage trisecting strategy and a GrS3WD model are proposed to integrate model construction with attribute reduction. Its main advantage is that it retains the topological structure of granules, which not only enhances semantic interpretation but also avoids unnecessary double counting. Second, three acceleration strategies and a novel granular sequential three-way reduction (GrS3WR) algorithm are proposed to fast obtain a classification-based reduct or a class-specific reduct. Finally, the decision rules with multi-granularity can be directly extracted from the concept tree generated by GrS3WR. Experimental results demonstrate that a class-specific reduct usually has fewer attributes and better classification performance than a classification-based reduct. Moreover, GrS3WR can significantly improve the computational efficiency of attribute reduction. © 1993-2012 IEEE.

关键词： Granular computing

来源：评论

学校读者我要写书评

暂无评论

MSMAE-Net: multi-semantic and multi-attention enhanced network for image forgery localization

引用

Signal, Image and Video Processing 2025年第7期19卷 1-11页

作者： Liao, Jianjun Su, Lichao Lu, Menghan Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China

The popularization of modern digital image technology has brought convenience to us, but it also poses many risks. The advancement of image editing software allows anyone to modify image content effortlessly. If these modified images are abused, they can severely impact societal safety and stability. To address these risks, we propose an end-to-end multi-scale collaborative enhancement image forgery localization network, termed MSMAE-Net. The method first employs a multi-branch feature extractor to initially capture both global and local information, with each branch optimized for different contextual information and features of the image. Next, to enhance the model’s ability to capture forged traces at various levels while maintaining the correlation between different spatial hierarchies, a boundary information aggregation module is designed. By constructing multiple branches with different receptive fields and collaborative learning with each other, a nested collaborative enhancement branch is designed to make the backbone network pay more attention to key features, so as to obtain better feature representation capability. Furthermore, to further fuse different semantic information, a novel strongly compatible semantic attention fusion module is proposed in this paper. Finally, an attention enhancement module is introduced in the localization of forgery regions to adaptively concentrate on key forged areas in the image and effectively capture the relationships between different pixels. In the experiments, we demonstrate that MSMAE-Net exhibits significant advantages in both localization accuracy and robustness in complex forgery scenarios when compared to other SOTA image forgery detection methods. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Photointerpretation

来源：评论

学校读者我要写书评

暂无评论

IMPRESS: An Importance-Informed Multi-Tier Prefix KV Storage System for Large Language Model Inference 23

IMPRESS: An Importance-Informed Multi-Tier Prefix KV Storage...

引用

23rd USENIX Conference on File and Storage Technologies, FAST 2025

作者： Chen, Weijian He, Shuibing Qu, Haoyang Zhang, Ruidong Yang, Siling Chen, Ping Zheng, Yi Huai, Baoxing Chen, Gang The State Key Laboratory of Blockchain and Data Security Zhejiang University China Institute of Blockchain and Data Security China Zhejiang Key Laboratory of Big Data Intelligent Computing China Huawei Cloud China

ISBN: (纸本)9781939133458

Modern advanced large language model (LLM) applications often prepend long contexts before user queries to improve model output quality. These contexts frequently repeat, either partially or fully, across multiple queries. Existing systems typically store and reuse the keys and values of these contexts (referred to as prefix KVs) to reduce redundant computation and time to first token (TTFT). When prefix KVs need to be stored on disks due to insufficient CPU memory, reusing them does not always reduce TTFT, as disk I/O latency is high. In this paper, we propose IMPRESS, an importance-informed multi-tier prefix KV storage system to reduce I/O delay for LLM inference by only loading important prefix KVs. IMPRESS first leverages the insight that there is significant similarity in important token index sets across attention heads and introduces an I/O-efficient important KV identification algorithm. It then optimizes prefix KV storage and caching through importance-informed KV management, reducing TTFT during model inference. Our experimental results show that IMPRESS can reduce TTFT by up to 2.8× compared to state-of-the-art systems, while maintaining comparable inference accuracy. © 2025 FAST. All Rights Reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A power optimization approach for mixed polarity Reed–Muller logic circuits based on multi-strategy fusion memetic algorithm

引用

Frontiers of Information Technology & Electronic Engineering 2025年第3期26卷 415-426页

作者： Mengyu ZHANG Zhenxue HE Yijin WANG Xiaojun ZHAO Xiaodan ZHANG Limin XIAO Xiang WANG Intelligent Agricultural Equipment Research Institute Hebei Agricultural UniversityBaoding 071001China Key Laboratory of Agricultural Big Data of Hebei Province Hebei Agricultural UniversityBaoding 071001China School of Computer Science and Engineering Beihang UniversityBeijing 100191China School of Electronic Information Engineering Beihang UniversityBeijing 100191China

The power optimization of mixed polarity Reed–Muller(MPRM)logic circuits is a classic combinatorial optimization *** optimization approaches often suffer from slow convergence and a propensity to converge to local optima,limiting their effectiveness in achieving optimal power ***,we propose a novel multi-strategy fusion memetic algorithm(MFMA).MFMA integrates global exploration via the chimp optimization algorithm with local exploration using the coati optimization algorithm based on the optimal position learning and adaptive weight factor(COA-OLA),complemented by population management through truncation ***,leveraging MFMA,we propose a power optimization approach for MPRM logic circuits that searches for the best polarity configuration to minimize circuit *** results based on Microelectronics Center of North Carolina(MCNC)benchmark circuits demonstrate significant improvements over existing power optimization *** achieves a maximum power saving rate of 72.30%and an average optimization rate of 43.37%;it searches for solutions faster and with higher quality,validating its effectiveness and superiority in power optimization.

关键词： Power optimization Multi-strategy fusion memetic algorithm(MFMA) Mixed polarity Reed-Muller(MPRM) Combinatorial optimization problem

来源：评论

学校读者我要写书评

暂无评论

Improved quantum image weighted average filtering algorithm

引用

Quantum Information Processing 2025年第5期24卷 1-24页

作者： Yuan, Suzhen Li, Xianli Yinxia, Shu Qing, Xianrong Deng, Jermiah D. College of Opto Electronic Engineering Chongqing University of Posts and Telecommunications Chongqing Chongqing400065 China School of Computing University of Otago Dunedin Dunedin9054 New Zealand School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing Chongqing400065 China Chongqing Key Laboratory of Computational Intelligence Key Laboratory of Big Data Intelligent Computing Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Posts and Telecommunications Chongqing Chongqing400065 China

Average filtering plays a vital role in image smoothing tasks. However, existing quantum image weighted average filtering methods suffer from high circuit complexity. Therefore, this paper proposes an improved quantum color image weighted average filtering algorithm and its corresponding quantum circuit. First, we improve the quantum circuit to prepare classical color images into a quantum state. Then, an improved quantum divider is developed, and a weighted average filter is constructed using basic quantum image processing modules. Next, to enhance the universality of the filter, a quantum comparator with lower circuit complexity is used to design a noise detection module for distinguishing noise from real signals. Finally, a quantum circuit for color image weighted average filtering is designed, and simulations are conducted on the IBM Quantum Experience (IBM Q) platform to verify the feasibility of our algorithm. The analysis shows that compared with existing methods, this method significantly reduces the circuit complexity and has better filtering performance. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

DMC-Watermark: A backdoor richer watermark for dual identity verification by dynamic mask covering

引用

Applied Intelligence 2025年第8期55卷 1-15页

作者： Zhu, Yujia Wang, Ruoxi Xia, Daoxun School of Big Data and Computer Science Guizhou Normal University Guiyang China Guizhou Key Laboratory of Advanced Computing Guizhou Normal University Guiyang China Engineering Laboratory for Applied Technology of Big Data in Education Guizhou Normal University Guiyang China

With the increasing use of neural networks, the importance of copyright protection for these models has gained significant attention. Backdoor watermarking is one of the key methods for protecting copyright. However, on the one hand, most existing backdoor watermarks are triggered by visual images, making them easily detectable, and therefore vulnerable to various attacks. On the other hand, it is difficult for these methods to carry information related to the creator’s identity which can easily lead to fraudulent claims of ownership. These factors contribute to the vulnerability and limitations of backdoor watermarking. In this paper, we propose DMC-Watermark, a backdoor richer watermarking method that uses dynamic mask-covered image structures as triggers. Leveraging the semantic preservation of image structure in transformation attacks, we select image structure as triggers. Furthermore, we convert the author-related information into an array of color information and apply it as a mask to the extracted image structures, allowing it to serve as a second layer of verification during the validation phase to resist fraudulent claims of ownership. The final trigger pattern, embedded with author-related image structures, is applied to the selected images in the trigger set, generating a final trigger set that is trained together with clean samples to produce a protected model. The experiments show that the proposed DMC-Watermark performs well in terms of fidelity, invisibility, undetectability, functionality, dual verification and robustness on three different datasets and four representative DNNs, and it has wide applicability and excellent results in high-resolution images. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Image watermarking

来源：评论

学校读者我要写书评

暂无评论

Towards Adaptive Masked Structural Learning for Graph-Level Clustering

引用

IEEE Transactions on Network Science and Engineering 2025年第3期12卷 2021-2032页

作者： Yang, Jinbin Cai, Jinyu Zhang, Yunhe Huang, Sujia Wang, Shiping Fuzhou University College of Computer and Data Science Fuzhou350116 China Bank of Quanzhou Company Ltd. Quanzhou362046 China National University of Singapore Institute of Data Science 117602 Singapore Shenzhen Research Institute of Big Data Shenzhen518172 China Chinese University of Hong Kong Guangdong Provincial Key Laboratory of Big Data Computing Shenzhen518172 China

Graph data presents a vast landscape for real-world applications. Current graph-level clustering approaches predominantly utilize graph neural networks to capture the intricate structural information for graph data. However, a significant challenge arises in effectively integrate structural and feature information under the prevalent noise in the real-world scenario. The advent of masking strategies has marked significant strides in boosting model robustness, accommodating incomplete data, and enhancing generalization capabilities. Yet, research attention on leveraging mask strategy for facilitating graph-level clustering is still limited. In this paper, we introduce a novel graph-level clustering method, towards adaptive masked structural learning for graph-level clustering. The method performs adaptive masking through reconstruction loss, and jointly adaptive mask representation learning and clustering in an end-to-end unsupervised framework. The mutual information between maximized the entire graph and substructure representations is also utilized to learn to generate cluster-oriented graph-level representations. Extensive experiments on eight real graph-level benchmark datasets demonstrate the effectiveness and superiority of the proposed method. © 2013 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：