US2022270299A1PendingUtilityA1

Enabling secure video sharing by exploiting data sparsity

Assignee: AT & T IP I LPPriority: Sep 20, 2018Filed: May 9, 2022Published: Aug 25, 2022
Est. expirySep 20, 2038(~12.1 yrs left)· nominal 20-yr term from priority
H04N 19/625H04N 19/176H04N 19/12G06T 9/002H04N 19/63H04N 19/62H04N 19/60G06T 9/007H04N 19/428
64
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

In one example, the present disclosure describes a device, computer-readable medium, and method for enabling secure video sharing by exploiting data sparsity. In one example, the method includes applying a transformation to a video dataset containing a plurality of video samples, to produce a plurality of sparse vectors in a first dimensional space, wherein each sparse vector of the plurality of sparse vectors corresponds to one video sample of the plurality of video samples, and multiplying each sparse vector of the plurality of sparse vectors by a transformation matrix to produce a plurality of reduced vectors in a second dimensional space, wherein the dimension of the second dimensional space is smaller than a dimension of the first dimensional space, and wherein the plurality of reduced vectors in the second dimensional space hides information about the video dataset while preserving relational properties between the plurality of video samples.

Claims

exact text as granted — not AI-modified
What is claimed is: 
     
         1 . A method comprising:
 applying a transformation to a video dataset containing a plurality of video samples, to produce a plurality of sparse vectors in a first dimensional space, wherein each sparse vector of the plurality of sparse vectors corresponds to one video sample of the plurality of video samples; and   multiplying each sparse vector of the plurality of sparse vectors by a transformation matrix to produce a plurality of reduced vectors in a second dimensional space, wherein a dimension of the second dimensional space is smaller than a dimension of the first dimensional space, and wherein the plurality of reduced vectors in the second dimensional space hides information about the video dataset while preserving relational properties between the plurality of video samples.   
     
     
         2 . The method of  claim 1 , wherein the transformation comprises a wavelet transform. 
     
     
         3 . The method of  claim 1 , wherein the transformation comprises a Fourier transform. 
     
     
         4 . The method of  claim 1 , wherein the transformation comprises a discrete cosine transform. 
     
     
         5 . The method of  claim 1 , wherein the video dataset is labeled. 
     
     
         6 . The method of  claim 1 , wherein the transformation matrix is an M×N matrix, wherein N is the dimension of the first dimensional space, and wherein M is the dimension of the second dimensional space. 
     
     
         7 . The method of  claim 6 , wherein the M×N matrix is a random matrix. 
     
     
         8 . The method of  claim 1 , wherein the relational properties comprise pairwise distances. 
     
     
         9 . The method of  claim 8 , wherein distance ratios between pairs of the plurality of sparse vectors are equal to distance ratios between pairs of the plurality of reduced vectors corresponding to the pairs of the plurality of sparse vectors. 
     
     
         10 . The method of  claim 1 , wherein the transformation matrix allows transformation of the plurality of reduced vectors back into the video dataset. 
     
     
         11 . A device comprising:
 a processor; and   a non-transitory computer-readable medium storing instructions which, when executed by the processor, cause the processor to perform operations, the operations comprising:
 applying a transformation to a video dataset containing a plurality of video samples, to produce a plurality of sparse vectors in a first dimensional space, wherein each sparse vector of the plurality of sparse vectors corresponds to one video sample of the plurality of video samples; and 
 multiplying each sparse vector of the plurality of sparse vectors by a transformation matrix to produce a plurality of reduced vectors in a second dimensional space, wherein a dimension of the second dimensional space is smaller than a dimension of the first dimensional space, and wherein the plurality of reduced vectors in the second dimensional space hides information about the video dataset while preserving pairwise distances between the plurality of video samples. 
   
     
     
         12 . A non-transitory computer-readable medium storing instructions which, when executed by a processor, cause the processor to perform operations, the operations comprising:
 applying a transformation to a video dataset containing a plurality of video samples, to produce a plurality of sparse vectors in a first dimensional space, wherein each sparse vector of the plurality of sparse vectors corresponds to one video sample of the plurality of video samples; and   multiplying each sparse vector of the plurality of sparse vectors by a transformation matrix to produce a plurality of reduced vectors in a second dimensional space, wherein a dimension of the second dimensional space is smaller than a dimension of the first dimensional space, and wherein the plurality of reduced vectors in the second dimensional space hides information about the video dataset while preserving pairwise distances between the plurality of video samples.   
     
     
         13 . The non-transitory computer-readable medium of  claim 12 , wherein the transformation matrix is an M×N matrix, wherein N is the dimension of the first dimensional space, and wherein M is the dimension of the second dimensional space. 
     
     
         14 . The non-transitory computer-readable medium of  claim 13 , wherein the M×N matrix is a random matrix. 
     
     
         15 . The non-transitory computer-readable medium of  claim 12 , wherein the relational properties comprise pairwise distances. 
     
     
         16 . The non-transitory computer-readable medium of  claim 15 , wherein distance ratios between pairs of the plurality of sparse vectors are equal to distance ratios between pairs of the plurality of reduced vectors corresponding to the pairs of the plurality of sparse vectors. 
     
     
         17 . The non-transitory computer-readable medium of  claim 12 , wherein the transformation matrix allows transformation of the plurality of reduced vectors back into the video dataset. 
     
     
         18 . The non-transitory computer-readable medium of  claim 12 , wherein the transformation comprises a wavelet transform. 
     
     
         19 . The non-transitory computer-readable medium of  claim 12 , wherein the transformation comprises: a Fourier transform or a discrete cosine transform. 
     
     
         20 . The non-transitory computer-readable medium of  claim 12 , wherein the video dataset is labeled.

Join the waitlist — get patent alerts

Track US2022270299A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.