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

arXiv 2023年

作者： Zhang, Qing-Hua He, Liang-Tian Wang, Yi-Lun Deng, Liang-Jian Liu, Jun Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Mathematical Sciences Anhui University Hefei230601 China Machinify Inc Palo AltoCA94301 United States School of Mathematical Sciences University of Electronic Science and Technology of China Chengdu611731 China Key Laboratory for Applied Statistics of MOE School of Mathematics and Statistics Northeast Normal University Changchun130024 China

Inspired by the fact that the matrix formulated by nonlocal similar patches in a natural image is of low rank, the rank approximation issue have been extensively investigated over the past decades, among which weighted nuclear norm minimization (WNNM) and weighted Schatten p-norm minimization (WSNM) are two prevailing methods have shown great superiority in various image restoration (IR) problems. Due to the physical characteristic of color images, color image restoration (CIR) is often a much more difficult task than its grayscale image counterpart. However, when applied to CIR, the traditional WNNM/WSNM method only processes three color channels individually and fails to consider their cross-channel correlations. Very recently, a quaternion-based WNNM approach (QWNNM) has been developed to mitigate this issue, which is capable of representing the color image as a whole in the quaternion domain and preserving the inherent correlation among the three color channels. Despite its empirical success, unfortunately, the convergence behavior of QWNNM has not been strictly studied yet. In this paper, on the one side, we extend the WSNM into quaternion domain and correspondingly propose a novel quaternion-based WSNM model (QWSNM) for tackling the CIR problems. Extensive experiments on two representative CIR tasks, including color image denoising and deblurring, demonstrate that the proposed QWSNM method performs favorably against many state-of-the-art alternatives, in both quantitative and qualitative evaluations. On the other side, more importantly, we preliminarily provide a theoretical convergence analysis, that is, by modifying the quaternion alternating direction method of multipliers (QADMM) through a simple continuation strategy, we theoretically prove that both the solution sequences generated by the QWNNM and QWSNM have fixed-point convergence guarantees. The source code of our algorithm can be downloaded at the website: https://***/qiuxuanzhizi/QWSNM. Copyr

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

Interactive Prototype Learning and Self-Learning for Few-Shot Medical Image Segmentation

SSRN

引用

SSRN 2024年

作者： Song, Yuhui Xu, Chenchu Wang, Boyan Du, Xiuquan Chen, Jie Zhang, Yanping Li, Shuo School of Computer Science and Technology Anhui University Hefei230601 China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei230601 China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei230051 China Department of Computer Science and Technology Tsinghua University Beijing100084 China School of Engineering Case Western Reserve University Cleveland44106 United States

Few-shot learning alleviates the heavy dependence of medical image segmentation tasks on large-scale labeled data, but it shows a strong performance gap when dealing with new targets and new tasks compared with traditional deep learning. Existing few-shot medical image segmentation models mainly realize segmentation by learning the semantic class knowledge of a few known (support) samples and extending it to unknown (query) samples. However, the neglect of the differences between known and unknown samples leads to a certain deviation in the transfer of class knowledge, and the trained model tends to overfit the class knowledge of training classes, which greatly reduces the segmentation and generalization performance of few-shot model. In this work, we propose an interactive prototype learning and self-learning network to alleviate the above problems. Specifically, we propose an interactive prototype learning network to promote feature consistency between support images and query images to improve the accuracy of prototype metric learning. In addition, to avoid overfitting the training class knowledge and reduce the over-dependence of query segmentation on the class knowledge, we introduce a query features-guided self-learning network to achieve the finer segmentation of query images through its rich feature information. Our model obtained the competitive segmentation results on three multi-organ and multi-modal public datasets that show a substantial improvement in generalization ability. © 2024, The Authors. All rights reserved.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

On the coset graph construction of distance-regular graphs

arXiv

引用

arXiv 2022年

作者： Shi, Minjia Krotov, Denis S. Solé, Patrick Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Mathematical Sciences Anhui University Hefei230601 China Sobolev Institute of Mathematics Novosibirsk630090 Russia I2M CNRS Centrale Marseille University of Aix-Marseille Marseille France

