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

A method of embedding a high-resolution image into a large field-of-view image

Multimedia Tools and Applications 2025年第14期84卷 13037-13056页

作者： Dong, Yanmei Pei, Mingtao Jia, Yunde Key Laboratory of Intelligent Information Processing and Graph Processing Tus College of Digit Guangxi University of Science and Technology Liuzhou545006 China Beijing Laboratory of Intelligent Information Technology School of Computer Science Beijing Institute of Technology Beijing100081 China

Images captured by wide-angle cameras or fisheye cameras are with large Field-of-View (FOV) but low resolution, while images captured by conventional cameras are with high-resolution but limited FOV. To handle this contradiction, in this paper, we propose to improve the resolution of a large FOV image by embedding a high-resolution image into it. We present an image embedding method based on non-rigid transformations and mesh optimization. Without any radial distortion correction on large FOV images, we utilize non-rigid transformations to model the mathematical transformation relationship between the high-resolution image and the large FOV image. Meanwhile, we exploit mesh optimization to generate evenly distributed control points for maintaining the shape and content of the large FOV image. To verify the effectiveness of the proposed method, we capture some image pairs from a conventional camera and a large FOV camera, and exploit several classic image alignment methods to implement four baseline methods. The experimental results show that our method preserves the shape and content of the original FOV image from 58% to 82%, which significantly outperforms all baseline methods. The results indicate that the proposed method can effectively embed a high-resolution image into a large FOV image as well as preserve the shape and content of the large FOV image. In other words, the resolution of a large FOV image can be improved via high-resolution image embedding. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

intelligent Innovation Dataset on Scientific Research Outcomes and Patents

引用

Journal of Social Computing 2025年第1期6卷 63-73页

作者： Wu, Xinran Zou, Hui Xing, Yidan Qu, Jingjing Guo, Weiwei Fu, Xiaoming School of Computer Science Fudan University Shanghai Key Laboratory of Intelligent Information Processing Shanghai200433 China Shanghai University Department of Library and Information Science Shanghai200444 China Big Data Technology Co. Ltd. Shanghai200082 China Shanghai Artificial Intelligence Laboratory Shanghai200082 China Fudan University Department of Management Shanghai200433 China Fudan University Shanghai Key Laboratory of Intelligent Information Processing Shanghai200433 China Institute of Computer Science University of Göttingen Göttingen37073 Germany

Various stakeholders, such as researchers, government agencies, businesses, and research laboratories require a large volume of reliable scientific research outcomes including research articles and patent data to support their work. These data are crucial for a variety of application, such as advancing scientific research, conducting business evaluations, and undertaking policy analysis. However, collecting such data is often a time-consuming and laborious task. Consequently, many users turn to using openly accessible data for their research. However, these existing open dataset releases typically suffer from lack of relationship between different data sources and a limited temporal coverage. To address this issue, we present a new open dataset, the intelligent Innovation Dataset (IIDS), which comprises six interrelated datasets spanning nearly 120 years, encompassing paper information, paper citation relationships, patent details, patent legal statuses, and funding information. The extensive contextual and extensive temporal coverage of the IIDS dataset will provide researchers and practitioners and policy maker with comprehensive data support, enabling them to conduct indepth scientific research and comprehensive data analyses. © 2020 Tsinghua University Press.

关键词： Decentralized finance

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges

引用

IEEE Transactions on Knowledge and Data Engineering 2025年第6期37卷 3342-3355页

作者： Zhou, Xiaotian Zehmakan, Ahad N. Zhang, Zhongzhi Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China School of Computing Australian National University CanberraACT2601 Australia Research Institute of Intelligent Complex Systems Fudan University Shanghai200433 China

