Papers
Topics
Authors
Recent
Search
2000 character limit reached

OmniVaT: Visual-Tactile Multimodal Framework

Updated 8 January 2026
  • OmniVaT is a multimodal framework that unifies visual and tactile data in a shared embedding–frequency space using fractional transforms.
  • It features the Multimodal Fractional Fourier Adapter (MFFA) and Discrete Tree Generation (DTG) modules to achieve robust single-domain generalization.
  • Extensive experiments show significant Macro-F1 improvements and enhanced cross-modal alignment, validating its practical advances in VTL.

OmniVaT is a multimodal learning framework targeting single domain generalization for visual-tactile learning (VTL), where the objective is robust perception across sensory domains without requiring data from multiple domains during training. This is achieved by mitigating both modality discrepancies between visual (VIS) and tactile (TAC) images, and domain gaps arising from heterogeneous tactile sensors and collection procedures. OmniVaT introduces two principal components: the Multimodal Fractional Fourier Adapter (MFFA), for aligning VIS and TAC embeddings within a unified embedding–frequency space, and the Discrete Tree Generation (DTG) module, which generates diverse, reliable multimodal fractional representations through a hierarchical structure. Extensive experimental evidence substantiates OmniVaT’s superior cross-domain generalization capabilities within the SDG-VTL paradigm (Qiu et al., 1 Jan 2026).

1. Mathematical Foundation: Fractional Fourier Transform (FrFT)

The Fractional Fourier Transform generalizes the classical Fourier transform, parameterized by order p=α/(π/2)Rp = \alpha/(\pi/2) \in \mathbb{R}, which geometrically “rotates” signals between the time (embedding) and frequency domains. Its continuous form is:

FrFTp(E(u0))=+Kp(u0,up)E(u0)du0\operatorname{FrFT}_p(E(u_0)) = \int_{-\infty}^{+\infty} K_p(u_0,u_p) E(u_0) du_0

Here, Kp(u0,up)K_p(u_0,u_p) is defined as:

  • For αnπ\alpha \neq n\pi: Kp(u0,up)=Aαexp[j(12u02cotαu0upcscα+12up2cotα)]K_p(u_0,u_p) = A_\alpha \exp[j(\frac{1}{2} u_0^2 \cot \alpha - u_0 u_p \csc \alpha + \frac{1}{2} u_p^2 \cot \alpha)] with Aα=(1jcotα)/2πA_\alpha = \sqrt{(1-j \cot \alpha)/2\pi}.
  • For α=2nπ\alpha = 2n\pi: Kp=δ(u0up)K_p = \delta(u_0 - u_p).
  • For α=(2n+1)π\alpha = (2n+1)\pi: Kp=δ(u0+up)K_p = \delta(u_0 + u_p).

Discrete FrFT (DFrFT) [Candan et al. 2000] uses Hermite–Gaussian eigenvectors:

FrFTp(E(u0))=+Kp(u0,up)E(u0)du0\operatorname{FrFT}_p(E(u_0)) = \int_{-\infty}^{+\infty} K_p(u_0,u_p) E(u_0) du_00

where FrFTp(E(u0))=+Kp(u0,up)E(u0)du0\operatorname{FrFT}_p(E(u_0)) = \int_{-\infty}^{+\infty} K_p(u_0,u_p) E(u_0) du_01, with FrFTp(E(u0))=+Kp(u0,up)E(u0)du0\operatorname{FrFT}_p(E(u_0)) = \int_{-\infty}^{+\infty} K_p(u_0,u_p) E(u_0) du_02 containing eigenvectors and FrFTp(E(u0))=+Kp(u0,up)E(u0)du0\operatorname{FrFT}_p(E(u_0)) = \int_{-\infty}^{+\infty} K_p(u_0,u_p) E(u_0) du_03 the diagonal matrix of eigenvalues. Varying FrFTp(E(u0))=+Kp(u0,up)E(u0)du0\operatorname{FrFT}_p(E(u_0)) = \int_{-\infty}^{+\infty} K_p(u_0,u_p) E(u_0) du_04 from FrFTp(E(u0))=+Kp(u0,up)E(u0)du0\operatorname{FrFT}_p(E(u_0)) = \int_{-\infty}^{+\infty} K_p(u_0,u_p) E(u_0) du_05 interpolates smoothly between the input embedding and its Fourier spectrum.

2. Multimodal Fractional Fourier Adapter (MFFA): Architecture

MFFA serves as the bridge across modalities, aligning visual, tactile, and language features in a unified embedding–frequency space through fractional domain projections coupled with cross-modal attention.

