Currently, Graph Neural Networks have been extended to the field of speech signal processing. It is the more compact and flexible way to represent speech sequences by graphs. However, the structures of the relationships in recent studies are tend to be relatively uncomplicated. Moreover, the graph convolution module exhibits limitations that impede its adaptability to intricate application scenarios. In this study, we establish the speech-graph using feature similarity and introduce a novel architecture for graph neural network that leverages an LSTM aggregator and weighted pooling. The unweighted accuracy of 65.39% and the weighted accuracy of 71.83% are obtained on the IEMOCAP dataset, achieving the performance comparable to or better than existing graph baselines. This method can improve the interpretability of the model to some extent, and identify speech emotion features effectively.

Many countries across the globe face the serious issue of traffic congestion. This paper presents a low-cost graph-based traffic forecasting and congestion detection framework using online images from multiple cameras. The advantage of using a graph neural network (GNN) for traffic forecasting and detection is that it represents the traffic network in a natural way. This framework requires only images from surveillance cameras without any other sensors. It converts the online images into two types of data: traffic volume and image-based traffic occupancy. A clustering-based graph construction method is proposed to build a graph based on the traffic network. For traffic forecasting, multiple models, including statistical models and deep graph convolutional neural networks (GCNs), are used and compared using the extracted data. The framework uses logistic regression to determine the threshold of traffic congestion. In the experiment, we found that the Decoupled Dynamic Spatial-Temporal Graph Neural Network (D2STGNN) model achieved the best performance on the collected dataset. We also propose a threshold-based method for detecting traffic congestion using traffic volume and image-based traffic occupancy. This framework provides a low-cost solution for traffic forecasting and congestion detection when only surveillance images are available.

To address the problem that existing quantum image watermarking schemes have only a single watermarking mode with weak robustness, in this paper we propose a novel Multi-Modal Quantum Watermarking (MMQW) scheme using the generalized model of novel enhanced quantum representation. Our scheme provides four quantum watermarking modes (G_G, G_C, C_C, C_G), covering both types of grayscale and color images for the watermark and the carrier image. To enhance the robustness, we propose the Block Bit-plane Centrosymmetric Expansion (BBCE) method, which utilizes controlled quantum gates to extend the watermark, making our method resistant to noise and geometric attacks. Moreover, we propose a Brightness-based Watermarking Mechanism (BWM) for embedding and extraction. By uniform embedding, BWM not only minimizes the impact on the carrier image but also reduces the visual distortion of the extracted watermark. In the proposed MMQW, we implement three adaptive embedding strategies using controlled quantum gates, each of which is adaptively triggered according to the corresponding modalities. Detailed quantum circuits for quantum computing are provided. To evaluate imperceptibility and robustness of the MMQW, we conduct experiments using high-resolution images from the USC-SIPI dataset. The results show that PSNR of the watermarked image ranges from 36 dB to 56 dB, indicating the high visual quality. The PSNR of the extracted watermark is about 34 dB when the noise density is 0.05, while the PSNR is higher than 48 dB under common quantum rotation attacks, which indicate the high robustness against noise addition and geometric attacks. In addition, the proposed MMQW can resist to cropping attack with cropping percentage up to 55%. A comprehensive comparison with existing state-of-the-art works shows that our method has significant advantages.

A long sequence always contains long‐term dependency problems, which leads to paragraph‐based sentiment analysis being a very challenging task and difficult to evaluate by using a simple RNN network. It is proposed in this letter to use a stacked CARU network to extract the main information in a paragraph. The resulting network also points out how to use a CNN‐based extractor to explore complete passages and capture useful features in their hidden state. In particular, instead of using the Softmax function, the Naïve‐Bayes classifier is connected to the end of the CNN‐based extractor. The proposed models also take into account the conditional independence of the observed results under the hidden variables, which aims to project features into a probability distribution appreciated for its simplicity and interpretability. The advantages of these models in sentiment analysis are empirically investigated by combining the usual classifiers with the results of GloVe embedding on the SST‐5 and IMDB datasets.

Discrete orthogonal matrices have applications in information coding and cryptography. It is often challenging to generate discrete orthogonal matrices. A common approach widely in use is to discretize continuous orthogonal functions that have been discovered. The need of such continuous functions is restrictive. Polynomials, as the simplest class of continuous functions, are widely studied for their orthogonality, to serve the purpose of generating orthogonal matrices. However, beginning with continuous orthogonal polynomials still takes much work. To overcome this complexity while improving the efficiency and flexibility, we present a general method for generating orthogonal matrices directly through the construction of certain even and odd polynomials from a set of distinct positive values, bypassing the need of continuous orthogonal functions. We present a constructive proof by induction that not only asserts the existence of such polynomials, but also tells how to iteratively construct them. Besides the derivation of the method as simple as a few nested loops, we discuss two well-known discrete transforms, the Discrete Cosine Transform and the Discrete Tchebichef Transform, about how they can be achieved using our method with the specific values, and how to embed them into the transform module of video coding. By the same token, we also give the examples for generating new orthogonal matrices from arbitrarily chosen values. The demonstrative experiments indicate that our method is not only simpler to implement, but also more efficient and flexible. It can generate orthogonal matrices of larger sizes, compared with those existing methods.