IP Library › Granted Patent US 12,682,418
Granted Patent B2
US 12,682,418 · App. 19/004,301 · Granted Jul 14, 2026

High resolution human imaging using neural network

Inventors: Sakila Sandeepani Jayaweera Samaranayake Arachchige Dona (College Park, MD); Sai Deepika Regani (Campbell, CA); Yuqian Hu (Greenbelt, MD); Guozhen Zhu (Greenbelt, MD); Wei-Hsiang Wang (College Park, MD); Beibei Wang (Clarksville, MD); K. J. Ray Liu (Potomac, MD); Oscar Chi-Lim Au (Rockville, MD)
G06T3/4046G06T3/4053
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,682,418
App. No.
19/004,301
Filed
Dec 28, 2024
Granted
Jul 14, 2026
Kind
B2
Examiner
LU, ZHIYU
Art Unit
2665
USPC
382/100
Abstract

High resolution human imaging using neural network is described. In one example, a described method comprises: assembling a k1-dimensional (k1-D) imaging matrix by a processor based on arranging and concatenating a plurality of k2-dimensional (k2-D) input imaging matrices; encoding the k1-D imaging matrix by an encoder, which is a k1-D encoding neural network, to generate a (k1+k3)-D first intermediate matrix; generating a (k2+k3)-D second intermediate matrix based on the (k1+k3)-D first intermediate matrix; and decoding the (k2+k3)-D second intermediate matrix by a decoder, which is a k2-D decoding neural network, to generate a k2-D output imaging matrix. There is at least one skip connection between the encoder and the decoder. An imaging resolution of the k2-D output imaging matrix is greater than the imaging resolution of any one of the plurality of k2-D input imaging matrices.

Claims (184)

1 . A method for encoder-decoder-based high resolution imaging, comprising:

assembling a k1-dimensional (k1-D) imaging matrix by a processor based on arranging and concatenating a plurality of k2-dimensional (k2-D) input imaging matrices;

encoding the k1-D imaging matrix by an encoder, which is a k1-D encoding neural network, to generate a (k1+k3)-D first intermediate matrix that includes k1 original dimensions of the k1-D imaging matrix and k3 expanded dimensions;

generating a (k2+k3)-D second intermediate matrix by removing (k1−k2) of the k1 original dimensions in the (k1+k3)-D first intermediate matrix, wherein each of k1, k2, k3 is a positive integer; and

decoding the (k2+k3)-D second intermediate matrix by a decoder, which is a k2-D decoding neural network, to generate a k2-D output imaging matrix, wherein:

there is at least one skip connection between the encoder and the decoder, and

an imaging resolution of the k2-D output imaging matrix is greater than the imaging resolution of any one of the plurality of k2-D input imaging matrices.

2 . The method of claim 1 , further comprising:

determining a (k1+k3)-D expanded matrix by adding k3 expanded dimensions to the k1 original dimensions of the k1-D imaging matrix, wherein:

a size of the (k1+k3)-D expanded matrix is 1 in each of the k3 expanded dimensions,

the encoder comprises L1 layers, each associated with multiple convolution filters,

the (k1+k3)-D expanded matrix is a (k1+k3)-D layer-1 input matrix to a layer 1 of the encoder, the first layer of the L1 layers of the encoder.

3 . The method of claim 2 , further comprising:

for each n between 1 and L1:

for each respective convolution filter of the multiple convolution filters associated with layer n of the encoder:

filtering a (k1+k3)-D layer-n input matrix with the respective convolution filter to generate a respective (k1+k3)-D layer-n per-filter output matrix, and

down-sampling the respective (k1+k3)-D layer-n per-filter output matrix in at least one of the k1 original dimensions with max-pooling; and

concatenating all of the (k1+k3)-D layer-n per-filter output matrices to form a (k1+k3)-D layer-n output matrix which is also a layer-(n+1) input matrix,

wherein:

a size of the layer-n output matrix in each of the k1 original dimensions is smaller than or equal to a size of a corresponding original dimension of the layer-n input matrix,

a size of the layer-n output matrix in each of the k3 expanded dimensions is greater than or equal to a size of a corresponding expanded dimension of the layer-n input matrix,

the (k1+k3)-D first intermediate matrix is the layer-(L1) output matrix, and

a size of the (k1+k3)-D first intermediate matrix is 1 in each of the k1 original dimensions.

4 . The method of claim 3 ,

wherein:

