paper-with-me

홈 › Papers

LowRankOcc: Tensor Decomposition and Low-Rank Recovery for Vision-based 3D Semantic Occupancy Prediction

2024-01-01 · CVPR 2024 1 · Linqing Zhao, Xiuwei Xu, Ziwei Wang, Yunpeng Zhang, Borui Zhang, Wenzhao Zheng, Dalong Du, Jie zhou, Jiwen Lu

In this paper we present a tensor decomposition and low-rank recovery approach (LowRankOcc) for vision-based 3D semantic occupancy prediction. Conventional methods model outdoor scenes with fine-grained 3D grids but the sparsity of non-empty voxels introduces considerable spatial redundancy leading to potential overfitting risks. In contrast our approach leverages the intrinsic low-rank property of 3D occupancy data factorizing voxel representations into low-rank components to efficiently mitigate spatial redundancy without sacrificing performance. Specifically we present the Vertical-Horizontal (VH) decomposition block factorizes 3D tensors into vertical vectors and horizontal matrices. With our "decomposition-encoding-recovery" framework we encode 3D contexts with only 1/2D convolutions and poolings and subsequently recover the encoded compact yet informative context features back to voxel representations. Experimental results demonstrate that LowRankOcc achieves state-of-the-art performances in semantic scene completion on the SemanticKITTI dataset and 3D occupancy prediction on the nuScenes dataset.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

3D Semantic Occupancy PredictionTensor Decomposition

Similar Papers 제목 키워드 기반

Low-Rank and Sparse Enhanced Tucker Decomposition for Tensor Completion

2020-10-01 · Chenjian Pan, Chen Ling, Hongjin He, Liqun Qi 외

Tensor completion refers to the task of estimating the missing data from an incomplete measurement or observation, which is a core problem frequently arising from the areas of big data analysis, computer vision, and netw…

Data CompressionFace Recognition

Optimal low rank tensor recovery

2019-06-12 · Jian-Feng Cai, Lizhang Miao, Yang Wang, Yin Xian

We investigate the sample size requirement for exact recovery of a high order tensor of low rank from a subset of its entries. In the Tucker decomposition framework, we show that the Riemannian optimization algorithm wit…

Riemannian optimization

Tensor Generalized Approximate Message Passing

2025-03-25 · Yinchuan Li, Guangchen Lan, Xiaodong Wang

We propose a tensor generalized approximate message passing (TeG-AMP) algorithm for low-rank tensor inference, which can be used to solve tensor completion and decomposition problems. We derive TeG-AMP algorithm as an ap…

Normalized Iterative Hard Thresholding for Tensor Recovery

2025-07-06 · Li Li, Yuneng Liang, Kaijie Zheng, Jian Lu arxiv

Low-rank recovery builds upon ideas from the theory of compressive sensing, which predicts that sparse signals can be accurately reconstructed from incomplete measurements. Iterative thresholding-type algorithms-particul…

Compressive Sensing

Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption

2023-05-06 · HanQin Cai, Zehan Chao, Longxiu Huang, Deanna Needell

We study the tensor robust principal component analysis (TRPCA) problem, a tensorial extension of matrix robust principal component analysis (RPCA), that aims to split the given tensor into an underlying low-rank compone…