PATENT CLAIM ANALYSIS

Application Number: 16087419
Application Type: Utility
Filing Date: 2018-09
Publication Date: 2019-04
Patent Classification: ["382", "131000"]

Abstract:
The disclosed apparatus, systems and methods relate to a framelet-based iterative algorithm for polychromatic CT which can reconstruct two components using a single scan. The algorithm can have various steps including a scaled-gradient descent step of constant or variant step sizes; a non-negativity step; a soft thresholding step; and a color reconstruction step.

Claim (Index 8):
A single scan polychromatic CT image reconstruction system, comprising:\n a. a computer implementing a computer-readable media comprising a single CT scan; and b. a processor configured to implement a framelet-based iterative algorithm configured for implementing a framelet-based iterative algorithm for CT image reconstruction from the single CT scan, the iterative algorithm comprising:\n i. a scaled-gradient descent step of constant or variant step sizes; \n ii. a non-negativity step; \n iii. a soft thresholding step; and \n iv. a color reconstruction step, \n wherein the processor is configured to reconstruct the CT image following the execution of the iterative steps, \n wherein \u03d5=\u03d5(r) defines a photoelectric component and \u03b8=\u03b8(r) defines a Compton scatter component of the attenuation coefficient \u03bc(r, E) at each point r, and \n wherein the iterative algorithm comprises iterating on n as follows: \n \u03c6 j n + 1 3 = \u03c6 j n - \u03b4 1 \ue89e \u2202 L \u2202 \u03c6 j \ue89e ( \u03c6 n , \u03b8 n ) \ue89e ( \u2211 h = 1 J \ue89e ( \u2202 2 \ue89e L \u2202 \u03c6 j \ue89e \u2202 \u03c6 h + \u2202 2 \ue89e L \u2202 \u03c6 j \ue89e \u2202 \u03b8 h ) \ue89e ( \u03c6 n , \u03b8 n ) ) - 1 \u03c6 j n + 2 3 = max \ue89e { \u03c6 j n + 1 3 , 0 } \u03b8 j n + 1 3 = \u03b8 j n - \u03b4 2 \ue89e \u2202 L \u2202 \u03b8 j \ue89e ( \u03c6 n , \u03b8 n ) \ue89e ( \u2211 h = 1 J \ue89e ( \u2202 2 \ue89e L \u2202 \u03b8 j \ue89e \u2202 \u03c6 h + \u2202 2 \ue89e L \u2202 \u03b8 j \ue89e \u2202 \u03b8 h ) \ue89e ( \u03c6 n , \u03b8 n ) ) - 1 \u03b8 j n + 2 3 = max \ue89e { \u03b8 j n + 1 3 , 0 } \u03c6 j n + 1 = \ue536 T \ue89e T \u03bb 1 \ue8a0 ( \ue536 \ue89e \ue89e \u03c6 j n + 2 3 ) \ue89e \n \ue89e \u03b8 j n + 1 = \ue536 T \ue89e T \u03bb 2 \ue8a0 ( \ue536 \ue89e \ue89e \u03b8 j n + 2 3 ) .

Metadata:
- Claim Count in Document: 3.0
- Percentile: 97.0
- Lexical Diversity: 1.37209
- Patent Class: 382.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['15313239', '12385498', '13264834', '14786290', '14592691']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.2923671129032607
- 35 USC 102 Novelty (BERT): 0.5039051181837915
- Combined Prediction Score: 0.3135209134313138
- Mean Citation Score: 223.467284
- Max Citation Score: 238.04643
- Similarity Product: 166.20608597559567

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

Dataset: test