the decoder comprises L2 layers, each associated with multiple de-convolution filters,

the (k2+k3)-D second intermediate matrix is a (k2+k3)-D layer-(L1+1) input matrix to a layer 1 of the decoder, the first layer of the L2 layers of the decoder.

5 . The method of claim 4 , further comprising:

for each m between 1 and L2:

up-sampling a (k2+k3)-D layer-(L1+m) input matrix in at least one of the remaining k2 original dimensions to generate a (k2+k3)-D layer-(L1+m) up-sampled input matrix,

for each respective de-convolution filter of the multiple de-convolution filters associated with layer m of the decoder, filtering the (k2+k3)-D layer-(L1+m) up-sampled input matrix with the respective de-convolution filter to generate a respective (k2+k3)-D layer-(L1+m) per-filter output matrix, and

combining and concatenating all of the (k2+k3)-D layer-(L1+m) per-filter output matrices to form a (k2+k3)-D layer-(L1+m) output matrix which is also a layer-(L1+m+1) input matrix, wherein:

a size of the layer-(L1+m) output matrix in each of the remaining k2 original dimensions is greater than or equal to a size of a corresponding original dimension of the layer-(L1+m) input matrix,

a size of the layer-(L1+m) output matrix in each of the k3 expanded dimensions is less than or equal to a size of a corresponding expanded dimension of the layer-(L1+m) input matrix; and

removing the k3 expanded dimensions of the layer-(L1+L2) output matrix to generate the k2-D output imaging matrix.

6 . The method of claim 5 , further comprising:

processing a m1−n1 skip connection, which is a skip connection between layer m1 of the encoder and layer n1 of the decoder, with 1<=m1<=L1, 1<=n1<=L2, wherein the m1−n1 skip connection is processed based on:

adjusting the (k1+k3)-D layer-(m1) output matrix of the encoder to generate a (k2+k3)-D adjusted layer-(m1) output matrix of the encoder, wherein the (k2+k3)-D adjusted layer-(m1) output matrix has a same dimension and a same size as the (k2+k3)-D layer-(L1+n1) output matrix of the decoder;

computing a temporary output matrix as a weighted average of the (k2+k3)-D adjusted layer-(m1) output matrix of the encoder and the (k2+k3)-D layer-(L1+n1) output matrix of the decoder; and

replacing the (k2+k3)-D layer-(L1+n1+1) input matrix of the decoder by the temporary output matrix.

7 . The method of claim 6 , wherein:

there is a m2-n2 skip connection, which is a skip connection between layer m2 of the encoder and layer n2 of the decoder, with 1<=m1<m2<=L1, 1<=n2<n1<=L2; and

the method further comprises processing all skip connections in an ascending order of layer index of the decoder such that the m2-n2 skip connection is processed before the m1−n1 skip connection.

8 . The method of claim 6 , further comprising:

for any n1 and the (k2+k3)-D layer-(L1+n1) output matrix of the decoder: performing a search among all L1 layers of the encoder to identify the m1 layer of the encoder which has an adjusted output matrix with a size matching the size of the layer-(L1+n1) output matrix of the decoder, in order to form the m1−n1 skip connection, wherein:

when no matching layer of the encoder is found, a best match is used for the m1-n1 skip connection,

the best match m1 is a layer of the encoder with a minimum absolute difference between the size of its adjusted output matrix and the size of the layer-(L1+n1) output matrix of the decoder.

9 . The method of claim 6 , further comprising:

computing each element of the (k2+k3)-D adjusted layer-(m1) output matrix of the encoder as a characteristic value of a respective (k1−k2)-D sub-matrix of the (k1+k3)-D layer-(m1) output matrix of the encoder, wherein:

the characteristic value is an aggregate of the elements in the respective (k1−k2)-D submatrix,

the aggregate comprises at least one of: mean, arithmetic mean, geometric mean, harmonic mean, weighted average, percentile, minimum (0-percentile), median (50-percentile), maximum (100-percentile), trimmed mean (mean of percentile from A1-percentile to A2-percentile), mode, sum, weighted sum, product or weighted product.

10 . The method of claim 1 , further comprising:

training the encoder and the decoder as part of a conditional generative adversarial network (cGAN) comprising a generator and a discriminator, wherein:

the generator comprises the encoder and the decoder with the at least one skip connection;

the k1-D imaging matrix is an input of the generator;

the k2-D output imaging matrix is an output of the generator; and

the discriminator comprises:

