Signal Processing最新文献

筛选
英文 中文
Preconditioned stochastic gradient Langevin dynamics for light field denoising 光场去噪的预条件随机梯度朗之万动力学
IF 3.4 2区 工程技术
Signal Processing Pub Date : 2025-05-28 DOI: 10.1016/j.sigpro.2025.110097
Haiyan Guo, Haimiao Zhang, Jun Qiu
{"title":"Preconditioned stochastic gradient Langevin dynamics for light field denoising","authors":"Haiyan Guo,&nbsp;Haimiao Zhang,&nbsp;Jun Qiu","doi":"10.1016/j.sigpro.2025.110097","DOIUrl":"10.1016/j.sigpro.2025.110097","url":null,"abstract":"<div><div>Light field imaging captures spatial and angular information about the scene and comprises multiple sub-aperture images (SAIs) from slightly offset viewpoints. Light field is often corrupted by noise during the acquisition process, which can significantly affect the quality of reconstructed images. In this paper, we propose a self-supervised deep learning model for light field denoising (LFDN). It exploits the inherent redundancy of light field data and uses the implicitly regularized deep neural networks to represent the clean light field. The preconditioned stochastic gradient Langevin dynamics (pSGLD) is adopted to train the model with the Markov Chain Monte Carlo method for sampling the posterior distribution. Numerical experiments on synthetic and real light field datasets demonstrate that our proposed pSGLD model outperforms the compared classical light field denoising methods.</div></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"238 ","pages":"Article 110097"},"PeriodicalIF":3.4,"publicationDate":"2025-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144169058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Maximum correntropy criterion-based Kalman filter for replay attack in non-Gaussian noises 基于最大熵准则的非高斯噪声重放攻击卡尔曼滤波
IF 3.4 2区 工程技术
Signal Processing Pub Date : 2025-05-27 DOI: 10.1016/j.sigpro.2025.110098
Cong Wu, Dongyuan Lin, Yunfei Zheng, Fuliang He, Shiyuan Wang
{"title":"Maximum correntropy criterion-based Kalman filter for replay attack in non-Gaussian noises","authors":"Cong Wu,&nbsp;Dongyuan Lin,&nbsp;Yunfei Zheng,&nbsp;Fuliang He,&nbsp;Shiyuan Wang","doi":"10.1016/j.sigpro.2025.110098","DOIUrl":"10.1016/j.sigpro.2025.110098","url":null,"abstract":"<div><div>The Kalman filter (KF) has been widely recognized as a fundamental tool for state estimation in linear systems. However, its performance can be significantly degraded when the measurement is subjected to replay attacks, particularly in non-Gaussian noise environments. To tackle this challenge, this letter presents a new robust KF, called replay attack maximum correntropy Kalman filter (RAMCKF). First, a replay attack measurement model (RAMM) is proposed, generating a novel state space model under replay attacks. Moreover, the maximum correntropy criterion (MCC) is used to construct the cost function that is effective to combat non-Gaussian noises. Then, the RAMCKF is proposed by the optimal estimation theory. Finally, simulation results demonstrate the robustness and adaptability of the proposed algorithm in replay attack scenarios and non-Gaussian disturbances.</div></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"238 ","pages":"Article 110098"},"PeriodicalIF":3.4,"publicationDate":"2025-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144169059","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Bistatic MIMO radar for exact near-field target localization with COLD arrays 用于冷阵列近场目标精确定位的双基地MIMO雷达
IF 3.4 2区 工程技术
Signal Processing Pub Date : 2025-05-27 DOI: 10.1016/j.sigpro.2025.110100
Zhenhao Yu , Muran Guo , Hua Chen , Liping Teng , Ye Tian , Zheng Zhou , Ming Jin
{"title":"Bistatic MIMO radar for exact near-field target localization with COLD arrays","authors":"Zhenhao Yu ,&nbsp;Muran Guo ,&nbsp;Hua Chen ,&nbsp;Liping Teng ,&nbsp;Ye Tian ,&nbsp;Zheng Zhou ,&nbsp;Ming Jin","doi":"10.1016/j.sigpro.2025.110100","DOIUrl":"10.1016/j.sigpro.2025.110100","url":null,"abstract":"<div><div>Most existing near-field target localization algorithms are based on the Fresnel approximation model, which can lead to a decrease in parameter estimation accuracy. In this paper, we combine bistatic multiple-input multiple-output (MIMO) radar with concentered orthogonal loop and dipole (COLD) arrays to propose a six-dimensional (6-D) parameter estimation algorithm based on an exact near-field spatial propagation geometry model. The proposed algorithm first performs eigenvalue decomposition of the covariance matrix of the receiving array and utilizes the rotational invariance technique to obtain estimates of two-dimensional reception polarization angles (2D-RPA). Then, the unambiguous spatial amplitude attenuation factors and ambiguous spatial phase factors are estimated. Two overdetermined linear equations are constructed and solved with the estimated spatial amplitude attenuation factors to obtain coarse direction of departure (DOD), range from transmitter to target (RFTT), direction of arrival (DOA), and range from target to receiver (RFTR) estimation. Finally, the coarse estimates of DOD, RFTT, DOA, and RFTR are combined with the estimated ambiguous spatial phase factors to obtain the unambiguous spatial phase factors, thereby achieving fine estimation of DOD, RFTT, DOA, and RFTR. The proposed algorithm achieves automatically matching of 6-D parameters that is superior to exiting method, simulation results validate its effectiveness.</div></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"238 ","pages":"Article 110100"},"PeriodicalIF":3.4,"publicationDate":"2025-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144169057","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Focus-aware compression and image quality metric for 3D displays 三维显示器的焦点感知压缩和图像质量度量
IF 3.4 2区 工程技术
Signal Processing Pub Date : 2025-05-22 DOI: 10.1016/j.sigpro.2025.110091
T. Chlubna , M. Vlnas , D. Bařina , T. Milet , P. Zemčík
{"title":"Focus-aware compression and image quality metric for 3D displays","authors":"T. Chlubna ,&nbsp;M. Vlnas ,&nbsp;D. Bařina ,&nbsp;T. Milet ,&nbsp;P. Zemčík","doi":"10.1016/j.sigpro.2025.110091","DOIUrl":"10.1016/j.sigpro.2025.110091","url":null,"abstract":"<div><div>3D displays are capable of immersive 3D content presentation without glasses and headsets. The displays project different views depending on the user’s viewing angle. Multiple views are visible to the user at once to simulate the 3D perception. The visual blending of the simultaneously projected views creates out-of-focus areas in the scene. The scene can be displayed with only one focusing distance, where the objects appear sharp. This paper utilizes this effect in data compression. First, several metrics are proposed for automatic visual quality assessment of the results on the 3D display. Then, automatic detection of the focusing distance in the scene, based on the input views, is proposed. Based on this detection, the high spatial frequencies in out-of-focus areas can be eliminated using the depth-of-field effect, or such areas can be compressed with higher compression ratio, depending on the use case. The paper compares the proposals. A user study is conducted to obtain human evaluation of the results. The results obtained identified the optimal visual quality metric for the 3D display. The proposed compression proved to be beneficial for 3D displays and capable of reaching a higher compression ratio than standard methods without a perceivable quality loss.</div></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"238 ","pages":"Article 110091"},"PeriodicalIF":3.4,"publicationDate":"2025-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144131058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Few-shot jamming recognition based on NMF combined with multi-dimensional fusion network 基于NMF与多维融合网络相结合的小弹干扰识别
IF 3.4 2区 工程技术
Signal Processing Pub Date : 2025-05-21 DOI: 10.1016/j.sigpro.2025.110089
Jiachen Li , Jiaxian Hao , Yukai Kong , Xianxiang Yu , Zhaoyin Xiang , Guolong Cui , Wenmin Wang
{"title":"Few-shot jamming recognition based on NMF combined with multi-dimensional fusion network","authors":"Jiachen Li ,&nbsp;Jiaxian Hao ,&nbsp;Yukai Kong ,&nbsp;Xianxiang Yu ,&nbsp;Zhaoyin Xiang ,&nbsp;Guolong Cui ,&nbsp;Wenmin Wang","doi":"10.1016/j.sigpro.2025.110089","DOIUrl":"10.1016/j.sigpro.2025.110089","url":null,"abstract":"<div><div>Accurately identifying specific types of active jamming is essential for optimizing radar resources and enhancing anti-jamming efficiency, particularly in the context of few-shot sample sizes, as discussed in this study. We first employ non-negative matrix factorization (NMF) to pre-process the radar signal. NMF enhances the feature representation of data while simultaneously augmenting the sample size. Subsequently, we propose a multi-dimensional fusion network (MDFN) designed to integrate high-dimensional features and classify jamming signals effectively. The proposed method demonstrates superior performance compared to existing approaches across twelve categories of jamming in few-shot scenario. Experimental results are presented to validate the reliability and effectiveness of the proposed method.</div></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"237 ","pages":"Article 110089"},"PeriodicalIF":3.4,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144108019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimized sparse 2D antenna array design via beampattern matching 基于波束匹配的二维稀疏天线阵优化设计
IF 3.4 2区 工程技术
Signal Processing Pub Date : 2025-05-21 DOI: 10.1016/j.sigpro.2025.110086
Saeid Sedighi , Nazila Karimian-Sichani , Bhavani Shankar M.R. , Maria S. Greco , Fulvio Gini , Björn Ottersten
{"title":"Optimized sparse 2D antenna array design via beampattern matching","authors":"Saeid Sedighi ,&nbsp;Nazila Karimian-Sichani ,&nbsp;Bhavani Shankar M.R. ,&nbsp;Maria S. Greco ,&nbsp;Fulvio Gini ,&nbsp;Björn Ottersten","doi":"10.1016/j.sigpro.2025.110086","DOIUrl":"10.1016/j.sigpro.2025.110086","url":null,"abstract":"<div><div>Emerging millimeter-wave (mmWave) MIMO radars combine the benefits of large bandwidth available at mmWave frequencies with the spatial diversity provided by MIMO architectures, significantly enhancing radar capabilities for automotive, surveillance, and imaging applications. However, deploying large numbers of antennas and transceivers at these high frequencies substantially increases chip complexity and hardware costs. In this paper, we address the design of sparse two-dimensional (2D) antenna arrays that retain the desirable beampattern characteristics of fully populated arrays – namely, narrow mainlobes and low sidelobes – while significantly reducing the required number of antenna elements. We formulate the sparse array design problem as a beampattern matching optimization, which selects optimal subsets of transmit and receive antenna positions from an initial dense grid. To efficiently solve this challenging nonconvex optimization problem, we introduce an iterative algorithm combining Majorization–Minimization (MM) and Alternating Optimization (AO) techniques. We provide theoretical guarantees for convergence to at least a local optimum. Additionally, we propose a weighting vector optimization step to further enhance sidelobe suppression. Numerical simulations confirm that the proposed method maintains angular resolution and Sidelobe Levels (SLLs) comparable to those of full arrays, while substantially reducing hardware complexity and cost. Performance comparisons against existing methods demonstrate notable improvements in sidelobe suppression and computational efficiency without compromising processing gain.</div></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"238 ","pages":"Article 110086"},"PeriodicalIF":3.4,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144131057","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimal transport-guided multivariable model for point set matching problems 点集匹配问题的最优运输导向多变量模型
IF 3.4 2区 工程技术
Signal Processing Pub Date : 2025-05-21 DOI: 10.1016/j.sigpro.2025.110090
Litao Ma, Xu Wang, Jiqiang Chen
{"title":"Optimal transport-guided multivariable model for point set matching problems","authors":"Litao Ma,&nbsp;Xu Wang,&nbsp;Jiqiang Chen","doi":"10.1016/j.sigpro.2025.110090","DOIUrl":"10.1016/j.sigpro.2025.110090","url":null,"abstract":"<div><div>With the rapid development of computer vision, the demand for point set matching in complex environments is increasing, especially in cases with large-scale deformation and high noise. However, existing algorithms often exhibit low accuracy or high computational costs. To enhance algorithmic efficiency while maintaining precision, we propose a new point sets matching method named multivariable entropic-regularized optimal transport model (MeROT), which handles the point sets more flexibly. Compared with the traditional optimal transport model, the proposed model introduces an orthogonal transformation matrix and a stretching transformation matrix, which can better handle the rotation and stretch transformation of the point set. In addition, an entropic-regularization term is incorporated to enhance the model’s robustness against noise and to decrease the computational expense. Subsequently, an alternate iteration algorithm is proposed. Thanks to the special properties of the two matrices and the entropy regularization term, each subproblem within the algorithm can be resolved either through a closed-form solution or by employing an efficient computational method. Therefore, MeROT offers both high matching accuracy and computational efficiency, making it well-suited for point cloud matching problems in the current complex environment. Finally, several experiments on 3D point sets are designed to show the efficiency of the proposed model.</div></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"238 ","pages":"Article 110090"},"PeriodicalIF":3.4,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144147343","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A decorrelation method in asynchronous arithmetic average fusion of GM-PHD filters GM-PHD滤波器异步算术平均融合中的去相关方法
IF 3.4 2区 工程技术
Signal Processing Pub Date : 2025-05-20 DOI: 10.1016/j.sigpro.2025.110119
Xue Yu, Feng Xi-an
{"title":"A decorrelation method in asynchronous arithmetic average fusion of GM-PHD filters","authors":"Xue Yu,&nbsp;Feng Xi-an","doi":"10.1016/j.sigpro.2025.110119","DOIUrl":"10.1016/j.sigpro.2025.110119","url":null,"abstract":"<div><div>We present a decorrelation arithmetic average (AA) fusion algorithm of Gaussian mixture probability hypothesis density (GM-PHD) filters to ameliorate the multi-target tracking accuracy in asynchronous scenarios. First, the correlations in single-target asynchronous scenarios and the Bayesian optimal decorrelation fusion method are derived. Then, the derived single-target decorrelation fusion is employed to merge estimates of the same target. As required by the derived decorrelation method, a measurement extraction technique is developed to acquire measurements contained in locally filtered estimates, and a hierarchical structure involving a master filter is designed to provide prior estimates automatically. Simulations verify that our algorithm inherits the derived single-target fusion’s Bayesian optimality in handling delays. Meanwhile, extending our algorithm to track multiple maneuvering targets also exhibits certain potential.</div></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"238 ","pages":"Article 110119"},"PeriodicalIF":3.4,"publicationDate":"2025-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144135041","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A survey of fragile model watermarking 脆弱模型水印研究进展
IF 3.4 2区 工程技术
Signal Processing Pub Date : 2025-05-18 DOI: 10.1016/j.sigpro.2025.110088
Zhenzhe Gao, Yu Cheng, Zhaoxia Yin
{"title":"A survey of fragile model watermarking","authors":"Zhenzhe Gao,&nbsp;Yu Cheng,&nbsp;Zhaoxia Yin","doi":"10.1016/j.sigpro.2025.110088","DOIUrl":"10.1016/j.sigpro.2025.110088","url":null,"abstract":"<div><div>With the rapid development of artificial intelligence models and their widespread application across various sectors, the reliability of these models has become a critical concern. Model integrity is an essential factor for ensuring the reliability of AI models. However, several types of attacks threaten the integrity of models, such as backdoor attacks and poisoning attacks, which can lead to incorrect output. When these outputs are applied in critical areas like finance and national defense, they may pose significant risks to society. In traditional media, fragile watermarks protect content integrity. Combined with adversarial knowledge, this forms fragile model watermarking. This technique aims to safeguard model integrity by detecting tampering. Although fragile model watermarking has developed more recently than robust model copyright watermarking, it has seen rapid advancements in recent years. However, a comprehensive survey on fragile model watermarking has yet to be published. This paper provides the first comprehensive survey of fragile model watermarking, categorizing it based on the two stages of embedding and verification. It introduces the basic principles of various fragile watermarking algorithms, discussing in detail the characteristics, advantages, and limitations of these approaches. Finally, the paper presents future directions for the development of fragile model watermarking.</div></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"238 ","pages":"Article 110088"},"PeriodicalIF":3.4,"publicationDate":"2025-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144243070","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Adaptive GLMB filter with IoU-based birth modeling for UAV visual multi-object tracking 基于iou出生建模的自适应GLMB滤波器用于无人机视觉多目标跟踪
IF 3.4 2区 工程技术
Signal Processing Pub Date : 2025-05-17 DOI: 10.1016/j.sigpro.2025.110087
Haiyi Tong, Dekang Zhu, Hongbo Guo, Zhou Zhang
{"title":"Adaptive GLMB filter with IoU-based birth modeling for UAV visual multi-object tracking","authors":"Haiyi Tong,&nbsp;Dekang Zhu,&nbsp;Hongbo Guo,&nbsp;Zhou Zhang","doi":"10.1016/j.sigpro.2025.110087","DOIUrl":"10.1016/j.sigpro.2025.110087","url":null,"abstract":"<div><div>This paper proposes an Intersection-over-Union-based Adaptive Birth Generalized Labeled Multi-Bernoulli (IoU-AB-GLMB) filter for UAV-based multi-object tracking (MOT), specifically designed to address challenges posed by small objects with indistinct appearance features and time-varying object numbers. The proposed method introduces an IoU-based adaptive birth probability estimation model, where detected bounding boxes are clustered using IoU metrics to analyze spatial relationships, allowing the identification of unassociated or weakly associated measurements as birth targets. Additionally, we also enhance the Gibbs sampling truncation strategy by incorporating hypothesis weights and target count constraints, enabling adaptive truncation to improve computational efficiency while maintaining critical track hypotheses. Built on the GLMB framework, our proposed filter provides a unified probabilistic model that handles detection uncertainty, target survival, birth, and disappearance through Bayesian recursion, eliminating the need for manually defined rules. Furthermore, instead of committing to a single optimal association, the GLMB filter retains multiple association hypotheses at each iteration, allowing for a more robust treatment of uncertainty. Experimental results show that IoU-AB-GLMB achieves MOT accuracy 41.29% and 39.07% on VisDrone and UAVDT. Despite not relying on appearance cues, our method performs comparably to state-of-the-art appearance-based trackers StrongSORT (43.06% on VisDrone; 27.93% on UAVDT). These results underscore the effectiveness of our algorithm in UAV tracking scenarios.</div></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"237 ","pages":"Article 110087"},"PeriodicalIF":3.4,"publicationDate":"2025-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144089887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信