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

Multi-View Graph Embedding Learning for Image Co-Segmentation and Co-Localization

IEEE Transactions on Circuits and Systems for Video technology 2024年第6期34卷 4942-4956页

作者： Huang, Aiping Li, Lijian Zhang, Le Niu, Yuzhen Zhao, Tiesong Lin, Chia-Wen Fuzhou University Fujian Key Laboratory for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering Fuzhou350108 China Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou350108 China University of Electronic Science and Technology of China School of Information and Communication Engineering Chengdu611731 China Fuzhou University Fujian Key Laboratory for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering The Fujian Science and Technology Innovation Laboratory for Optoelectronic Information Fuzhou350108 China Institute of Communications Engineering National Tsing Hua University Department of Electrical Engineering Hsinchu30013 Taiwan

Image co-segmentation and co-localization exploit inter-image information to identify and extract foreground objects with a batch mode. However, they remain challenging when confronted with large object variations or complex backgrounds. This paper proposes a multi-view graph embedding (MV-Gem) learning scheme which integrates diversity, robustness and discernibility of object features to alleviate this phenomenon. To encourage the diversity, the deep co-information containing both low-layer general representations and high-layer semantic information is generated to form a multi-view feature pool for comprehensive co-object description. To enhance the robustness, a multi-view adaptive weighted learning is formulated to fuse the deep co-information for feature complementation. To ensure the discernibility, the graph embedding and sparse constraint are embedded into the fusion formulation for feature selection. The former aims to inherit important structures from multiple views, and the latter further selects important features to restrain irrelevant backgrounds. With these techniques, MV-Gem gradually recovers all co-objects through optimization iterations. Extensive experimental results on real-world datasets demonstrate that MV-Gem is capable of locating and delineating co-objects in an image group. © 1991-2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Overlapping community‐based particle swarm optimization algorithm for influence maximization in social networks

引用

CAAI Transactions on Intelligence technology 2023年第3期8卷 893-913页

作者： Lei Zhang Yutong Liu Haipeng Yang Fan Cheng Qi Liu Xingyi Zhang Information Materials and Intelligent Sensing Laboratory of Anhui Province Key Laboratory of Intelligent Computing and Signal Processing of Ministry of EducationSchool of Computer Science and TechnologyAnhui UniversityHefeiChina School of Computer Science and Technology University of Science and Technology of ChinaHefeiChina

Influence maximization,whose aim is to maximise the expected number of influenced nodes by selecting a seed set of k influential nodes from a social network,has many applications such as goods advertising and rumour *** the existing influence maximization methods,the community‐based ones can achieve a good balance between effectiveness and ***,this kind of algorithm usually utilise the network community structures by viewing each node as a non‐overlapping *** fact,many nodes in social networks are overlapping ones,which play more important role in influence *** this end,an overlapping community‐based particle swarm opti-mization algorithm named OCPSO for influence maximization in social networks,which can make full use of overlapping nodes,non‐overlapping nodes,and their interactive information is ***,an overlapping community detection algorithm is used to obtain the information of overlapping community structures,based on which three novel evolutionary strategies,such as initialisation,mutation,and local search are designed in OCPSO for better finding influential *** results in terms of influence spread and running time on nine real‐world social networks demonstrate that the proposed OCPSO is competitive and promising comparing to several state‐of‐the‐arts(***,CMA‐IM,CIM,CDH‐SHRINK,CNCG,and CFIN).

关键词： computational intelligence data mining social network

来源：评论

学校读者我要写书评

暂无评论

On Isodual Double Toeplitz Codes

引用

Journal of Systems Science & Complexity 2024年第5期37卷 2196-2206页

作者： SHI Minjia XU Li SOLÉ Patrick Key Laboratory of Intelligent Computing and Signal Processing Ministry of EducationSchool of Mathematical SciencesAnhui UniversityHefei 230601China State Key Laboratory of Information Security Institute of Information EngineeringChinese Academy of SciencesBeijing 100093China CNRS University of Aix MarseilleCentrale MarseilleI2MMarseille 13284France

