Search

Stuttering is a neurodevelopmental speech disorder characterized by common speech symptoms such as pauses, exclamations, repetition, and prolongation. Speech-language pathologists typically assess the type and severity of stuttering by observing these symptoms. Many effective end-to-end methods exist for stuttering detection, but a commonly overlooked challenge is the uncertain relationship between tasks involved in this process. Using a suitable multi-task strategy could improve stuttering detection performance. This paper presents a novel stuttering event detection model designed to help speech-language pathologists assess both the type and severity of stuttering. First, the Conformer model extracts acoustic features from stuttered speech, followed by a Long Short-Term Memory (LSTM) network to capture contextual information. Finally, we explore multi-task learning for stuttering and propose an effective multi-task strategy. Experimental results show that our model outperforms current state-of-the-art methods for stuttering detection. In the SLT 2024 Stuttering Speech Challenge based on the AS-70 dataset [1], our model improved the mean F1 score by 24.8% compared to the baseline method and achieved first place. On this basis, we conducted relevant extensive experiments on LSTM and multi-task learning strategies respectively. The results show that our proposed method improved the mean F1 score by 39.8% compared to the baseline method., Comment: 7 pages, 3 figures, 7 tables

Brain-inspired spiking neuron networks (SNNs) have attracted widespread research interest due to their low power features, high biological plausibility, and strong spatiotemporal information processing capability. Although adopting a surrogate gradient (SG) makes the non-differentiability SNN trainable, achieving comparable accuracy for ANNs and keeping low-power features simultaneously is still tricky. In this paper, we proposed an energy-efficient spike-train level spiking neural network with spatio-temporal conversion, which has low computational cost and high accuracy. In the STCSNN, spatio-temporal conversion blocks (STCBs) are proposed to keep the low power features of SNNs and improve accuracy. However, STCSNN cannot adopt backpropagation algorithms directly due to the non-differentiability nature of spike trains. We proposed a suitable learning rule for STCSNNs by deducing the equivalent gradient of STCB. We evaluate the proposed STCSNN on static and neuromorphic datasets, including Fashion-Mnist, Cifar10, Cifar100, TinyImageNet, and DVS-Cifar10. The experiment results show that our proposed STCSNN outperforms the state-of-the-art accuracy on nearly all datasets, using fewer time steps and being highly energy-efficient., Comment: Accepted by Neurocomputing on 10 August 2024

In this paper, we introduce the Grassmann tensor by tensor product of vectors and some basic terminology in tensor theory. Some basic properties of the Grassmann tensors are investigated and the tensor language is used to rewrite some relations and correspondences in the mutliview geometry. Finally we show that a polytope in the Euclidean space $\R^{n}$ can also be concisely expressed as the Grassmann tensor generated by its vertices., Comment: 17 pages

Spiking neural network (SNN) is a brain-inspired model which has more spatio-temporal information processing capacity and computational energy efficiency. However, with the increasing depth of SNNs, the memory problem caused by the weights of SNNs has gradually attracted attention. Inspired by Artificial Neural Networks (ANNs) quantization technology, binarized SNN (BSNN) is introduced to solve the memory problem. Due to the lack of suitable learning algorithms, BSNN is usually obtained by ANN-to-SNN conversion, whose accuracy will be limited by the trained ANNs. In this paper, we propose an ultra-low latency adaptive local binary spiking neural network (ALBSNN) with accuracy loss estimators, which dynamically selects the network layers to be binarized to ensure the accuracy of the network by evaluating the error caused by the binarized weights during the network learning process. Experimental results show that this method can reduce storage space by more than 20 % without losing network accuracy. At the same time, in order to accelerate the training speed of the network, the global average pooling(GAP) layer is introduced to replace the fully connected layers by the combination of convolution and pooling, so that SNNs can use a small number of time steps to obtain better recognition accuracy. In the extreme case of using only one time step, we still can achieve 92.92 %, 91.63 % ,and 63.54 % testing accuracy on three different datasets, FashionMNIST, CIFAR-10, and CIFAR-100, respectively.

