Using non-negative matrix factorization toward finding an informative basis in spin-image data

Three-dimensional (3D) Laser Detection and Ranging (LADAR) range data is being investigated for automatic target recognition applications. The spin-image provides a useful data representation for 3D point cloud data. In the spirit of recent work that shows ℓ1-sparseness to be a useful data compression metric, we propose to use Nonnegative Matrix Factorization (NMF) to help find features that capture the salient information resident in the spin-image representation. NMF is a technique for decomposing nonnegative multivariate data into its 'parts', resulting in a compressed and usually sparse representation. As a surrogate for measured 3D LADAR data, we generate 3D point clouds from computer-aided-design models of two land targets, and we generate spin-images at multiple support scales. We select the support scale that provides the highest separability between the spin-image stacks from the two land targets. We then apply NMF to the spin-images at this support scale, and seek elements corresponding to meaningful parts of the land vehicles (e.g., a tank turret or truck wheels), that in a joint sense should provide significant discriminative capability. We measure the separability in the sparse NMF subspace. For measuring separability, we use the Henze-Penrose measure of multivariate distributional divergence.

[1]  Jordi Vitrià,et al.  Evaluation of distance metrics for recognition based on non-negative matrix factorization , 2003, Pattern Recognit. Lett..

[2]  Andrew E. Johnson,et al.  Spin-Images: A Representation for 3-D Surface Matching , 1997 .

[3]  Stephen DelMarco,et al.  A theoretical framework for 3D LADAR ATR problem definition and performance evaluation , 2005, SPIE Defense + Commercial Sensing.

[4]  Donald E. Waagen,et al.  Multiscale target manifold characterization for 3D imaging ladar , 2008, SPIE Defense + Commercial Sensing.

[5]  Andrew E. Johnson,et al.  Using Spin Images for Efficient Object Recognition in Cluttered 3D Scenes , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Tony DeRose,et al.  Surface reconstruction from unorganized points , 1992, SIGGRAPH.

[7]  S. Sra Nonnegative Matrix Approximation: Algorithms and Applications , 2006 .

[8]  Stefan M. Wild,et al.  Improving non-negative matrix factorizations through structured initialization , 2004, Pattern Recognit..

[9]  Jie Yang,et al.  Initialization enhancer for non-negative matrix factorization , 2007, Eng. Appl. Artif. Intell..

[10]  J. Friedman,et al.  Multivariate generalizations of the Wald--Wolfowitz and Smirnov two-sample tests , 1979 .

[11]  N. Henze,et al.  On the multivariate runs test , 1999 .

[12]  Rakesh Kumar,et al.  Rapid and scalable 3D object recognition using LIDAR data , 2006, SPIE Defense + Commercial Sensing.

[13]  H. Sebastian Seung,et al.  Learning the parts of objects by non-negative matrix factorization , 1999, Nature.

[14]  Donald Waagen,et al.  Statistical analysis of spin images for differentiation of wheeled and tracked objects , 2005, SPIE Defense + Commercial Sensing.

[15]  E.J. Candes Compressive Sampling , 2022 .

[16]  Dietrich Lehmann,et al.  Nonsmooth nonnegative matrix factorization (nsNMF) , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  Stan Sclaroff,et al.  Improved feature descriptors for 3D surface matching , 2007, SPIE Optics East.

[18]  Donald E. Waagen,et al.  A statistical analysis of 3D structure tensor features generated from LADAR imagery , 2006, SPIE Defense + Commercial Sensing.

[19]  Robert Tibshirani,et al.  The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2nd Edition , 2001, Springer Series in Statistics.

[20]  Raul Kompass,et al.  A Generalized Divergence Measure for Nonnegative Matrix Factorization , 2007, Neural Computation.

[21]  Patrik O. Hoyer,et al.  Non-negative Matrix Factorization with Sparseness Constraints , 2004, J. Mach. Learn. Res..