PATENT CLAIM ANALYSIS

Application Number: 15897110
Application Type: Utility
Filing Date: 2018-02
Publication Date: 2018-06
Patent Classification: ["382", "131000"]

Abstract:
Some embodiments of the present disclosure relates to a method and system for generating crystal lookup table (CLT) based on a flood histogram. The method may include receiving a flood histogram of a subject; determining a crystal central position map based on the flood histogram, the crystal central position map including a plurality of crystal central positions, forming rows and columns of the plurality of crystal central positions to generate a labelled crystal lookup table, forming a template based on the rows and the columns in the labelled crystal central position map, and correcting the labelled crystal central position map based on the template and the flood histogram to obtain a corrected crystal central position map. A crystal lookup table may be formed.

Claim (Index 34):
The system of  claim 31 , wherein to generate the crystal central position map (CCPM) based on the series of binary image B i , the at least one processor is configured to cause the system to:\n identify a plurality of connected components in the series of binary image B i , 1 i K, the plurality of connected components each corresponding to a connected region inside which all pixel values are one; classify the plurality of connected components into overlapping connected components and non-overlapping connected components, wherein each of the non-overlapping connected components does not overlap with any of the plurality of connected components, each of the overlapping connected components overlaps with at least one of the plurality of connected components; group the overlapping connected components into a plurality of groups, wherein in each group of the plurality of groups each overlapping connected component overlaps with each of the other overlapping connected components in the group; for each of the plurality of groups, determine a connected component as a target overlapping connected component, the determined target connected component having a smallest area among the overlapping connected components in the group or identified in a binary image B M , wherein M is the highest number of iteration i in binary images B i  among the overlapping connected components in the group; generate the CCPM based on the non-overlapping components and the target overlapping connected components.

Metadata:
- Claim Count in Document: 59.0
- Percentile: 88.0
- Lexical Diversity: 2.55769
- Patent Class: 382.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: True
- Related Applications: ['15142295', '12916100', '13955029', '13702150', '14731223']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.27852250462659
- 35 USC 102 Novelty (BERT): 0.585838745688036
- Combined Prediction Score: 0.3092541287327346
- Mean Citation Score: 211.24377
- Max Citation Score: 530.8494
- Similarity Product: 370.72504487979415

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

Dataset: test