the encoder with the k1-D imaging matrix as input and the (k2+k3)-D second intermediate matrix as output,

an additional encoder with a k2-D supplementary input imaging matrix as input, and

a full-connected network configured to compute a real-fake score.

11 . The method of claim 10 , further comprising:

training the cGAN with a cost function which is a weighted sum of a standard generative adversarial network (GAN) loss function and an additional cost function, wherein the additional cost function is at least one of:

a L-k loss function or a weighted L-k loss function between the k2-D output imaging matrix and the k2-D supplement input imaging matrix, with k being an integer,

a visual loss function,

a pre-trained perceptual loss function,

a SSIM loss function,

an image structural loss function, or

an image-based loss function.

12 . A system for encoder-decoder-based high resolution imaging, comprising:

a processor configured to assemble a k1-dimensional (k1-D) imaging matrix by arranging and concatenating a plurality of k2-dimensional (k2-D) input imaging matrices;

an encoder, which is a k1-D encoding neural network, configured to encode the k1-D imaging matrix to generate a (k1+k3)-D first intermediate matrix that includes k1 original dimensions of the k1-D imaging matrix and k3 expanded dimensions, wherein the processor is further configured to generate a (k2+k3)-D second intermediate matrix by removing (k1−k2) of the k1 original dimensions in the (k1+k3)-D first intermediate matrix, wherein each of k1, k2, k3 is a positive integer; and

a decoder, which is a k2-D decoding neural network, configured to decode the (k2+k3)-D second intermediate matrix to generate a k2-D output imaging matrix, wherein:

there is at least one skip connection between the encoder and the decoder, and

an imaging resolution of the k2-D output imaging matrix is greater than the imaging resolution of any one of the plurality of k2-D input imaging matrices.

13 . The system of claim 12 , wherein the processor is further configured to:

determine a (k1+k3)-D expanded matrix by adding k3 expanded dimensions to the k1 original dimensions of the k1-D imaging matrix, wherein:

a size of the (k1+k3)-D expanded matrix is 1 in each of the k3 expanded dimensions,

the encoder comprises L1 layers, each associated with multiple convolution filters,

the (k1+k3)-D expanded matrix is a (k1+k3)-D layer-1 input matrix to a layer 1 of the encoder, the first layer of the L1 layers of the encoder.

14 . The system of claim 13 , wherein the processor is further configured to:

for each n between 1 and L1:

for each respective convolution filter of the multiple convolution filters associated with layer n of the encoder:

filter a (k1+k3)-D layer-n input matrix with the respective convolution filter to generate a respective (k1+k3)-D layer-n per-filter output matrix, and

down-sample the respective (k1+k3)-D layer-n per-filter output matrix in at least one of the k1 original dimensions with max-pooling; and

concatenate all of the (k1+k3)-D layer-n per-filter output matrices to form a (k1+k3)-D layer-n output matrix which is also a layer-(n+1) input matrix,

wherein:

a size of the layer-n output matrix in each of the k1 original dimensions is smaller than or equal to a size of a corresponding original dimension of the layer-n input matrix,

a size of the layer-n output matrix in each of the k3 expanded dimensions is greater than or equal to a size of a corresponding expanded dimension of the layer-n input matrix,

the (k1+k3)-D first intermediate matrix is the layer-(L1) output matrix, and

a size of the (k1+k3)-D first intermediate matrix is 1 in each of the k1 original dimensions.

15 . The system of claim 14 ,

wherein:

the decoder comprises L2 layers, each associated with multiple de-convolution filters,

the (k2+k3)-D second intermediate matrix is a (k2+k3)-D layer-(L1+1) input matrix to a layer 1 of the decoder, the first layer of the L2 layers of the decoder.

16 . The system of claim 15 , wherein the processor is further configured to:

for each m between 1 and L2:

up-sample a (k2+k3)-D layer-(L1+m) input matrix in at least one of the remaining k2 original dimensions to generate a (k2+k3)-D layer-(L1+m) up-sampled input matrix,

for each respective de-convolution filter of the multiple de-convolution filters associated with layer m of the decoder, filter the (k2+k3)-D layer-(L1+m) up-sampled input matrix with the respective de-convolution filter to generate a respective (k2+k3)-D layer-(L1+m) per-filter output matrix, and

combine and concatenate all of the (k2+k3)-D layer-(L1+m) per-filter output matrices to form a (k2+k3)-D layer-(L1+m) output matrix which is also a layer-(L1+m+1) input matrix, wherein:

