Object movie exporter

• US 6,941,516 B2
• Filed: 08/06/2001
• Issued: 09/06/2005
• Est. Priority Date: 08/06/2001
• Status: Active Grant

• Current Assignee: Apple Inc.
• Original Assignee: Apple Computer Incorporated (Apple Inc.)
• Inventors: Nie, Xiaochun, Flick, Christopher L.
• Primary Examiner(s): Hailu, Tadesse
• Application Number:
  US09/923,835
• Publication Number:
  US 20030025725A1
• Time in Patent Office: 1,492 Days
• Field of Search: 715716-726, 375/240, 375/240.2, 375/240.1, 382/232, 382/276, 382/239, 382/246, 725/118, 725/115
• US Class Current: 715/721
• CPC Class Codes: G06T 9/004 Predictors, e.g. intraframe, interframe coding

Abstract

Methods and apparatuses for compressing and/or transmitting and/or receiving data representing different views of an object. In one method according to the present invention, the method stores a plurality of frames of an object wherein each of these frames represents a view of the object. The method then assigns a reference number to each of these frames, arranges these frames in a preferred layout, divides the preferred layout into a plurality of blocks having frames sharing spatial similarities, and compresses each of these blocks separately.

Claims

1. A digital processing implemented method for processing a data set enabling interactive random access for different views of an object, said method comprising:

storing a plurality of frames of said object, said plurality of frames representing a set of views of said object;

assigning a reference number to each of said plurality of frames;

arranging said plurality of frames in a preferred layout; and

dividing said preferred layout into a plurality of blocks having frames sharing spatial similarities and compressing each of said plurality of blocks separately;

selecting at least one key frame and a plurality of non-key frames for each of said plurality of blocks; and

compressing each of said non-key frame and said key frame for each of said plurality of blocks separately such that a compressing sequence includes going away from said key frame until reaching a boundary of each of said plurality of blocks to cover each of said non-key frames.

2. A method as in claim 1,wherein a longest compressing path of any one of said non-key frames and said key frame is less than a predetermined number of frames from said key frame.

3. A method as in claim 2 further comprising including a video track layout for said set of views, said video track layout making references to a data source track, said data source track to comprise compressed data for said set of views wherein each of said at least one key frame and said non-key frames is compressed only once and is referenced as many times as necessary by said video track layout.

4. A method as in claim 3 wherein each of said video track, wherein at least one key frame is near a center of each of said plurality of blocks.

5. A method as in claim 4 wherein each of said plurality of blocks has a size that is one of equal to a predetermined size and smaller than said predetermined size.

6. A method as in claim 5 wherein said preferred layout is a two-dimensional array.

7. A method as in claim 6 further comprising:

dividing said preferred layout such that a smaller size block is at a further top and a further left corner of said preferred layout and a larger size block is at a further bottom and a further right corner of said preferred layout; and

selecting said at least one key frame such that said at least one key frame is closer to a further top and a further left corner of each of said plurality of blocks.

8. A method as in claim 7 wherein a frame differencing compression method is used to compress each of said plurality of blocks separately.

9. A method as in claim 8 wherein said method is performed by a server computer system.

10. A method as in claim 9 wherein said method is performed by a world-wide web server.

11. A digital processing implemented method for receiving and using a data set enabling interactive random access for different views of an object, said method comprising:

transmitting a request to receive said data set, said data set including frames of said object, said frames representing views of said object; and

receiving said data set wherein said frames were arranged in a preferred layout, said preferred layout was divided into a plurality of blocks wherein each of said plurality of blocks was compressed separately and wherein said data set further comprises at least one key frame and a plurality of non-key frames for each of said plurality of blocks, each of said at least one key frame was compressed prior to said non-key frame such that a compressing sequence includes going away from said key frame until reaching a boundary of each of said plurality of blocks to cover each of said non-key frames.

12. A method as in claim 11 wherein said preferred layout, said plurality of blocks, said at least one key frame, and said plurality of non-key frames were arranged such that a longest compressing path of any one of said non-key frames and said key frame is less than a predetermined number of frames from said key frame.

