Large Multimodal Models (LMMs) that process 3D data typically rely on heavy, pre-trained visual encoders to extract geometric features. While recent 2D LMMs have begun to eliminate such encoders for efficiency and scalability, extending this paradigm to 3D remains challenging due to the unordered and large-scale nature of point clouds. This leaves a critical unanswered question: How can we design an LMM that tokenizes unordered 3D data effectively and efficiently without a cumbersome encoder? We propose Fase3D, the first efficient encoder-free Fourier-based 3D scene LMM. Fase3D tackles the challenges of scalability and permutation invariance with a novel tokenizer that combines point cloud serialization and the Fast Fourier Transform (FFT) to approximate self-attention. This design enables an effective and computationally minimal architecture, built upon three key innovations: First, we represent large scenes compactly via structured superpoints. Second, our space-filling curve serialization followed by an FFT enables efficient global context modeling and graph-based token merging. Lastly, our Fourier-augmented LoRA adapters inject global frequency-aware interactions into the LLMs at a negligible cost. Fase3D achieves performance comparable to encoder-based 3D LMMs while being significantly more efficient in computation and parameters. Project website: https://tev-fbk.github.io/Fase3D.
Figures & tables
Figure 1: Fase3D’s contribution overview. Mainstream 3D LMMs are based on computationally-heavy scene encoders to extract geometric features before alignment with the LLM. In contrast, our method (Fase3D) employs a lightweight Fourier-based tokenizer to process raw point clouds directly and introduces Fourier-augmented LoRA adapters, which infuse global frequency-aware context into the LLM without additional computational overhead.
Figure 2: The Fase3D pipeline. A lightweight tokenizer ( ∙ ) produces M superpoint tokens, which are refined by an FFT-based context enhancer ( ∙ ). A graph is then constructed, and a token-merging block ( ∙ ) compresses the tokens into T compact 3D tokens ( T<M ). Finally, an LLM ( ∙ ) with an FFT-based global filter ( ∙ ) processes these tokens together with textual and user prompts.
Method
LLMs
#Params ↓
FLOP ↓
ScanQA (val)
SQA3D (test)
R ↑
M ↑
B-4 ↑
C ↑
EM@1 ↑
Encoder-based 3D LMMs with point cloud as inputs
LL3DA [ 6 ]
OPT-1.3B [ 53 ]
118.87M
40.21
37.31
15.88
13.53
76.79
-
PerLA [ 34 ]
OPT-1.3B [ 53 ]
119.76M
163.38
39.60
17.44
14.49
78.13
-
3D-LLaVA [ 12 ]
Vicuna-1.5-7B [ 9 ]
58.26M
37.75
43.10
18.40
17.10
92.60
54.5
Encoder-free 3D LMMs with point cloud as inputs
Table 1: Question answering results on ScanQA [ 2 ] and SQA3D [ 33 ] . #Param/FLOP: number of activated parameters and Floating Point Operation count required for the encoding/tokenization stage. Best result is in bold . Second best result is underlined .
Figure 3: Qualitative results and comparisons between Fase3D, PerLA [ 34 ] , and LL3DA [ 6 ] on the ScanQA [ 2 ] dataset.
Table 2: Dense captioning results on ScanRefer and Nr3D. #Param/FLOP: number of activated parameters and Floating Point Operation count required for the encoding/tokenization stage. Best result in bold . Second best result is underlined .
Figure 4: Qualitative comparison between Fase3D, PerLA [ 34 ] , and LL3DA [ 6 ] on the ScanRefer [ 5 ] dataset.
Module
ScanQA (Validation)
Point
Superpoint
FFT
R ↑
M ↑
B-4 ↑
C ↑
✓
37.03
15.43
13.14
76.04
✓
✓
37.18
16.38
13.96
79.70
✓
✓
39.56
17.03
15.11
82.97
✓
✓
✓
41.64
17.80
16.70
86.91
Full model with pretraining
42.56
18.24
18.02
90.11
Table 3: Ablation study of vision embedding modules. Point (downsampled raw point tokens), Superpoint (superpoint pooling), FFT (lightweight FFT-based context enhancer).
Module
ScanQA (Validation)
vision
text
R ↑
M ↑
B-4 ↑
C ↑
LoRA
-
36.98
15.37
13.35
76.45
-
LoRA
36.49
15.40
13.19
76.21
sLoRA
sLoRA
37.34
16.04
12.83
78.24
dLoRA
dLoRA
39.96
17.23
15.09
82.53
dLoRA+FFT
dLoRA
41.64
17.80
16.70
86.91
Table 4: Ablation study of LoRA placement and Fourier residual on ScanQA (Validation) [ 2 ] . sLoRA: the branches share the same LoRA modules. dLoRA: the branches use separate (decoupled) LoRA modules. “+FFT” adds a parallel Fourier residual branch.
Method
Enc.
#Params ↓
FLOP ↓
ScanQA (val)
R ↑
M ↑
B-4 ↑
C ↑
OPT-1.3B [ 53 ] LLM
LL3DA [ 6 ]
✓
118.87M
40.21
37.31
15.88
13.53
76.79
PerLA [ 34 ]
✓
119.76M
163.38
39.60
17.44
14.49
78.13
Fase3D
✗
9.30M
2.01
40.34
17.63
15.96
86.24
Qwen2.5-3B [ 52 ] LLM
Table 5: Question answering results with different LLMs on ScanQA [ 2 ] . #Param/FLOP(G) denote the activated parameters and encoding/tokenization FLOPs. Best results in bold .
#Layers
ScanQA (Validation)
R ↑
M ↑
B-4 ↑
C ↑
0
35.93
14.94
13.39
74.03
4
38.27
16.30
13.76
80.04
8
41.64
17.80
16.70
86.91
10
41.51
17.14
16.67
87.05
12
40.47
16.56
15.78
86.40
Table A: Ablation study on the number of LLM’s LoRA layers.
nC
R ↑
M ↑
B-4 ↑
C ↑
1
37.42
15.96
14.23
79.06
2
40.49
16.78
15.96
85.64
4
41.64
17.80
16.70
86.91
6
41.72
17.93
17.01
87.14
Table B: Effect of the number of SFC curves nC in multi-curve serialization on ScanQA (val).
#Token
ScanQA (Validation)
R ↑
M ↑
B-4 ↑
C ↑
64
37.96
16.23
14.09
79.53
128
38.21
15.85
14.88
83.92
256
41.64
17.80
16.70
86.91
320
41.73
17.67
16.61
87.20
Table C: Ablation study on the number of LLM’s input tokens.
Method
R ↑
M ↑
B-4 ↑
C ↑
Scratch
41.64
17.80
16.70
86.91
w/pretrain
43.37
18.61
16.87
91.74
Table D: Effect of two-stage training on ScanQA validation.
Selector
R ↑
M ↑
B-4 ↑
C ↑
Q-Former
37.52
15.87
14.06
77.41
FPS
39.67
17.10
15.18
82.54
Fase3D
41.64
17.80
16.70
86.91
Table E: Effect of different token selection / merging strategies on ScanQA validation performance. All models are trained from scratch on the ScanQA training split, without any pre-training.
Figure A : Visualization of our SFC-based k NN graph construction via window voting. We show two representative examples of curve-guided neighbor selection.
Figure B : Comparison of space-filling curves (Hilbert, transposed Hilbert, Z-order, and transposed Z-order) under four views (columns). All four variants produce broadly similar locality-preserving paths, with Hilbert-type curves appearing smoother and Z-order variants exhibiting more axis-aligned segments. Using both the standard and transposed versions provides complementary directional coverage and reduces orientation bias, so in Fase3D we apply the FFT jointly over all four curves.