ID 原文 译文
21795 首先结合AFS算法，利用识别特征来衡量更合适的数据成对相似性，生成更强大的亲合矩阵； Firstly, AFS algorithm is combined to measure the similarity of more suitable data by recognizing features, and the stronger affinity matrix is generated.
21796 再有效地利用Nyström采样算法，计算采样点间以及采样点和剩余点间的相似度矩阵去降低计算的复杂度； Then Nyströmsampling algorithm is used to calculate the similarity matrix between the sampling points and the sampling points and the remaining points to reduce the computational complexity.
21797 最后通过在不同数据集以及图像分割上进行实验，证明了提出算法的有效性。 Finally, the experiment is carried out by using different data sets and image segmentations, the effectiveness of the proposed algorithm are proved.
21798 由于卷积码序列的 0,1 bit 的概率几乎均衡，对于卷积码自同步加扰的扰码盲识别，现有的基于输入序列0, 1 bit 概率不均衡性的识别方法均已失效，为此该文提出一种新的自同步扰码盲识别方法。 Since the probability bias between 0 and 1 bit in a convolutional code sequence is very small, the existing method based on the probability bias in the input sequence is ineffective for the identification of a self-synchronous scrambler placed after a convolutional encoder. To solve this problem, a novel method for the blind identification of a self-synchronous scrambler is proposed.
21799 首先将卷积码自同步加扰序列进行分块处理，通过加扰数据块与卷积码校验向量相乘产生新的序列； First, the scrambled convolutional code sequence is divided into blocks, and a new bit sequence is generated, in which each bit is the dot product of a scrambled bit block with a parity check vector of the convolutional code.
21800 然后以最大化新生成序列间线性约束关系成立概率为准则，利用解调输出的软判决序列建立自同步扰码反馈多项式系数的代价函数； Second, based on the criteria of maximizing the probability that the linear equations in the generated bits hold, the cost function of the feedback polynomial coefficients of the self-synchronous scrambler is established using the soft decision sequence, which is the output of the demodulator.
21801 最后根据自同步扰码反馈多项式的项数特点，在求解代价函数时改进了动态搜索烟花算法，增加了对烟花个体元素值的约束操作，由求解出的参量值识别出自同步扰码反馈多项式。 Third, according to the characteristic of the number of terms in the feedback polynomial, the dynamic fireworks algorithm is modified by constraining the values of elements in fireworks, and the cost function is optimized using the modified dynamic fireworks algorithm.
21802 仿真实验验证了所提方法的有效性，该方法无需遍历搜索反馈多项式，且具有较好的鲁棒性，所需数据量小，随着数据量的增大和扰码阶数的降低，其识别正确率逐渐提高。 Simulation experiments show the effectiveness of the proposed algorithm. There is no need to search for the feedback polynomial exhaustively in the proposed algorithm. It is robust to the noise and the number of data required is small. Moreover, along with the increase of the number of received data or the decrease of the order of the feedback polynomial, the correct identification ratio of the proposed method increases.
21803 荧光素眼底血管造影技术(FFA)是眼底疾病诊断的金标准，但是造影过程中病人不可避免地转动眼球，造成FFA图像序列中感兴趣区域(例如视网膜血管分支、新生血管)的位置发生变化，给后续的图像定量分析与病情准确评估诊断带来困难。 Fluorescein Fundus Angiography (FFA) is regarded as the golden diagnostic criteria for fundus diseases. However, dislocation or rotation of the interested images on anatomic landmark (like retinal vascular branches, neovascularization), caused by inevitable eyeball movement, brings about difficulties in subsequent quantitative analysis and progress assessment of the diseases.
21804 针对上述问题，该文提出一种基于互信息的FFA图像序列配准方法。 In order to solve the above problems, a novel method based on mutual information is proposed for automatic registration of FFA image sequence.