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

6th IEEE International Conference on Electronic Information and Communication Technology, ICEICT 2023

作者： Qi, Junwei Deng, Yuhao Wang, Qingchun Yang, Zhen Li, Yingsong College of Information and Communication Engineering Harbin Engineering University Harbin150001 China Shanghai Yanding Information Technology Co. Ltd. Shanghai201210 China College of Computer Science and Technology Harbin Engineering University Harbin150001 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education China

ISBN: (纸本)9798350399059

We present a no-reference image-quality - assessment algorithm based on active reasoning module. This algorithm has three modules: the feature extraction module, the active reasoning module, and the quality assessment module. The active reasoning module incorporates the generator component of the generative adversarial network and enhances its structure with the Res2Net architecture. By integrating this module into the backbone feature extraction network, we improve the receptive field of each convolutional layer, enabling the network to capture information at different scales of the image. To preserve the texture information of the image, we input the gradient map of the distorted image, the distorted image itself, and the image features generated by the generator into the quality assessment module, which has a multi-feature regression networks. This module establishes a mapping model from image-feature to image-quality scores. We conducted experimental analysis of this algorithm on three widely used public datasets, confirming the excellent performance and superiorities of the presented algorithm. The results validate the effectiveness of the designed algorithm and its ability to assess image quality accurately. © 2023 IEEE.

关键词： Image quality

来源：评论

学校读者我要写书评

暂无评论

Characterization of Plotkin-optimal two-weight codes over finite chain rings and related applications

arXiv

引用

arXiv 2023年

作者： Li, Shitao Shi, Minjia Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Mathematical Sciences Anhui University Hefei230601 China State Key Laboratory of Integrated Services Networks Xidian University Xi’an710071 China

Few-weight codes over finite chain rings are associated with combinatorial objects such as strongly regular graphs (SRGs), strongly walk-regular graphs (SWRGs) and finite geometries, and are also widely used in data storage systems and secret sharing schemes. The first objective of this paper is to characterize all possible parameters of Plotkin-optimal two-homogeneous weight regular projective codes over finite chain rings, as well as their weight distributions. We show the existence of codes with these parameters by constructing an infinite family of two-homogeneous weight codes. The parameters of their Gray images have the same weight distribution as that of the two-weight codes of type SU1 in the sense of Calderbank and Kantor (Bull Lond Math Soc 18: 97-122, 1986). Further, we also construct three-homogeneous weight regular projective codes over finite chain rings combined with some known results. Finally, we study applications of our constructed codes in secret sharing schemes and graph theory. In particular, infinite families of SRGs and SWRGs with non-trivial parameters are *** Codes 94B05, 05E30 Copyright © 2023, The Authors. All rights reserved.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Double-Local Conditional Probability Based Fast Calculation Method for Approximation Regions of Probabilistic Rough Sets

SSRN

引用

SSRN 2023年

作者： Xu, Yi Zhou, Meng Sun, Weikang School of Computer Science and Technology Anhui University Hefei230601 China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei230601 China

As an extended rough set model, the probabilistic rough sets can effectively process data with noise. How to effectively calculate three approximation regions, is a crucial issue of probability rough sets. Existing calculation methods for approximation regions are based on conditional probability, the time complexity is O(|U||U||C|). In order to improve the computing efficiency of three approximation regions of probabilistic rough sets, we propose a double-local conditional probability based fast calculation method. First, to improve the computational efficiency of equivalence class, we define the double-local equivalence class. Second, based on the double-local equivalence class, we define the double-local conditional probability. Finally, given the probability thresholds and a local equivalence class, the monotonicity of double-local conditional probability is proved, on this basis, a double-local conditional probability based fast calculation method for approximation regions of probabilistic rough sets is presented, and the time complexity is O(MAX(X||U||C|, |XC||U||C|)). Experimental results based on 12 datasets from UCI demonstrate the effectiveness of the proposed method. © 2023, The Authors. All rights reserved.

关键词： Equivalence classes

来源：评论

学校读者我要写书评

暂无评论

Spatio-Temporal Context Modeling for Road Obstacle Detection 1

引用

4th International Conference on Machine Learning for Cyber Security, ML4CS 2022

作者： Wu, Xiuen Wang, Tao Liang, Lingyu Li, Zuoyong Ching, Fum Yew College of Computer and Data Science Fuzhou University Fuzhou350108 China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou350108 China The Key Laboratory of Cognitive Computing and Intelligent Information Processing of Fujian Education Institutions Wuyi University Wuyishan354300 China School of Electronic and Information Engineering South China University of Technology Guangzhou510641 China Ministry of Education Key Laboratory of Computer Network and Information Integration Southeast University Nanjing211189 China Guangzhou510320 China Penang11800 Malaysia

ISBN: (数字)9783031200960

ISBN: (纸本)9783031200953

