基于图平衡和Gershgorin圆盘对齐的点云采样
Point Cloud Sampling via Graph Balancing and Gershgorin Disc Alignment
摘要:
3D点云(PC)-物理对象表面的离散几何样本的集合-通常尺寸很大,这需要昂贵的后续操作,如视点图像渲染和对象识别。利用图采样的最新进展,我们提出了一种快速的PC子采样算法,在保持整体对象形状的同时减小其大小。具体来说,为了阐明采样目标,我们首先假设基于特征图拉普拉斯正则化(FGLR)的超分辨率(SR)方法,该方法重建原始高分辨率PC,给定由采样矩阵$\H$选择的3D点。我们证明,最小化最坏情况下的SR重建误差是等价于最大化的矩阵$\H^{\top} \H + μ\cL$,其中$\cL$是一个对称的,半正定矩阵计算的邻域图连接的3D点的最小特征值$λ_{\min}$。相反,为了快速计算,我们通过三个步骤选择$\H$来最大化下限$λ^-_{\min}(\H^{\top} \H + μ\cL)$。将$\cL$解释为对应于不平衡带符号图$\cG$的广义图拉普拉斯矩阵,首先用平衡图$\cG_B$近似$\cG$,平衡图$\cL_B$具有相应的广义图拉普拉斯矩阵.其次,利用最近的定理称为Gershgorin光盘完美对齐(GDPA),我们执行相似性变换$\cL_p = §\cL_B §^{-1}$,使$\cL_p$的Gershgorin光盘左端都对齐相同的值$λ_{\min}(\cL_B)$。最后,我们使用图形采样算法在$\cG_B$上执行PC子采样,以在大致线性的时间内最大化$λ^-_{\min}(\H^{\top} \H + μ\cL_p)$。实验结果表明,我们的算法选择的三维点优于竞争计划在SR重建质量的数字和视觉。
英文摘要:
3D point cloud (PC) -- a collection of discrete geometric samples of a physical object's surface -- is typically large in size, which entails expensive subsequent operations like viewpoint image rendering and object recognition. Leveraging on recent advances in graph sampling, we propose a fast PC sub-sampling algorithm that reduces its size while preserving the overall object shape. Specifically, to articulate a sampling objective, we first assume a super-resolution (SR) method based on feature graph Laplacian regularization (FGLR) that reconstructs the original high-resolution PC, given 3D points chosen by a sampling matrix $\H$. We prove that minimizing a worst-case SR reconstruction error is equivalent to maximizing the smallest eigenvalue $λ_{\min}$ of a matrix $\H^{\top} \H + μ\cL$, where $\cL$ is a symmetric, positive semi-definite matrix computed from the neighborhood graph connecting the 3D points. Instead, for fast computation we maximize a lower bound $λ^-_{\min}(\H^{\top} \H + μ\cL)$ via selection of $\H$ in three steps. Interpreting $\cL$ as a generalized graph Laplacian matrix corresponding to an unbalanced signed graph $\cG$, we first approximate $\cG$ with a balanced graph $\cG_B$ with the corresponding generalized graph Laplacian matrix $\cL_B$. Second, leveraging on a recent theorem called Gershgorin disc perfect alignment (GDPA), we perform a similarity transform $\cL_p = §\cL_B §^{-1}$ so that Gershgorin disc left-ends of $\cL_p$ are all aligned at the same value $λ_{\min}(\cL_B)$. Finally, we perform PC sub-sampling on $\cG_B$ using a graph sampling algorithm to maximize $λ^-_{\min}(\H^{\top} \H + μ\cL_p)$ in roughly linear time. Experimental results show that 3D points chosen by our algorithm outperformed competing schemes both numerically and visually in SR reconstruction quality.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。