APPARATUS AND METHOD FOR REPRESENTING A SEQUENCE OF CONTENT AS PROJECTIONS FOR RECONSTRUCTING THE SEQUENCE AT FULL OR LOWER QUALITY
First Claim
1. A method for encoding a sequence of M raw digital entertainment content bits comprising:
- grouping said M raw digital entertainment content bits into P points, by partitioning the bits into tuples of L bits and taking a number whose binary representation equals the (i×
D+j)-th L tuple to be the j-th coordinate of the i-th point (1<
=i<
=P), (1<
=D), each point being D-dimensional, where D>
1, each dimension having 2 to the power of L levels, such that P×
D×
L=M; and
generating at least a portion of a sequence of E data elements ELEMENT1, . . . ELEMENTE, wherein each data element ELEMENTk(1<
k<
=E) comprises a dk-dimensional subspace sk of D-dimensional space that was chosen at random and a projection of substantially all of said P points onto subspace sk, wherein d1+. . . +dF>
D, and wherein ELEMENTk'"'"'s projection comprises P sets of dk L-tuples of bits defining P points, PNTk,1 , PNTk,2 , PNTk,p, respectively, in subspace sk.
0 Assignments
0 Petitions
Accused Products
Abstract
A content presentation system comprising content playing apparatus and content providing apparatus operative to receive an array of digitally represented numbers, representing content as P points in D-dimensional space, to generate therefrom a plurality of projections on at least one sub-space of a vector space comprising a span of at least one D-dimensional vector, and to provide the plurality of projections to the content playing apparatus, the content playing apparatus being operative to reconstruct the array of digitally represented numbers from the plurality of projections and to expose human users to content accordingly.
18 Citations
48 Claims
-
1. A method for encoding a sequence of M raw digital entertainment content bits comprising:
-
grouping said M raw digital entertainment content bits into P points, by partitioning the bits into tuples of L bits and taking a number whose binary representation equals the (i×
D+j)-th L tuple to be the j-th coordinate of the i-th point (1<
=i<
=P), (1<
=D), each point being D-dimensional, where D>
1, each dimension having 2 to the power of L levels, such that P×
D×
L=M; andgenerating at least a portion of a sequence of E data elements ELEMENT1, . . . ELEMENTE, wherein each data element ELEMENTk(1<
k<
=E) comprises a dk-dimensional subspace sk of D-dimensional space that was chosen at random and a projection of substantially all of said P points onto subspace sk, wherein d1+. . . +dF>
D, and wherein ELEMENTk'"'"'s projection comprises P sets of dk L-tuples of bits defining P points, PNTk,1 , PNTk,2 , PNTk,p, respectively, in subspace sk. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 16, 17, 18, 42, 43, 45, 46, 47)
-
-
13. A content presentation system comprising:
-
content playing apparatus; and content providing apparatus operative to receive an array of digitally represented numbers, representing content as P points in D-dimensional space, to generate therefrom a plurality of projections on at least one sub-space of a vector space comprising a span of at least one D-dimensional vector, and to provide said plurality of projections to the content playing apparatus, said content playing apparatus being operative to reconstruct said array of digitally represented numbers from said plurality of projections and to expose human users to content accordingly. - View Dependent Claims (27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 40, 41)
-
-
14. A method for retrieving a sequence of P×
- D×
L=M raw digital entertainment content bits from a received sequence of 1<
e<
=E data elements, each data element comprising P sets of dk L-tuples of bits,each data element ELEMENTk (1<
=k<
=e) comprising a projection of substantially all of P points defined in a coordinate system having an origin, onto a dk-dimensional subspace sk of D-dimensional space, thereby to define subspaces defining a span,wherein the subspaces are characterized in that the dim(span(S1, . . . , Sk))<
=M/(P×
L),the method comprising; if dim(S1)+. . . +dim(Se)>
M/(P×
L) discarding data elements at random until dim(S1)+. . . +dim(Se)=M/(P×
L), and then continuing as in the case where dim(span(S1, . . . Se))=M/(P×
L);repeating for p=1, . . . P; a. retrieving a p'"'"'th point comprising D L-tuples of bits, wherein retrieving the p'"'"'th point comprises, for each data element ELEMENTh (1<
=h<
=e) in said sequence of e data elements, taking the intersection of all Op,1, Op,2, . . . , Op,e where Op,h (1<
=p<
=P, 1<
=h<
=e) is a translated subspace orthogonal to sh that contains the point PNTh,p, the dimension of the subspace being D−
dh, the intersection of all of said translated subspaces orthogonal to sh defining an intersection translated subspace comprising a translated subspace of dimension D-dim(span(s1,s2, . . . , s[k]e)); andb. choosing a D-dimensional point qp within said intersection translated subspace, wherein each dimension of the D-dimensional point is represented at a 2L-level resolution, such that the point is defined by D L-tuples of bits; and decoding the P D-dimensional points into M raw digital entertainment bits by setting the (ixD+j)-th L-tuple of bits to hold the L-bit binary representation of the j-th coordinate of the i-th point (1<
=j<
=D) (1<
=i<
=P), thereby obtaining P×
D×
L bitswherein, if dim(span(S1, . . . , Se)) =M/(P×
L), the intersection of all of said translated subspaces orthogonal to sh defines a single point qp and said M raw digital entertainment bits are identical to the bits that were encoded. - View Dependent Claims (15, 44, 48)
- D×
-
19. A system for digitizing a playable sequence of content items, the method comprising:
a whole-sequence representing digital element generator computing at least a portion of a set of digital data elements, said set being characterized in that it is possible to reconstruct an approximation of the playable sequence from at least some subsets of said set of digital data elements and wherein each said approximation has a quality, and wherein the quality of each said approximation depends on the size of the subset from which said approximation is reconstructed. - View Dependent Claims (20, 21, 22, 23, 24, 25, 26)
-
39. An entertainment system comprising:
-
entertainment content storing apparatus; and content providing apparatus operative to receive an array of digitally represented numbers, representing entertainment content having a quality parameter as P points in D-dimensional space, to generate therefrom a plurality of projections on at least one sub-space of a vector space comprising a span of at least one D-dimensional vector, and to store said plurality of projections on the entertainment content storing apparatus, thereby to ensure that local damage to said entertainment content storing apparatus does not eradicate any portion of said entertainment content and instead generally uniformly reduces the quality parameter of all portions of said entertainment content.
-
Specification