Apparatus and method for representing a sequence of content as projections for reconstructing the sequence at full or lower quality
First Claim
Patent Images
1. 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 ELEMENT k (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,ewhere 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)); and
b. 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 (i×
D+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 bits,wherein, 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.
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.
16 Citations
4 Claims
-
1. 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 ELEMENT k (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,ewhere 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 (i×
D+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 bits,wherein, 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 (2, 3, 4)
- D×
Specification