# US 2025/0167801 A1 · Medical imaging data compression utilizing codebooks

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

- Number: US 2025/0167801 A1
- Document ID: US20250167801A1
- Status: Published application
- Kind: A1
- Application number: 18/907,456
- Filed: 2024-10-04
- Published: 2025-05-22
- Earliest claimed: 2017-10-30
- Assignees: Atombeam Technologies Inc.
- Applicants: AtomBeam Technologies Inc.
- Inventors: Joshua Cooper; Charles Yeomans; Brian Galvin; Grant Fickes
- Web page: https://patentgrep.com/patent/US20250167801A1

## CPC

- G06N 3/0455: Auto-encoder networks; Encoder-decoder networks
- H03M 7/3059: {Digital compression and data reduction techniques where the original information is represented by a subset or similar information, e.g. lossy compression}
- G06N 3/047: Probabilistic or stochastic networks
- G06N 3/0475: Generative networks
- G06N 3/0895: Weakly supervised learning, e.g. semi-supervised or self-supervised learning
- G06N 20/00: Machine learning
- H03M 7/3079: {Context modeling}
- H03M 7/40: Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
- H03M 7/6005: {Decoder aspects}
- H03M 7/6041: {Compression optimized for errors}
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

A system and method for an innovative approach to medical imaging compression and encryption, specifically designed for tomosynthesis data. It transforms input data to a dyadic distribution, optimizing it for Huffman encoding while preserving critical diagnostic information. The compressed data is processed through a Large Codeword Model (LCM) incorporating a latent transformer, which learns complex patterns and relationships within the imaging data. This process not only achieves high compression ratios but also provides inherent encryption. A neural upsampler, trained to invert the dyadic transformation, reconstructs the original image with high fidelity. The system is particularly effective for handling the redundancies inherent in tomosynthesis datasets, where adjacent slices often contain similar information. By balancing compression efficiency with diagnostic accuracy, this method enables secure storage and transmission of large medical imaging datasets while maintaining the ability to reconstruct high-quality images for accurate diagnosis.

## Claims

### Claim 1

A system for efficient data compression and accurate reconstruction, comprising:
a computing device comprising at least a memory and a processor;
a plurality of programming instructions that, when operating on the processor, cause the computing device to:
analyze a distribution of input data;
transform the input data to approximate a target distribution optimized for compression;
apply an entropy coding technique to the transformed data;
generate a compressed data stream;
process the compressed data through an encoder to generate latent space vectors;
learn relationships between the latent space vectors; and
generate output based on the learned relationships.

### Claim 2 (depends on 1)

The system of claim 1, wherein the computing device is further caused to:
apply entropy decoding to the output to produce a decompressed data stream;
process the decompressed data stream;
reconstruct the original data distribution, recovering information altered during the initial transformation; and
process the reconstructed data to extract relevant information.

### Claim 3 (depends on 1)

The system of claim 1, wherein the target distribution is a dyadic distribution.

### Claim 4 (depends on 1)

The system of claim 1, wherein the entropy coding technique is Huffman coding.

### Claim 5 (depends on 1)

The system of claim 1, wherein a latent transformer architecture is utilized to generate the latent space vectors.

### Claim 6 (depends on 1)

The system of claim 1, wherein the encoder is a variational autoencoder.

### Claim 7 (depends on 1)

The system of claim 1, further comprising a Large Codeword Model configured to process the compressed data stream into a plurality of latent space vectors.

### Claim 8 (depends on 2)

The system of claim 2, wherein the computing device is further caused to:
compare the reconstructed data to the original input data;
quantify any discrepancies or information loss; and
provide feedback to optimize the transformation and neural reconstruction processes.

### Claim 9 (depends on 1)

The system of claim 1, wherein the computing device is further caused to identify unusual patterns or deviations in the latent space vectors.

### Claim 10 (depends on 1)

The system of claim 1, wherein the system is configured to operate on streaming data in real-time.

### Claim 11 (depends on 1)

The system of claim 1, wherein the computing device is further caused to generate human-readable reports based on the extracted relevant information.

### Claim 12

A method for efficient data compression and accurate reconstruction, comprising the steps of:
analyzing the distribution of input data;
transforming the data to approximate a target distribution optimized for compression;
applying an entropy coding technique to the transformed data;
generating compressed data stream;
processing the compressed data through an encoder to generate latent space vectors;
learning relationships between the latent space vectors; and
generating output based on the learned relationships.

### Claim 13 (depends on 12)

The method of claim 12, wherein the computing device is further caused to:
apply entropy decoding to the output to produce a decompressed data stream;
process the decompressed data stream;
reconstruct the original data distribution, recovering information altered during the initial transformation; and
process the reconstructed data to extract relevant information.

### Claim 14 (depends on 12)

The method of claim 12, wherein the target distribution is a dyadic distribution.

### Claim 15 (depends on 12)

The method of claim 12, wherein the entropy coding technique is Huffman coding.

### Claim 16 (depends on 12)

The method of claim 12, wherein a latent transformer architecture is utilized to generate the latent space vectors.

### Claim 17 (depends on 12)

The method of claim 12, wherein the encoder is a variational autoencoder.

### Claim 18 (depends on 12)

The method of claim 12, further comprising a Large Codeword Model configured to process the compressed data stream into a plurality of latent space vectors.

### Claim 19 (depends on 13)

The method of claim 13, wherein the computing device is further caused to:
compare the reconstructed data to the original input data;
quantify any discrepancies or information loss; and
provide feedback to optimize the transformation and neural reconstruction processes.

### Claim 20 (depends on 12)

The method of claim 12, wherein the computing device is further caused to identify unusual patterns or deviations in the latent space vectors.

### Claim 21 (depends on 12)

The method of claim 12, wherein the system is configured to operate on streaming data in real-time.

### Claim 22 (depends on 12)

The method of claim 12, wherein the computing device is further caused to generate human-readable reports based on the extracted relevant information.
