# US 2016/0335473 A1 · Method for processing molecular imaging data and corresponding data server

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2016/0335473 A1
- Document ID: US20160335473A1
- Status: Published application
- Kind: A1
- Application number: 15/110,430
- Filed: 2015-01-09
- Published: 2016-11-17
- Earliest claimed: 2014-01-10
- Assignees: Imabiotech
- Applicants: Imabiotech
- Inventors: Fabien PAMELARD; Jonathan M. STAUBER
- Web page: https://patentgrep.com/patent/US20160335473A1

## CPC

- G06V 20/695: {Preprocessing, e.g. image segmentation}
- G06T 3/40: Scaling of whole images or parts thereof, e.g. expanding or contracting
- G06T 7/0014: {using an image reference approach}
- G06T 7/337: {involving reference images or patches}
- G06T 7/90: Determination of colour characteristics
- G16B 45/00: ICT specially adapted for bioinformatics-related data visualisation, e.g. displaying of maps or networks
- G16B 50/00: ICT programming tools or database systems specially adapted for bioinformatics
- G16B 50/30: Data warehousing; Computing architectures
- H01J 49/0036: {Step by step routines describing the handling of the data generated during a measurement}
- G06T 2207/10088: Magnetic resonance imaging [MRI]
- G06T 2207/10104: Positron emission tomography [PET]
- G06T 2207/30024: Cell structures in vitro; Tissue sections in vitro
- G06V: IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G16B: BIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY
- H01J: ELECTRIC DISCHARGE TUBES OR DISCHARGE LAMPS (spark-gaps H01T; electric arc lamps H05B31/00; particle accelerators H05H)

## Abstract

A method for processing a plurality of spectral datasets (J1-Jn) intended for being used by a molecular imaging method or a method for recording a plurality of spectral datasets (J1-Jn), each spectral dataset (J1-Jn) being defined by a set of spatial positions (Xi, Yj) each of which is associated with a molecular spectrum with at least two dimensions containing a set of molecular information (S(Xi, Yj)), the method including in particular the following steps: for each dataset (J1-Jn), cutting the molecular spectrum associated with each position (Xi, Yj) into a plurality of spectrum segments (T1-Tm); inserting the segments (T1-Tm) obtained for each position (Xi, Yj) of each dataset (J1-Jn) into a database (BDD); selecting in the database (BDD), following a request relating to molecular information of interest, the one or more segments (T1-Tm) containing the molecular information of interest; and selecting, within each segment (T1-Tm), the molecular information of interest.

## Claims

### Claim 1

A process for processing a plurality of spectral data sets (J1-Jn) intended to be exploited by a molecular imaging process, each spectral data set (J1-Jn) being defined by a set of spatial positions (Xi, Yj) with each of which is associated a molecular spectrum of at least two dimensions containing a set of molecular information (S(Xi, Yj)), the process comprising the following steps:
for each data set (J1-Jn) cutting the molecular spectrum associated with each position (Xi, Yj) into several sections of spectrum (T1-Tm) each containing some of the molecular information of said spectrum,
inserting the sections (T1-Tm) obtained for each position (Xi, Yj) of each data set (J1-Jn) into a database (BDD), such that a set of indexed sections of spectrum (T1-Tm) is associated with each position (Xi, Yj) of each data set (J1-Jn),
selecting in the database (BDD) following a request relative to molecular information of interest, the section(s) (T1-Tm) containing the molecular information of interest, and
selecting within each section (T1-Tm) said molecular information of interest.

### Claim 2

A process for recording a plurality of spectral data sets during a molecular imaging process, each data set being defined by a set of spatial positions, with each of which is associated a molecular spectrum of at least two dimensions containing a set of molecular information, the process comprising the following steps:
during acquisition of spectral data, and for each spectral data set, cutting the molecular spectrum associated with each position into several sections of spectrum, each containing some of the molecular information of said spectrum,
inserting the sections obtained for each position of each data set into a database such that a set of indexed sections of spectrum is associated with each position of each data set, and optionally
selecting in the database, following a request relative to molecular information of interest, the section(s) containing the molecular information of interest, and
selecting within each section said molecular information of interest.

### Claim 3 (depends on 1)

The process according to claim 1, further comprising a step of viewing the molecular information of interest in the form of a set of data maps (C1-Cn) each corresponding to a data set (J1-Jn).

### Claim 4 (depends on 1)

