PATENT CLAIM ANALYSIS

Application Number: 16119403
Application Type: Utility
Filing Date: 2018-08
Publication Date: 2019-01
Patent Classification: ["725", "031000"]

Abstract:
Digital files are compressed using a process including Schmidt decompositions of matrices using an algorithm, termed ‘BSD’ herein, which is based on an algebraic method generalizing QR decomposition. Software analyzes an input file and initially identifies a matrix M, with entries within a predefined set of integers, within the file. Next, essential entries are defined, extracted from M, that contain sufficient information to recover M using BSD. The compressed file includes the essential entries and their positions within M. To achieve an encryption process, software encrypts the pattern matrix that includes the positions of the essential entries of M. To achieve a lossy compression, software identifies essential entries that contain sufficient information to recover an approximation to M for which the quality is determined by an error threshold. For a more efficient lossy compression, software uses singular value decomposition, BSD, and other signal processing of M.

Claim (Index 1):
A method for encoding digital data, comprising:\n using a computer executing software stored on non-transitory media, the software configured to:\n use SVD to find Ma, an mn\u00d7pq matrix, with the lowest Schmidt rank R for which PSNR(Ma, M)\u2265a predetermined value; \n quantize Ma to find a matrix Q whose entries are integers; \n define a left essential matrix A; \n define a right essential matrix B; \n define a pattern matrix P for storing positions of essential entries; \n assign to matrix M e  a starting value of Q; \n define a matrix A e ; \n define a matrix B e , \n assign a starting value to e; \n a) select a non-zero entry d e  of M e ; \n b) store the position (r, c) of the selected non-zero entry of M e  at an e th  column of P; \n c) select from M e  two matrices A e  and B e  having d e  as a common entry and for which A e \u2297B e /d e  is a term in the Schmidt decomposition of M with respect to the parameters m, n, p, and q; \n d) store in the e th  m\u00d7p block of A the entries of M whose positions are the positions of the entries of A e  in M e ; \n e) store in the e th  n\u00d7q block of B the entries of M whose positions are the positions of the entries of B e  in M e ; and \n f) calculate the matrix M e+1 =M e \u2212A e \u2297B e /d e , and if e<R , repeat steps (a)-(f) with M e+1 , and if e=R, then P, A, and B collectively represent encoded digital data corresponding to M.

Metadata:
- Claim Count in Document: 3.0
- Percentile: 96.0
- Lexical Diversity: 1.9186
- Patent Class: 725.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['15505665', '15821480', '14215292', '13377866', '13875619']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.4131963910729103
- 35 USC 102 Novelty (BERT): 0.5245611770310263
- Combined Prediction Score: 0.4243328696687219
- Mean Citation Score: 190.990756
- Max Citation Score: 331.52948
- Similarity Product: 273.47359986007933

Labels:
- Claim Label 101: 0
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 0
- Label 101 Adjusted: 0

Dataset: test