Road obstacle detection is an important problem for vehicle driving safety. In this paper, we aim to obtain robust road obstacle detection based on spatio-temporal context modeling. Firstly, a data-driven spatial context model of the driving scene is constructed with the layouts of the training data. Then, obstacles in the input image are detected via the state-of-the-art object detection algorithms, and the results are combined with the generated scene layout. In addition, to further improve the performance and robustness, temporal information in the image sequence is taken into consideration, and the optical flow is obtained in the vicinity of the detected objects to track the obstacles across neighboring frames. Qualitative and quantitative experiments were conducted on the Small Obstacle Detection (SOD) dataset and the Lost and Found dataset. The results indicate that our method with spatio-temporal context modeling is superior to existing methods for road obstacle detection. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Heterophilic Graph Representation Learning Based on Multi-Order Information Extraction and High and Low Pass Filters 10

Heterophilic Graph Representation Learning Based on Multi-Or...

引用

10th IEEE Smart World Congress, SWC 2024

作者： Wu, Ling Li, Xinyu Yang, Yingjie Guo, Kun Zhang, Qishan Fuzhou University College of Computer and Data Science Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing China De Montfort University School of Computer Science and Informatics Leicester United Kingdom Shanghai International Studies University College of Economics and Humanities Shanghai China

ISBN: (纸本)9798331520861

Real-world networks can be divided into homophilic and heterophilic graphs. Significantly, many nodes tend to be heterophilic in a homophilic graph. Graph representation learning in heterophilic graphs has attracted considerable significance in recent years as it breaks the homophily assumption and achieves higher-quality graph embeddings. However, existing heterophilic graph representation learning methods often mix attribute and topological information, neglecting the mutual exclusion between attribute information and topological information. Furthermore, algorithms in heterogeneous graphs usually rely on specific matrix structures to capture high-order information, which may restrict the applicability of these methods. To tackle these issues, this paper proposes a GNN-based strategy for Heterophilic graph Representation Learning based on Multi-order information extraction and High and Low pass filters (HRLMHL). First, we designed two relatively independent modules to learn attribute information and topological information, respectively, to address the issue of mismatch. Second, we built a multi-order information extraction module to extract multi-order similarity features, thereby achieving the learning of high-order graph information. Experiments on real datasets show that the node classification accuracy is superior to that of the state-of-the-art methods on most datasets. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Relaxing Distillation Constraints for Improved New Class Learning in Continual Semantic Segmentation

Relaxing Distillation Constraints for Improved New Class Lea...

引用

International Conference on Acoustics, Speech, and signal processing (ICASSP)

作者： Zheng Ti Xuze Hao Renhai Chen College of Intelligence and Computing Tianjin University Tianjin China School of Computer Science Shanghai Key Laboratory of Intelligent Information Processing Fudan University China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Continual Semantic Segmentation (CSS) aims to continuously learn new classes while mitigating catastrophic forgetting. Existing CSS methods primarily address this challenge through knowledge distillation. While they focus on maintaining stability for old classes, this emphasis often restricts plasticity in learning new ones. In this work, we propose two plug-and-play methods to better balance stability and plasticity. First, for feature map distillation, we replace pixel-level constraints with statistical information extraction within a window, improving the learning of new classes while preserving structural integrity to overcome forgetting. Second, we use relative ranks of predictions to replace exact probabilistic values to loosen the constraints in the logit distribution of old classes. Extensive experiments demonstrate that our methods outperform state-of-the-art methods when integrating into several baselines across various CSS scenarios.

关键词： Semantic segmentation Semantics signal processing Feature extraction Probabilistic logic Information retrieval Acoustics Data mining Speech processing

来源：评论

学校读者我要写书评

暂无评论

A Communication Protocol Identification Method Based on Time-Frequency Domain Combination for Internet of Things

A Communication Protocol Identification Method Based on Time...

引用

IEEE International Conference on Communications in China Workshops (ICCC)

作者： Zhiwei Zheng Hui Zhi Kui Tie Xianpeng Wang Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University School of Electronic and Information Engineering Anhui University Hefei China Zhongdian Kesiyi Technology (Anhui) Co. Ltd Bengbu China

ISBN: (数字)9798350377675

ISBN: (纸本)9798350377682

At present, Internet of Things (IoT) testing instruments and meters are unable to identify the communication protocol of communication data when all characteristic parameters of communication data are unknown. Regarding this problem, this paper utilizes the K-Nearest Neighbors (KNN) model in machine learning, designs communication protocol identification methods and proposes a communication protocol identification method based on time-frequency domain combination (CPI- TFC). First, we generate time-domain waveforms and frequency-domain waveforms from sampling communication data sequences, and attempt only time-domain identification method and only frequency-domain identification method based on KNN model. Then, we compare the results, design a communication protocol identification method based on the combination of time-domain identification and frequency domain identification, and propose CPI-TFC. Experimental results show that CPI-TFC can achieve higher identification accuracy than only time-domain identification method and only frequency-domain identification method, so it can effectively identify the communication protocol for a IoT communication data. Moreover, CPI- TFC can provide prior information for subsequent configuring parameters in IoT testing instruments, improve the parameter configuration efficiency.

