http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-10692251-B2
Outgoing Links
| Predicate | Object |
|---|---|
| assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_8d0f10d81a44adb3a0f44ef3742d65ae http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_126ee3230b4b5418ebce8364ea676b89 |
| classificationCPCAdditional | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06T2211-424 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06T2210-41 |
| classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06T11-006 |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06T11-00 |
| filingDate | 2017-01-13-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| grantDate | 2020-06-23-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_fe789b7b89b8e783a139c582338fbd76 http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_63721c6f0b9bd7d4b4c6564e7a63a126 |
| publicationDate | 2020-06-23-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | US-10692251-B2 |
| titleOfInvention | Efficient variance-reduced method and apparatus for model-based iterative CT image reconstruction |
| abstract | A method and apparatus is provided to reconstruct a computed tomography image using iterative reconstruction combined with variance-reduced acceleration techniques. The acceleration techniques including: ordered subsets, separable quadratic surrogates, and Nesterov's acceleration. Ordered subset iteration is used, but instead of calculating a gradient of the objective function for only one subset per iteration, a full gradient of the total objective function is used. This decreases the variance and mitigates limit cycles. A correction term is calculated as the difference between the subset gradient and the full gradient, and this correction term is used when performing the update of the reconstructed image. The ordered subset can be combined with Nesterov's acceleration. To improve computational efficiency, the full gradient can be calculated once every T iterations, with negligible degradation to the convergence rate. |
| priorityDate | 2017-01-13-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 23.