IP Library Granted Patent US 12,402,837
Granted Patent B2
US 12,402,837 · App. 17/167,140 · Granted Sep 2, 2025

Tensor amplification-based data processing

Inventors: Hendrikus Derksen (Dexter, MI); Neriman Tokcan (Somerville, MA); Kayvan Najarian (Northville, MI); Jonathan Gryak (Ann Arbor, MI)
Assignee: The Regents of the University of Michigan
A61B5/7264A61B5/318G06F16/908G06F17/40G06N20/00G16H50/20G16H50/30G16H50/70
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,402,837
App. No.
17/167,140
Granted
Sep 2, 2025
Kind
B2
Abstract

A method of generating an assessment of medical condition for a patient includes obtaining a patient data tensor indicative of a plurality of tests conducted on the patient, obtaining a set of tensor factors, each tensor factor of the set of tensor factors being indicative of a decomposition of training tensor data for the plurality of tests, the decomposition amplifying low rank structure of the training tensor data, determining a patient tensor factor for the patient based on the obtained patient data tensor and the obtained set of tensor factors, applying the determined patient tensor factor to a classifier such that the determined further tensor factor establishes a feature vector for the patient, the classifier being configured to process the feature vector to generate the assessment, and providing output data indicative of the assessment.

Claims (34)

1. A method of generating an assessment of medical condition for a patient, the method comprising:

obtaining, by a processor, a patient data tensor indicative of a plurality of tests conducted on the patient;

obtaining, by the processor, a set of tensor factors, each tensor factor of the set of tensor factors being indicative of a decomposition of training tensor data for the plurality of tests, the decomposition amplifying low rank structure of the training tensor data;

determining, by the processor, a patient tensor factor for the patient based on the obtained patient data tensor and the obtained set of tensor factors;

applying, by the processor, the determined patient tensor factor to a classifier such that the determined tensor factor establishes a feature vector for the patient, the classifier being configured to process the feature vector to generate the assessment; and

providing, by the processor, output data indicative of the assessment.

2. The method of claim 1 , wherein the set of tensor factors comprises a tensor factor indicative of a correlation of the decomposition to multiple predetermined values of a noise level parameter.

3. The method of claim 1 , wherein the set of tensor factors comprises a tensor factor indicative of a correlation of the decomposition to timing windows for the plurality of tests.

4. The method of claim 1 , wherein determining the patient tensor factor comprises solving a least squares problem to minimize a difference between the patient data tensor and a tensor product of the obtained tensor factors and the patient tensor factor.

5. The method of claim 1 , further comprising forming the feature vector for the patient by combining the determined patient tensor factor with electronic health record data for the patient.

6. The method of claim 1 , wherein the obtained set of tensor factors is indicative of training data processed via a procedure in which the training data is clustered in accordance with presence of the medical condition.

7. The method of claim 1 , wherein the plurality of tests comprises an electrocardiogram (ECG) test, a blood pressure test, and a photoplethysmography (PPG) test conducted during a time period window.

8. The method of claim 1 , wherein the low rank structure comprises a plurality of rank 1 tensors.

9. A method of generating an assessment of medical condition for a patient, the method comprising:

obtaining, by a processor, tensor data comprising one or more patient-based tensors for patient data indicative of a plurality of tests conducted on the patient and first and second class tensors for first and second patient classes with and without the medical condition, respectively;

adjusting, by the processor, dimensionality of either the one or more patient-based tensors or the first and second class tensors via a tensor decomposition so that the one or more patient-based tensors or the first and second class tensors have a same dimensionality, the tensor decomposition generating a set of tensor factors that amplify low rank structure;

computing, by the processor, first and second similarity scores for first and second tensor pairings of the one or more patient-based tensors relative to the first and second patient classes, respectively;

selecting, by the processor, the first patient class or the second patient class for the assessment based on the computed first and second similarity scores; and

providing, by the processor, output data indicative of the assessment.

10. The method of claim 9 , wherein adjusting the dimensionality comprises replacing a tensor factor generated via the tensor decomposition with a matrix that minimizes a distance between tensors for which the first and second similarity scores are computed.

11. The method of claim 9 , wherein obtaining the tensor data comprises stacking the patient data onto the first and second class tensors to create first and second patient-based tensors.

12. The method of claim 9 , wherein computing the first and second similarity scores further comprises determining a normalized inner product of tensors for which the first and second similarity scores are computed.

13. The method of claim 9 , wherein computing the first and second similarity scores further comprises implementing a canonical polyadic (CP) decomposition procedure on tensors for which the first and second similarity scores are computed.

14. The method of claim 9 , wherein selecting the first patient class or the second patient class comprises determining which of the first patient class and the second patient class has a higher similarity score.