Inputs:

  • FrFTp(E(u0))=+Kp(u0,up)E(u0)du0\operatorname{FrFT}_p(E(u_0)) = \int_{-\infty}^{+\infty} K_p(u_0,u_p) E(u_0) du_06 (Visual embedding)
  • FrFTp(E(u0))=+Kp(u0,up)E(u0)du0\operatorname{FrFT}_p(E(u_0)) = \int_{-\infty}^{+\infty} K_p(u_0,u_p) E(u_0) du_07 (Tactile embedding)
  • FrFTp(E(u0))=+Kp(u0,up)E(u0)du0\operatorname{FrFT}_p(E(u_0)) = \int_{-\infty}^{+\infty} K_p(u_0,u_p) E(u_0) du_08 (Language prompt embedding)

2.1 Language-Guided FrFT Processing

The language embedding is first expanded and projected by the FrFT:

FrFTp(E(u0))=+Kp(u0,up)E(u0)du0\operatorname{FrFT}_p(E(u_0)) = \int_{-\infty}^{+\infty} K_p(u_0,u_p) E(u_0) du_09

where Kp(u0,up)K_p(u_0,u_p)0 are learned expansion weights, Kp(u0,up)K_p(u_0,u_p)1 denotes ReLU activation.

2.2 Fractional Fourier Attention (FrATT)

A global class token Kp(u0,up)K_p(u_0,u_p)2 is aggregated over the batch. Fractional attention operates as:

Kp(u0,up)K_p(u_0,u_p)3

where Kp(u0,up)K_p(u_0,u_p)4 denote learned projections.

2.3 Language-Guided VIS/TAC Fractional Projection

Refined language features Kp(u0,up)K_p(u_0,u_p)5 guide the projection of VIS/TAC embeddings:

  • Kp(u0,up)K_p(u_0,u_p)6
  • Kp(u0,up)K_p(u_0,u_p)7
  • Kp(u0,up)K_p(u_0,u_p)8 constructed identically, via shared weights

2.4 Modality-Alignment Loss

To align modalities in the fractional space, OmniVaT minimizes a KL divergence loss:

Kp(u0,up)K_p(u_0,u_p)9

2.5 Choice of Fractional Order αnπ\alpha \neq n\pi0

In all main experiments, αnπ\alpha \neq n\pi1 (the midpoint between original embedding and full spectrum) delivers optimal results, validated through a sweep over αnπ\alpha \neq n\pi2. αnπ\alpha \neq n\pi3 is treated as a hyperparameter.

2.6 MFFA Forward Pass Pseudocode

Aα=(1jcotα)/2πA_\alpha = \sqrt{(1-j \cot \alpha)/2\pi}5

3. Framework Integration and Discrete Tree Generation (DTG)

OmniVaT consists of:

  • Frozen CLIP-pretrained visual, tactile, and language encoders
  • MFFA module with shared weights for VIS/TAC
  • DTG module performing domain augmentation by hierarchical tree feature generation
  • Linear classifier with cross-entropy supervision

Forward Pass Overview:

  1. Extract αnπ\alpha \neq n\pi4 via CLIP backbones.
  2. Apply MFFA to yield αnπ\alpha \neq n\pi5, and compute αnπ\alpha \neq n\pi6.
  3. Concatenate all (VIS/TAC/lang) into root tree feature αnπ\alpha \neq n\pi7.
  4. DTG constructs a binary tree of depth 3, generating augmented features as children nodes: αnπ\alpha \neq n\pi8.
  5. Node-diversity loss αnπ\alpha \neq n\pi9, where Kp(u0,up)=Aαexp[j(12u02cotαu0upcscα+12up2cotα)]K_p(u_0,u_p) = A_\alpha \exp[j(\frac{1}{2} u_0^2 \cot \alpha - u_0 u_p \csc \alpha + \frac{1}{2} u_p^2 \cot \alpha)]0 is cosine similarity among Kp(u0,up)=Aαexp[j(12u02cotαu0upcscα+12up2cotα)]K_p(u_0,u_p) = A_\alpha \exp[j(\frac{1}{2} u_0^2 \cot \alpha - u_0 u_p \csc \alpha + \frac{1}{2} u_p^2 \cot \alpha)]1.
  6. Final feature fusion: Kp(u0,up)=Aαexp[j(12u02cotαu0upcscα+12up2cotα)]K_p(u_0,u_p) = A_\alpha \exp[j(\frac{1}{2} u_0^2 \cot \alpha - u_0 u_p \csc \alpha + \frac{1}{2} u_p^2 \cot \alpha)]2, and analogously for TAC.
  7. Classification by linear head; CE loss Kp(u0,up)=Aαexp[j(12u02cotαu0upcscα+12up2cotα)]K_p(u_0,u_p) = A_\alpha \exp[j(\frac{1}{2} u_0^2 \cot \alpha - u_0 u_p \csc \alpha + \frac{1}{2} u_p^2 \cot \alpha)]3.

