Table of Contents
Fetching ...

Semi-Tensor-Product Based Convolutional Neural Networks

Daizhan Cheng, Xiao Zhang

TL;DR

The paper tackles boundary artifacts and data irregularities in CNNs by introducing a padding-free convolution built on the semi-tensor product (STP) that operates across cross-dimensional domains $\mathbb{R}^\infty$. A unified linear-algebraic formulation uses a receptive-field matrix (RFM) and a block Hadamard product to realize STP-based convolution (STP-CP) without padding, enabling domain-aware processing of irregular and multi-scale inputs. The authors demonstrate STP-CP on irregular, partially damaged, and 3D volumetric data, showing robustness to missing data and scale mismatches and extending to higher-order signals. They provide a theoretical forward-propagation foundation for STP-CNNs and outline directions for training analysis, large-scale validation, and library integration.

Abstract

The semi-tensor product of vectors generalizes the conventional inner product, enabling algebraic operations between vectors of different dimensions. Building upon this foundation, we introduce a domain-based convolutional product and integrate it with the STP to formulate a padding-free convolutional operation. This new operation inherently avoids zero or other artificial padding, thereby eliminating redundant information and boundary artifacts commonly present in conventional convolutional neural networks. Based on this operation, we further develop an STP-based CNN framework that extends convolutional computation to irregular and cross-dimensional data domains. Applications to image processing and third-order signal identification demonstrate the proposed method's effectiveness in handling irregular, incomplete, and high-dimensional data without the distortions caused by padding.

Semi-Tensor-Product Based Convolutional Neural Networks

TL;DR

The paper tackles boundary artifacts and data irregularities in CNNs by introducing a padding-free convolution built on the semi-tensor product (STP) that operates across cross-dimensional domains . A unified linear-algebraic formulation uses a receptive-field matrix (RFM) and a block Hadamard product to realize STP-based convolution (STP-CP) without padding, enabling domain-aware processing of irregular and multi-scale inputs. The authors demonstrate STP-CP on irregular, partially damaged, and 3D volumetric data, showing robustness to missing data and scale mismatches and extending to higher-order signals. They provide a theoretical forward-propagation foundation for STP-CNNs and outline directions for training analysis, large-scale validation, and library integration.

Abstract

The semi-tensor product of vectors generalizes the conventional inner product, enabling algebraic operations between vectors of different dimensions. Building upon this foundation, we introduce a domain-based convolutional product and integrate it with the STP to formulate a padding-free convolutional operation. This new operation inherently avoids zero or other artificial padding, thereby eliminating redundant information and boundary artifacts commonly present in conventional convolutional neural networks. Based on this operation, we further develop an STP-based CNN framework that extends convolutional computation to irregular and cross-dimensional data domains. Applications to image processing and third-order signal identification demonstrate the proposed method's effectiveness in handling irregular, incomplete, and high-dimensional data without the distortions caused by padding.

Paper Structure

This paper contains 16 sections, 6 theorems, 67 equations, 6 figures.

Key Result

Lemma 2.3

Figures (6)

  • Figure 1: $({\mathbb R}^{\infty},{\mathcal{T}}_n)$ vs $\Omega$
  • Figure 3: Image CP
  • Figure 4: Matrix $\Xi_{n\times \eta}^d$
  • Figure 5: An irregular image and its receptive fields.
  • Figure 6: STP-CP applied to a partly damaged image
  • ...and 1 more figures

Theorems & Definitions (29)

  • Definition 2.1
  • Definition 2.2
  • Lemma 2.3: che19
  • Definition 2.4
  • Definition 2.5
  • Lemma 2.6: che24
  • Definition 3.1
  • Proposition 3.2: edw79
  • Definition 3.3
  • Proposition 3.4
  • ...and 19 more