a size of the layer-(L1+m) output matrix in each of the remaining k2 original dimensions is greater than or equal to a size of a corresponding original dimension of the layer-(L1+m) input matrix,

a size of the layer-(L1+m) output matrix in each of the k3 expanded dimensions is less than or equal to a size of a corresponding expanded dimension of the layer-(L1+m) input matrix; and

remove the k3 expanded dimensions of the layer-(L1+L2) output matrix to generate the k2-D output imaging matrix.

17 . The system of claim 16 , wherein the processor is further configured to:

process a m1−n1 skip connection, which is a skip connection between layer m1 of the encoder and layer n1 of the decoder, with 1<=m1<=L1, 1<=n1<=L2, wherein the m1−n1 skip connection is processed based on:

adjusting the (k1+k3)-D layer-(m1) output matrix of the encoder to generate a (k2+k3)-D adjusted layer-(m1) output matrix of the encoder, wherein the (k2+k3)-D adjusted layer-(m1) output matrix has a same dimension and a same size as the (k2+k3)-D layer-(L1+n1) output matrix of the decoder;

computing a temporary output matrix as a weighted average of the (k2+k3)-D adjusted layer-(m1) output matrix of the encoder and the (k2+k3)-D layer-(L1+n1) output matrix of the decoder; and

replacing the (k2+k3)-D layer-(L1+n1+1) input matrix of the decoder by the temporary output matrix.

18 . The system of claim 17 , wherein:

there is a m2-n2 skip connection, which is a skip connection between layer m2 of the encoder and layer n2 of the decoder, with 1<=m1<m2<=L1, 1<=n2<n1<=L2; and

the processor is further configured to process all skip connections in an ascending order of layer index of the decoder such that the m2-n2 skip connection is processed before the m1−n1 skip connection.

19 . The system of claim 17 , wherein the processor is further configured to:

for any n1 and the (k2+k3)-D layer-(L1+n1) output matrix of the decoder: perform a search among all L1 layers of the encoder to identify the m1 layer of the encoder which has an adjusted output matrix with a size matching the size of the layer-(L1+n1) output matrix of the decoder, in order to form the m1−n1 skip connection, wherein:

when no matching layer of the encoder is found, a best match is used for the m1-n1 skip connection,

the best match m1 is a layer of the encoder with a minimum absolute difference between the size of its adjusted output matrix and the size of the layer-(L1+n1) output matrix of the decoder.

20 . The system of claim 17 , wherein the processor is further configured to:

compute each element of the (k2+k3)-D adjusted layer-(m1) output matrix of the encoder as a characteristic value of a respective (k1−k2)-D sub-matrix of the (k1+k3)-D layer-(m1) output matrix of the encoder, wherein:

the characteristic value is an aggregate of the elements in the respective (k1−k2)-D submatrix,

the aggregate comprises at least one of: mean, arithmetic mean, geometric mean, harmonic mean, weighted average, percentile, minimum (0-percentile), median (50-percentile), maximum (100-percentile), trimmed mean (mean of percentile from A1-percentile to A2-percentile), mode, sum, weighted sum, product or weighted product.

21 . The system of claim 12 , wherein the processor is further configured to:

train the encoder and the decoder as part of a conditional generative adversarial network (cGAN) comprising a generator and a discriminator, wherein:

the generator comprises the encoder and the decoder with the at least one skip connection;

the k1-D imaging matrix is an input of the generator;

the k2-D output imaging matrix is an output of the generator; and

the discriminator comprises:

the encoder with the k1-D imaging matrix as input and the (k2+k3)-D second intermediate matrix as output,

an additional encoder with a k2-D supplementary input imaging matrix as input, and

a full-connected network configured to compute a real-fake score.

22 . The system of claim 21 , wherein the processor is further configured to:

train the cGAN with a cost function which is a weighted sum of a standard generative adversarial network (GAN) loss function and an additional cost function, wherein the additional cost function is at least one of:

a L-k loss function or a weighted L-k loss function between the k2-D output imaging matrix and the k2-D supplement input imaging matrix, with k being an integer,

a visual loss function,

a pre-trained perceptual loss function,

a SSIM loss function,

an image structural loss function, or

an image-based loss function.

23 . A device for encoder-decoder-based high resolution imaging, comprising:

a processor; and

a memory storing instructions, which when executed, cause the processor to perform operations comprising:

assembling a k1-dimensional (k1-D) imaging matrix by arranging and concatenating a plurality of k2-dimensional (k2-D) input imaging matrices,

encoding the k1-D imaging matrix by an encoder, which is a k1-D encoding neural network, to generate a (k1+k3)-D first intermediate matrix that includes k1 original dimensions of the k1-D imaging matrix and k3 expanded dimensions,

generating a (k2+k3)-D second intermediate matrix by removing (k1−k2) of the k1 original dimensions in the (k1+k3)-D first intermediate matrix, wherein each of k1, k2, k3 is a positive integer, and

decoding the (k2+k3)-D second intermediate matrix using a decoder, which is a k2-D decoding neural network, to generate a k2-D output imaging matrix, wherein:

there is at least one skip connection between the encoder and the decoder, and

an imaging resolution of the k2-D output imaging matrix is greater than the imaging resolution of any one of the plurality of k2-D input imaging matrices.

24 . The device of claim 23 , wherein the operations further comprise:

determining a (k1+k3)-D expanded matrix by adding k3 expanded dimensions to the k1 original dimensions of the k1-D imaging matrix, wherein:

a size of the (k1+k3)-D expanded matrix is 1 in each of the k3 expanded dimensions,

the encoder comprises L1 layers, each associated with multiple convolution filters,

the (k1+k3)-D expanded matrix is a (k1+k3)-D layer-1 input matrix to a layer 1 of the encoder, the first layer of the L1 layers of the encoder.

25 . The device of claim 24 , wherein the operations further comprise:

for each n between 1 and L1:

for each respective convolution filter of the multiple convolution filters associated with layer n of the encoder:

filtering a (k1+k3)-D layer-n input matrix with the respective convolution filter to generate a respective (k1+k3)-D layer-n per-filter output matrix, and

down-sampling the respective (k1+k3)-D layer-n per-filter output matrix in at least one of the k1 original dimensions with max-pooling; and

concatenating all of the (k1+k3)-D layer-n per-filter output matrices to form a (k1+k3)-D layer-n output matrix which is also a layer-(n+1) input matrix,

wherein:

a size of the layer-n output matrix in each of the k1 original dimensions is smaller than or equal to a size of a corresponding original dimension of the layer-n input matrix,

a size of the layer-n output matrix in each of the k3 expanded dimensions is greater than or equal to a size of a corresponding expanded dimension of the layer-n input matrix,

the (k1+k3)-D first intermediate matrix is the layer-(L1) output matrix, and

a size of the (k1+k3)-D first intermediate matrix is 1 in each of the k1 original dimensions.

26 . The device of claim 25 ,

wherein:

the decoder comprises L2 layers, each associated with multiple de-convolution filters,

the (k2+k3)-D second intermediate matrix is a (k2+k3)-D layer-(L1+1) input matrix to a layer 1 of the decoder, the first layer of the L2 layers of the decoder.

27 . The device of claim 26 , wherein the operations further comprise:

for each m between 1 and L2:

up-sampling a (k2+k3)-D layer-(L1+m) input matrix in at least one of the remaining k2 original dimensions to generate a (k2+k3)-D layer-(L1+m) up-sampled input matrix,

for each respective de-convolution filter of the multiple de-convolution filters associated with layer m of the decoder, filtering the (k2+k3)-D layer-(L1+m) up-sampled input matrix with the respective de-convolution filter to generate a respective (k2+k3)-D layer-(L1+m) per-filter output matrix, and

combining and concatenating all of the (k2+k3)-D layer-(L1+m) per-filter output matrices to form a (k2+k3)-D layer-(L1+m) output matrix which is also a layer-(L1+m+1) input matrix, wherein:

a size of the layer-(L1+m) output matrix in each of the remaining k2 original dimensions is greater than or equal to a size of a corresponding original dimension of the layer-(L1+m) input matrix,

a size of the layer-(L1+m) output matrix in each of the k3 expanded dimensions is less than or equal to a size of a corresponding expanded dimension of the layer-(L1+m) input matrix; and

removing the k3 expanded dimensions of the layer-(L1+L2) output matrix to generate the k2-D output imaging matrix.

28 . The device of claim 27 , wherein the operations further comprise:

processing a m1−n1 skip connection, which is a skip connection between layer m1 of the encoder and layer n1 of the decoder, with 1<=m1<=L1, 1<=n1<=L2, wherein the m1−n1 skip connection is processed based on:

adjusting the (k1+k3)-D layer-(m1) output matrix of the encoder to generate a (k2+k3)-D adjusted layer-(m1) output matrix of the encoder, wherein the (k2+k3)-D adjusted layer-(m1) output matrix has a same dimension and a same size as the (k2+k3)-D layer-(L1+n1) output matrix of the decoder;

computing a temporary output matrix as a weighted average of the (k2+k3)-D adjusted layer-(m1) output matrix of the encoder and the (k2+k3)-D layer-(L1+n1) output matrix of the decoder; and

replacing the (k2+k3)-D layer-(L1+n1+1) input matrix of the decoder by the temporary output matrix.

29 . The device of claim 28 , wherein:

there is a m2-n2 skip connection, which is a skip connection between layer m2 of the encoder and layer n2 of the decoder, with 1<=m1<m2<=L1, 1<=n2<n1<=L2; and

the operations further comprise processing all skip connections in an ascending order of layer index of the decoder such that the m2-n2 skip connection is processed before the m1−n1 skip connection.

30 . The device of claim 29 , wherein the operations further comprise:

for any n1 and the (k2+k3)-D layer-(L1+n1) output matrix of the decoder: performing a search among all L1 layers of the encoder to identify the m1 layer of the encoder which has an adjusted output matrix with a size matching the size of the layer-(L1+n1) output matrix of the decoder, in order to form the m1−n1 skip connection, wherein:

when no matching layer of the encoder is found, a best match is used for the m1-n1 skip connection,