The Kirchhoff index, which is the sum of the resistance distance between every pair of nodes in a network, is a key metric for gauging network performance, where lower values signify enhanced performance. In this paper, we study the problem of minimizing the Kirchhoff index by adding edges. We first provide a greedy algorithm for solving this problem and give an analysis of its quality based on the bounds of the submodularity ratio and the curvature. Then, we introduce a gradient-based greedy algorithm as a new paradigm to solve this problem. To accelerate the computation cost, we leverage geometric properties, convex hull approximation, and approximation of the projected coordinate of each point. To further improve this algorithm, we use pre-pruning and fast update techniques, making it particularly suitable for large networks. Our proposed algorithms have nearly-linear time complexity. We provide extensive experiments on ten real networks to evaluate the quality of our algorithms. The results demonstrate that our proposed algorithms outperform the state-of-the-art methods in terms of efficiency and effectiveness. Moreover, our algorithms are scalable to large graphs with over 5 million nodes and 12 million edges. © 2025 IEEE.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Hi-NeRF: Hybridizing 2D Inpainting with Neural Radiance Fields for 3D Scene Inpainting 17th

Hi-NeRF: Hybridizing 2D Inpainting with Neural Radiance Fie...

引用

17th Asian Conference on computer Vision, ACCV 2024

作者： Huang, Xianliang Chen, Shuhang Zhong, Zhizhou Gou, Jiajie Guan, Jihong Zhou, Shuigeng Shanghai Key Lab of Intelligent Information Processing and School of Computer Science Fudan University Shanghai China School of Computer Science and Technology Tongji University Shanghai China

ISBN: (纸本)9789819609710

Recent developments in Neural Radiance Fields (NeRF) have showcased notable progress in the synthesis of novel views. Nevertheless, there is limited research on inpainting 3D scenes using implicit representations. Traditional approaches utilizing 3D networks for direct 3D inpainting often falter in high-resolution settings, mainly due to GPU memory constraints. This paper introduces Hi-NeRF, an innovative 3D inpainting approach designed to remove arbitrary 3D objects by hybridizing 2D inpainting strategies with NeRF techniques. Recognizing that prevailing 2D inpainting methods often fail to grasp the 3D geometric intricacies of scenes, we leverage the unique capability of NeRF in capturing these structures. Additionally, we propose a multi-view perceptual loss (MVPL) to harness multi-view data, ensuring that 2D inpainting and implicit 3D representations can mutually compensate for each other. Furthermore, we refine the output from the Segment Anything Model (SAM) using image dilation to produce accurate multi-view masks. To finalize the process, we employ Instant-NGP to efficiently retrieve 3D-consistent scenes from 3D-consistent inpainted images. As there is no multi-view 3D scene datasets with corresponding masks, we construct both real-world and synthetic scenes for the multi-view 3D scene inpainting task, which serves as a benchmark dataset. Experimental results on both indoor and outdoor scenes highlight the superiority of our approach over the existing 2D inpainting methods and NeRF-based baselines. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： 3D modeling

来源：评论

学校读者我要写书评

暂无评论

Enhancing Graph Structure Learning via Motif-Driven Hypergraph Construction

引用

IEEE Transactions on Network science and Engineering 2025年第3期12卷 2333-2344页

作者： Zhao, Jia-Le Zhang, Xian-Jie Ding, Xiao Zhang, Xingyi Zhang, Hai-Feng Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Mathematical Science Hefei230601 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Hefei230601 China

Graph neural networks (GNNs), as a cutting-edge technology in deep learning, perform particularly well in various tasks that process graph structure data. However, their foundation on pairwise graphs often limits their capacity to capture latent higher-order topological semantic information. Thus, it is crucial to find a way to extract the latent higher-order information of graphs without missing the lower-order information of the original graph. To address this issue, we here develop a method to construct hypergraph based on motifs, and then a novel neural network framework, named MD-HGNN, is proposed for enhanced graph learning. Specifically, we first utilize motifs of the original graph to construct the hypergraph and eliminate nested structures within the hypergraph to prevent information redundancy. Subsequently, GNNs and hypergraph neural networks (HGNNs) are employed separately to extract the lower-order and higher-order topological semantic information of the graph. Finally, the lower-order and higher-order information are integrated to obtain an embedded representation of graph. Extensive experimental results demonstrate that MD-HGNN preserves the original lower-order graph structure information while effectively extracting higher-order features. Moreover, its performance and robustness are validated across different downstream tasks. © 2013 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Double-Mix-Net: A Multimodal Music Emotion Recognition Network with Multi-layer Feature Mixing 10th

Double-Mix-Net: A Multimodal Music Emotion Recognition Netwo...