We show that no more new distance-regular graphs in the tables of the book of (Brouwer, Cohen, Neumaier, 1989) can be produced by using the coset graph of additive completely regular codes over finite *** Codes 05E30,... 详细信息

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Constructing MRD codes by switching

arXiv

引用

arXiv 2022年

作者： Shi, Minjia Krotov, Denis S. Özbudak, Ferruh Key Laboratory of Intelligent Computing Signal Processing Ministry of Education School of Mathematical Sciences Anhui University Anhui Hefei230601 China Sobolev Institute of Mathematics Novosibirsk630090 Russia Department of Mathematics Institute of Applied Mathematics Middle East Technical University Ankara Turkey

MRD codes are maximum codes in the rank-distance metric space on m-by-n matrices over the finite field of order q. They are diameter perfect and have the cardinality qm(n-d+1) if m ≥ n. We define switching in MRD codes as replacing special MRD subcodes by other subcodes with the same parameters. We consider constructions of MRD codes admitting such switching, including punctured twisted Gabidulin codes and direct-product codes. Using switching, we construct a huge class of MRD codes whose cardinality grows doubly exponentially in m if the other parameters (n, q, the code distance) are fixed. Moreover, we construct MRD codes with different affine ranks and aperiodic MRD *** Codes 94B25 Copyright © 2022, The Authors. All rights reserved.

关键词： Switching

来源：评论

学校读者我要写书评

暂无评论

Interblock-interference-free precoding using square-root decomposition for faster-than-Nyquist signaling

引用

Digital Communications and Networks 2025年

作者： Yan Wang Qiang Li Liping Li Yingsong Li Xingwang Li Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei 230601 China School of Physics and Electronic Information Engineering Henan Polytechnic University Jiaozuo China

Precodings using square-root decomposition, including Cholesky and G-To-Minus-Half (GTMH) precodings, are promising for eliminating the Faster-Than-Nyquist (FTN)-induced Intersymbol-Interference (ISI). However, the existing precodings using square-root decomposition either ignore Interblock-Interference (IBI) or increase the signal power, deteriorating the Bit Error Rate (BER) performance for high-order modulations and severe ISI. To overcome these drawbacks, we adopt two approaches for constructing the circular ISI matrix. The first approach inserts a Cyclic Prefix/Suffix (CPS) after each precoded symbol block, while the second approach replaces the linear convolution of the FTN shaping and the matched filter by the circular convolution, resulting in the Circular FTN (CFTN). Using these two approaches, we propose three IBI-free precodings, i.e., CPS-Cholesky, CFTN-Cholesky and CFTN-GTMH precodings. Furthermore, employing QR decomposition shows that the GTMH and Cholesky precodings can be converted interchangeably. Thus, we demonstrate that the GTMH precoding is essentially equivalent to the Cholesky precoding. Simulation results indicate that the BER performance of three IBI-free precodings approaches Nyquist performance for moderate ISI. However, as ISI intensifies, the CPS-Cholesky scheme increases the transmit power, causing BER performance degradation. In contrast, the CFTN-Cholesky and CFTN-GTMH precodings maintain optimal BER performance even for severe ISI. Considering 128-amplitude phase shift keying with a code rate of 1/2, the BER loss of CFTN-Cholesky and CFTN-GTMH precodings for the ideal BER of 10-5 is approximately 0.002 dB and 0.005 dB when packing factor is 0.7 and roll-off factor is 0.3. To the best knowledge of the authors, this is the optimal performance achievable through precoding.

关键词： Faster-than-Nyquist Intersymbol-interference Interblock-interference Bit error rate Precoding

来源：评论

学校读者我要写书评

暂无评论

Staggered Grid Scheme for the FFT-Based Methods

引用

Chinese Journal of Electronics 2019年第5期28卷 1066-1072页

作者： XIE Jiaye KONG Weibin PANG Lili SONG Weiju HUANG Zhixiang WU Xianliang Industrial Center Nanjing Institute of Technology State Key Laboratory of Millimeter Waves College of Information Engineering Yancheng Institute of Technology Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University

