Research on image segmentation of Miao costume patterns based on the RSKP-UNet model北大核心CSCD

The Miao nationality is the sixth largest ethnic group in China which has a history of thousands of years. It has created a unique material culture and spiritual culture in its development process and the Miao costume is a highly condensed collection of the material and spiritual culture of the Miao nationality. As one of the unique symbols of Miao culture the Miao costume has profound cultural heritage and cultural connotations. The patterns of the Miao costume are particularly eye-catching as they not only symbolize the wisdom of the Miao people in thousands of years of production and life but also symbolize the pursuit of the good spirit of the Miao people. However under the impact of modern pop culture and foreign culture these cultural symbols are gradually disappearing. In order to protect and inherit them the Miao costume pattern segmentation has become the most important work. However the Miao costume pattern segmentation is quite difficult. At present there are few studies on the extraction classification identification and preservation of the features of Miao costume pattern segmentation. With the excellent segmentation performance of the U-Net model and the advantages of easy deployment the paper improves the basic structure of the U-Net model and proposes a Miao costume pattern segmentation algorithm based on the RSKP-UNet Residual Selective-Kernel Parallel U-Net model. The algorithm adds Residual modules in the encoder part of the U-Net model to improve the feature extraction capability of the model and embeds the SKNet modules and ParNet modules in the decoder part to enhance the feature expression capability of the model. The paper uses evaluation metrics to measure the segmentation performance of the model and compares it with four segmentation models based on deep learning. The paper not only combines the current research focus-deep learning and attention mechanism but also introduces the Lovász-hinge loss function to effectively solve the problem of class imbalance in the Miao costume patterns. The RSKP-UNet model is better than other models in various segmentation indicators. Compared with the benchmark model U-Net the Dice coefficient IoU precision recall and accuracy are improved by 6. 98% 11. 07% 2. 89% 6. 75% and 3. 92% . The segmentation algorithm proposed in this paper realizes the extraction of the element content of the Miao costume patterns through image segmentation of Miao costume patterns which can be used to build the Miao costume pattern database in this way thus helping designers relevant researchers and organizations to provide research foundation and completing the protection and inheritance of the Miao costume culture. The paper also provides some reference for the segmentation research of other minority costume patterns. © 2022 Authors. All rights reserved.     

全变分极端通道先验的盲图像去噪去模糊

图像先验是图像复原中求解不适定问题的关键。针对在图像具有显著噪声时,极端通道先验去模糊算法容易产生振铃伪影和无法抑制噪声的缺点,利用全变分模型可以同时抑制噪声和保护边缘的优势,提出一种有效的全变分极端通道先验的盲图像去噪和去模糊模型。首先,将全变分模型分别引入暗通道和亮通道中,用于保护图像的边缘及消除噪声或振铃伪影;其次,利用半二次分裂技术解决模型的非凸问题和估计潜在的清晰图像;最后,用迭代多尺度盲反褶积估计图像的模糊核。实验结果表明,该算法能够在抑制噪声的同时很好地保护图像的边缘细节和消除振铃伪影。相比近几年具有代表性的其他方法,该模型的鲁棒性、主观视觉效果和客观评价指标均有明显提高。     

v-软间隔罗杰斯特回归分类机

坐标下降(Coordinate Descent, CD)方法是求解大规模数据分类问题的有效方法,具有简单操作流程和快速收敛速率。为了提高罗杰斯特回归分类器(Logistic Regression Classifier, LRC)的泛化性能,受v-软间隔支持向量机的启发,该文提出一种v-软间隔罗杰斯特回归分类机(v-Soft Margin Logistic Regression Classifier, v-SMLRC),证明了v-SMLRC对偶为一等式约束对偶坐标下降CDdual并由此提出了适合于大规模数据的v-SMLRC-CDdual。所提出的v-SMLRC-CDdual既能最大化类间间隔,又能有效提高LRC的泛化性能。大规模文本数据集实验表明,v-SMLRC-CDdual分类性能优于或等同于相关方法。     

基于矩阵补全的自适应去雨雪算法

传统去雨雪方法通常没有考虑参数的自适应问题。为了提高视频去雨雪的效果,在Kim方法的矩阵补全模型中添加了一个自适应参数并提出了基于矩阵补全的自适应去雨雪算法。首先,简要地描述Kim方法的主要工作;其次,把自适应参数添加到经典的Kim模型的第二项;最后,使用各种雨雪视频验证了该参数的有效性及优异性,并使用网格搜索法找到去雨效果最好的参数。实验结果表明,添加的自适应参数能够有效地去除视频中的雨雪。     