引用

10th Conference on Sound and Music Technology, CSMT 2023

作者： Li, Peilin Chen, Kairan Wei, Weixin Zhao, Jiahao Li, Wei School of Computer Science and Technology Fudan University Shanghai Shanghai200438 China Shanghai Key Laboratory of Intelligent Information Processing Fudan University Shanghai Shanghai200433 China

ISBN: (纸本)9789819779611

Computational music emotion recognition (MER) is an important task that aims to recognize emotional content in music tracks. Understanding the emotional content of music can help tailor therapeutic interventions to specific emotional needs, potentially improving their effectiveness. Piano music is widely used in music therapy for depression, anxiety, and other mental health conditions. However, comparatively little work has been done on MER in piano music, which is a challenging task due to the unique difficulties in recognizing emotions in single-timbre music without vocals, especially on valence. In this paper, we propose a novel Double-Mix-Net model that utilizes the multi-layer feature mixing and multi-modal feature mixing methods to improve classification performance. Our model uses both the title of the YouTube music video and the music context to predict the emotion of a given music track. Additionally, we make full use of different granularity features through the multi-layer feature mixing method. Our proposed model achieved state-of-the-art accuracy performance of 73.8% on the Emopia dataset and is the first multi-modal network designed for piano emotion recognition. The results of our study highlight the importance of considering the music title and utilizing multi-layer feature mixing methods in piano music emotion recognition. This work helps the emotional understanding of piano music. Our proposed model can be applied in various domains such as music recommendation systems, film scoring, and game design to enhance the emotional impact of music. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Game design

来源：评论

学校读者我要写书评

暂无评论

Improving Wireless Security with Phase-Tag Physical-Layer Authentication

引用

IEEE Transactions on Mobile Computing 2025年第6期24卷 4716-4732页

作者： Chang, Zikai Xiong, Wei Xie, Ning Niyato, Dusit Shenzhen University State Key Laboratory of Radio Frequency Heterogeneous Integration Guangdong Key Laboratory of Intelligent Information Processing College of Electronics and Information Engineering Shenzhen518060 China Nanyang Technological University School of Computer Science and Engineering Singapore

Authentication is a fundamental requirement and a crucial topic in wireless communications. This paper focuses on improving the security of the prior tag-based Physical-Layer Authentication (PLA) schemes. We propose two phase-tag-based PLA schemes to overcome the limitations of prior tag-based PLA schemes. First, we propose the Phase-Tag-based PLA (PT-PLA) scheme, which superimposes a tag to the phase of the transmitted signal rather than the amplitude. Second, we propose the Adaptive Phase-Tag-based PLA (APT-PLA) scheme, where an appropriate parameter of the PT-PLA scheme is adaptively set for achieving a better trade-off among robustness, security, and compatibility. Rigorous theoretical analyses of the proposed schemes are conducted in high-order modulation systems, such as M-PSK and M-QAM systems, with a focus on evaluating their robustness, security, and compatibility. We also discuss advantages and disadvantages of these schemes and offer helpful recommendations according to different scenarios. Furthermore, we implement the proposed schemes and perform extensive simulations to compare their performance comprehensively. Simulation results demonstrate a perfect match with the theoretical results, verifying the superiority of the proposed schemes over the prior schemes. © 2002-2012 IEEE.

关键词： Authentication Protocol

来源：评论

学校读者我要写书评

暂无评论

DIG: Improved DINO for Graffiti Detection

引用

IEEE Transactions on Systems, Man, and Cybernetics: Systems 2025年第5期55卷 3557-3569页

作者： Wang, Bingshu Mao, Qianchen Liu, Aifei Chen, Long Chen, C. L. Philip Northwestern Polytechnical University School of Software Xi’an710129 China Shenzhen University Guangdong Key Laboratory of Intelligent Information Processing Shenzhen Key Laboratory of Media Security Shenzhen518060 China University of Macao Department of Computer and Information Science China South China University of Technology School of Computer Science and Engineering Guangzhou510641 China