A staggered grid scheme is proposed to reduce both the total memory requirement and the CPU time of generating the corrected near matrix in the FFTbased methods. Two sets of Cartesian grids are used to project the source points and the field points, *** proposed method does not lower the efficiency of computing far matrix-vector products, compared with the traditional uniform Cartesian grid scheme. Some numerical experiments are provided to demonstrate both the correctness and the efficiency of the proposed method.

关键词： Green’s function Singularity RFG-FFT Staggered grid scheme Corrected near matrix

来源：评论

学校读者我要写书评

暂无评论

A Novel Compensation Inductance Structure for Suppressing Differential-to-Common Mode Conversion in Bended Differential Transmission Line 8

A Novel Compensation Inductance Structure for Suppressing Di...

引用

8th Asia-Pacific Conference on Antennas and Propagation, APCAP 2019

作者： Wang, Jiabao Sun, Yufa Zhu, Haoran Li, Fan Anhui University Key Lab of Intelligent Computing Signal Processing Ministry of Education Hefei230601 China

ISBN: (纸本)9781665400541

A novel compact compensation inductance structure optimized by genetic algorithm (GA) for right-angle bended transmission line is proposed to mitigate differential-to-common mode conversion noise in this paper. In comparison with the previous suppression method, high suppression level and large bandwidth are obtained with the proposed structure. Simultaneously, the differential return loss and insertion loss have been minimized by GA, leading to an overall improved signal integrity (SI). Furthermore, the proposed structure places inside the transmission line and does not occupy extra wiring space. Finally, the differential-to-common mode conversion can be prohibited from DC to 11 GHz with a suppression level of-23.13 dB. The measured results agree well with the simulated ones. © 2019 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Compact ultra-wideband MIMO antenna with double notch 8

Compact ultra-wideband MIMO antenna with double notch

引用

8th Asia-Pacific Conference on Antennas and Propagation, APCAP 2019

作者： Wang, Kang Sun, Yufa Anhui University Key Lab of Intelligent Computing Signal Processing Ministry of Education Hefei230601 China

ISBN: (纸本)9781665400541

In this paper, a compact multiple-input multiple-output (MIMO) antenna with two notches for wireless UWB applications is presented. The size of the proposed antenna is small, only 20 × 20 mm2. The radiating element of the antenna is a rectangular patch with a chamfered corner, and the inverted U-shaped slit on the patch is used to create the notches at wireless local area network and the downlink X-band of satellite communication. The isolation of more than 15 dB is achieved over the entire working frequency band (3.04-12.36 GHz). © 2019 IEEE.

关键词： Microwave antennas

来源：评论

学校读者我要写书评

暂无评论

A Novel Technique for Analyzing the Metasurface of Varying Element Sizes or Rotate Angles

A Novel Technique for Analyzing the Metasurface of Varying E...

引用

IEEE International Conference on Computational Electromagnetics (ICCEM)

作者： Huihui Li G. S. Cheng Bo Wu Z. X. Huang Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Auhui University China

ISBN: (数字)9781728134482

ISBN: (纸本)9781728134499

This paper presents an efficient method for analyzing the metasurface of varying element sizes or rotate angles. In this method, the characteristic modes (CMs) for metasurface element can be obtained by solving a generalized eigenvalue problem (GEP) based on the mixed potential integral equation (MPIE). Then, by choosing the first several CMs of the isolated reference element with larger mode significance (MS) to construct the entire domain basis functions, the induced current of the metasurface structure can be expanded using the set of entire domain basis functions. By truncating the order of the entire domain basis functions, this method can significantly reduce the number of unknowns and greatly reduce the computational time and memory requirement.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Two-Weight Codes and Second Order Recurrences

引用

Chinese Journal of Electronics 2019年第6期28卷 1127-1130页

作者： SHI Minjia ZHANG Zhongyi SOLé Patrick Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Mathematical Sciences Anhui University School of Wendian Anhui University Aix Marseille Univ CNRS Centrale Marseile

Cyclic codes of dimension 2 over a finite field are shown to have at most two nonzero weights. We compute their weight distribution, and give a condition on the roots of their check polynomials for them to be maximum ... 详细信息

关键词： Two-weight codes Irreducible Cyclic codes MDS codes Linear recurrences

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：