关键词： Meters Time-frequency analysis Protocols Accuracy Simulation Machine learning Nearest neighbor methods Internet of Things Time-domain analysis Testing

来源：评论

学校读者我要写书评

暂无评论

A Study on the Recognition of Single-Word Tones of Yunnan Zhaotong Dialect Based on Speech signal Analysis

A Study on the Recognition of Single-Word Tones of Yunnan Zh...

引用

Language Technology and Digital Humanities (LTDH), International Conference on

作者： Hanyun Qi Shiliang Lyu Key Laboratory of Linguistic and Cultural Computing Ministry of Education Northwest Minzu University Key Laboratory of Minzu Language and Cultures Intelligent Information Processing Gansu Province Northwest Minzu University

ISBN: (数字)9798350380187

ISBN: (纸本)9798350380194

Zhaotong City is located in the northeast of Yunnan Province and used to be called “Zhuti County”. Due to the influence of population migration, the Zhaotong dialect has the characteristics of the northern dialect as well as its own unique features. Early research on the tones of Zhaotong dialect relied on traditional language survey methods. In this paper, we use modern methods of speech signal analysis to reanalyze the tones of Zhaotong dialect by means of spectral analysis of sound waveforms, resonance peak analysis, fundamental frequency extraction, etc. combined with the knowledge of experimental phonetics. It is concluded that the Zhaotong dialect consists of four tone categories, namely, Tone1, Tone2, Tone3, and Tone4. Among the single character tones, Tonel is characterized by a flat tonal pattern; Tone2 is characterized by a descending tonal pattern; Tone3 is characterized by a descending tonal pattern; and Tone4 is characterized by a zigzag tonal pattern.

关键词： Surveys Hands Fluctuations Urban areas Speech recognition Turning Registers Digital preservation Speech processing Spectral analysis

来源：评论

学校读者我要写书评

暂无评论

Acoustic Analysis of Long and Short Vowels of Eastern Yugur Language for Low Resource Speech Synthesis

Acoustic Analysis of Long and Short Vowels of Eastern Yugur ...

引用

Language Technology and Digital Humanities (LTDH), International Conference on

作者： Shiliang Lyu Hanyun Qi Yuwen Min Qianqian Ma Key Laboratory of Minzu Language and Cultures Intelligent Information Processing Northwest Minzu University Gansu Province Key Laboratory of Linguistic and Cultural Computing Ministry of Education Northwest Minzu University

ISBN: (数字)9798350380187

ISBN: (纸本)9798350380194

The articulation of long and short vowels is not only a change in duration, but also includes changes in the shape of the oral cavity to comprehensively affect the timbre. Since the low-resource phonetic data is very limited, especially the pronunciation of long and short vowels will be affected by the surrounding phonemes or syllables, which makes it difficult for the speech synthesis model to adequately learn and capture the differences of vowels, thus affecting the accuracy and naturalness of the synthesis of long and short vowels. The eastern Yugur language in China belongs to the Mongolian group of the Altaic language family, with an endangered language and limited phonetic resource data. If this endangered language is extinct, it can be restored through speech synthesis. In this article, we analyze the acoustics of long and short vowels in the Eastern Yugur language, and find out the differences in the distribution of acoustic parameters, as well as the differences in the parameters of males and females, so as to provide a reference for the synthesis of the Eastern Yugur language.

关键词： Time-frequency analysis Shape Resonant frequency Training data Phonetics Rhythm Resonance Acoustics Speech synthesis Timbre

来源：评论

学校读者我要写书评

暂无评论

Prediction of piRNA-mRNA interactions based on an interactive inference network

Prediction of piRNA-mRNA interactions based on an interactiv...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Liu, Yajun Li, Ru Li, Aimin Fei, Rong Guo, Xie Wu, Fang-Xiang Xi'an University of Technology Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an China Xi'an University of Technology Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi'an China University of Saskatchewan Division of Biomedical Engineering Department of Computer Science Department of Mechanical Engineering Saskatoon Canada

ISBN: (纸本)9798350337488

As the largest class of small non-coding RNAs, piRNAs primarily present in the reproductive cells of mammals, which influence post-transcriptional processes of mRNAs in multiple ways. Effective methods for predicting piRNA and mRNA target relationships can help identify piRNA functions, investigate the possibility of piRNAs as biomarkers and therapeutic targets. In this study, we propose a computational approach for classifying the relationships of piRNA-mRNA pairs based on an interactive inference network (IIN). First, we gather piRNA-mRNA target data, collect sequence data by position alignment, and construct a benchmark dataset. Furthermore, a reliable negative set is constructed by positive-unlabeled learning. Finally, we view a piRNA and a mRNA sequence as a premise and hypothesis sentence, respectively, and IIN model is used to predict the relationship between them. The experiments demonstrate that our method effectively characterizes piRNA-mRNA interaction and could be beneficial for researchers to investigate piRNA functions. © 2023 IEEE.

关键词： interactive inference network noncoding RNA piRNA-mRNA interactions positive-unlabeled learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：