Graffiti detection is essential in historic building protection and urban neighborhood management. Graffiti detection has made significant progress in recent years based on the development of deep learning. However, small-scale graffiti, interference from the background, and the false detection of word parts in graffiti make it a challenging problem. This article proposes a Transformer-based high-precision graffiti detection method, namely DIG. Precisely, it consists of three modules: 1) Spatial query selection (SQS), scale-aware IoU loss (SIL);2) Denoising Task with binary contrastive denoising (BCDN);and 3) IoU-guided box denoising (IBD) modules. To detect small-scale graffiti, this paper proposes SIL to help the loss function to perceive small-scale graffiti and large-scale graffiti fairly. To reduce the false detection of word parts, this article presents the SQS module, which integrates spatial information into the query selection process of the Encoder to filter out falsely detected bounding boxes within the graffiti. To reduce the interference from the background, this article introduces a denoising task with BCDN and IBD modules, improving the model’s ability to distinguish graffiti from the background and accurately select appropriate bounding boxes. A large number of experimental results on the STORM dataset show that our method achieves state-of-the-art results with an AP50 of 87.9%. Moreover, DIG achieved competitive results on the FineFM dataset for mask detection. This indicates that DIG can also be conveniently transferred to detect other scenarios. © 2013 IEEE.

关键词： Historic preservation

来源：评论

学校读者我要写书评

暂无评论

PRPFD: Polynomial Resampling Particle Filter Based Deconvolution Approach for Resting-State BOLD-fMRI Data Analysis 24

PRPFD: Polynomial Resampling Particle Filter Based Deconvolu...

引用

5th International Symposium on Artificial Intelligence for Medicine science, ISAIMS 2024

作者： Luo, Yunying Zeng, Weiming Key Laboratory for Digital Imaging Processing and Intelligent Computing School of Information Engineering Shanghai Maritime University Shanghai China

ISBN: (纸本)9798400717826

Functional Magnetic Resonance Imaging (fMRI) stands out in brain science research due to its non-invasive, non-intrusive, radiation-free, high spatial resolution, and precise localization advantages. However, the BOLD-fMRI signals it generates exhibit a several-second delay compared to neural activity, making it unable to reflect brain neural activity directly. This discrepancy may lead to differences from the actual situation. Therefore, this study aims to enhance the deconvolution of fMRI by refining existing methods to reconstruct the brain’s neural signals more faithfully. Building upon the foundation of particle filtering deconvolution, this paper introduced a novel approach to deconvolving resting-state fMRI data: the polynomial resampling particle filtering deconvolution (PRPFD). They adapted the particle distribution better to match the actual state through weight computation and resampling. We performed a simulation-based experiment to validate the feasibility of our approach. Besides, we validated the performance of our method using group data, focusing on both effective connectivity and functional connectivity, providing strong evidence for the usability and stability of our approach, and compared our method with other deconvolution techniques, demonstrating improvements in accuracy and computational efficiency. © 2024 Copyright held by the owner/author(s).

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

Sketch-based Point Cloud Generation with Diffusion Model and Pre-training Enhancement

Sketch-based Point Cloud Generation with Diffusion Model and...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal processing, ICASSP 2025

作者： Chen, Yangdong Chen, Mohan Zhang, Yuejie Feng, Rui Zhang, Tao Gao, Shang School of Computer Science Shanghai Key Laboratory of Intelligent Information Processing Fudan University Shanghai China School of Information Management and Engineering Shanghai Key Laboratory of Financial Information Technology Shanghai University of Finance and Economics Shanghai China School of Information Technology Deakin University Victoria Australia

ISBN: (纸本)9798350368741

Diffusion models, known for their success in various generative tasks like image generation and super-resolution, are applied in this study for point cloud generation, a field that has not been extensively explored due to the complexity of point clouds. We propose a novel method using a diffusion model to generate high-quality 3D point clouds from 2D sketches. This method employs a self-supervised contrastive learning scheme to align sketch and point cloud modalities. Additionally, it incorporates a specific partition mixing strategy to integrate edge information during pre-training. Evaluated on two benchmark datasets, our method outperforms existing state-of-the-art approaches, showcasing the potential of diffusion models in point cloud generation and setting a new direction for future research. © 2025 IEEE.

关键词： Diffusion Models Point Cloud Generation Self-supervised Contrastive Learning Sketch

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：