Spiking neural networks (SNNs), as one of the brain-inspired models, has spatio-temporal information processing capability, low power feature, and high biological plausibility. The effective spatio-temporal feature makes it suitable for event streams classification. However, neuromorphic datasets, such as N-MNIST, CIFAR10-DVS, DVS128-gesture, need to aggregate individual events into frames with a new higher temporal resolution for event stream classification, which causes high training and inference latency. In this work, we proposed a spatio-temporal compression method to aggregate individual events into a few time steps of synaptic current to reduce the training and inference latency. To keep the accuracy of SNNs under high compression ratios, we also proposed a synaptic convolutional block to balance the dramatic change between adjacent time steps. And multi-threshold Leaky Integrate-and-Fire (LIF) with learnable membrane time constant is introduced to increase its information processing capability. We evaluate the proposed method for event streams classification tasks on neuromorphic N-MNIST, CIFAR10-DVS, DVS128 gesture datasets. The experiment results show that our proposed method outperforms the state-of-the-art accuracy on nearly all datasets, using fewer time steps.

In this paper, we first introduce the invertibility of even-order tensors and the separable tensors, including separable symmetry tensors and separable anti-symmetry tensors, defined respectively as the sum and the algebraic sum of rank-1 tensors generated by the tensor product of some vectors, say, $v_{1}, v_{2}, \ldots, v_{m}$. We show that the $m!$ sumrands, each in form $v_{\sigma(1)}\times v_{\sigma(2)}\times\ldots\times v_{\sigma(m)}$, are linearly independent if $v_{1},v_{2}, \ldots, v_{m}$ are linearly independent, where $\sigma$ is any permutation on $\set{1,2,\ldots,m}$. We offer a class of tensors to achieve the upper bound for $\rank(A) \leq 6$ for all $A\in R^{3\times 3\times 3}$. We also show that each $3\times 3\times 3$ anti-symmetric tensor is separable., Comment: 18 pages, 0 figures

As a fundamental yet challenging problem in intelligent transportation systems, point cloud registration attracts vast attention and has been attained with various deep learning-based algorithms. The unsupervised registration algorithms take advantage of deep neural network-enabled novel representation learning while requiring no human annotations, making them applicable to industrial applications. However, unsupervised methods mainly depend on global descriptors, which ignore the high-level representations of local geometries. In this paper, we propose to jointly use both global and local descriptors to register point clouds in a self-supervised manner, which is motivated by a critical observation that all local geometries of point clouds are transformed consistently under the same transformation. Therefore, local geometries can be employed to enhance the representation ability of the feature extraction module. Moreover, the proposed local descriptor is flexible and can be integrated into most existing registration methods and improve their performance. Besides, we also utilize point cloud reconstruction and normal estimation to enhance the transformation awareness of global and local descriptors. Lastly, extensive experimental results on one synthetic and three real-world datasets demonstrate that our method outperforms existing state-of-art unsupervised registration methods and even surpasses supervised ones in some cases. Robustness and computational efficiency evaluations also indicate that the proposed method applies to intelligent vehicles.

Spiking neural networks (SNNs) can utilize spatio-temporal information and have a nature of energy efficiency which is a good alternative to deep neural networks(DNNs). The event-driven information processing makes SNNs can reduce the expensive computation of DNNs and save a lot of energy consumption. However, high training and inference latency is a limitation of the development of deeper SNNs. SNNs usually need tens or even hundreds of time steps during the training and inference process which causes not only the increase of latency but also the waste of energy consumption. To overcome this problem, we proposed a novel training method based on backpropagation (BP) for ultra-low latency(1-2 time steps) SNN with multi-threshold. In order to increase the information capacity of each spike, we introduce the multi-threshold Leaky Integrate and Fired (LIF) model. In our proposed training method, we proposed three approximated derivative for spike activity to solve the problem of the non-differentiable issue which cause difficulties for direct training SNNs based on BP. The experimental results show that our proposed method achieves an average accuracy of 99.56%, 93.08%, and 87.90% on MNIST, FashionMNIST, and CIFAR10, respectively with only 2 time steps. For the CIFAR10 dataset, our proposed method achieve 1.12% accuracy improvement over the previously reported direct trained SNNs with fewer time steps.