The process according to claim 1, which includes the following steps:
cutting the molecular spectra (S(Xi, Yj)) into sections of spectrum (T1-Tm) as per at least one predetermined pitch (P′),
inserting a reference axis (Aref) setting up correspondence between points index of the different sections (T1-Tm) and the corresponding molecular information, and
selecting the section (T1-Tm) containing the molecular information of interest as a function of the reference axis (Aref) and of the predetermined pitch (P′).

### Claim 5 (depends on 1)

The process according to claim 1, wherein, before or after insertion of sections (T1-Tm) into the database (BDD) said process includes at least one pre-processing step consisting of spectral alignment and/or subtraction of background noise and/or intra data set standardization (J1-Jn).

### Claim 6 (depends on 1)

The process according to claim 1, which includes the step of resizing the spatial positions (Xi, Yj) of the data sets (J1-Jn) having different spatial sizes so as to be aligned on the data set (J1-Jn) having the finest spatial size.

### Claim 7 (depends on 1)

The process according to claim 1, which further includes the step of extracting a data set, such as maximum intensity (Pk1-Pkl), average intensity, an area under a peak, a noise-to-signal ratio of each peak of interest of all the molecular spectra.

### Claim 8 (depends on 7)

The process according to claim 7, wherein extraction is performed as a function of peak selection criteria defined by a quality criterion of a noise-to-signal ratio and/or a spectral resolution.

### Claim 9 (depends on 1)

The process according to claim 1, which includes the step of standardizing the molecular spectra of the plurality of the data sets (J1-Jn) to each other so as to then compare the different data sets (J1-Jn) to each other.

### Claim 10 (depends on 9)

The process according to claim 9, wherein to perform the standardization step, said process includes the following steps:
selecting a molecule or several endogenic or exogenic reference molecules (Mref) common to all of the data sets (J1-Jn),
calculating, for each data set (J1-Jn), a standardization factor (Fnor) as a function of this or these reference molecules (Mref), and
correcting the molecular information of interest with this standardization factor to obtain a set of standardized data sets (J1-Jn).

### Claim 11 (depends on 10)

The process according to claim 10, wherein the standardization factor (Fnor) is defined from at least one reference molecule (Mref) present on a set of samples corresponding to the data sets (J1-Jn) or in a particular reference zone (Z) of the samples corresponding to the data sets (J1-Jn).

### Claim 12 (depends on 9)

The process according to claim 9, which includes the step of viewing, comparing and analyzing, in the form of a plurality of data maps (C1′-Cn′) each coming from a standardized data set (J1-Jn), the molecular information of interest with a color scale common to all of the maps.

### Claim 13 (depends on 12)

The process according to claim 12, wherein the common color scale is based on the smallest and largest intensity of all the data sets (J1-Jn) for the molecule of interest.

### Claim 14 (depends on 1)

The process according to claim 1, wherein said data sets (J1-Jn) are obtained by a mass spectrometry process.

### Claim 15 (depends on 1)

The process according to claim 1, wherein said data sets (J1-Jn) are obtained by an imaging process of Positron Emission Tomography (PET) or Magnetic Resonance Imaging (MRI) type.

### Claim 16 (depends on 1)

A data server (10) including a memory storing software instructions for performing at least some of the steps of the process for processing a plurality of data sets (J1-Jn) defined according to claim 1.

### Claim 17 (depends on 2)

The process according to claim 2, further comprising a step of viewing the molecular information of interest in the form of a set of data maps (C1-Cn) each corresponding to a data set (J1-Jn).

### Claim 18 (depends on 2)

The process according to claim 2, which includes the following steps:
cutting the molecular spectra (S(Xi, Yj)) into sections of spectrum (T1-Tm) as per at least one predetermined pitch (P′),
inserting a reference axis (Aref) setting up correspondence between points index of the different sections (T1-Tm) and the corresponding molecular information, and
selecting the section (T1-Tm) containing the molecular information of interest as a function of the reference axis (Aref) and of the predetermined pitch (P′).

### Claim 19 (depends on 2)

The process according to claim 2, wherein, before or after insertion of sections (T1-Tm) into the database (BDD) said process includes at least one pre-processing step consisting of spectral alignment and/or subtraction of background noise and/or intra data set standardization (J1-Jn).

### Claim 20 (depends on 2)

The process according to claim 2, which includes the step of resizing the spatial positions (Xi, Yj) of the data sets (J1-Jn) having different spatial sizes so as to be aligned on the data set (J1-Jn) having the finest spatial size.
