IP Library › Granted Patent US 11,477,468
Granted Patent B2
US 11,477,468 · App. 16/760,609 · Granted Oct 18, 2022

Method and device for compressing image and neural network using hidden variable

Inventors: Joo-Young Lee (Daejeon, KR); Seung-Hyun Cho (Daejeon, KR); Youn-Hee Kim (Daejeon, KR); Jin-Wuk Seok (Daejeon, KR); Woong Lim (Daejeon, KR); Jong-Ho Kim (Daejeon, KR); Dae-Yeol Lee (Daejeon, KR); Se-Yoon Jeong (Daejeon, KR); Hui-Yong Kim (Daejeon, KR); Jin-Soo Choi (Daejeon, KR)
Assignee: Electronics and Telecommunications Research Institute
H04N19/42G06N3/04G06N3/082H04N19/136
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 11,477,468
App. No.
16/760,609
Granted
Oct 18, 2022
Kind
B2
Abstract

A method and apparatus for image compression using a latent variable are provided. The multiple components of the latent variable may be sorted in order of importance. Through sorting, when the feature information of only some of the multiple components is used, the quality of a reconstructed image may be improved. In order to generate a latent variable, the components of which are sorted in order of importance, learning may be performed in various manners. Also, less important information may be eliminated from the latent variable, and processing, such as quantization, may be applied to the latent variable. Through elimination and processing, the amount of data for the latent variable may be reduced.

Claims (36)

1. A processing method, comprising:

acquiring a latent variable; and

performing selection or processing related to the latent variable,

wherein multiple components of the latent variable are sorted in a specific order, and

wherein the latent variable is acquired through an encoder neural network that is trained in advance.

2. The processing method of claim 1 , wherein the multiple components are sorted in order of importance.

3. The processing method of claim 1 , wherein loss in learning in a neural network includes reconstruction loss and a sparsity penalty, and the sparsity penalty is a sum of values of the multiple components of the latent variable to which weights are assigned, respectively.

4. The processing method of claim 3 , wherein the weight assigned to each of the multiple components is related to a frequency with which feature information represented by the component is used in input images that are used for learning.

5. The processing method of claim 1 , wherein, in learning in a neural network configured with multiple learning steps, elements of only some components having high-ranking indices, among the multiple components of the latent variable, are activated in each of the multiple steps.

6. The processing method of claim 5 , wherein a number of activated components having the high-ranking indices is randomly set.

7. The processing method of claim 5 , wherein whether to activate each of the multiple components of the latent variable is determined, whereby a probability that the component affects a magnitude of the reconstruction loss is adjusted.

8. The processing method of claim 1 , wherein the selection is eliminating, from the latent variable, information that is less important for reconstruction of an image.

9. The processing method of claim 1 , wherein the processing is reducing an amount of data for the latent variable by eliminating a specific component, among the multiple components of the latent variable.

10. The processing method of claim 9 , wherein the specific component is at least one component having a lowest importance.

11. The processing method of claim 1 , wherein the processing is quantization for the latent variable.

12. The processing method of claim 1 , wherein:

the multiple components are sorted in order of importance,

the processing is neural network pruning, and

the neural network pruning is eliminating nodes having a lowest importance, among nodes of a latent layer of a neural network.

13. The processing method of claim 12 , wherein multiple neural networks are derived from the neural network using a parameter that indicates a degree of pruning in the neural network pruning.

14. A processing method, comprising:

generating a reconstructed image using a decoder neural network to which a latent variable is applied,

wherein multiple components of the latent variable are sorted in a specific order, and

wherein the latent variable is acquired through an encoder neural network that is trained in advance.

15. The processing method of claim 14 , wherein the multiple components are sorted in order of importance.

16. The processing method of claim 14 , further comprising:

generating the latent variable using latent variable generation information.

17. The processing method of claim 14 , wherein the reconstructed image is generated using feature information of only some components having high-ranking indices, among the multiple components of the latent variable.

18. The processing method of claim 17 , wherein a ranking of each of the multiple components is determined based on a component index thereof.

19. A computer-readable recording medium in which a bitstream is stored, the bitstream comprising:

latent variable generation information,

wherein:

a latent variable is generated using the latent variable generation information,

a reconstructed image is generated using a decoder neural network to which the latent variable is applied, and

multiple components of the latent variable are sorted in a specific order, and

wherein the latent variable is acquired through an encoder neural network that is trained in advance.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 30, 2020
From: LEE, JOO-YOUNG; CHO, SEUNG-HYUN; KIM, YOUN-HEE; SEOK, JIN-WUK; LIM, WOONG; KIM, JONG-HO; LEE, DAE-YEOL; JEONG, SE-YOON; KIM, HUI-YONG; CHOI, JIN-SOO
To: ELECTRONICS AND TELECOMMUNICATIONS RESEARCH INSTITUTE
Reel/Frame 052537/0257 →
Priority Claims (2)
KR 10-2017-0142066 · Oct 30, 2017 · national
KR 10-2018-0130680 · Oct 30, 2018 · national
Continuity (1)
Related Publication 20200351509A1 · Nov 5, 2020
Cited By (2)
US 12,225,239 US 12,620,136