Learn More
We propose a novel Riemannian manifold pre-conditioning approach for the tensor completion problem with rank constraint. A novel Rieman-nian metric or inner product is proposed that exploits the least-squares structure of the cost function and takes into account the structured symmetry that exists in Tucker decomposition. The specific metric allows to use(More)
We propose an online tensor subspace tracking algorithm based on the CP decomposition exploiting the recursive least squares (RLS), dubbed OnLine Low-rank Subspace tracking by TEnsor CP Decomposition (OLSTEC). Numerical evaluations show that the proposed OLSTEC algorithm gives faster convergence per iteration comparing with the state-of-the-art online(More)
This paper presents an environmental sound classification method that is noise-robust against sounds recorded by mobile devices, and presents evaluation of its performance. This method is specifically designed to recognize higher semantics of context from environmental sound. Conventionally, sound classifications have used acoustic features in the frequency(More)
This paper investigates an indoor location estimation system based on UHF band RFID. Tags, separated by 50 cm, are attached to the ceiling and an RFID reader is attached to the person of interest. The location of the person is estimated using the tags' coordinate which are read by the RFID reader. Three simple location estimation algorithms are proposed,(More)
Stochastic variance reduction algorithms have recently become popular for minimizing the average of a large, but finite, number of loss functions. In this paper, we propose a novel Riemannian extension of the Euclidean stochastic variance reduced gradient algorithm (R-SVRG) to a compact manifold search space. To this end, we show the developments on the(More)