Double Toeplitz(shortly DT)codes are introduced here as a generalization of double circulant *** authors show that such a code is isodual,hence formally self-dual(FSD).FSD codes form a far-reaching generalization of self-dual codes,the most important class of codes of rate ***-dual DT codes are characterized as double circulant or double ***,even binary DT codes are characterized as double *** examples obtained by exhaustive search show that the codes constructed have best-known minimum distance,up to one unit,amongst formally self-dual codes,and sometimes improve on the known *** q=2,the authors find four improvements on the best-known values of the minimum distance of FSD *** F4 an explicit construction of DT codes,based on quadratic residues in a prime field,performs equally *** authors show that DT codes are asymptotically good over ***,the authors construct DT codes arbitrarily close to the asymptotic Varshamov-Gilbert bound for codes of rate one half.

关键词： Double circulant codes double Toeplitz codes isodual codes formally self-dual codes

来源：评论

学校读者我要写书评

暂无评论

Trajectory optimization for UAV-enabled relaying with reinforcement learning

引用

Digital Communications and Networks 2025年第1期11卷 200-209页

作者： Chiya Zhang Xinjie Li Chunlong He Xingquan Li Dongping Lin School of Electronic and Information Engineering Harbin Institute of TechnologyShenzhenChina Guangdong Key Laboratory of Intelligent Information Processing Shenzhen UniversityShenzhenChina Peng Cheng Laboratory(PCL) ShenzhenChina National Mobile Communications Research Laboratory Southeast UniversityNanjingChina Shenzhen Institute of Information Technology ShenzhenChina Guangdong-Hong Kong Joint Laboratory for Big Data Imaging and Communication Shenzhen UniversityShenzhenChina

In this paper,we investigate the application of the Unmanned Aerial Vehicle(UAV)-enabled relaying system in emergency communications,where one UAV is applied as a relay to help transmit information from ground users to a Base Station(BS).We maximize the total transmitted data from the users to the BS,by optimizing the user communication scheduling and association along with the power allocation and the trajectory of the *** solve this non-convex optimization problem,we propose the traditional Convex Optimization(CO)and the Reinforcement Learning(RL)-based ***,we apply the block coordinate descent and successive convex approximation techniques in the CO approach,while applying the soft actor-critic algorithm in the RL *** simulation results show that both approaches can solve the proposed optimization problem and obtain good ***,the RL approach establishes emergency communications more rapidly than the CO approach once the training process has been completed.

关键词： Unmanned aerial vehicle Emergency communications Trajectory optimization Convex optimization Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Pseudo-Centroid Representation Learning for Cross-domain Few-shot Classification from Remote Sensing Imagery 2

Pseudo-Centroid Representation Learning for Cross-domain Few...

引用

2nd IEEE International Conference on Signal, information and Data processing, ICSIDP 2024

作者： Li, Can Xie, Jianlin Chen, He Zhuang, Yin Li, Jiahao Chen, Liang Beijing Institute of Technology National Key Laboratory of Space-Born Intelligent Information Processing Beijing China

ISBN: (纸本)9798331515669

Cross-domain few-shot classification is gaining significant attention due to its potential to address challenges in remote sensing applications, such as large domain gaps and limited labeled data. Recent approaches have explored leveraging unlabeled target domain data for semi-supervised learning, in addition to source labeled data, to improve cross-domain training. However, these techniques often struggle with getting discriminative representation for distinguishing categories in novel target domains, particularly when facing new categories and limited training examples. To overcome these issues, we propose a novel cross-domain pseudo-centroid representation (CDPCR) framework, designed to generate more discriminative and adaptable class representations for improved cross-domain learning. The framework consists of a semi-supervised cross-domain structure that integrates both source labeled data and a portion of target unlabeled data to establish the relationship between domains. A consistency regularization branch is introduced to stabilize model outputs by aligning predictions on the target unlabeled data under input perturbations. Additionally, a pseudo-centroid contrastive representation learning module is incorporated to enhance intra-category feature consistency while improving the separability of inter-category representations, aiding the model in adapting to classification tasks across diverse domains. The effectiveness of the proposed CDPCR framework is validated through comprehensive experiments conducted across 8 cross-domain scenarios using remote sensing scene classification datasets. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Linear Subspace Surrogate Modeling for Large-Scale Expensive Single/Multi-Objective Optimization