In this paper, a novel machine learning regression based single event transient (SET) modeling method is proposed. The proposed method can obtain a reasonable and accurate model without considering the complex physical mechanism. We got plenty of SET current data of SMIC 130nm bulk CMOS by TCAD simulation under different conditions (e.g. different LET and different drain bias voltage). A multilayer feedfordward neural network is used to build the SET pulse current model by learning the data from TCAD simulation. The proposed model is validated with the simulation results from TCAD simulation. The trained SET pulse current model is implemented as a Verilog-A current source in the Cadence Spectre circuit simulator and an inverter with five fan-outs is used to show the practicability and reasonableness of the proposed SET pulse current model for circuit-level single-event effect (SEE) simulation.

The recent discovery and realizations of higher-order topological insulators enrich the fundamental studies on topological phases. Here, we report three-dimensional (3D) wave-steering capabilities enabled by topological boundary states at three different orders in a 3D phononic crystal with nontrivial bulk topology originated from the synergy of mirror symmetry of the unit cell and a non-symmorphic glide symmetry of the lattice. The multitude of topological states brings diverse possibility of wave manipulations. Through judicious engineering of the boundary modes, we experimentally demonstrate two functionalities at different dimensions: 2D negative refraction of sound wave enabled by a first-order topological surface state with negative dispersion, and a 3D acoustic interferometer leveraging on second-order topological hinge states. Our work showcases that topological modes at different orders promise diverse wave steering applications across different dimensions.

We report a realization of three-dimensional (3D) electromagnetic void space. Despite occupying a finite volume of space, such a medium is optically equivalent to an infinitesimal point where electromagnetic waves experience no phase accumulation. The 3D void space is realized by constructing all-dielectric 3D photonic crystals such that the effective permittivity and permeability vanish simultaneously, forming a six-fold Dirac-like point with Dirac-like linear dispersions at the center of the Brillouin Zone. We demonstrate, both theoretically and experimentally, that such a 3D void space exhibits unique properties and rich functionalities absent in any other electromagnetic media, such as boundary-control transmission switching and 3D perfect wave-steering mechanisms. Especially, contrary to the photonic "doping" effect in its two-dimensional counterpart, the 3D void space exhibits an amazing property of "impurity-immunity". Our work paves a road towards the realization of 3D void space where electromagnetic waves can be manipulated in unprecedented ways.

Point cloud recognition is an essential task in industrial robotics and autonomous driving. Recently, several point cloud processing models have achieved state-of-the-art performances. However, these methods lack rotation robustness, and their performances degrade severely under random rotations, failing to extend to real-world scenarios with varying orientations. To this end, we propose a method named Self Contour-based Transformation (SCT), which can be flexibly integrated into various existing point cloud recognition models against arbitrary rotations. SCT provides efficient rotation and translation invariance by introducing Contour-Aware Transformation (CAT), which linearly transforms Cartesian coordinates of points to translation and rotation-invariant representations. We prove that CAT is a rotation and translation-invariant transformation based on the theoretical analysis. Furthermore, the Frame Alignment module is proposed to enhance discriminative feature extraction by capturing contours and transforming self contour-based frames into intra-class frames. Extensive experimental results show that SCT outperforms the state-of-the-art approaches under arbitrary rotations in effectiveness and efficiency on synthetic and real-world benchmarks. Furthermore, the robustness and generality evaluations indicate that SCT is robust and is applicable to various point cloud processing models, which highlights the superiority of SCT in industrial applications., Comment: 13 pages, 11 figures