15. The method of claim 9 , wherein the low rank structure comprises a plurality of rank 1 tensors.

16. A method of de-noising tensor data in preparation for a medical condition assessment, the method comprising:

obtaining, by a processor, the tensor data;

estimating, by the processor, a noise level of the tensor data using tensor amplification-based dimension reduction;

implementing, by the processor, a decomposition by iteratively amplifying low rank structure of the tensor data while an error term of the decomposition is greater than the estimated noise level; and

providing, by the processor, tensor factors of the decomposition when the error term is equal to or less than the estimated noise level, or a de-noised version of the tensor data based on the tensor factors.

17. The method of claim 16 , wherein implementing the decomposition comprises implementing a tensor amplification-based tensor decomposition.

18. The method of claim 16 , wherein the low rank structure comprises a plurality of rank 1 tensors.

19. The method of claim 16 , wherein estimating the noise level using tensor amplification-based dimension reduction comprises generating a set of tensor factors, each tensor factor of the set of tensor factors being indicative of a decomposition of the tensor data.

20. The method of claim 16 , wherein the tensor data is indicative of physiological data.

Assignments (3)
CONFIRMATORY LICENSE Recorded Dec 27, 2023
From: UNIVERSITY OF MICHIGAN
To: UNITED STATES GOVERNMENT
Reel/Frame 066127/0677 →
CORRECTIVE ASSIGNMENT TO CORRECT THE SECOND INVENTOR'S EXECUTION DATE PREVIOUSLY RECORDED AT REEL: 055235 FRAME: 0051. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT . Recorded Mar 23, 2021
From: DERKSEN, HENDRIKUS; TOKCAN, NERIMAN; NAJARIAN, KAYVAN; GRYAK, JONATHAN
To: THE REGENTS OF THE UNIVERSITY OF MICHIGAN
Reel/Frame 055693/0607 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 11, 2021
From: DERKSEN, HENDRIKUS; TOKCAN, NERIMAN; NAJARIAN, KAYVAN; GRYAK, JONATHAN
To: THE REGENTS OF THE UNIVERSITY OF MICHIGAN
Reel/Frame 055235/0051 →
Continuity (2)
Provisional Application 62970653 · Feb 5, 2020
Related Publication 20210338171A1 · Nov 4, 2021
References Cited (64)
US 11355240B2 · Hirsch · 2022 [cited by examiner]
US 11829867B2 · Iwakura · 2023 [cited by examiner]
US 20080063264A1 · Porikli · 2008 [cited by examiner]
US 20110119209A1 · Kirshenbaum · 2011 [cited by examiner]
US 20200005929A1 · Tablan · 2020 [cited by examiner]
Xuyu Wang, Chao Yang, and Shiwen Mao. TensorBeat: Tensor Decomposition for Monitoring Multiperson Breathing Beats with Commodity WiFi. ACM Trans. Intell. Syst. Technol. 9, 1, Article 8, 27 pages. <https://doi.org/10.114… [cited by examiner]
L.-H. Lim and P. Comon, Multiarray signal processing: tensor decomposition meets compressed sensing, Comptes Rendus Mecanique 338 (2010), 311-320. [cited by applicant]
R. Bro, Multi-way Analysis in the Food Industry: Models, Algorithms and Applications, Ph. D. thesis, University of Amsterdam, 1998. Available at: http://www.models.kv1.dk/research/theses. [cited by applicant]
Z. Wen, W. Yin and Y. Zhang, Solving low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm, Rice CAAM Tech Report 10-07, University of Rice, 2010. [cited by applicant]
A. Anandkumar, R. Ge, D. Hsu, S. Kakade and M. Telgarsky, Tensor decompositions for learning latent variable models, J. of Machine Learning Research 15 (2014), 2773-2832. [cited by applicant]
A. Cichocki, Era of Big Data Processing: A new approach via tensor networks and tensor decompositions, Preprint 2014, arXiv:1403.2048. [cited by applicant]
A. Rajwade, A. Rangarajan and A. Banerjee, Image Denoising using Higher Order Singular Value Decomposition, IEEE Trans. on Pattern Analysis and Machine Intelligence (PAMI) 35 (2013), 849-862. [cited by applicant]
A. Rajwade, A. Rangarajan and A. Banerjee, Using the Higher Order Singular Value Decomposition (HOSVD) for Video Denoising, Energy Minimization Methods in Computer Vision and Pattern Recognition (EMMCVPR), Springer, NCS… [cited by applicant]
A. Ramlatchan et al., A survey of matrix completion methods for recommendation systems, Big Data Mining and Analytics, 1 (2018) No. 4, 308-323. [cited by applicant]
A. Özdemir, M. A. Iwen and S. Aviyente, “A multiscale approach for tensor denoising” 2016 IEEE Statistical Signal Processing Workshop (SSP), 2016, pp. 1-5, doi: 10.1109/SSP.2016.7551841. [cited by applicant]
B. Mishra, G. Meyer, F. Bach and R. Sepulchre, Low-rank optimization with trace norm penalty, Preprint, 2011, http://arxiv.org/abs/1112.2318. [cited by applicant]
B. Mitchell and D. S. Burdick, Slowly converging PARAFAC sequences: Swamps and two-factor degeneracies, J. Chemometrics 8 (1994), 155-168. [cited by applicant]
B. Recht and C. Ré, Parallel stochastic gradient algorithms for large-scale matrix completion, Math. Programming Computation 5 (2013), 201-226. [cited by applicant]
B. Recht, M. Fazel and P. Parillo, Guaranteed minimum rank solutions of linear matrix equations via nuclear norm minimization, SIAM Review 52 (2010), No. 3, 471-501. [cited by applicant]
B. W. Bader, T. G. Kolda and others, MATLAB Tensor Toolbox, Version [Version], available online at https://www.tensortoolbox.org, 2021. [cited by applicant]
C. J. Hillar and L.-H. Lim, Most tensor problems are NP-hard, Journal of the ACM 60 (2013), No. 6, Art. 45. [cited by applicant]
C. Navasca, L. de Lathauwer and S. Kinderman, Swamp reducing technique for tensor decompositions, in: Proceedings of the 16th European Signal Processing Conference (EUSIPCO 2008), Lausanne, 2008. [cited by applicant]
D. L. Donoho, Compressed Sensing, IEEE Trans. on Information Theory 52 (2006), 1289-1306. [cited by applicant]
D. Nion and L. De Lathauwer, An enhanced line search scheme for complex-valued tensor decompositions. Application in DS-CDMA, Signal Process. 88 (2008), 749-755. [cited by applicant]
E. J. Candès and B. Recht, Exact matrix completion via convex optimization, Found. of Comput. Math. 9, 2009, 717-772. [cited by applicant]
E. J. Candès and Y. Plan, Matrix completion with noise, Proceedings of the IEEE 98, 2010, 925-936. [cited by applicant]
E. J. Candès, J. K. Romberg and T. Tao, Stable signal recovery from incomplete and inaccurate measurements, Comm. on Pure and Appl. Math. 59 (2006), 1207-1223. [cited by applicant]
F. L. Hitchcock, Multiple invariants and generalized rank of a p-way matrix or tensor, J. Math. Phys. 7, No. 1, 39-79. [cited by applicant]
F. L. Hitchcock, The expression of a tensor or a polyadic as a sum of products, J. Math. Phys. 6 (1927), No. 1, 164-189. [cited by applicant]
G. Tomasi, Practical and Computational Aspects in Chemometric Data Analysis, Ph. D. thesis, Deparment of Food Science, The Royal Veterinary and Agricultural University, Frederiksberg, Denmark, 2006. Available at http://… [cited by applicant]
H. Derksen, A general theory of singular values with applications to signal denoising, SIAM Journal on Appl. Alg. and Geom., 2017, arXiv:1705.10881. [cited by applicant]
H. Derksen, On the nuclear norm and the singular value decomposition of tensors, Found. Comput. Math. 16 (2016), No. 3, 779-811. [cited by applicant]
H. Weyl, The Classical Groups. Their Invariants and Representations, Princeton University Press, 1939. [cited by applicant]
J. D. Carroll and J. Chang, Analysis of individual differences in multidimensional scaling via an N-way generalization of “Eckart-Young” decomposition, Psychometrika 35 (1970), 283-319. [cited by applicant]
J. Hastad, Tensor rank is NP-complete, J. Algorithms 11 (1990), No. 4, 644-654. [cited by applicant]
J. Jiang, H. Wu, Y. Li and R. Yu, Three-way data resolution by alternating slice-wise diagonalization (ASD) method, J. CHemometrics 14 (2000), 15-36. [cited by applicant]
J. M. Landsberg, Tensors: Geometry and Applications, Graduate Studies in Mathematics 128, American Mathematical Society, Providence, RI, 2012. [cited by applicant]
K. C. Toh and S. Yun, An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems, Pacific Journal of Optimization 6 (2010), 615-640. [cited by applicant]
M. Rajih and P. Comon, Enhanced line search: A novel method to accelerate PARAFAC, in: EUSIPCO-05: Proceedings of the 13th European Signal Processing Conference, 2005. [cited by applicant]
N. Srebro, J. Rennie and T. Jaakkola, Maximum margin matrix factorization, in: Advances in Neural Information Processing Systems (NIPS) 17 (2005). [cited by applicant]
OEIS Foundation Inc. (2019), The On-Line Encyclopedia of Integer Sequences, http://oeis.org/A002831. [cited by applicant]
P. A. Wang and C. J. Lu, Tensor decomposition via simultaneous power iteration, Proceedings of the 34th International Conference on Machine Learning, PMLR 70:3665-3673, 2017. [cited by applicant]
P. Jain, R. Meka and I. S. Dhillon, Guaranteed rank minimization via singular value projection, in: Advances in Neural Information processing Systems (NIPS) 22 (2010), 937-945. [cited by applicant]
P. Paatero, Construction and analysis of degenerate PARAFAC models, J. Chemometrics 14 (2000), 285-299. [cited by applicant]
R. A. Harshman, Foundations of the parafac procedure: models and conditions for an “explanatory” multimodal factor analysis, UCLA working papers in Phonetics 16 (1970), 1-84. [cited by applicant]
R. Brauer, On algebras which are connected with the semisimple continuous groups, Annals of Mathematics 38 (1937), No. 4, 857-872. [cited by applicant]
R. H. Keshavan, A. Montanari and S. Oh, Matrix completion from a few entries, IEEE Trans. on Information Theory 56 (2010), 2980-2998. [cited by applicant]
R. Keshavan and S. Oh, Optspace: A gradient descent algorithm on the Grassmann manifold for matrix completion, preprint 2009, http://arxiv.org/abs/0910.5260. [cited by applicant]
R. Mazumder, T. Hastie and R. Tibshirani, Spectral regularization algorithms for learning large incomplete matrices, J. of Machine Learning Research 11 (2010), 2287-2322. [cited by applicant]
R. Schatten, A Theory of Cross-Spaces, Princeton University Press, Princeton, NJ, 1950. [cited by applicant]
S. Friedland, L.-H. Lim, Nuclear norm of higher-order tensors, Mathematics of Computation 87 (2018), No. 311, 1255-1281. [cited by applicant]
S. Ji and J. Ye, An accelerated gradient method for trace norm minimization, in: Proceedings of the 26th International Conference on Machine Learning (ICML), 2009, 457-464. [cited by applicant]
S. Ma, D. Goldfarb and L. Chen, Fixed point and Bregman iterative methods for matrix rank minimization, Mathematical Programming 128 (2011), 321-353. [cited by applicant]
T. G. Kolda and B. W. Bader, Tensor decompositions and applications, SIAM review 51 (2009), No. 3, 455-500. [cited by applicant]
V. L. Popov and E. B. Vinberg, “Invariant theory” in: Encyclopaedia of Mathematical Sciences, vol. 55, A. Parshin and I. R. Shafarevich, eds., Springer-Verlag, Berlin, 1994. [cited by applicant]
W. Hu, Y. Xie, W. Zhang, L. Zhu, Y. Qu and Y. Tan, Image denoising via nonlocally sparse coding and tensor decomposition, Proceedings of International Conference on Internet Multimedia Computing and Service (ICMCS '14),… [cited by applicant]
W. S. Rayens and B. C. Mitchell, Two-factor degeneracies and a stabilization of PARAFAC, Chemometrics and Intelligent Laboratory Systems 38 (1997), 173-181. [cited by applicant]
Y. Liu, D. Sun and K.-C. Toh, An implementable proximal point algorithmic framework for nuclear norm minimization, Mathematical Programming 133 (2012), 399-436. [cited by applicant]
Y. Wang, H.-Y. Tung, A. J. Smola and A. Anandkumar, Fast and guaranteed tensor decomposition via sketching, Advances in Neural Information Processing Systems 28 (NIPS 2015). [cited by applicant]
Z. Lu and Y. Zhang, Penalty decomposition methods for rank minimization, preprint, 2010, http://arxiv.org/abs/0910.5260. [cited by applicant]
Z. Weng, M.-J. Lai, Z. Lu, W. Fan, H. Davulcu and J. Ye, Orthogonal rank-one matrix pursuit for low rank matrix completion, Preprint 2014, http://arxiv.org/abs/1404.1377. [cited by applicant]
Goodman et al., “Symmetry, Representations, and Invariants”, Graduate Texts in Mathematics, Chapter 10, p. 428, Fig. 10.2, 2009, Springer. [cited by applicant]
J.-F. Cai, E. J. Candes and Z. Shen, “A Singular Value Thresholding Algorithm for Matrix Completion”, SIAM J. on Optimization 20, 1956-1982, (2010). [cited by applicant]
Smilde et al., “Multi-way Analysis with Applications in the Chemical Sciences”, Chapter 6, pp. 116-118 “Initializing PARAFAC-ALS”, 2004, Wiley. [cited by applicant]