引用

IEEE Transactions on Evolutionary Computation 2023年第3期29卷 1-1页

作者： Si, Langchun Zhang, Xingyi Tian, Ye Yang, Shangshang Zhang, Limiao Jin, Yaochu School of Computer Science and Technology Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei China School of Artificial Intelligence Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei China Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui University Hefei China Faculty of Technology Bielefeld University Bielefeld Germany

Despite that the surrogate-assisted evolutionary algorithms have achieved great success in addressing expensive optimization problems, they still suffer from stiff challenges when the number of dimensions of problems becomes large. The primary reason lies in that it is very hard to build an acceptable surrogate model in the high-dimensional search space with small amounts of evaluated historical data in evolution. To tackle this issue, we suggest an effective surrogate modeling method for large-scale expensive optimization in this paper, where the models are built on a number of linear subspaces instead of the original search space. Specifically, a linear subspace is constructed by a pair of points/solutions which are generated based on the set of elite solutions. For each linear subspace, several historical solutions are first associated according to their distance to the linear subspace, and then a surrogate model is trained by the associated solutions and used to evaluate the offspring. To ensure the exploration and exploitation capacity of the proposed method, these linear subspaces and the surrogate models are updated after a few iterations. Experimental results on CEC’2010 and CEC’2013 single-objective optimization problems with up to 1500 decision variables show that the proposed algorithm is superior over six comparison algorithms. Moreover, we also extend the proposed algorithm to multi-objective optimization problems and verified its competitiveness on problems with up to 1500 decision variables. IEEE

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Non-uniform Compressive Sensing Imaging Based on Image Saliency

引用

Chinese Journal of Electronics 2023年第1期32卷 159-165页

作者： LI Hongliang DAI Feng ZHAO Qiang MA Yike CAO Juan ZHANG Yongdong University of Chinese Academy of Sciences Key Lab of Intelligent Information Processing of Chinese Academy of Sciences Institute of Computing Technology Chinese Academy of Sciences University of Science and Technology of China

For more effective image sampling, compressive sensing(CS) imaging methods based on image saliency have been proposed in recent years. Those methods assign higher measurement rates to salient regions,but lower measurement rate to non-salient regions to improve the performance of CS imaging. However, those methods are block-based, which are difficult to apply to actual CS sampling, as each photodiode should strictly correspond to a block of the scene. In our work, we propose a non-uniform CS imaging method based on image saliency, which assigns higher measurement density to salient regions and lower density to non-salient regions,where measurement density is the number of pixels measured in a unit size. As the dimension of the signal is reduced, the quality of reconstructed image will be improved theoretically, which is confirmed by our experiments. Since the scene is sampled as a whole, our method can be easily applied to actual CS sampling. To verify the feasibility of our approach, we design and implement a hardware sampling system, which can apply our non-uniform sampling method to obtain measurements and reconstruct the images. To our best knowledge, this is the first CS hardware sampling system based on image saliency.

关键词： Measurement units Density measurement Imaging Image sampling Size measurement Hardware Sensors

来源：评论

学校读者我要写书评

暂无评论

MDFNet: Multimodal Feature Decomposition and Fusion Network for Multimodal Remote Sensing Image Semantic Segmentation 2

MDFNet: Multimodal Feature Decomposition and Fusion Network ...

引用

2nd IEEE International Conference on Signal, information and Data processing, ICSIDP 2024

作者： Wei, Tianyu Chen, He Wang, Jue Liu, Wenchao Beijing Institute of Technology National Key Laboratory of Science and Technology on Space-Born Intelligent Information Processing Beijing China

ISBN: (纸本)9798331515669