Total loss: Kp(u0,up)=Aαexp[j(12u02cotαu0upcscα+12up2cotα)]K_p(u_0,u_p) = A_\alpha \exp[j(\frac{1}{2} u_0^2 \cot \alpha - u_0 u_p \csc \alpha + \frac{1}{2} u_p^2 \cot \alpha)]4.

4. Implementation Regimen

  • Backbones: Frozen CLIP ResNet-50, ViT-B/16, ViT-L/14 (Kp(u0,up)=Aαexp[j(12u02cotαu0upcscα+12up2cotα)]K_p(u_0,u_p) = A_\alpha \exp[j(\frac{1}{2} u_0^2 \cot \alpha - u_0 u_p \csc \alpha + \frac{1}{2} u_p^2 \cot \alpha)]5)
  • MFFA hyperparameters: Fractional order Kp(u0,up)=Aαexp[j(12u02cotαu0upcscα+12up2cotα)]K_p(u_0,u_p) = A_\alpha \exp[j(\frac{1}{2} u_0^2 \cot \alpha - u_0 u_p \csc \alpha + \frac{1}{2} u_p^2 \cot \alpha)]6, expansion size Kp(u0,up)=Aαexp[j(12u02cotαu0upcscα+12up2cotα)]K_p(u_0,u_p) = A_\alpha \exp[j(\frac{1}{2} u_0^2 \cot \alpha - u_0 u_p \csc \alpha + \frac{1}{2} u_p^2 \cot \alpha)]7, alignment weight Kp(u0,up)=Aαexp[j(12u02cotαu0upcscα+12up2cotα)]K_p(u_0,u_p) = A_\alpha \exp[j(\frac{1}{2} u_0^2 \cot \alpha - u_0 u_p \csc \alpha + \frac{1}{2} u_p^2 \cot \alpha)]8
  • DTG hyperparameters: Tree depth Kp(u0,up)=Aαexp[j(12u02cotαu0upcscα+12up2cotα)]K_p(u_0,u_p) = A_\alpha \exp[j(\frac{1}{2} u_0^2 \cot \alpha - u_0 u_p \csc \alpha + \frac{1}{2} u_p^2 \cot \alpha)]9
  • Optimization: SGD, learning rate 0.05, cosine warm-up, momentum 0.9, 20 epochs
  • Batch sizes: 16 paired VIS-TAC samples, 16 prompt texts
  • Objective: Combined loss Aα=(1jcotα)/2πA_\alpha = \sqrt{(1-j \cot \alpha)/2\pi}0

5. Experimental Validation

Ablation analysis on the “TAG→X” protocol using ViT-B/16 reveals:

Model Variant ACC (%) Macro-F1 (%) F1 Improvement (pp)
Baseline (PromptStyler + CE only) 51.7 40.6
+MFFA (w/o Aα=(1jcotα)/2πA_\alpha = \sqrt{(1-j \cot \alpha)/2\pi}1) 54.5 51.2 +10.6
+MFFA (with Aα=(1jcotα)/2πA_\alpha = \sqrt{(1-j \cot \alpha)/2\pi}2) 54.8 52.5 +11.9

Cosine-margin analysis on unseen domains reports:

Method Margin
LDC ≈0.04
OmniVaT (MFFA+DTG) ≈0.17

These experiments demonstrate MFFA produces a Aα=(1jcotα)/2πA_\alpha = \sqrt{(1-j \cot \alpha)/2\pi}312 percentage point Macro-F1 improvement over the baseline, attributable to improved cross-modal alignment in fractional space. Cosine-margin improvement is nearly fourfold on unseen domains (Qiu et al., 1 Jan 2026).

6. Limitations, Assumptions, and Prospects

  • Training-only Language Prompts: Language information (class labeling) enters exclusively during training; at test time, MFFA cannot exploit textual cues.
  • Fractional Order Hyperparameterization: The fractional order Aα=(1jcotα)/2πA_\alpha = \sqrt{(1-j \cot \alpha)/2\pi}4 is set by cross-validation, not learned end-to-end.
  • Modality Restriction: OmniVaT presently ingests image-based tactile data; vibration or force modalities are not included.
  • Prospective Extensions: Future work intends to incorporate vibrotactile signals and enable end-to-end learning of the fractional order.

A plausible implication is that the MFFA paradigm could generalize to other cross-modal or sensor fusion settings, provided suitable embedding–frequency mappings. OmniVaT marks an initial step for robust single-domain generalization in visual–tactile multimodal learning, integrating advanced spectral methods and structured augmentation.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to OmniVaT Framework.