the best match m1 is a layer of the encoder with a minimum absolute difference between the size of its adjusted output matrix and the size of the layer-(L1+n1) output matrix of the decoder.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 23, 2026
From: AU, OSCAR CHI-LIM; REGANI, SAI DEEPIKA; HU, YUQIAN; ZHU, GUOZHEN; WANG, WEI-HSIANG; WANG, BEIBEI; LIU, K. J. RAY; SAMARANAYAKE ARACHCHIGE DONA, SAKILA SANDEEPANI JAYAWEERA
To: ORIGIN RESEARCH WIRELESS, INC.
Reel/Frame 075041/0586 →
Continuity (23)
Continuation In Part 18401684 · Jan 1, 2024
Continuation In Part 18401681 · Jan 1, 2024
Continuation In Part 18395543 · Dec 23, 2023
Continuation In Part 18395539 · Dec 23, 2023
Continuation In Part 18395533 · Dec 23, 2023
Continuation In Part 18395544 · Dec 23, 2023
Continuation In Part 18395537 · Dec 23, 2023
Continuation In Part 18391529 · Dec 20, 2023
Continuation In Part 18379622 · Oct 12, 2023
Continuation In Part 18199963 · May 21, 2023
Continuation In Part 18108563 · Feb 10, 2023
Continuation In Part 17960080 · Oct 4, 2022
Continuation In Part 17959487 · Oct 4, 2022
Continuation In Part PCTUS2022045708 · Oct 4, 2022
Continuation In Part 17838244 · Jun 12, 2022
Continuation In Part 17838228 · Jun 12, 2022
Continuation In Part 17838231 · Jun 12, 2022
Continuation In Part 17827902 · May 30, 2022
Continuation In Part 17537432 · Nov 29, 2021
Continuation In Part 17149625 · Jan 14, 2021
Provisional Application 63721406 · Nov 15, 2024
Provisional Application 63651921 · May 24, 2024
Related Publication 20250139738A1 · May 1, 2025
References Cited (43)
US 20210192762A1 · Guan · 2021 [cited by examiner]
US 20220036539A1 · Brauer · 2022 [cited by examiner]
US 20240062061A1 · Bone · 2024 [cited by examiner]
Beibei Wang et al., “The Promise of Radio Analytics: A Future Paradigm for Wireless Positioning, Tracking, and Sensing”, IEEE Signal Processing Magazine, vol. 35, No. 3, pp. 59-80, May 2018. [cited by applicant]
Feng Zhang et al., “WiSpeed: A Statistical Electromagnetic Approach for Device-Free Indoor Speed Estimation”, IEEE Internet of Things Journal, vol. 5, No. 3, pp. 2163-2177, Jun. 2018. [cited by applicant]
Feng Zhang et al., “WiBall: A Time-Reversal Focusing Ball Method for Decimeter-Accuracy Indoor Tracking”, IEEE Internet of Things Journal, vol. 5, No. 5, pp. 4031-4041, Oct. 2018. [cited by applicant]
Chenshu Wu et al., “EasiTrack: Decimeter-Level Indoor Tracking with Graph-based Particle Filtering”, IEEE Internet of Things Journal., vol. 7, No. 3, pp. 2397-2411, Mar. 2020. [cited by applicant]
Chenshu Wu et al., “RF-based Inertial Measurement”, ACM SIGCOMM, Beijing, China, Aug. 19-24, 2019. [cited by applicant]
Wei-Hsiang Wang et al., “Device-Free Room-Level Localization with WiFi Utilizing Spatial-Frequency-Time Diversity,” IEEE Internet of Things Journal, vol. 11, No. 21, pp. 35689-35698, Nov. 2024. [cited by applicant]
Chenshu Wu et al., “mmTrack: Passive Multi-Person Localization Using Commodity Millimeter Wave Radio”, IEEE International Conference on Computer Communications, Beijing, China, Apr. 27-30, 2020. [cited by applicant]
Qinyi Xu et al., “Radio Biometrics: Human Recognition Through a Wall”, IEEE Trans. on Information Forensics and Security, vol. 12, No. 5, pp. 1141-1155, May 2017. [cited by applicant]
Qinyi Xu et al., “Trieds: Wireless Events Detection Through the Wall”, IEEE Internet of Things Journal, vol. 4, No. 3, pp. 723-735, Jun. 2017. [cited by applicant]
Chen Chen et al., “TR-BREATH: Time-Reversal Breathing Rate Estimation and Detection”, IEEE Trans. on Biomedical Engineering, vol. 65, No. 3, pp. 489-501, Mar. 2018. [cited by applicant]
Fengyu Wang et al., “Respiration Tracking for People Counting and Recognition”, IEEE Internet of Things Journal, vol. 7, No. 6, pp. 5233-5245, Jun. 2020. [cited by applicant]
Fengyu Wang et al., “ViMo: Multi-person Vital Sign Monitoring using Commodity Millimeter Wave Radio”, IEEE Internet of Things Journal, vol. 8, No. 3, pp. 1294-1307, Feb. 2021. [cited by applicant]
Beibei Wang et al., “Green Wireless Communications: A Time-Reversal Paradigm”, IEEE Journal of Selected Areas in Communications , special issue on Energy-Efficient Wireless Communications, vol. 29, No. 8, pp. 1698-1710,… [cited by applicant]
Feng Zhang et al., “WiDetect: Robust Motion Detection with a Statistical Electromagnetic Model”, Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies (IMWUT), vol. 3, No. 3, Article 122:1-… [cited by applicant]
Yuqian Hu et al., Robust Passive Proximity Detection using Wi-Fi, IEEE Internet of Things Journal, vol. 10, No. 7, pp. 6221-6234, Apr. 2023. [cited by applicant]
Yuqian Hu et al., “DeFall: Environment-Independent Passive Fall Detection Using WiFi,” IEEE Internet of Things Journal, vol. 9, No. 11, pp. 546-557, Jun. 2022. [cited by applicant]
Sai Deepika Regani et al., “FallAware: An Explainable Learning Approach to Robust Fall Detection with WiFi,” IEEE Journal of Selected Areas in Sensors, vol. 2, pp. 71-83, Dec. 2024. [cited by applicant]
Feng Zhang et al., “SMARS: Sleep Monitoring via Ambient Radio Signals”, IEEE Trans. on Mobile Computing, vol. 20, No. 1, pp. 217-231, Jan. 2021. [cited by applicant]
Wei-Hsiang Wang et al., “WIResP: A Robust Wi-Fi-Based Respiration Monitoring via Spectrum Enhancement,” IEEE Sensors Journal, vol. 24, No. 13, pp. 20999-21011, Jul. 2024. [cited by applicant]
K. J. Ray Liu et al., “Wireless AI: Wireless Sensing, Positioning, IoT, and Communications,” Cambridge University Press, 2019. [cited by applicant]
Chenshu Wu et al., “Wi-Fi Can Do More: Toward Ubiquitous Wireless Sensing,” IEEE Communications Standards Magazine, vol. 6, No. 2, pp. 42-49, Jun. 2022. [cited by applicant]
K. J. Ray Liu et al., “Statistical Principles of Time Reversal [Perspectives],” IEEE Signal Processing Magazine, vol. 41, No. 1, pp. 31-37, Jan. 2024. [cited by applicant]
Chenshu Wu et al., “GaitWay: Monitoring and Recognizing Gait Through the Walls”, IEEE Trans. on Mobile Computing, vol. 20, No. 6, pp. 2186-2199, Jun. 2021. [cited by applicant]
Sai Deepika Regani et al., “Driver Authentication for Smart Car Using Wireless Sensing”, IEEE Internet of Things Journal, vol. 7, No. 3, pp. 2235-2246, Mar. 2020. [cited by applicant]
Qinyi Xu et al., “Wireless AI in Smart Car: How Smart a Car Can Be?”, IEEE Access. [cited by applicant]
Fengyu Wang et al., “Driver Vital Signs Monitoring Using Millimeter Wave Radio,” IEEE Internet of Things Journal, vol. 9, No. 13, pp. 11283-11298, Jul. 2022. [cited by applicant]
Xiaolu Zeng et al., “WiCPD: Wireless Child Presence Detection System for Smart Cars,” IEEE Internet of Things Journal, vol. 9, No. 24, pp. 24866-24881, Dec. 2022. [cited by applicant]
Guozhen Zhu et al., “Wi-MoID: Human and Nonhuman Motion Discrimination Using WiFi With Edge Computing,” IEEE Internet of Things Journal, vol. 11, No. 8, pp. 13900-13912, Apr. 2024. [cited by applicant]
Guozhen Zhu et al., “SrcSense: Robust WiFi-based Motion Source Recognition via Signal-Informed Deep Learning,” IEEE Journal of Selected Areas in Sensors, vol. 2, pp. 40-53, Dec. 2024. [cited by applicant]
Chenshu Wu et al., “mSense: Towards Mobile Material Sensing with a Single Millimeter-Wave Radio”, PACM on Interactive, Mobile, Wearable and Ubiquitous Technologies (IMWUT), Virtual Online, Sep. 2020. [cited by applicant]
Feng Zhang et al., “mmEye: Super-Resolution Millimeter Wave Imaging”, IEEE Internet of Things Journal, vol. 8, No. 8, pp. 6995-7008, Apr. 2021. [cited by applicant]
Sakila S. Jayaweera et al., “HRNet: High-Resolution Neural Network for Human Imaging Using mmWave Radar,” IEEE Internet of Things Journal, vol. 12, No. 1, pp. 881-893, Jan. 2025. [cited by applicant]
Sai Deepika Regani et al., “mmWrite: Passive Handwriting Tracking using a Single Millimeter Wave Radio”, IEEE Internet of Things Journal, vol. 8, No. 17, pp. 13291-13305, Sep. 2021. [cited by applicant]
Fengyu Wang et al., “mmHRV: Contactless Heart Rate Variability Monitoring using Millimeter-Wave Radio”, IEEE Internet of Things Journal, vol. 8, No. 22, pp. 16623-16636, Nov. 2021. [cited by applicant]
Yuqian Hu et al., “mmKey: Universal Virtual Keyboard using a Single Millimeter Wave Radio”, IEEE Internet of Things Journal, vol. 9, No. 1, pp. 510-524, Jan. 2022. [cited by applicant]
Mohammed Zahid Ozturk et al., “GaitCube: Deep Data Cube Learning for Human Recognition with Millimeter-Wave Radio”, IEEE Internet of Things Journal, vol. 9, No. 1, pp. 546-557, Jan. 2022. [cited by applicant]
Sai Deepika Regani et al., “GWrite: Enabling Through-the-Wall Gesture Writing Recognition Using WiFi,” IEEE Internet of Things Journal, vol. 10, No. 7, pp. 5977-5991, Nov. 2022. [cited by applicant]
Mohammed Zahid Ozturk et al., “RadioMic: Sound Sensing via Radio Signals,” IEEE Internet of Things Journal, vol. 10, No. 5, pp. 4431-4448, Oct. 2022. [cited by applicant]
Mohammed Zahid Ozturk et al., “RadioSES: mmWave-Based Audioradio Speech Enhancement and Separation System,” IEEE/ACM Transactions on Audio Speech, and Language Processing, vol. 31, pp. 1333-1347, Mar. 2023. [cited by applicant]
Mohammed Zahid Ozturk et al., “RadioVAD: mmWave-Based Noise and Interference-Resilient Voice Activity Detection,” IEEE Internet of Things Journal, vol. 11, No. 15, pp. 26005-26019, Aug. 2024. [cited by applicant]