The semantic segmentation of multimodal remote sensing (RS) images, utilizing optical and synthetic aperture radar (SAR) data, has raised attention in recent studies. Advanced studies adaptively modeled and fused modality-share and modality-specific information beneficial for segmentation and achieved competitive performance. However, in challenging scenarios such as low image contrast or blurred textures in optical images and speckle noises or foreshortening in SAR images, modality-specific information may lost. This study proposed a multimodal feature decomposition and fusion network (MDFNet) designed for multimodal RS image semantic segmentation using optical and SAR images. By decomposing multimodal features into modality-share and modality-difference features and applying gradient descent on modality-difference features, modality-specific information beneficial for segmentation can be retained. Specifically, we designed a MDF decoder with MDF blocks. MDF block maps multimodal features into the same feature space and calculates the difference of multimodal features to obtain modality-share and modality-difference features respectively, then fuses these features. MDF decoder optimizes modality-difference features by gradient descent using adaptive modeling, thereby retaining modality-specific information that is beneficial for segmentation. Comprehensive experiments conducted on the DFC20 dataset demonstrated that the proposed MDFNet surpasses representative methods. © 2024 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Image Editing based on Diffusion Model for Remote Sensing Image Change Captioning 2

Image Editing based on Diffusion Model for Remote Sensing Im...

引用

2nd IEEE International Conference on Signal, information and Data processing, ICSIDP 2024

作者： Cai, Miaoxin Chen, He Li, Can Gan, Shuyu Chen, Liang Zhuang, Yin Beijing Institute of Technology National Key Laboratory of Science and Technology on Space-Born Intelligent Information Processing Beijing China

ISBN: (纸本)9798331515669

Remote Sensing Image Change Captioning (RSICC) is a task that utilizes natural language to describe changes in remote sensing images of the same area captured at different times. However, the significant temporal intervals between multi-temporal images, the infrequency of observable changes, and the limitations on observation locations make it difficult to acquire and annotate a large and diverse dataset for analyzing change in multi-temporal images. The scarcity of labeled data hinders the training of RSICC models, leading to poor generalization. Compared to annotated registered bi-temporal image, single-temporal data is easier to obtain. Therefore, to tackle the issue of poor generalization of RSICC models under limited annotated sample conditions, a text-guided image pairs generation (TGIPG) method is proposed to create synthetic RSICC datasets from single-temporal data and randomly sampled text instructions via a diffusion-based controllable image editing model. This approach generates more valid pairs of multi-temporal samples to address the constraints of limited change information. Specifically, this method utilizes language instructions to introduce change information into the diffusion process, gradually transforming the pre-phase image into the post-phase image. Our experiments on the LEVIR-CC dataset show that synthetic data can significantly enhance the performance of any RSICC model, with a restricted number of training samples, by employing this plug-and-play TGIPG method. © 2024 IEEE.

关键词： Spatio-temporal data

来源：评论

学校读者我要写书评

暂无评论

Efficient On-board Remote Sensing Scene Classification Using FPGA With Ternary Weight 2

Efficient On-board Remote Sensing Scene Classification Using...

引用

2nd IEEE International Conference on Signal, information and Data processing, ICSIDP 2024

作者： Qi, Guijie Qiao, Tingting Yu, Jingchi Xie, Yizhuang Beijing Institute of Technology National Key Laboratory of Science and Technology on Space-Born Intelligent Information Processing Beijing China

ISBN: (纸本)9798331515669

Remote Sensing Scene Classification (RSSC) is essential for applications such as environmental monitoring and catastrophe management, which often have stringent time constraints requiring real-time processing. On-board processing significantly enhances real-time performance but is challenged by limited computational resources and strict power requirements. To address these challenges, this study proposes an FPGA-based accelerator designed for Ternary Weight Networks (TWNs), which use ternary values {+1, 0, -1} for weights. By adopting TWNs, the multiplication operations in convolution are eliminated, resulting in a significant reduction in computing and power needs. Experimental results show that TWNs significantly reduce network parameters while retaining classification accuracy comparable to Full-precision Weight Networks (FPWNs). The FPGA-based accelerator achieves an energy-efficiency ratio of 434.11 GOP/W, outperforming most existing CNN accelerators, hence meeting the requirements for on-board RSSC. © 2024 IEEE.

关键词： Image thinning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：