A random vector $\bx\in \R^n$ is a vector whose coordinates are all random variables. A random vector is called a Gaussian vector if it follows Gaussian distribution. These terminology can also be extended to a random (Gaussian) matrix and random (Gaussian) tensor. The classical form of an $k$-order moment (for any positive integer $k$) of a random vector $\bx\in \R^n$ is usually expressed in a matrix form of size $n\times n^{k-1}$ generated from the $k$th derivative of the characteristic function or the moment generating function of $\bx$ , and the expression of an $k$-order moment is very complicate even for a standard normal distributed vector. With the tensor form, we can simplify all the expressions related to high order moments. The main purpose of this paper is to introduce the high order moments of a random vector in tensor forms and the high order moments of a standard normal distributed vector. Finally we present an expression of high order moments of a random vector that follows a Gaussian distribution., Comment: 18 pages,0 figures

Spiking neural networks (SNNs) are the third generation of neural networks and can explore both rate and temporal coding for energy-efficient event-driven computation. However, the decision accuracy of existing SNN designs is contingent upon processing a large number of spikes over a long period. Nevertheless, the switching power of SNN hardware accelerators is proportional to the number of spikes processed while the length of spike trains limits throughput and static power efficiency. This paper presents the first study on developing temporal compression to significantly boost throughput and reduce energy dissipation of digital hardware SNN accelerators while being applicable to multiple spike codes. The proposed compression architectures consist of low-cost input spike compression units, novel input-and-output-weighted spiking neurons, and reconfigurable time constant scaling to support large and flexible time compression ratios. Our compression architectures can be transparently applied to any given pre-designed SNNs employing either rate or temporal codes while incurring minimal modification of the neural models, learning algorithms, and hardware design. Using spiking speech and image recognition datasets, we demonstrate the feasibility of supporting large time compression ratios of up to 16x, delivering up to 15.93x, 13.88x, and 86.21x improvements in throughput, energy dissipation, the tradeoffs between hardware area, runtime, energy, and classification accuracy, respectively based on different spike codes on a Xilinx Zynq-7000 FPGA. These results are achieved while incurring little extra hardware overhead.

The main purpose of this paper is to introduce the random tensor with normal distribution, which promotes the matrix normal distribution to a higher order case. Some basic knowledge on tensors are introduced before we focus on the random tensors whose entries follow normal distribution. The random tensor with standard normal distribution(SND) is introduced as an extension of random normal matrices. As a random multi-array deduced from an affine transformation on a SND tensor, the general normal random tensor is initialised in the paper. We then investigate some equivalent definitions of a normal tensor and present the description of the density function, characteristic function, moments, and some other functions related to a random matrix. A general form of an even-order multi-variance tensor is also introduced to tackle a random tensor. Finally some equivalent definitions for the tensor normal distribution are described., Comment: 26 pages

We report a design and experimental realization of a three-dimensional (3D) acoustic double-zero-index medium (DZIM), whose effective mass density and compressibility are nearly zero simultaneously. The DZIM is constructed from a cubic lattice of three orthogonally-aligned metal rods in air. The combination of lattice symmetry and accidental degeneracy yields a four-fold degenerate point with conical dispersion at the Brillouin zone center, where the material becomes a 3D DZIM. Though occupying a finite volume, the 3D DZIM maintains the wave properties of a "void space," and enables rich applications. For demonstration, we fabricate an acoustic "periscope" by placing the designed 3D DZIM inside a 3D bending waveguide, and observe the unusual wave tunneling effect through this waveguide with undisturbed planar wavefront. Our findings establish a practical route to realize 3D DZIM as an effective acoustic "void space," which offers unprecedented opportunities for advanced sound manipulation.