13. A method as in claim 12 wherein said data set further comprising a video track layout for said views, said video track layout making references to a data source track, said data source track including compressed data for said views wherein each of said at least one key frame and said non-key frames is compressed only once and is referenced as many times as necessary by said video track layout.

14. A method as in claim 13 wherein each of said at least one key frame is near a center of each of said plurality of blocks.

15. A method as in claim 14 wherein each of said plurality of blocks has a size that is one of equal to a predetermined size and smaller than said predetermined size.

16. A method as in claim 15 wherein said preferred layout is a two-dimensional array.

17. A method as in claim 16 wherein said preferred layout is divided such that a smaller size block is at a further top and a further left corner of said preferred layout and a larger size block is at a further bottom and a further right corner of said preferred layout and wherein said at least one key frame is closer to a further top and a further left corner of each of said plurality of blocks.

18. A method as in claim 17 wherein said method is performed by a digital processing system and wherein said data set is received from a server computer system.

19. A method as in claim 18 wherein a frame differencing compression method is used to separately compress each of said plurality of blocks.

20. A computer readable storage medium containing executable computer program instructions which when executed cause a digital processing implemented method for processing a data set enabling interactive random access for different views of an object, said method comprising:

storing a plurality of frames of said object, said plurality of frames representing a set of views of said object;

assigning a reference number to each of said plurality of frames;

arranging said plurality of frames in a preferred layout; and

dividing said preferred layout into a plurality of blocks having frames sharing spatial similarities and compressing each of said plurality of blocks separately;

selecting at least one key frame and a plurality of non-key frames for each of said plurality of blocks; and

compressing each of said non-key frame and said key frame for each of said plurality of blocks separately such that a compressing sequence includes going away from said key frame until reaching a boundary of each of said plurality of blocks to cover each of said non-key frames.

21. A computer readable storage medium as in claim 20 wherein said dividing said preferred layout into a plurality of blocks and said selecting at least one key frame and a plurality of non-key frames for each of said plurality of blocks are such that a longest compressing path of any one of said non-key frames and said key frame is less than a predetermined number of frames from said key frame.

22. A computer readable storage medium as in claim 21 further comprising including a video track layout for said set of views, said video track layout making references to a data source track, said data source track to comprise compressed data for said set of views wherein each of said at least one key frame and said non-key frames is compressed only once and is referenced as many times as necessary by said video track layout.

23. A computer readable storage medium as in claim 22 wherein each of of said video track at least one key frame is near a center of each said plurality of blocks.

24. A computer readable storage medium as in claim 23 wherein each of said plurality of blocks has a size that is one of equal to a predetermined size and smaller than said predetermined size.

25. A computer readable storage medium as in claim 24 wherein said preferred layout is a two-dimensional array.

26. A computer readable storage medium as in claim 25 further comprising:

dividing said preferred layout such that a smaller size block is at a further top and a further left corner of said preferred layout and a larger size block is at a further bottom and a further right corner of said preferred layout; and

selecting said at least one key frame such that said at least one key frame is closer to a further top and a further left corner of each of said plurality of blocks.

27. A computer readable storage medium as in claim 26 wherein a frame differencing compression method is used to compress each of said plurality of blocks separately.

28. A computer readable storage medium as in claim 27 wherein said method is preformed by a server computer system.

29. A computer readable storage medium containing executable computer program instructions which when executed cause a digital processing implemented method for receiving and using a data set enabling interactive random access for different views of an object, said method comprising:

transmitting a request to receive said data set, said data set including frames of said object, said frames representing views of said object; and

receiving said data set wherein said frames were arranged in a preferred layout, said preferred layout was divided into a plurality of blocks wherein each of said plurality of blocks was compressed separately wherein an input is used for manipulating said object using a cursor which is display on a display device;

receiving said input which requests a selected number of said views;

mapping said input to a selected appropriate frames in said frames; and

decompressing said selected appropriate frames;

storing said appropriate frames that are compressed; and

allowing a user to playback said selected number of said views in a movie-like sequence wherein said method is performed by a digital processing system wherein said data set is received from a server computer system and wherein said data set further comprises at least one key frame and a plurality of non-key frames for each of said plurality of blocks, each of said at least one key frame was compressed prior to said non-key frames such that a compressing sequence includes going away from said key frame until reaching a boundary of each of said plurality of blocks to cover each of said non-key frames.