熵指数约束的模糊聚类新算法

针对基于模糊C均值聚类(fuzzy C-means,FCM)算法框架的竞争聚集聚类(competitive agglomeration,CA)算法中模糊指数m被限定为2的问题,提出了一种更为普适的模糊聚类新算法.该算法首先在FCM算法框架的基础上引入熵指数约束条件,构造了基于熵指数约束的模糊C均值聚类(entropy index constraint FCM,EIC-FCM)算法,成功地将模糊指数m1的约束条件转换为熵指数0r1的约束条件,经分析该算法具备与经典FCM算法等效的聚类性能.其后进一步在EIC-FCM算法的框架下融入竞争学习机制得到基于熵指数约束的竞争聚集聚类(entropy index constraint CA,EICCA)算法,该算法由于使用(0,1)范围的熵指数约束而不再受到模糊指数仅为2的限制,增强了算法的适应性且更具普适性的特征.在模拟数据集以及UCI数据集上的实验结果同样表明,EICCA方法较之经典的CA算法性能更为优越,参数的选择更为灵活.     

面向学生产出的焊接实训现代化教学体系建设

以学生能力培养为导向,分析了焊接实训教学过程中存在的常见问题.依托贵州民族大学焊接技术实训项目,结合学生能力目标培养体系,从"云工训"平台建设、"七步循环"实践教学方法、能力目标考核方案和推行"7S"管理制度4个方面构建了现代化实践教学体系,形成了更加科学、明晰的人才培养方案,提高了人才培养的目标达成度、质保有效度和结果满意度.     

优化的模糊C均值聚类在民族服饰图像分割中的应用

图像分割是图像处理和图像识别领域的重要研究内容之一.目前成熟的分割算法中,对于具有纹理、背景复杂或受噪声污染的图像分割效果不佳.针对这些问题,在模糊C均值聚类算法基础上,Lei等人[1]提出了一种快速鲁棒的模糊C均值算法(Fast and Robust Fuzzy C-means Clustering Algorith...     

改进BPDN的图像去雨雪应用研究

在视频图像数据采集时,往往受到天气等因素的影响,为进一步研究视频图像数据的主要信息增加了困难。雨、雪天气作为视频图像数据预处理中最为困难的研究,近几年一直是各学者研究的课题。针对传统基追踪去噪（BPDN）算法没有考虑雨、雪图像的局部特征问题,提出一种基于改进BPDN的图像去雨雪算法。将局部特征约束理论引入图像去雨雪中,主要是在精炼雨图提取的稀疏系数优化问题求解中加入训练图像数据的局部信息,以达到提高雨线的识别,进而提高图像的雨线去除效果。引入局部信息的优化问题可以推导为二次规划问题,为使用BPDN算法提供了理论支持。合成和真实图像去雨实验结果表明,改进的BPDN算法在算法收敛性、精炼雨图识别、图像去雨效果上优于传统BPDN算法所得到的结果。     

Asianux 3中实现DHCP服务器的构建

DHCP(动态主机配置协议)可以使客户端自动从服务器得到一个IP地址.本文通过对DHCP的工作原理进行研究,在目前最新的红旗Linux Asianux 3下构建DHCP服务器.     

基于非局部空间约束的可靠性核FCM算法的图像分割

针对图像易受到噪声破坏的现象,导致传统的模糊C均值(fuzzy c-means, FCM)算法分割效果差的问题,提出基于非局部空间约束的可靠性核FCM算法,旨在有效的去除噪声干扰和保留图像细节。首先在FCM的目标函数中引入了一个非局部空间约束项,并在此基础上利用一个正则化参数来增强图像细节保留的能力;其次引入一个不确定性的聚类模型,以降低噪声点和边缘点的影响;最后使用高斯核距离代替欧氏距离,进一步提高算法对噪声的鲁棒性。利用含噪声的合成图像、自然图像和遥感图像进行实验,结果表明所提算法的抗噪性能较好,同时也能保留更多的图像细节。其中,对于被高斯噪声和椒盐噪声破坏的灰度图像,所提算法的平均精度分别为99.92%和99.97%,提高了4.02%和1.47%。