Siming Wei

Learn More
We analyze and improve low rank representation (LRR), the state-of-the-art algorithm for subspace segmentation of data. We prove that for the noiseless case, the optimization model of LRR has a unique solution, which is the shape interaction matrix (SIM) of the data matrix. So in essence LRR is equivalent to factorization methods. We also prove that the(More)
In the past decades, exactly recovering the intrinsic data structure from corrupted observations, which is known as robust principal component analysis (RPCA), has attracted tremendous interests and found many applications in computer vision. Recently, this problem has been formulated as recovering a low-rank component and a sparse component from the(More)
Recent years have witnessed the popularity of using rank minimization as a regularizer for various signal processing and machine learning problems. As rank minimization problems are often converted to nuclear norm minimization (NNM) problems, they have to be solved iteratively and each iteration requires computing a singular value decomposition (SVD).(More)
Diffusion kurtosis imaging (DKI) is a recent MRI based method that can quantify deviation from Gaussian behavior using a kurtosis ten-sor. DKI has potential value for the assessment of neurologic diseases. Existing techniques for diffusion kurtosis imaging typically need to capture hundreds of MRI images, which is not clinically feasible on human subjects.(More)
We introduce a novel subspace segmentation method called Minimal Squared Frobenius Norm Representation (MSFNR). MSFNR performs data clustering by solving a convex optimization problem. We theoretically prove that in the noiseless case, MSFNR is equivalent to the classical Factorization approach and always classifies data correctly. In the noisy case, we(More)
Based on the theory of Markov Random Fields, a Bayesian regu-larization model for diffusion tensor images (DTI) is proposed in this paper. The low-degree parameterization of diffusion tensors in our model makes it less computationally intensive to obtain a maximum a posteriori (MAP) estimation. An approximate solution to the problem is achieved efficiently(More)
  • 1