Searcharxiv⌕ Search

arXiv subjects

Dekang Zhu

Publications and source records attributed to Dekang Zhu.

3 recordsLinked to original sources

SplatFlow3D: Learning Scene Flow via 3D Motion Feature Splatting

Considering the motion continuity and stability of 3D objects over short inter-frame intervals, introducing multi-frame settings in scene flow estimation can potentially address occlusion. In this paper, we propose a two-frame backbone, SimpleFlow3D, which integrates dense information from the image plane and sparse information from the depth dimension in a decoupling-followed-by-coupling manner by hierarchically constructing the 3D motion feature. SimpleFlow3D achieves SOTA results with minimal parameters. We also propose a weight-sharing multi-frame framework to splat the previous 3D motion feature to the current estimation process. The framework unifies the first and non-first frame inference by constructing pseudo inputs. After combining the proposed framework and backbone, the newly born multi-frame method SplatFlow3D further advances the state of the art. It achieves lower errors than the two-frame backbone, with fewer parameters than current methods. On both KITTI and Spring, SplatFlow3D ranked 1st over all published and submitted methods. Experiments show that SplatFlow3D improves occlusion handling, non-rigid motion estimation, and generalization to real-world scenes. Code is available at https://github.com/wwsource/SplatFlow3D.

cs.CV↗

Statistical Properties of the Single Linkage Hierarchical Clustering Estimator

Distance-based hierarchical clustering (HC) methods are widely used in unsupervised data analysis but few authors take account of uncertainty in the distance data. We incorporate a statistical model of the uncertainty through corruption or noise in the pairwise distances and investigate the problem of estimating the HC as unknown parameters from measurements. Specifically, we focus on single linkage hierarchical clustering (SLHC) and study its geometry. We prove that under fairly reasonable conditions on the probability distribution governing measurements, SLHC is equivalent to maximum partial profile likelihood estimation (MPPLE) with some of the information contained in the data ignored. At the same time, we show that direct evaluation of SLHC on maximum likelihood estimation (MLE) of pairwise distances yields a consistent estimator. Consequently, a full MLE is expected to perform better than SLHC in getting the correct HC results for the ground truth metric.

stat.ML↗

Maximum Likelihood Estimation for Single Linkage Hierarchical Clustering

We derive a statistical model for estimation of a dendrogram from single linkage hierarchical clustering (SLHC) that takes account of uncertainty through noise or corruption in the measurements of separation of data. Our focus is on just the estimation of the hierarchy of partitions afforded by the dendrogram, rather than the heights in the latter. The concept of estimating this "dendrogram structure'' is introduced, and an approximate maximum likelihood estimator (MLE) for the dendrogram structure is described. These ideas are illustrated by a simple Monte Carlo simulation that, at least for small data sets, suggests the method outperforms SLHC in the presence of noise.

stat.ML↗