•   按检索    检索词:    高级检索
     排序:相关度 OA 时间 被引次数 点击次数 下载次数 共有10000条符合的查询结果,以下是第9451-9460项 搜索用时 154 毫秒
[首页] « 上一页 [941] [942] [943] [944] [945] 946 [947] [948] [949] [950] [951] 下一页 » 末  页»
9451.
ObjectiveThe application of mixed reality (MR) in training environments, particularly in the field of aviation, marks a remarkable leap from… …   相似文献
《中国图象图形学报》2024,29(10):3008-3021
9452.
ObjectiveThree-dimensional human pose estimation has always been a research hotspot in computer vision. Currently, most methods directly reg… …   相似文献
《中国图象图形学报》2024,29(10):3116-3129
9453.
ObjectiveThis study introduces a novel method that aims to address the shortcomings of current no-reference point cloud quality assessment m… …   相似文献
《中国图象图形学报》2024,29(10):2979-2991
9454.
  
To improve the decoding performance of the simplified sequence repetition node-based fast successive cancellation (SSRFSC) decoding algorithm, a decoding algorithm (CSS-SSR-Flip) based on critical simplified set (CSS) and simplified sequence repetition (SSR) nodes was designed. Firstly, the information bit of the longest repetition (REP) node in SSR was selected as candidate bit (CB), thus constructing a CSS based on SSR. Corresponding flip metrics and flip criterion were designed according to the decoding characteristics of SSR nodes. Secondly, the CB reliability was measured by considering the influence of repetition sequences and the source of SSR nodes on decoding, and suboptimal repetition sequences were selected to complete SSR node flip operations during specific CB flips. Experimental data shows that at frame error rates of 10-3, CSS-SSR-Flip decoding algorithm is able to obtain more than 0.1 dB performance gain compared to the traditional fast simplified successive cancellation filp (Fast-SSC-Flip) decoding algorithm, and has the same decoding performance as the new Fast-SSC-Flip (New-Fast-SSC-Flip) decoding algorithm. However, compared to the traditional flip set size K, the CSS size of the proposed algorithm is reduced by up to 79.5%, and compared to the critical set (CS), the set size can be reduced by up to 23.1%.… …   相似文献
《通信学报》2024,45(10):95-106
9455.
  
To solve the problem of low efficiency of entanglement distribution caused by quantum information easily lost in quantum channels, quantum s… …   相似文献
《通信学报》2024,45(10):69-80
9456.
  
Aiming at the problems of quantum computing attacks, high authentication overhead and long interaction time in satellite network access auth… …   相似文献
《通信学报》2024,45(10):17-30
9457.
  
Although the computing power network (CPN) can connect via the Internet and flexibly schedule computing resources, it still lacks intelligen… …   相似文献
《通信学报》2024,45(10):191-206
9458.
  
To address the significant issue of hidden terminal interference that severely impacted resource management in ultra-dense Internet of thing… …   相似文献
《通信学报》2024,45(10):243-252
9459.
  
《通信学报》2024,45(10):225-242
9460.
为了确保合成孔径雷达(SAR)自动目标识别(ATR)系统能够迅速适应新的应用环境,其必须具备快速学习新类的能力。目前的SAR ATR系统在学习新类时需要不断重复训练所有旧类样本,这会造成大量存储资源的浪费,同时识别模型无法快速更新。保留少量的旧类样例进行后续的增量训练是模型增量识… …   相似文献
[首页] « 上一页 [941] [942] [943] [944] [945] 946 [947] [948] [949] [950] [951] 下一页 » 末  页»