The commutation matrix was first introduced in statistics as a transposition matrix by Murnaghan in 1938. In this paper, we first investigate the commutation matrix which is employed to transform a matrix into its transpose. We then extend the concept of the commutation matrix to commutation tensor and use the commutation tensor to achieve the unification of the two formulae of the linear preserver of the matrix rank, a classical result of Marcus in 1971., Comment: 23 pages, 0 figure, part of this work was presented at the 2018 international conference on Matrices and operators (MAO2018) in Shanghai

We demonstrate that multiple topological transitions can occur, with high-sensitivity, by continuous change of the geometry of a simple 2D dielectric-frame photonic crystal consisting of circular air-holes. By changing the radii of the holes and/or the distance between them, multiple transitions between normal and topological photonic band gaps (PBGs) can appear. The time-reversal symmetric topological PBGs resemble the quantum spin-Hall insulator of electrons and have two counter-propagating edge states. We search for optimal topological transitions, i.e., sharp transitions sensitive to the geometry, and optimal topological PBGs, i.e., large PBGs with clean spectrum of edge states. Such optimizations reveal that dielectric-frame photonic crystals are promising for optical sensors and unidirectional waveguides., Comment: submitted to Phys. Rev. B

A doubly nonnegative matrix can be written as a Gramian matrix, and a completely positive matrix can therefore be written as a Gramian matrix of some nonnegative vectors. In this paper, we introduce Gramian tensors and study 2-dimension completely positive tensors and {0,1} CP tensors. Also investigated are the complete positive multi-hypergraph, a generalized form of a cp graph. We also provide a necessary and sufficient condition for a 2-dimensional tensor to be completely positive., Comment: 21 pages, This research was supported by the Hong Kong Research Grant Council (No. PolyU 502111, 501212, 501913 and 15302114). The work was partially done during the first and the second authors' visit at the Hong Kong Polytechnic Uiversity in August of 2016. arXiv admin note: text overlap with arXiv:1508.04204

Completely positive graphs have been employed to associate with completely positive matrices for characterizing the intrinsic zero patterns. As tensors have been widely recognized as a higher-order extension of matrices, the multi-hypergraph, regarded as a generalization of graphs, is then introduced to associate with tensors for the study of complete positivity. To describe the dependence of the corresponding zero pattern for a special type of completely positive tensors--the $\{0,1\}$ completely positive tensors, the completely positive multi-hypergraph is defined. By characterizing properties of the associated multi-hypergraph, we provide necessary and sufficient conditions for any $(0,1)$ associated tensor to be $\{0,1\}$ completely positive. Furthermore, a necessary and sufficient condition for a uniform multi-hypergraph to be completely positive multi-hypergraph is proposed as well.

The problem of finding completely positive matrices with equal cp-rank and rank is considered. We give some easy-to-check sufficient conditions on the entries of a doubly nonnegative matrix for it to be completely positive with equal cp-rank and rank. An algorithm is also presented to show its efficiency., Comment: corresponding author: Changqing Xu, Email: cqxurichard@gmail.com

Nonnegative tensor factorization has applications in statistics, computer vision, exploratory multiway data analysis and blind source separation. A symmetric nonnegative tensor, which has a symmetric nonnegative factorization, is called a completely positive (CP) tensor. The H-eigenvalues of a CP tensor are always nonnegative. When the order is even, the Z-eigenvalue of a CP tensor are all nonnegative. When the order is odd, a Z-eigenvector associated with a positive (negative) Z-eigenvalue of a CP tensor is always nonnegative (nonpositive). The entries of a CP tensor obey some dominance properties. The CP tensor cone and the copositive tensor cone of the same order are dual to each other. We introduce strongly symmetric tensors and show that a symmetric tensor has a symmetric binary decomposition if and only if it is strongly symmetric. Then we show that a strongly symmetric, hierarchically dominated nonnegative tensor is a CP tensor, and present a hierarchical elimination algorithm for checking this. Numerical examples are also given.