30. A computer readable storage medium as in claim 29 wherein said preferred layout, said plurality of blocks, said at least one key frame, and said plurality of non-key frames were arranged such that a longest compressing path of any one of said non-key frames and said key frame is less than two frames from said key frame.

31. A computer readable storage medium as in claim 30 wherein said data set further comprising a video track layout for said views, said video track layout making references to a data source track, said data source track including compressed data for said views wherein each of said at least one key frame and said non-key frames is compressed only once and is referenced as many times as is necessary by said video track layout.

32. A computer readable storage medium as in claim 31 wherein each of said at least one key frame is near a center of each of said plurality of blocks.

33. A computer readable storage medium as in claim 32 wherein each of said plurality of blocks has a size that is one of equal to a predetermined size and smaller than said predetermined size.

34. A computer readable storage medium as in claim 33 wherein said preferred layout is a two-dimensional array.

35. A computer readable storage medium as in claim 34 wherein said preferred layout is divided such that a smaller size block is at a further top and a further left corner of said preferred layout and a larger size block is at a further bottom and a further right corner of said preferred layout and wherein said at least one key frame is closer to a further top and a further left corner of each of said plurality of blocks.

36. A computer readable storage medium as in claim 35 wherein said method is performed by a digital processing system and wherein said data set is received from a server computer system.

37. A computer readable storage medium as in claim 36 wherein a frame differencing compression method is used to separately compress each of said plurality of blocks.

38. A digital processing system for processing a data set enabling interactive random access for different views of an object, said system comprising:

means for storing a plurality of frames of said object, said plurality of frames representing a set of views of said object;

means for assigning a reference number to each of said plurality of frames;

means for arranging said plurality of frames in a preferred layout; and

means for dividing said preferred layout into a plurality of blocks having frames sharing spatial similarities and compressing each of said plurality of blocks separately; and

means for selecting at least one key frame and a plurality of non-key frames for each of said plurality of blocks and means for compressing said at least one key frame prior to compressing non-key frames such that a compressing sequence includes going away from said key frame until reaching a boundary of each of said plurality of blocks to cover each of said non-key frames.

39. A system as in claim 38 wherein said dividing said preferred layout into a plurality of blocks and said selecting at least one key frame and a plurality of non-key frames for each of said plurality of blocks is such that a longest compressing path of any one of said non-key frames and said key frame is less than a predetermined number of frames from said key frame.

40. A system as in claim 39 further comprises means for including a video track layout for said set of views, said video track layout making references to a data source track, said data source track to comprise compressed data for said set of views wherein each of said at least one key frame and said non-key frame is compressed only once and is referenced as many times as necessary by said video track layout.

41. A digital processing implemented system for receiving and using a data set enabling interactive random access for different views of an object, said system comprising:

means for transmitting a request to receive said data set, said data set including frames of said object, said frames representing views of said object; and

means for receiving said data set wherein said frames were arranged in a preferred layout, said preferred layout was divided into a plurality of blocks wherein each of said plurality of blocks was compressed separately wherein an input is used for manipulating said object using a cursor which is displayed on a display device;

means for storing said appropriate frames that are compressed; and

means for allowing a user to playback said selected number of said views in a movie-like sequence wherein said data set further comprising at least one key frame and a plurality of non-key frames for each of said plurality of blocks, each of said at least one key frame was compressed prior to said non-key frames such that a compressing sequence includes going away from said key frame until reaching a boundary of each of said plurality of blocks to cover each of said non-key frames.

42. A system as in claim 41 wherein said preferred layout, said plurality of blocks, said at least one key frame, and said plurality of non-key frames were arranged such that a longest comprising path of any one of said non-key frames and said key frame is less than two frames from said key frame.

43. A system as in claim 42 wherein said data set further comprising a video track layout for said views, said video track layout making references to a data source track, said data source track including compressed data for said views wherein each of said at least one key frame and said non-key frames is compressed only once and is referenced as many times as necessary by said video track layout.