Patent Grant
7577677
The present invention relates to portable storage mediums and more particularly to portable storage mediums with content that is updated after manufacture.
Optical disk storage technologies store information as a series of microscopic pits and smooth areas arranged in tracks on a surface of an annular disk. The stored information is read from the disk by directing a focused laser beam along the tracks and detecting variations in the intensity of the laser beam as it reflects off of the microscopic pits and smooth areas on the disk.
A digital versatile disk (DVD) is a type of optical storage medium that is becoming more and more widely available. DVD's may be used to hold video, audio, and computer data. Currently, DVD formats include: DVD-Video for holding video programs, DVD-ROM for holding computer data, and DVD-Audio for holding audio tracks. Because of their versatility, DVD's may by used in a wide range of applications including home entertainment, computers, and business information systems. Film, television, and music producers are increasingly turning to DVD's as a medium for offering movies, television episodes and music albums to the public.
DVD's are an optimal medium for presenting full-length movies. DVD's can produce studio-like video quality and audio quality better than compact disks (CD). DVD's are also more durable that videotape and do not suffer wear from use. Presently, a single DVD is able to store over eight hours of high quality digital video information and is also able to store multiple audio and subtitle tracks. DVD's also may store information for automatic and seamless branching of video to permit viewing of multiple story lines on a single disk. Additionally, DVD's may also store text information for providing movie credit information and biographical information on the cast and crew. DVD's may also include menus and other graphic interfaces for enhancing user enjoyment by aiding user access to various features provided on the disk.
However, in the past, movies and audio recordings stored on optical disk storage media (including those on DVD) most commonly available to consumers are offered in a fixed, read-only format. With such a format, as soon as the information is stored on a disk, the information is often quickly outdated because it is impossible to add additional information arising after the time the original information was stored on the disk. Thus, producers are confronted with the problem of how to provide their consumers with current and up to date products with this format of optical disk storage media. This problem results in the current use of fixed, read-only format disks having a very short shelf life before becoming outdated. As a result, producers are forced to periodically recall older disks and reissue updated versions of their products on new disks in order to offer current products to their consumers.
As an illustrative example, if filmographies of the actors in a movie stored on a disk are included on the disk, it is impossible to go back and update the information on the disk to include films in which the actors have acted subsequent to the creation of the disk. If the movie disk is offered to consumers several months after the disk was made, the actors may have starred in other subsequent movies. As a result, consumers obtaining this disk would never be informed about these subsequent movies when viewing the filmographies stored on their disks. Thus, the producer offering the movie on these disks is forced to recall old disks of the movie and issue new disks of the movie with the actors' subsequent movies included in updated versions of the filmographies.
Another problem producers face with a fixed, read-only format is that it is impossible to correct errors once the product has been stored on a disk. For example, if text included with a movie stored on a read-only formatted disk has spelling errors, the disk must be destroyed and the corrections to the text must be stored on a new disk. This process can become very expensive and may significantly hurt the profitability derived from the issuing of the particular movie on the disk.
An additional problem producers using the fixed, read-only format have is that it is difficult to provide updates and corrections to consumers already possessing the producer's product with this format. As an illustrative example, with a fixed, read-only format, a producer is unable to add additional menus and other graphic interfaces to the disks of existing owners without providing these owners with newly produced disks that include the upgraded feature. In one option, the producer may announce a recall to owners of their existing products and offer a newly produced issue of the product as a replacement to these owners. However, this method is expensive, laborious, time consuming, and often ineffectual because existing owners rarely want to make the effort to return their disks to the producer. Another option for a producer is to send existing owners the newly produced disks without requiring the return of the old disks back to the producer. However, this option allows the owners to pass on their old disks (which are still usable) to other consumers and thereby detrimentally reduce new consumer demand for the producer's product.
The present invention provides a system, method, and article of manufacture for updating content stored on a portable storage medium. Upon input of a portable storage medium into a machine by a user, the content stored on the portable storage medium is read. After reading the content of the portable storage medium, a separate storage medium is accessed and content is received therefrom. The content from the separate storage medium is an update of the content of the portable storage medium. This content of the separate storage medium is then displayed.
In one embodiment, the separate storage medium may be accessed upon receipt of an indication of a user action effected by the user. In one version of this embodiment, such user action may be the selection of at least a portion of the content stored in the portable storage medium in a menu or the like.
In another embodiment of the present invention, the content of the portable storage medium may additionally be compared with the content of the separate storage medium so that content of the separate storage medium is received only if the content of the separate storage medium is an update of the content of the portable storage medium.
In yet another embodiment of the present invention, the separate storage medium may be a remote server capable of being connected to the machine via a wide area network, i.e., the Internet. In one version of this embodiment, the content of the remote server is cached in a local storage medium so that the cached content may be subsequently reused. As an option, this version of this embodiment may also require that a determination be made as to whether a connection exists between the remote server and the machine so that the cached content may be received from the local storage medium when the connection is determined to be nonexistent. If a connection exists, the remote server may be automatically accessed. In another version of this embodiment of the present invention, the content of the separate storage medium may be displayed using hyper-text mark-up language (HTML).
The present invention also includes embodiments where the portable storage medium is an optical disk such as a laser centric disk, a digital versatile disk (DVD), a compact disk read only memory (CD-ROM), a writeable compact disk (CD-W), and/or a rewriteable compact disk (CD-RW). Optionally, in these embodiments, the information may be stored on a burst cut area (BCA) of the particular optical disk or other storage area.
Also encompassed by the present invention is an embodiment where the updated content of the separate storage medium that is received includes content that is selected based on information such as an owner of the content, a profile of a user, a retailer of the portable storage medium, a distributor of the portable storage medium, a manufacturer of the machine, a date which the portable storage medium was manufactured, version of the content of the portable storage medium, and/or identifier of the portable storage medium. In this embodiment, the updated content of the separate storage medium that is received may also optionally include a menu.
The present invention enables easy updating of information stored on fixed, read-only format media. With the present invention, the shelf life of fixed, read-only format media is greatly extended. Older fixed, read-only format media no longer has to be replaced with newer media in order to provide more current information to users or in order to correct errors in the information stored on the media. In an illustrative practical application, the present invention is especially useful for updating advertisements included on fixed, read-only format media so that new advertisements can be regularly directed to users of the media. In addition, the content can be specific to a user's profile. This facilitates tailoring of the advertisements in a manner specific to the requirements and tastes of a particular user.
The present invention also permits the tailoring of the read-only media to suit the needs and preferences of a user to help increase user enjoyment of the contents of the fixed, read-only format media. Additionally, the present invention also allows information on fixed, read-only format media to be time-released or periodically unlocked to help motivate a user to regularly use the media in order to access the newly released material.
The foregoing and other objects, aspects and advantages are better understood from the following detailed description of embodiments of the invention with reference to the drawings, in which:
The present invention includes a system, method, and article of manufacture for updating content stored on a portable storage medium.
It should be noted that the portable storage medium may take the form of any electronic/optic storage medium capable of storing content. Exemplary portable and separate storage mediums include locally or remotely accessible hard drives and floppy disks as well as any laser centric disk including, but not limited to, a digital versatile disk (DVD), a compact disk read only memory (CD-ROM), a writeable compact disk (CD-W), a rewriteable compact disk (CD-RW) or a MiniDisk (produced by Sony Corporation). In the present description, however, focus will remain on one embodiment of portable storage medium, a DVD.
In one embodiment of the present invention, the separate storage medium is accessed upon receiving an indication of a user action, which is effected by the user. The content of the portable storage medium may be displayed upon reading the content of the portable storage medium. In such case, the user action could include selection of at least a portion of the displayed content, i.e., a menu, of the portable storage medium.
In another embodiment of the present invention, the content of the portable storage medium and content of the separate storage medium are compared, such as to determine whether the content of the separate storage medium is an update of the content of the portable storage medium. In one embodiment, the content of the separate storage medium is received only if such content is an update of the content of the portable storage medium.
The update of content of the separate storage medium that is received in operation 106 of
In decision 206, it is determined whether a connection exists between the remote server and the machine. If it is determined in decision 206 that a connection exists, the cached content is compared to the content on the remote server in decision 208 to determine whether the cached information contains the latest update. If it is determined that the cached information includes the latest update, the cached content is received from the local storage medium in operation 210. If it is determined that the cached information does not include the latest update, the latest version of the update is received from the remote server in operation 212. It should be noted that decision 208 can be executed by comparing the cached content with tat stored in the remote server. This procedure will be explained more fully hereinafter in greater detail.
If it is determined in decision 206 that the connection is nonexistent, the cached content is received from the local storage medium in operation 214. Finally, in operation 216, the update of the content of the separate storage medium is displayed. It should be kept in mind that a remote server may include a remote database. Optionally, the remote server may be automatically accessed if the connection exists. Also optionally, the content of the separate storage medium can be displayed using hyper-text mark-up language (HTML).
Referring to decision 208, the determination of whether the data is updated information can be determined referring to and comparing:
An exemplary embodiment utilizing a DVD attempts to always present a user with the latest information. Since the DVD is fixed (write-once), it is therefore immediately outdated upon manufacturing and shipment. Certain content on the DVD can be updated with more recent content from either the local storage medium or directly over the Internet. The value of utilizing a local storage medium is that it does not necessarily require the user to be physically connected to the Internet which can tie up a communication link such as a telephone line (which in the case of international Internet usage may become very expensive if the user is charged for the time spent on their Internet connection). In this embodiment, content or digital assets can be downloaded or “pushed” from a remote location over the Internet and then stored locally for future viewing. The present invention automatically “serves” up (displays to the consumer) the latest version of information. The software can automatically detect the state of the consumer's device:
This embodiment of the present invention accomplishes this task by utilizing a distributed database/control structure having:
An exemplary use of an embodiment of the present invention could include, for example, automatically updating a menu in DVD-Video space via the Internet and displaying the updated menu to the consumer. Further, the menu could be tailored based on certain criteria, such as profile, retailer, computer manufacturer, other.
Other exemplary DVD-Video selection/construct components that can be updated include, but are not limited to, the chapter/part of title; title; angle (of camera); audio stream, and subpicture stream.
Methods of Obtaining Updated Information
Referring again to
One solution to the problem of distributing the updated content on large computer files is use of compression. A number of standard compression algorithms are in existence and are commonly used today. These algorithms typically achieve compression of a large executable file down to between 40% to 60% of its original file size and can compress some types of text files even further, thereby reducing the transaction costs of shipping the file. However, for very large computer files or collections of files, even a compressed file reduced to 40% still represents a substantial transmission cost.
Another method useful for transmitting updated files is using a technique known as a differencing program or comparator program to compare an old file to a new revised file in order to determine how the files differ. One such file system is distributed as part of the GNU UNIX-like operating system through tools referred to as diff and patch and described in standard GNU documentation. The described system discusses a way to use a differencing program to generate a patch file, and then using that patch file in combination with the old file to generate a newly revised file. While the GNU revision system has some applications within the UNIX-like operating system within which it was developed, it has not been generalizable in the new environment of personal computer systems. The most commonly available versions of the system are limited to text files, and achieve only limited compression. These programs cannot effectively handle files where a number of fairly complex changes have occurred, such as a number of block moves or random shuffling of text strings. These programs also do not produce the smallest patch file possible.
In the alternative, a method and system may be employed for generating a difference file from an old file and a new file, where that difference file indicates, in minimal number of bytes, changes between the old file and the new file. Such system allows users to then transmit the difference file to a computer system, and to use that difference file and the old file along with a decoding process to generate a newly revised file. The difference file can also be stored locally, allowing a number of versions of the same file to be saved without duplicating redundant information. Ideally, the difference file would be the smallest possible difference file, achieving compression density of perhaps 10% or less of the original file, even with a moderate number of changes between the two files.
The present invention may thus comprise a software system with several components, a method, and a file structure for generating very efficient difference files (sometimes abbreviated DIFF file) from an old file and a new file so that a difference file can be transmitted to a computer system where the difference file and a duplicate of the old file can quickly be used to create a copy of the new file, duplicating the new file as it existed on the separate storage medium. The difference file could also be stored locally to the computer system, allowing the new file to be duplicated from the old file without storing the new file.
Use of Burst Cut Area (BCA) to Tailor Updated Information
Initially, at the time of manufacture, content in the form of music, video, data, or any other type of visual or audible entertainment or information is generated and stored on the portable storage medium. Thereafter, a storage medium identifier, such as the Burst Cut Area (BCA) is incorporated onto the portable storage medium at the time of manufacture. It should be noted that the portable storage medium may take the form of any electronic/optic storage medium capable of storing content. In the present description, however, focus will remain on one embodiment of portable storage medium, a DVD.
Utilization of BCA Identification at the End Consumer
As mentioned earlier, when a final user obtains the portable storage medium, the portable storage medium may be identified using the tracking identifier on the portable storage medium. By this identification, various features may be executed upon identification of the portable storage medium. It should be noted that, in one embodiment, identification is carried out by a computer and software governs the features that are executed after identification of the portable storage medium.
For example, the present invention may be practiced in the context of a personal computer such as an IBM compatible personal computer, Apple Macintosh computer or UNIX based workstation. A representative hardware environment is depicted in
A preferred embodiment is written using JAVA, C, and the C++ language and utilizes object oriented programming methodology. Object oriented programming (OOP) has become increasingly used to develop complex applications. As OOP moves toward the mainstream of software design and development, various software solutions require adaptation to make use of the benefits of OOP. A need exists for these principles of OOP to be applied to a messaging interface of an electronic messaging system such that a set of OOP classes and objects for the messaging interface can be provided.
OOP is a process of developing computer software using objects, including the steps of analyzing the problem, designing the system, and constructing the program. An object is a software package that contains both data and a collection of related structures and procedures. Since it contains both data and a collection of structures and procedures, it can be visualized as a self-sufficient component that does not require other additional structures, procedures or data to perform its specific task. OOP, therefore, views a computer program as a collection of largely autonomous components, called objects, each of which is responsible for a specific task. This concept of packaging data, structures, and procedures together in one component or module is called encapsulation.
In general, OOP components are reusable software modules which present an interface that conforms to an object model and which are accessed at run-time through a component integration architecture. A component integration architecture is a set of architecture mechanisms which allow software modules in different process spaces to utilize each other's capabilities or functions. This is generally done by assuming a common component object model on which to build the architecture. It is worthwhile to differentiate between an object and a class of objects at this point. An object is a single instance of the class of objects, which is often just called a class. A class of objects can be viewed as a blueprint, from which many objects can be formed.
OOP allows the programmer to create an object that is a part of another object. For example, the object representing a piston engine is said to have a composition-relationship with the object representing a piston. In reality, a piston engine comprises a piston, valves and many other components; the fact that a piston is an element of a piston engine can be logically and semantically represented in OOP by two objects.
OOP also allows creation of an object that “depends from” another object. If there are two objects, one representing a piston engine and the other representing a piston engine wherein the piston is made of ceramic, then the relationship between the two objects is not that of composition. A ceramic piston engine does not make up a piston engine. Rather it is merely one kind of piston engine that has one more limitation than the piston engine; its piston is made of ceramic. In this case, the object representing the ceramic piston engine is called a derived object, and it inherits all of the aspects of the object representing the piston engine and adds further limitation or detail to it. The object representing the ceramic piston engine “depends from” the object representing the piston engine. The relationship between these objects is called inheritance.
When the object or class representing the ceramic piston engine inherits all of the aspects of the objects representing the piston engine, it inherits the thermal characteristics of a standard piston defined in the piston engine class. However, the ceramic piston engine object overrides these ceramic specific thermal characteristics, which are typically different from those associated with a metal piston. It skips over the original and uses new functions related to ceramic pistons. Different kinds of piston engines have different characteristics, but may have the same underlying functions associated with it (e.g., how many pistons in the engine, ignition sequences, lubrication, etc.). To access each of these functions in any piston engine object, a programmer would call the same functions with the same names, but each type of piston engine may have different/overriding implementations of functions behind the same name. This ability to hide different implementations of a function behind the same name is called polymorphism and it greatly simplifies communication among objects.
With the concepts of composition-relationship, encapsulation, inheritance and polymorphism, an object can represent just about anything in the real world. In fact, our logical perception of the reality is the only limit on determining the kinds of things that can become objects in object-oriented software. Some typical categories are as follows:
With this enormous capability of an object to represent just about any logically separable matters, OOP allows the software developer to design and implement a computer program that is a model of some aspects of reality, whether that reality is a physical entity, a process, a system, or a composition of matter. Since the object can represent anything, the software developer can create an object which can be used as a component in a larger software project in the future.
If 90% of a new OOP software program consists of proven, existing components made from preexisting reusable objects, then only the remaining 10% of the new software project has to be written and tested from scratch. Since 90% already came from an inventory of extensively tested reusable objects, the potential domain from which an error could originate is 10% of the program. As a result, OOP enables software developers to build objects out of other, previously built objects.
This process closely resembles complex machinery being built out of assemblies and sub-assemblies. OOP technology, therefore, makes software engineering more like hardware engineering in that software is built from existing components, which are available to the developer as objects. All this adds up to an improved quality of the software as well as an increased speed of its development.
Programming languages are beginning to fully support the OOP principles, such as encapsulation, inheritance, polymorphism, and composition-relationship. With the advent of the C++ language, many commercial software developers have embraced OOP. C++ is an OOP language that offers a fast, machine-executable code. Furthermore, C++ is suitable for both commercial-application and systems-programming projects. For now, C++ appears to be the most popular choice among many OOP programmers, but there is a host of other OOP languages, such as Smalltalk, Common Lisp Object System (CLOS), and Eiffel. Additionally, OOP capabilities are being added to more traditional popular computer programming languages such as Pascal.
The benefits of object classes can be summarized, as follows:
Class libraries are very flexible. As programs grow more complex, more programmers are forced to reinvent basic solutions to basic problems over and over again. A relatively new extension of the class library concept is to have a framework of class libraries. This framework is more complex and consists of significant collections of collaborating classes that capture both the small scale patterns and major mechanisms that implement the common requirements and design in a specific application domain. They were first developed to free application programmers from the chores involved in displaying menus, windows, dialog boxes, and other standard user interface elements for personal computers.
Frameworks also represent a change in the way programmers think about the interaction between the code they write and code written by others. In the early days of procedural programming, the programmer called libraries provided by the operating system to perform certain tasks, but basically the program executed down the page from start to finish, and the programmer was solely responsible for the flow of control. This was appropriate for printing out paychecks, calculating a mathematical table, or solving other problems with a program that executed in just one way.
The development of graphical user interfaces began to turn this procedural programming arrangement inside out. These interfaces allow the user, rather than program logic, to drive the program and decide when certain actions should be performed. Today, most personal computer software accomplishes this by means of an event loop which monitors the mouse, keyboard, and other sources of external events and calls the appropriate parts of the programmer's code according to actions that the user performs. The programmer no longer determines the order in which events occur. Instead, a program is divided into separate pieces that are called at unpredictable times and in an unpredictable order. By relinquishing control in this way to users, the developer creates a program that is much easier to use. Nevertheless, individual pieces of the program written by the developer still call libraries provided by the operating system to accomplish certain tasks, and the programmer must still determine the flow of control within each piece after it's called by the event loop. Application code still “sits on top of” the system.
Even event loop programs require programmers to write a lot of code that should not need to be written separately for every application. The concept of an application framework carries the event loop concept further. Instead of dealing with all the nuts and bolts of constructing basic menus, windows, and dialog boxes and then making these things all work together, programmers using application frameworks start with working application code and basic user interface elements in place. Subsequently, they build from there by replacing some of the generic capabilities of the framework with the specific capabilities of the intended application.
Application frameworks reduce the total amount of code that a programmer has to write from scratch. However, because the framework is really a generic application that displays windows, supports copy and paste, and so on, the programmer can also relinquish control to a greater degree than event loop programs permit. The framework code takes care of almost all event handling and flow of control, and the programmer's code is called only when the framework needs it (e.g., to create or manipulate a proprietary data structure).
A programmer writing a framework program not only relinquishes control to the user (as is also true for event loop programs), but also relinquishes the detailed flow of control within the program to the framework. This approach allows the creation of more complex systems that work together in interesting ways, as opposed to isolated programs, having custom code, being created over and over again for similar problems.
Thus, as is explained above, a framework basically is a collection of cooperating classes that make up a reusable design solution for a given problem domain. It typically includes objects that provide default behavior (e.g., for menus and windows), and programmers use it by inheriting some of that default behavior and overriding other behavior so that the framework calls application code at the appropriate times.
There are three main differences between frameworks and class libraries:
Thus, through the development of frameworks for solutions to various problems and programming tasks, significant reductions in the design and development effort for software can be achieved. A preferred embodiment of the invention utilizes HyperText Markup Language (HTML) to implement documents on the Internet together with a general-purpose secure communication protocol for a transport medium between the client and the Newco. HTTP or other protocols could be readily substituted for HTML without undue experimentation. Information on these products is available in T. Berners-Lee, D. Connoly, “RFC 1866: Hypertext Markup Language—2.0” (Nov. 1995); and R. Fielding, H, Frystyk, T. Berners-Lee, J. Gettys and J. C. Mogul, “Hypertext Transfer Protocol—HTTP/1.1: HTTP Working Group Internet Draft” (May 2, 1996). HTML is a simple data format used to create hypertext documents that are portable from one platform to another. HTML documents are SGML documents with generic semantics that are appropriate for representing information from a wide range of domains. HTML has been in use by the WorldWide Web global information initiative since 1990. HTML is an application of ISO Standard 8879; 1986 Information Processing Text and Office Systems—Standard Generalized Markup Language (SGML).
To date, Web development tools have been limited in their ability to create dynamic Web applications that span from client to server and interoperate with existing computing resources. Until recently, HTML has been the dominant technology used in development of Web-based solutions. However, HTML has proven to be inadequate in the following areas:
Sun Microsystem's Java language solves many of the client-side problems by:
With Java, developers can create robust User Interface (UI) components. Custom “widgets” (e.g., real-time stock tickers, animated icons, etc.) can be created, and client-side performance is improved. Unlike HTML, Java supports the notion of client-side validation, offloading appropriate processing onto the client for improved performance. Dynamic, real-time Web pages can be created. Using the above-mentioned custom UI components, dynamic Web pages can also be created.
Sun's Java language has emerged as an industry-recognized language for “programming the Internet.” Sun defines Java as: “a simple, object-oriented, distributed, interpreted, robust, secure, architecture-neutral, portable, high-performance, multithreaded, dynamic, buzzword-compliant, general-purpose programming language. Java supports programming for the Internet in the form of platform-independent Java applets.” Java applets are small, specialized applications that comply with Sun's Java Application Programming Interface (API) allowing developers to add “interactive content” to Web documents (e.g., simple animations, page adornments, basic games, etc.). Applets execute within a Java-compatible browser (e.g., Netscape Navigator) by copying code from the server to client. From a language standpoint, Java's core feature set is based on C++. Sun's Java literature states that Java is basically, “C++ with extensions from Objective C for more dynamic method resolution.”
Another technology that provides similar function to JAVA is provided by Microsoft and ActiveX Technologies, to give developers and Web designers wherewithal to build dynamic content for the Internet and personal computers. ActiveX includes tools for developing animation, 3-D virtual reality, video and other multimedia content. The tools use Internet standards, work on multiple platforms, and are being supported by over 100 companies. The group's building blocks are called ActiveX Controls, small, fast components that enable developers to embed parts of software in hypertext markup language (HTML) pages. ActiveX Controls work with a variety of programming languages including Microsoft Visual C++, Borland Delphi, Microsoft Visual Basic programming system and, in the future, Microsoft's development tool for Java, code named “Jakarta.” ActiveX Technologies also includes ActiveX Server Framework, allowing developers to create server applications. One of ordinary skill in the art readily recognizes that ActiveX could be substituted for JAVA without undue experimentation to practice the invention.
It should be noted that various permutations of serialization may be employed including, but not limited to a watermark, hologram, and any other type in substitution or combination with the BCA information without diverging from the spirit of the claimed invention.
Watermarking
Digital video data can be copied repeatedly without loss of quality. Therefore, copyright protection of video data is a more important issue in digital video delivery networks than it was with analog TV broadcast. One method of copyright protection is the addition of a “watermark” to the video signal which carries information about sender and receiver of the delivered video. Therefore, watermarking enables identification and tracing of different copies of video data. Applications are video distribution over the World-Wide Web (WWW), pay-per-view video broadcast, or labeling of video discs and video tapes. In the mentioned applications, the video data is usually stored in compressed format. Thus, the watermark must be embedded in the compressed domain. An approach for robust watermarking of MPEG-2 encoded video is presented in accordance with an alternate embodiment. The method is of much lower complexity than a complete decoding process followed by watermarking in the pixel domain and re-encoding. Although an existing MPEG-2 bitstream is partly altered, the method avoids drift by adding a drift compensation signal. The method has been implemented and the results confirm that a robust watermark can be embedded into MPEG-encoded video which can be used to securely transmit arbitrary binary information at a data rate of several bytes/second.
The method is easily applicable to other video coding schemes like MPEG-1, H.261, and H.263. Digital watermarks exist at a convergence point where creators and publishers of digitized multimedia content demand localized, secured identification and authentication of that content. Because existence of piracy is clearly a disincentive to the digital distribution of copyrighted works, establishment of responsibility for copies and derivative copies of such works is invaluable. In considering the various forms of multimedia content, whether “master,” stereo, NTSC video, audio tape or compact disc, tolerance of quality degradation will vary with individuals and affect the underlying commercial and aesthetic value of the content.
It is desirable to tie copyrights, ownership rights, purchaser information or some combination of these and related data to the content in such a manner that the content must undergo damage, and therefore a reduction in value, with subsequent, unauthorized distribution of the content, whether it be commercial or otherwise. Legal recognition and attitude shifts, which recognize the importance of digital watermarks as a necessary component of commercially distributed content (audio, video, game, etc.), will further the development of acceptable parameters for the exchange of such content by the various parties engaged in the commercial distribution of digital content.
These parties may include artists, engineers, studios, Internet access providers, publishers, agents, on-line service providers, aggregators of content for various forms of delivery, on-line retailers, individuals and parties that participate in the transfer of funds to arbitrate the actual delivery of content to intended parties. Since the characteristics of digital recordings vary widely, it is a worth while goal to provide tools to describe an optimized envelope of parameters for inserting, protecting and detecting digital watermarks in a given digitized sample (audio, video, virtual reality, etc.) stream. The optimization techniques described hereinafter make unauthorized removal of digital watermarks containing these parameters a significantly costly operation in terms of the absolute given projected economic gain from undetected commercial distribution. The optimization techniques, at the least, require significant damage to the content signal, as to make the unauthorized copy commercially worthless, if the digital watermark is removed, absent the use of extremely expensive tools. Presumably, the commercial value of some works will dictate some level of piracy not detectable in practice and deemed “reasonable” by rights holders given the overall economic return. For example, there will always be fake $100 bills, LEVI jeans, and GUCCI bags given the sizes of the overall markets and potential economic returns for pirates in these markets—as there also will be unauthorized copies of works of music, operating systems (Windows 98, etc.), video and future multimedia goods. However, what differentiates the “digital marketplace” from the physical marketplace is the absence of any scheme that establishes responsibility and trust in the authenticity of goods. For physical products, corporations and governments that mark the goods and monitor manufacturing capacity and sales to estimate loss from piracy. There are also no reinforcing mechanisms, including legal, electronic, and informational campaigns to better educate consumers.
With the advent of digital video and digital video broadcasting, issues of copyright protection have become more important, since the duplication of digital video does not result in the inherent decrease in quality suffered by analog video. One method of copyright protection is the addition of a “watermark” to the video signal. The watermark is a digital code embedded in the bitstream of the digital video that typically identifies the copyright owner. The watermark, if applied to individual copies of the video, may also be used to identity of the receiver of each copy. This processing identifies illegally reproduced copies and facilitates tracing back to the receiver from which they originated. For watermarking of digital video, a number of different characteristics of the watermark are desirable. First, the watermark should be embedded in such a way that it is imperceptible or barely perceptible to a viewer of the video. Secondly, the watermark should be such that it cannot be removed by intentional or unintentional operations on the digital video bitstream or on the decoded video without, at the same time, degrading the perceived quality of the video to the point of significantly reducing its commercial value (a characteristic referred to as “robustness”). Thirdly, since the video may be stored for broadcast in a compressed form (such as in a “video-on-demand” server), it is desirable to be able to incorporate the watermark into the bitstream without having to decode the signal first and to re-encode it after adding the watermark. This can be accomplished with the watermarking of digital still images, but the method used does not lend itself to digital video, due to the additional constraints which video signals present. Many digital video applications are “constant bit rate” applications, which do not tolerate increases in the bit rate of the transmitted bitstream. Even in those applications which are not restricted to a constant bit rate, unnecessary increases in the bit rate should be avoided, so as to preserve the real-time decodability of the video signal when transmitted over a channel having a given bandwidth. Thus, it is desirable that the addition of the watermark does not increase the bit rate of the video signal. Past watermarking techniques for digital video are limited to the watermarking of uncompressed video data. However, since video sequences are often stored in a compressed format (thereby saving on memory space), watermarking the signal in a way which uniquely identifies each receiver of the signal would require decoding of the signal, addition of the watermark, and recoding before the signal is transmitted. This clearly places a significant time and processing burden on the task of delivering the video sequence.
Hologram
Information exchange and transfer over a shared transmission channel present a challenge to the security of sensitive information. Internet and Intranet are two examples of such a shared information transmission channeling which many computers are connected with one another by local or wide area communication networks. It is therefore possible for any user or an intruder to intercept a package of sensitive data that is transmitted over the shared channel. In particular, the internet is a rapidly growing business forum and securing information transferred through its channels is becoming a major concern for transmitting proprietary information. Data encryption techniques can be used to increase the security in data exchange and transfer over a shared transmission channel. In its simplest form, data encryption uses a “key” based on a particular algorithm to change the sequence of a package of data that contains a piece of confidential information (“plain text”) so that the data is enciphered or “scrambled” into an form that appears to have no correlation with the embedded confidential information (“cipher text”). An unauthorized user, who does not have the knowledge of either the encryption method (e.g., the encryption algorithm) or the key formed based on the encryption method, cannot easily decode the information. An authorized user recovers the embedded information in the scrambled data by using a “key” that is constructed based on the encryption method. Therefore, even if the unauthorized user obtains the scrambled data, the knowledge of both of the encryption method and the particular key is needed to decrypt the confidential information embedded therein.
One well-known encryption system is the Data Encryption Standard (DES) adapted in 1977 by the National Bureau of Standards. This is a secret-key crypto system to exploit confusion and diffusion techniques, allowing acceptable security using key lengths as short as 64. The number of keys in crypto systems based on the DES can be as many as 512 keys with the current computational power. However, increased key lengths “cost” significant delays in transmitting and receiving the encoded information. Two main kinds of crypto systems are a symmetrical system, i.e., the private key system, and an asymmetrical system, i.e., the public-private key system. The DES symmetric crypto systems typically encrypt 64 bit blocks of plain text using a key length of 56 bits. The fundamental building blocking DES (referred to as a round) is a single combination of a substitution followed by a permutation of the text, based on the key.
The plain text is encoded through 16 rounds of a function, which usually implement substitution, permutation, XOR and shift operations on subsets of the text and the key in such a way that every bit of the cipher text depends on every bit of the plain text and every bit of the key. This means that if a single bit of the cipher text is corrupted during transmission, the entire message may be lost. This is another weakness of DES-type block ciphers. In each round, a different subset of the elements from the key, Ki, are used to perform the encryption (hence K1 is applied during the first round, and Ki is applied during the ithround, etc.). An analogous algorithm is used to decrypt the cipher text, but the keys are now applied in reverse order, and the shift operations change from left to right. Given the complexity of the DES algorithm, the speed at which DES is encrypted is a function of the processor characteristics for both hardware and software implementations. For example, Digital Equipment Corporation makes a hardware DES chip which can encrypt and decrypt at a rate of 1 GBit/sec, or 15.6 million DES blocks per second. Software implementations are slower; for example, an IBM 3090 mainframe can encrypt 32,000 DES blocks per second.
Typical software implementation performances for microcomputers are listed in the Table 1 herein. TABLE 1 Encryption Rates using some microprocessors Bus width DES Blocks Processor Speed (MHz) (bits) (per/sec) 8088 4.7 8 37068000 7.6 16 90080286 6.0 16 1,10068020 16.0 32 3,50068030 16.0 32 3,90080280 25.0 16 5,00068030 50.0 32 9,60068040 25.0 32 16,00068040 40.0 32 23,20080486 33.0 32 40,600. Another prior art cryptography system is the RSA Public Key Crypto system available from the RSA Data Security in California. RSA is an asymmetric crypto system in which two different keys are used: a public key to encrypt the plain text and a private key to decrypt the cipher text. The hardware implementations of RSA are usually about 1000 to 10,000 times slower than a hardware implementation of DES. In software implementations, RSA is generally about 100 times slower than DES. These numbers will improve as technology advances, but the processing speed of RSA will be difficult to approach the speed of a symmetric crypto system. Consequently, RSA is generally not viewed as a replacement for DES or any other fast bulk encryption algorithm. Instead, RSA is often used for secure key exchange without prior exchange of secrets. Hence a long message is encrypted with DES.
The message is sent with its DES key encrypted via RSA public key encryption. Many other prior-art encryption systems are variations of the DES-type encryption. Generally, it is suspected that given the advanced state of computational processors, DES may no longer be safe against a brute-force attack, so alternatives have actively been sought since the late 1980's. In response to this need, several alternatives have been developed and are thought to be competitive with DES in terms of the level of security provided. Examples of these systems include the following encryption methods.
(1) Triple DES. This is a variation of DES where the plain text is encrypted with the DES algorithm by three different keys in succession. This is commonly accepted to be equivalent to increasing the size of the DES key to 112 bits. Triple encryption of the plain text is the current method of dealing with misgivings about DES's security, but this is clearly done at the expense of the throughput rate for encrypting and decrypting messages.
(2) REDOC, a block algorithm which has a 20 byte (160-bit key) and that operates on an 80 bit block. All of the manipulations, (i.e. substitutions, permutations, and key XOR's) are performed on bytes, which makes it more efficient in software than DES whose initial and final permutations are difficult to efficiently implement in software. In addition, the 160 bit key usually makes this algorithm very secure.
(3) Khufu is a recently proposed 64 bit block cipher, which calls for a 512-bit key, and leaves the number of rounds open (either 16, 24, or 32). Because of the large key, and the potentially expanded number of rounds, the security of this algorithm is expected to be very high. However, increasing the number of rounds has the disadvantage of slowing the rate at which data can be encrypted.
(4) IDEA is a 64-bit block cipher that utilizes a 128 bit key. It usually utilizes three basic operations, XOR, addition modulo 2 sup 16, and multiplication modulo 2 sup 16. The algorithm typically operates on 16-bitsub-blocks, which makes it efficient, even on 16 bit processors. Its current software implementations are about as fast as DES. In view of the limitations and disadvantages of the various prior-art encryption systems, the inventors of the present invention developed a new crypto system based on optical phase modulation and a corresponding implementation interface between a user computer and the network. An embodiment in accordance with the present invention can exchange any of these methods for enciphering information embedded in a digital bit stream prior to digitization and transmission over a shared network such as the internet.
A holographic de-scrambler can be used at the receiving end in accordance with a preferred embodiment by an authorized user to decipher the information. One of many advantages of the present invention is the potential to achieve high rate of encryption/decryption (e.g., larger than 1 Gbit/s) as optical fiber networks of high data rates (e.g., larger than 2.4 Gbit/s) become more common. In one of several preferred embodiments of the present invention, a package of digital data is first imprinted on a carrier light beam. This is done by using a two-dimensional spatial light modulator. The phase of the data-bearing optical waveform is subsequently distorted by a phase-scrambling medium. Next, the data-bearing optical waveform with distorted phase is used to form an optical hologram with a reference beam. The hologram is then converted into electronic signals which are sent to its destination in digital form over a shared transmission channel. At the destination where the scrambled data is received, the hologram is displayed in a spatial light modulator and a conjugate reconstruction thereof is performed to generate a conjugate of the data-bearing signal waveform with distorted phase. A holographic medium having information indicative of the phase-scrambling medium is used to unscramble the phase and the embedded data is retrieved from the conjugate reconstruction optical waveform by using a light detector array such as a CCD array. One aspect of the present invention is to achieve optical encryption keys up to and greater than 10 sup 6 keys to enhance the security.
This is a difficult implementation for many prior art systems. Such a large number of encryption keys is possible because of the unique optical analog technique in accordance with the present invention. It is another aspect of the present invention to insure fast enciphering and deciphering of a large encryption key that are rarely obtainable with the prior-art systems. The preferred embodiments implement this by using the high-speed optical reconstruction of a data-bearing hologram and the capability of parallel processing of optical data processing devices. It is yet another aspect of the present invention to increase the confidentiality of the encryption schemes by using unconventional analog-based enciphering and deciphering of digital data. This aspect is particularly advantageous in view of the current lack of a theoretical foundation for decrypting analog-based encryption. A brute force attacked encryption based on algorithm techniques is nearly impossible for invading the cryptography systems in accordance with the present invention. It is yet another aspect of the present invention to use optical phase information in a nonobvious way to encipher and decipher digital data. It is yet another aspect of the present invention that optical holographic techniques are used in both enciphering and deciphering processes to further enhance the confidentiality of the encryption systems in accordance with the present invention. It is yet another aspect of the present invention that the phase conjugate reconstruction of data-bearing holograms are implemented in preferred embodiments to ensure the high fidelity of the analog deciphering process. It is yet another aspect of the present invention to integrate optical processing technology, hardware encryption, opto-electronic interfacing, and high-fidelity and fast-speed digital signal transmission to form a highly secure, fast and versatile encryption system that works independent of the transmission media utilized. It is still another aspect of the present invention to complete the encryption or decryption process in a single step, instead of the 16 rounds of complex computations typically found in most symmetric encryption schemes. In the optical encryption systems in accordance with the present invention, the encrypting speed is usually not limited by the size of the encryption key, but rather by the system speed in converting between the electronic-to-optical and the optical-to-electronic information modes.
Other Serialization
In the past, merchants have unsuccessfully employed various methods in an attempt to track and identify their inventory. Engraving, stamping, painting, and marking are several methods that merchants have employed. Due to practical problems, those methods are not effectively applicable to the CD multimedia rental industry.
As is known in the art and industry of compact disc multimedia, graphical information identifying the program title and author of a recording is ordinarily placed on the top surface of a CD. Digital data is stored on or just below that top surface. In particular, digital data is stored immediately below such graphical information between the top surface and the bottom surface of the CD. The bottom surface of the CD is comprised of a section of clear material through which, in accessing the data, a laser beam from a compact disc player radiates upward.
The digital data is delicate and can easily be damaged during processes typically used to identify merchandise, which include engraving, stamping, or marking. As stated above, the digital data is closer to the top surface of the CD than it is to the bottom surface. Although the top surface of a CD usually contains graphical information applied by silk screening that partially protects the digital data from damage, the silk screened layer is thinner and more fragile than the bottom surface of a CD which comprises clear material. Thus, there is a greater need to protect the top surface of the CD and the digital data close to it from physical damage such as scratching.
Engraving may be used to identify merchandise. Engraving CDs with identification markings is problematic since engraving is often attempted on the top surface of the CD and such engraving could interfere with the digital data next to it. Moreover, even if engraving is attempted on the bottom surface of a CD where it is less likely that digital data will be damaged, the data may still be damaged during engraving due to the pressure required to be placed on the top of the CD to hold it in place and the heat that may result from such engraving. In addition, engraving may be undesirable since it is a relatively labor intensive and costly process, especially in high volume situations.
Thus, merchants have considered other less invasive methods of identification such as, for example, painting. Painting also fails to provide an effective means of identification or security due to the labor required, the cost required, and the inherent unreliability of the process given the ease with which a person can duplicate such painting. Moreover, painting may pose other problems since harm to the digital data must be avoided.
Still another option of identifying and securing inventory is the use of ordinary adhesive stickers. Such stickers do not provide an effective means of identification due to the ease with which such stickers can be removed and reaffixed to similar looking items without a means of clearly indicating any tampering with the sticker. In addition, such stickers may be difficult to manually apply to CDs (since any sticker should be precisely centered on the CD) in the absence of an applicator workstation such as the one disclosed herein. In addition, such stickers may be easy to duplicate.
Magnetic-type EAS systems are widely used to inhibit the theft of merchandise such as clothing, books, cassettes and compact disks. Electronic article surveillance (EAS) systems are often used to prevent unauthorized removal of articles from a protected area, such as a library or retail store. An EAS system usually includes an interrogation zone or corridor located near the exit of the protected area and markers or tags attached to the articles to be protected. EAS systems have been based on magnetic, RF, microwave and magneto-restrictive technologies. Regardless of the particular technology involved, the EAS systems are designed such that the tag will produce some characteristic response when exposed to an interrogating signal in the corridor. Detection of this characteristic response indicates the presence of a sensitized tag in the corridor. The EAS system then initiates some appropriate security action, such as sounding an audible alarm, locking an exit gate, etc. To allow authorized removal of articles from the protected area, tags that are either permanently or reversibly deactivatable (i.e., dual status tags) are often used.
Although EAS markers have been in common use for the theft protection of optically recorded media such as compact disks and CD-ROM's, the markers have generally been adapted for attachment to the packages containing new compact disks and have been poorly suited for direct attachment to the compact disk itself for libraries and other institutions that repeatedly check compact disks in and out to accommodate the needs of customers and clients, effective inventory control would prefer that EAS markers are attached to the compact disk.
Some markers for direct attachment to compact disks have been developed. One, available as “DCD-1” from Minnesota Mining and Manufacturing Company, St. Paul, Minn., is a single marker strip and security overlay which are attached to a compact disk. However, this marker adversely effects the mechanical balance of the disk, which can adversely affect the operation of modern high rotation speed CD-ROM drives, CD players, and other optically recorded media playback equipment which require that the media be mechanically balanced for proper operation. Another product, “CD-Guard”, available from Knogo North America, Inc., Hauppauge, Long Island, N.Y., suffers the same mechanical balance drawback. An optical information storage disk comprising an embedded, generally annular, dual-status EAS marker is described in coassigned U.S. Pat. No. 5,347,508.
Other Media
It should be noted that the principles of the present invention may be applied to other types of media beyond the portable storage medium discussed hereinabove. As a disk-like recording medium (referred to hereinafter as an optical disk) on and from which an information signal is recorded and reproduced by laser beam, there are now commercially available a so-called compact disc with audio data recorded therein, a CD-ROM in which computer data is recorded, a write once optical disk on which an information signal can be recorded once and a recordable optical disk in which an information signal can be reproduced, recorded and erased.
The read-only optical disk such as a compact disc or CD-ROM has tracks on which irregular patterns, i.e., phase pits are concentrically or spirally formed on the basis of a recorded information signal formed on one surface thereof. Specifically, the read-only optical disk is composed of a disk base plate made of a transparent synthetic resin such as polycarbonate or PMMA (polymethyl methacrylate), a reflection film made of a metal such as Al or Au formed so as to cover phase pits formed on one surface of the disk base plate and a protection layer formed so as to cover the reflection film in order to protect the reflection film.
When an information signal is reproduced from the read-only optical disk, laser beam from a laser light source is converged by an objective lens and irradiated on the read-only optical disk from the disk base plate side. Reflected light flux modulated by the phase pits on the optical disk is detected by a photodetector, for example, and converted into a detected signal having a signal level corresponding to an intensity of reflected light flux, thereby allowing a reproduced signal of the information signal recorded on the read-only optical disk to be obtained.
While the read-only optical disk can provide mass-produced products (optical disks) inexpensively on the market, it is not suitable for products of small demand. For this end, write once optical disks are prepared for optical disk products of small demand and a variety of data can be provided to the user easily. As write once optical disks, there are available a write once optical disk of recording system using physical chemical change of pigment, a write once optical disk of a single layer hole forming recording system, a write once optical disk of multi-layer hole forming recording system, a write once optical disk of phase-change recording system and a write once optical disk of bubble-foaming system. Upon reproduction, in a manner similar to the read-only optical disk, a laser beam (having a weak reproduction laser power) from a laser light source is irradiated on the disk from the disk base plate side under the condition that the laser beam is converged by an objective lens. Then, reflected light flux that is modulated by previously-recorded pits is detected by a photodetector and the detected signal is converted into a detected signal having a signal level corresponding to an intensity of a reflected light bundle, thereby obtaining a reproduced signal of an information signal recorded on the write once optical disk.
When an information signal is recorded on the above write once optical disk, a laser beam (having a strong recording laser power) from a laser light source is irradiated on the optical disk from the disk base plate side under the condition that the laser beam is converged by an objective lens. Then, the power of the laser beam is turned on and off by modulating the laser beam in response to an information signal and pits (pits substantially similar to those recorded on the read-only optical disk) corresponding to the information signal are formed along recording tracks of the optical disk. Specifically, in the case of the single layer hole forming recording system, a hole is formed on the recording track at an area irradiated with a strong laser beam and this hole is recorded as a pit. In the case of a multi-layer hole forming recording system, a hole is formed on the recording track at an area irradiated with a strong laser beam, e.g., the film of the first layer and the hole on the first layer are recorded as a pit.
In the case of the phase change recording system, a portion of the recording track irradiated with a strong laser beam is changed from the amorphous state to the crystal state and the portion that was changed to the crystal state is recorded as a pit. In the case of the bubble foaming recording system, of the recording tracks, a recording layer of the portion irradiated with a strong laser beam is upheaved and the upheaved portion is recorded as a pit.
In the write once optical disk, in particular, a guide groove is formed (pre-groove portion) to allow tracking control of laser beam. An end face opposing the pre-groove is formed as a sine wave shape (generally referred to as a wobble shape) having a predetermined amplitude and a predetermined period along the track. When this wobble shape is optically detected by laser beam, it is possible to obtain a wobble signal serving as absolute time information. The wobble signal is used to control the system of the recording and reproducing apparatus and, in particular, the timing information for recording pits on the optical disk. Further, the wobble signal is used to servo-control an optical disk rotating and driving means, e.g., a spindle motor. According to the servo control operation, the rotational speed of the spindle motor is controlled such that the period of the wobble signal becomes constant.
The above write once optical disk is generally of a groove recording 10 system where pits are recorded on the pre-groove portion. When information data that is to be recorded on the write once optical disk is recorded, a target position is synchronously searched based on the period of the wobble signal obtained by optically detecting the wobble shape formed on the pre-groove portion. When the target position is detected, the above information data that is to be recorded on the write once optical disk is recorded on the target position according to a predetermined format.
On the other hand, upon reproduction, a target position is searched as described above. When the target position is detected, based on a frame synchronizing signal inserted into the data to be recorded on the write once optical disk, 2 kilobytes of data, for example, are sequentially read out, thereby reproducing recorded data.
Since the read-only optical disk and the write once optical disk are the same in reproduction principle as described above, even when the write once optical disk is loaded onto a reproducing apparatus which reproduces an information signal from the read-only optical disk, data recorded on the write once optical disk can be reproduced without distinction of the read-only optical disk.
In addition, the write once optical disk has a feature that allows a number of optical disks to be easily produced by relatively simple equipment. For this reason, there is the risk that the write once optical disk will be illegally copied (illegal copy). Specifically, initially, there is a computer system wherein a reproducing apparatus for reproducing an information signal from a read-only optical disk is connected to one external input and output terminal of a personal computer used by the end user. For example, and an external storage device for recording and reproducing an information signal on and from the write once optical disk is connected to another external input and output terminal. Then, recorded data that had been read out from the read-only optical disk by the reproducing apparatus are all written in the write once optical disk by the external storage device, thereby producing a pirate edition of the read-only optical disk.
In this case, if the read-only optical-disk is a CD-ROM where computer data (including computer program) are recorded, then a pirate edition of game software can be easily produced. If the read-only optical disk is a compact disc (CD) where music information are recorded, then it becomes possible to easily produce a pirate edition of the compact disc.
Since computer programs are copyrighted material protected by copyright, copies—except those made by the regular user, i.e., registered users who accepted the software license agreement (software license agreement)—for backup or copies for the hard disk are illegal.
Further, copy for thoroughly copying recorded data on the CD-ROM which is a copyright material to the write once optical disk for the purpose of action of concession in distribution is also illegal and such illegal action for obtaining unfair profit should be prevented.
Furthermore, an act wherein a regular user makes a free distribution for those who are not regular users in an enterprise or CAI (Computer Assisted Instruction) is regarded as serious.
At present, there are a variety of proposed methods for copy protection many of which have been reduced to practice. On the other hand, a software (program or the like) called “copy tool” used in removing copy protection is now commercially available. Short of the user's own conscience, there is currently no other way to prevent the illegal copying of recorded data.
In view of the aforesaid, it is an object of the present invention to provide a data recording method wherein an illegal copy between disk-like recording mediums can be effectively protected even against a copy tool and in which copyrighted material (recorded data) recorded on the disk-like recording medium can be protected.
Interactive productions allow a user of a computer system to interact with movies, video or other displayed images while the images are being updated at a rapid rate. The purpose of these productions is to present useful information, educate or entertain the user. The ultimate goal of interactive technology is to make the user feel as though they are interacting with images on the screen so that, for example, characters or objects in a drama react to the users actions. The user's actions can affect characters, objects or other images on the display screen and change the course of the storyline.
One method for providing a high degree of interaction is to make the production completely computer generated. This means that the computer models a three dimensional world and calculates and displays the orientation of figures and objects on the screen. However, this approach is limited by today's technology because the computing power to fully calculate and render lifelike images, especially human figures, at resolutions approaching television quality in real time at video or film refresh rates is beyond the current technology for mass-marketed systems.
A different approach is to prerecord video, film or computer generated image sequences and play the prerecorded images, or frames, back at high speed. This achieves the resolution of television, or better, and is sufficiently lifelike to create a level of believability comparable to television. However, in this approach the user has a very limited amount of interactivity with the production since the user's ability to affect the story is limited to the small number of different “paths” of prerecorded image sequences that are branched to at predetermined decision points in the video or animation sequence. The use of any prerecorded sequences of images that are played back so as to achieve animation while allowing a user to interact with the images is referred to broadly here as “interactive video.”
Interactive video productions typically use a compact disc read-only memory (CD-ROM) disc to store the images and a CD-ROM drive to retrieve images during playback. The CD-ROM disc stores information in a concentric spiral on optical media and is “read” or played back with a CD-ROM drive that uses a “read head” with a laser beam. The big problem with CD-ROM based interactive production is the break in continuity due to delays of about a half-second or more required to locate a desired branch path that is different from the current path that the drive's read head is tracking. Another problem is that CD-ROM based interactive video productions are severely limited in the number and types of ways that a user may interact with the video.
The length of time to access a different video path (“access time” or “seek time”) depends upon the location of the different video path with respect to the current placement of the CD-ROM drive's read head. In order to access a given video sequence, a computer controller looks up the location of the sequence in an index and instructs the CD-ROM drive to access the new sequence by moving the read head to the beginning of the new sequence on the disc. Since the read head is moved by a mechanical mechanism it takes a comparatively long time to reposition the read head to a new point on the track to access the different video path.
The prior art uses caches to try to improve the performance of accessing data in a CD-ROM. The cache can be in the CD-ROM drive, in an interface card between the processor and the drive, in the memory of the computer system controlled by software or even on a hard disk or other storage medium. However, these caches only provide marginal improvement in access times where video is concerned because of the relatively small sizes of the caches compared to the data rate of the information coming off of the CD-ROM. Also, when a different path is branched to the information in the caches is usually useless since they don't contain the new data. The caches must be “purged” and loaded with new information.
While current CD-ROM drives are not adequate to provide sufficient interactivity in interactive video productions, they represent a huge installed base since hundreds of thousands have already been sold to consumers. Therefore, a system which eliminates the access time in CD-ROM based interactive videos without requiring modification of existing CD-ROM drives is desired.
Conventionally, a so-called LD (Laser Disk) and a so-called CD (Compact Disk) are generalized as optical disks, on which information such as video information, audio information and the like is recorded. On the LD or the like, the video information and the audio information are recorded together with time information indicating a time at which each information is to be reproduced with respect to a reproduction start position, which each LD or the like has, as a standard position. Thus, other than a general normal reproduction to reproduce the recorded information in the order of recording, various special reproductions are possible, such as a reproduction to extract and listen to an only desirable music out of a plurality of recorded musics, a reproduction to listen to the recorded musics in a random order and so on, in case of the CD, for example.
However, there is a problem that, according to the above mentioned LD or the like, a so-called interactive and variegated reproduction is not possible in which the audience can have a plurality of selection branches as for the video or audio information to be displayed or sound-outputted and in which the audience can select them to watch or listen to it.
Namely, for example, in case of giving audience to a foreign movie on the LD, it is not possible to select one of languages to be used for a subtitle (caption) displayed on the picture plane (e.g., select one of the subtitle in Japanese and the subtitle in the original language) so as to display the subtitle in the selected language, or, in case of giving audience to a music recorded on the CD, it is not possible to select one of sound voices of the music (e.g., select one of the English lyric and the Japanese lyric).
On the other hand, various proposals and developments are being made as for the DVD, as an optical disk in which the memory capacity is improved by about ten times without changing the size of the optical disk itself as compared with the aforementioned conventional CD. With respect to this DVD, if a plurality of subtitles in various languages or a plurality of voice sounds in various languages are recorded, the above mentioned interactive and variegated reproduction is possible as the audience selects one of them.
However, the information amount of the audio information or music information becomes enormous if the audio or voice sounds in various languages or the music in various types are recorded on the above-mentioned DVD. At this time, if the information is not recorded in an appropriate recording form, the process for searching the audio information etc. to be reproduced becomes complicated, and a case where the audio sound or music sound etc. is interrupted in the middle of the reproduction due to the time required to search the audio information etc. may happen at the time of reproduction, which is a problem.
It should be noted that the process operations used in the examples and figures above exemplify only a few implementations of the present invention. Those skilled in the art will appreciate that other process operations can accomplish the design goals of the present invention. For example, analogies may be drawn to digital entertainment systems. Likewise, alternative logic can be used to implement the present invention.
It should also be noted that all of the above embodiments pertain to multiple platforms or machines including, but not limited to computers, set-top boxes, DVD consumer players, cable boxes, and satellite receivers.
While various embodiments have been described above, it should be understood that they have been presented by way of example only, and not limitation. Thus, the breadth and scope of a preferred embodiment should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents.
This application is a Continuation of U.S. patent application Ser. No. 09/476,190, filed Jan. 3, 2000, entitled A SYSTEM, METHOD AND ARTICLE OF MANUFACTURE FOR UPDATING CONTENT STORED ON A PORTABLE STORAGE MEDIUM, which is a Continuation in Part of U.S. patent application Ser. No. 09/296,098, filed Apr. 21, 1999, entitled A SYSTEM, METHOD AND ARTICLE OF MANUFACTURE FOR UPDATING CONTENT STORED ON A PORTABLE STORAGE MEDIUM, now U.S. Pat. No. 6,453,420, all of which are incorporated herein by reference in their entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4000510 | Cheney et al. | Dec 1976 | A |
| 4386375 | Altman | May 1983 | A |
| 4602907 | Foster | Jul 1986 | A |
| 4672572 | Alsberg | Jun 1987 | A |
| 4709813 | Wildt | Dec 1987 | A |
| 4710754 | Montean | Dec 1987 | A |
| 4739510 | Jeffers et al. | Apr 1988 | A |
| 4785472 | Shapiro | Nov 1988 | A |
| 4798543 | Spiece | Jan 1989 | A |
| 4804328 | Barrabee | Feb 1989 | A |
| 4863384 | Slade | Sep 1989 | A |
| 4888638 | Bohn | Dec 1989 | A |
| 4967185 | Montean | Oct 1990 | A |
| 4993068 | Piosenka et al. | Feb 1991 | A |
| 5023907 | Johnson et al. | Jun 1991 | A |
| 5109482 | Bohrman | Apr 1992 | A |
| 5128752 | Von Kohorn | Jul 1992 | A |
| 5274758 | Beitel et al. | Dec 1993 | A |
| 5289439 | Koulopoulos et al. | Feb 1994 | A |
| 5305195 | Murphy | Apr 1994 | A |
| 5305197 | Axler et al. | Apr 1994 | A |
| 5347508 | Montbriand et al. | Sep 1994 | A |
| 5353218 | De Lapa et al. | Oct 1994 | A |
| 5400402 | Garfinkle | Mar 1995 | A |
| 5410343 | Coddington et al. | Apr 1995 | A |
| 5413383 | Laurash et al. | May 1995 | A |
| 5420403 | Allum et al. | May 1995 | A |
| 5426629 | Saitou et al. | Jun 1995 | A |
| 5457746 | Dolphin | Oct 1995 | A |
| 5467329 | Hashimoto | Nov 1995 | A |
| 5483658 | Grube et al. | Jan 1996 | A |
| 5509074 | Choudury et al. | Apr 1996 | A |
| 5530686 | Schylander et al. | Jun 1996 | A |
| 5550577 | Verbiest et al. | Aug 1996 | A |
| 5568275 | Norton et al. | Oct 1996 | A |
| 5617502 | Ort et al. | Apr 1997 | A |
| 5619024 | Kolls | Apr 1997 | A |
| 5619733 | Noe et al. | Apr 1997 | A |
| 5633946 | Lachinski et al. | May 1997 | A |
| 5640453 | Schuchman et al. | Jun 1997 | A |
| 5640560 | Smith | Jun 1997 | A |
| 5642171 | Baumgartner et al. | Jun 1997 | A |
| 5651064 | Newell | Jul 1997 | A |
| 5659792 | Walmsley | Aug 1997 | A |
| 5673195 | Schwartz et al. | Sep 1997 | A |
| 5677953 | Dolphin | Oct 1997 | A |
| 5694546 | Reisman | Dec 1997 | A |
| 5696898 | Baker et al. | Dec 1997 | A |
| 5717879 | Moran et al. | Feb 1998 | A |
| 5721827 | Logan et al. | Feb 1998 | A |
| 5729687 | Rothrock et al. | Mar 1998 | A |
| 5734719 | Tsevdos et al. | Mar 1998 | A |
| 5734898 | He | Mar 1998 | A |
| 5736977 | Hughes | Apr 1998 | A |
| 5751672 | Yankowski | May 1998 | A |
| 5774664 | Hidary et al. | Jun 1998 | A |
| 5774666 | Portuesi | Jun 1998 | A |
| RE35839 | Asai et al. | Jul 1998 | E |
| 5778181 | Hidary et al. | Jul 1998 | A |
| 5778187 | Montieiro et al. | Jul 1998 | A |
| 5782692 | Stevlovsky | Jul 1998 | A |
| 5790753 | Krishnamoorthy | Aug 1998 | A |
| 5796393 | McNaughton et al. | Aug 1998 | A |
| 5796952 | Davis et al. | Aug 1998 | A |
| 5801685 | Miller et al. | Sep 1998 | A |
| 5802294 | Ludwig et al. | Sep 1998 | A |
| 5804810 | Woolley et al. | Sep 1998 | A |
| 5805442 | Crater et al. | Sep 1998 | A |
| 5805804 | Laursen et al. | Sep 1998 | A |
| 5808662 | Kinney et al. | Sep 1998 | A |
| 5809250 | Kisor | Sep 1998 | A |
| 5809471 | Brodsky | Sep 1998 | A |
| 5809512 | Kato | Sep 1998 | A |
| 5812661 | Akiyama et al. | Sep 1998 | A |
| 4775935 | Yourick | Oct 1998 | A |
| 5818935 | Maa | Oct 1998 | A |
| 5819284 | Farber | Oct 1998 | A |
| 5822123 | Davis et al. | Oct 1998 | A |
| 5822291 | Brindze et al. | Oct 1998 | A |
| 5825876 | Peterson, Jr. | Oct 1998 | A |
| 5839905 | Redford et al. | Nov 1998 | A |
| 5850218 | LaJolie et al. | Dec 1998 | A |
| 5857021 | Kataoka et al. | Jan 1999 | A |
| 5860068 | Cook | Jan 1999 | A |
| 5869819 | Knowles et al. | Feb 1999 | A |
| 5872747 | Johnson | Feb 1999 | A |
| 5875296 | Shi et al. | Feb 1999 | A |
| 5878020 | Takahashi | Mar 1999 | A |
| 5878233 | Schloss | Mar 1999 | A |
| 5882291 | Bradshaw et al. | Mar 1999 | A |
| 5883623 | Cseri | Mar 1999 | A |
| 5887143 | Saito et al. | Mar 1999 | A |
| 5889980 | Smith, Jr. | Mar 1999 | A |
| 5892825 | Mages et al. | Apr 1999 | A |
| 5892900 | Ginter et al. | Apr 1999 | A |
| 5892908 | Hughes et al. | Apr 1999 | A |
| 5893910 | Martineau et al. | Apr 1999 | A |
| 5895073 | Moore | Apr 1999 | A |
| 5896132 | Berstis et al. | Apr 1999 | A |
| 5899980 | Wilf et al. | May 1999 | A |
| 5907322 | Kelly et al. | May 1999 | A |
| 5907704 | Gudmundson et al. | May 1999 | A |
| 5909551 | Tahara et al. | Jun 1999 | A |
| 5913210 | Call | Jun 1999 | A |
| 5915091 | Ludwig et al. | Jun 1999 | A |
| 5915093 | Berlin et al. | Jun 1999 | A |
| 5915288 | Gabriel | Jun 1999 | A |
| 5920694 | Carleton et al. | Jul 1999 | A |
| 5922045 | Hanson | Jul 1999 | A |
| 5924013 | Guido et al. | Jul 1999 | A |
| 5930238 | Nguyen | Jul 1999 | A |
| 5930767 | Reber et al. | Jul 1999 | A |
| 5931906 | Fidelibus et al. | Aug 1999 | A |
| 5933497 | Beetcher et al. | Aug 1999 | A |
| 5940504 | Griswold | Aug 1999 | A |
| 5943304 | Kamada et al. | Aug 1999 | A |
| 5945988 | Williams et al. | Aug 1999 | A |
| 5950173 | Perkowski | Sep 1999 | A |
| 5953005 | Liu | Sep 1999 | A |
| 5956482 | Agraharam et al. | Sep 1999 | A |
| 5960398 | Fuchigami et al. | Sep 1999 | A |
| 5969898 | Hansen et al. | Oct 1999 | A |
| 5977964 | Williams et al. | Nov 1999 | A |
| 5978773 | Hudetz et al. | Nov 1999 | A |
| 5986690 | Hendricks | Nov 1999 | A |
| 5987454 | Hobbs | Nov 1999 | A |
| 5987525 | Roberts et al. | Nov 1999 | A |
| 5991374 | Hazenfield | Nov 1999 | A |
| 5991399 | Graunke et al. | Nov 1999 | A |
| 5991798 | Ozaki et al. | Nov 1999 | A |
| 5995965 | Experton | Nov 1999 | A |
| 6006328 | Drake | Dec 1999 | A |
| 6009410 | LeMole et al. | Dec 1999 | A |
| 6012071 | Krishna et al. | Jan 2000 | A |
| 6016166 | Huang et al. | Jan 2000 | A |
| 6018768 | Ullman et al. | Jan 2000 | A |
| 6021307 | Chan | Feb 2000 | A |
| 6023241 | Clapper | Feb 2000 | A |
| 6034937 | Kumagai | Mar 2000 | A |
| 6035329 | Mages et al. | Mar 2000 | A |
| 6044403 | Gerszberg et al. | Mar 2000 | A |
| 6047292 | Kelly et al. | Apr 2000 | A |
| 6052717 | Reynolds | Apr 2000 | A |
| 6052785 | Lin et al. | Apr 2000 | A |
| 6055314 | Spies et al. | Apr 2000 | A |
| 6108002 | Ishizaki | Apr 2000 | A |
| 6061057 | Knowlton et al. | May 2000 | A |
| 6064979 | Perkowski | May 2000 | A |
| 6073124 | Krishnan et al. | Jun 2000 | A |
| 6076733 | Wilz, Sr. et al. | Jun 2000 | A |
| 6078348 | Klosterman et al. | Jun 2000 | A |
| 6080207 | Kroening et al. | Jun 2000 | A |
| 6081785 | Oshima et al. | Jun 2000 | A |
| 6083276 | Davidson et al. | Jul 2000 | A |
| 6097291 | Tsai et al. | Aug 2000 | A |
| 6097814 | Mochizuki | Aug 2000 | A |
| 6101180 | Donahue et al. | Aug 2000 | A |
| 6101534 | Rothschild | Aug 2000 | A |
| 6108687 | Craig | Aug 2000 | A |
| 6119147 | Toomey et al. | Sep 2000 | A |
| 6124854 | Sartain et al. | Sep 2000 | A |
| 6125388 | Reisman | Sep 2000 | A |
| 6128434 | Hirayama et al. | Oct 2000 | A |
| 6128649 | Smith et al. | Oct 2000 | A |
| 6128652 | Toh et al. | Oct 2000 | A |
| 6134533 | Shell | Oct 2000 | A |
| 6134593 | Alexander et al. | Oct 2000 | A |
| 6138150 | Nichols et al. | Oct 2000 | A |
| 6141010 | Hoyle | Oct 2000 | A |
| 6145006 | Vishlitsky et al. | Nov 2000 | A |
| 6154738 | Call | Nov 2000 | A |
| 6154773 | Roberts et al. | Nov 2000 | A |
| 6154844 | Touboul et al. | Nov 2000 | A |
| 6157953 | Chang | Dec 2000 | A |
| 6161132 | Roberts et al. | Dec 2000 | A |
| 6175842 | Kirk et al. | Jan 2001 | B1 |
| 6175872 | Neumann et al. | Jan 2001 | B1 |
| 6182222 | Oparaji | Jan 2001 | B1 |
| 6184877 | Dodson et al. | Feb 2001 | B1 |
| 6189032 | Susaki et al. | Feb 2001 | B1 |
| 6192340 | Abecassis | Feb 2001 | B1 |
| 6195693 | Berry et al. | Feb 2001 | B1 |
| 6199048 | Hudetz et al. | Mar 2001 | B1 |
| 6202061 | Khosla et al. | Mar 2001 | B1 |
| 6208805 | Abecassis | Mar 2001 | B1 |
| 6219675 | Pal et al. | Apr 2001 | B1 |
| 6226235 | Wehmeyer | May 2001 | B1 |
| 6229523 | Czako | May 2001 | B1 |
| 6230174 | Berger et al. | May 2001 | B1 |
| 6230324 | Tomita et al. | May 2001 | B1 |
| 6233618 | Shannon | May 2001 | B1 |
| 6233736 | Wolzien | May 2001 | B1 |
| 6239793 | Barnert et al. | May 2001 | B1 |
| 6239801 | Chiu et al. | May 2001 | B1 |
| 6240459 | Roberts et al. | May 2001 | B1 |
| 6240555 | Shoff et al. | May 2001 | B1 |
| 6243692 | Floyd et al. | Jun 2001 | B1 |
| 6246778 | Moore | Jun 2001 | B1 |
| 6259701 | Shur et al. | Jul 2001 | B1 |
| 6263501 | Schein et al. | Jul 2001 | B1 |
| 6263505 | Walker et al. | Jul 2001 | B1 |
| 6282713 | Kitsukawa et al. | Aug 2001 | B1 |
| 6289165 | Abecassis | Sep 2001 | B1 |
| 6298482 | Seidman et al. | Oct 2001 | B1 |
| 6301661 | Shambroom | Oct 2001 | B1 |
| 6308005 | Ando et al. | Oct 2001 | B1 |
| 6321252 | Bhola et al. | Nov 2001 | B1 |
| 6330719 | Zigmond | Dec 2001 | B1 |
| 6331865 | Sachs et al. | Dec 2001 | B1 |
| 6341375 | Watkins | Jan 2002 | B1 |
| 6343314 | Ludwig et al. | Jan 2002 | B1 |
| 6360057 | Tsumagari et al. | Mar 2002 | B1 |
| 6374402 | Schmeidler et al. | Apr 2002 | B1 |
| 6381404 | deCarmo | Apr 2002 | B1 |
| 6388714 | Schein et al. | May 2002 | B1 |
| 6389467 | Eyal | May 2002 | B1 |
| 6389473 | Carmel et al. | May 2002 | B1 |
| 6405203 | Collart | Jun 2002 | B1 |
| 6415438 | Blackketter et al. | Jul 2002 | B1 |
| 6418471 | Shelton et al. | Jul 2002 | B1 |
| 6426778 | Valdez, Jr. | Jul 2002 | B1 |
| 6449653 | Klemets et al. | Sep 2002 | B2 |
| 6452609 | Katinsky et al. | Sep 2002 | B1 |
| 6453420 | Collart | Sep 2002 | B1 |
| 6453459 | Brodersen et al. | Sep 2002 | B1 |
| 6460086 | Swaminathan et al. | Oct 2002 | B1 |
| 6460180 | Park et al. | Oct 2002 | B1 |
| 6462754 | Chakraborty et al. | Oct 2002 | B1 |
| 6463468 | Buch et al. | Oct 2002 | B1 |
| 6486891 | Rice | Nov 2002 | B1 |
| 6499057 | Portuesi | Dec 2002 | B1 |
| 6505160 | Levy et al. | Jan 2003 | B1 |
| 6505169 | Bhagavath et al. | Jan 2003 | B1 |
| 6510467 | Behfar et al. | Jan 2003 | B1 |
| 6516467 | Schindler et al. | Feb 2003 | B1 |
| 6523063 | Miller et al. | Feb 2003 | B1 |
| 6526580 | Shimomura | Feb 2003 | B2 |
| 6529949 | Getsin et al. | Mar 2003 | B1 |
| 6535909 | Rust | Mar 2003 | B1 |
| 6543053 | Li et al. | Apr 2003 | B1 |
| 6564255 | Mobini et al. | May 2003 | B1 |
| 6567980 | Jain et al. | May 2003 | B1 |
| 6573907 | Madrane | Jun 2003 | B1 |
| 6580870 | Kanazawa et al. | Jun 2003 | B1 |
| 6583806 | Ludwig et al. | Jun 2003 | B2 |
| 6591420 | McPherson et al. | Jul 2003 | B1 |
| 6601103 | Goldschmidt et al. | Jul 2003 | B1 |
| 6609253 | Swix et al. | Aug 2003 | B1 |
| 6615408 | Kaiser et al. | Sep 2003 | B1 |
| 6625656 | Goldhor et al. | Sep 2003 | B2 |
| 6636888 | Bookspan et al. | Oct 2003 | B1 |
| 6640337 | Lu | Oct 2003 | B1 |
| 6659861 | Faris et al. | Dec 2003 | B1 |
| 6691106 | Sathyanarayan | Feb 2004 | B1 |
| 6691126 | Syeda-Mahmood | Feb 2004 | B1 |
| 6694309 | Cho et al. | Feb 2004 | B2 |
| 6698020 | Zigmond et al. | Feb 2004 | B1 |
| 6721748 | Knight et al. | Apr 2004 | B1 |
| 6725281 | Zintel et al. | Apr 2004 | B1 |
| 6731239 | Wall et al. | May 2004 | B2 |
| 6732162 | Wood et al. | May 2004 | B1 |
| 6741790 | Burgess | May 2004 | B1 |
| 6760043 | Markel | Jul 2004 | B2 |
| 6769130 | Getsin | Jul 2004 | B1 |
| 6771290 | Hoyle | Aug 2004 | B1 |
| 6803950 | Miyamoto et al. | Oct 2004 | B2 |
| 6865746 | Herrington et al. | Mar 2005 | B1 |
| 6868225 | Brown | Mar 2005 | B1 |
| 6909708 | Krishnaswamy et al. | Jun 2005 | B1 |
| 6941383 | Getsin et al. | Sep 2005 | B1 |
| 6944621 | Collart | Sep 2005 | B1 |
| 6952297 | Rothschild | Oct 2005 | B2 |
| 6952697 | Rothschild | Oct 2005 | B1 |
| 6959339 | Wu et al. | Oct 2005 | B1 |
| 6976229 | Balabanovic et al. | Dec 2005 | B1 |
| 7024497 | Maffezoni | Apr 2006 | B1 |
| 7043693 | Wenzel et al. | May 2006 | B2 |
| 7111009 | Gupta et al. | Sep 2006 | B1 |
| 7136574 | Ando et al. | Nov 2006 | B2 |
| 7165071 | Fanning et al. | Jan 2007 | B2 |
| 7165098 | Boyer et al. | Jan 2007 | B1 |
| 7168012 | Clauss | Jan 2007 | B2 |
| 7171480 | Chatani | Jan 2007 | B2 |
| 7281199 | Nicol et al. | Oct 2007 | B1 |
| 7412482 | Ludwig et al. | Aug 2008 | B2 |
| 20010001160 | Shoff | May 2001 | A1 |
| 20010005903 | Goldschmidt Iki et al. | Jun 2001 | A1 |
| 20010051037 | Safadi et al. | Dec 2001 | A1 |
| 20010056434 | Kaplan et al. | Dec 2001 | A1 |
| 20010056478 | Wheeler et al. | Dec 2001 | A1 |
| 20020026321 | Faris et al. | Feb 2002 | A1 |
| 20020049978 | Rodriguez et al. | Apr 2002 | A1 |
| 20020053078 | Holtz et al. | May 2002 | A1 |
| 20020056129 | Blackketter et al. | May 2002 | A1 |
| 20020057893 | Wood et al. | May 2002 | A1 |
| 20020059342 | Gupta et al. | May 2002 | A1 |
| 20020064149 | Elliott et al. | May 2002 | A1 |
| 20020073152 | Andrew et al. | Jun 2002 | A1 |
| 20020078144 | Lamkin et al. | Jun 2002 | A1 |
| 20020083377 | Clauss et al. | Jun 2002 | A1 |
| 20020088011 | Lamkin et al. | Jul 2002 | A1 |
| 20020103855 | Chatani | Aug 2002 | A1 |
| 20020136406 | Fitzhardinge et al. | Sep 2002 | A1 |
| 20020143774 | Vandersluis | Oct 2002 | A1 |
| 20020161578 | Saindon et al. | Oct 2002 | A1 |
| 20020184627 | Alba et al. | Dec 2002 | A1 |
| 20020184637 | Perlman | Dec 2002 | A1 |
| 20030005461 | Shinohara | Jan 2003 | A1 |
| 20030028892 | Gewickey et al. | Feb 2003 | A1 |
| 20030101232 | Ullman et al. | May 2003 | A1 |
| 20030191697 | Stolski | Oct 2003 | A1 |
| 20030204847 | Ellis et al. | Oct 2003 | A1 |
| 20040010510 | Hotti | Jan 2004 | A1 |
| 20040017475 | Akers et al. | Jan 2004 | A1 |
| 20040024818 | Yoon et al. | Feb 2004 | A1 |
| 20040024889 | Getsin et al. | Feb 2004 | A1 |
| 20040040042 | Feinleib | Feb 2004 | A1 |
| 20040114042 | Paolini et al. | Jun 2004 | A1 |
| 20040139077 | Banker | Jul 2004 | A1 |
| 20040215755 | Oneill | Oct 2004 | A1 |
| 20040220791 | Lamkin | Nov 2004 | A1 |
| 20040220926 | Lamkin | Nov 2004 | A1 |
| 20040255236 | Getsin | Dec 2004 | A1 |
| 20050041150 | Gewickey | Feb 2005 | A1 |
| 20050044481 | Collart | Feb 2005 | A1 |
| 20050050208 | Chatani | Mar 2005 | A1 |
| 20050154682 | Taylor | Jul 2005 | A1 |
| 20050166232 | Lamkin et al. | Jul 2005 | A1 |
| 20050182828 | Lamkin | Aug 2005 | A1 |
| 20050193322 | Lamkin | Sep 2005 | A1 |
| 20050198574 | Lamkin | Sep 2005 | A1 |
| 20050223013 | Jarman | Oct 2005 | A1 |
| 20050240588 | Siegel et al. | Oct 2005 | A1 |
| 20050251732 | Lamkin | Nov 2005 | A1 |
| 20050251749 | Lamkin | Nov 2005 | A1 |
| 20050265701 | Lamkin et al. | Dec 2005 | A1 |
| 20050278435 | Lamkin et al. | Dec 2005 | A1 |
| 20050278729 | Lamkin et al. | Dec 2005 | A1 |
| 20060004778 | Lamkin et al. | Jan 2006 | A1 |
| 20060041639 | Lamkin | Feb 2006 | A1 |
| 20060041640 | Lamkin | Feb 2006 | A1 |
| 20060107215 | Gewickey | May 2006 | A1 |
| 20060112336 | Gewickey | May 2006 | A1 |
| 20060117344 | Lamkin | Jun 2006 | A1 |
| 20060159109 | Lamkin | Jul 2006 | A1 |
| 20060159431 | Ando et al. | Jul 2006 | A1 |
| 20060161635 | Lamkin | Jul 2006 | A1 |
| 20060181965 | Collart | Aug 2006 | A1 |
| 20060182424 | Lamkin et al. | Aug 2006 | A1 |
| 20060184538 | Randall | Aug 2006 | A1 |
| 20060193606 | Lamkin | Aug 2006 | A1 |
| 20060195600 | Getsin | Aug 2006 | A1 |
| 20070094583 | Randall | Apr 2007 | A1 |
| Number | Date | Country |
|---|---|---|
| 42 42 992 | Jun 1994 | DE |
| 194143 | Sep 1986 | EP |
| 0 372 716 | Jun 1990 | EP |
| 0 762 422 | Mar 1997 | EP |
| 0 802 527 | Oct 1997 | EP |
| 0 809 244 | Nov 1997 | EP |
| 0 814 419 | Dec 1997 | EP |
| 0 849 734 | Jun 1998 | EP |
| 0 853 315 | Jul 1998 | EP |
| 0 809 244 | Dec 1998 | EP |
| 0 849 734 | Mar 1999 | EP |
| 0 853 315 | Dec 1999 | EP |
| 10063562 | Mar 1998 | JP |
| 11039262 | Feb 1999 | JP |
| 2000236531 | Aug 2000 | JP |
| WO-9705616 | Feb 1997 | WO |
| WO 9847080 | Oct 1998 | WO |
| WO 9858368 | Dec 1998 | WO |
| WO 9914678 | Mar 1999 | WO |
| WO 9951031 | Oct 1999 | WO |
| WO 0002385 | Jan 2000 | WO |
| WO 0008855 | Feb 2000 | WO |
| WO 0016229 | Mar 2000 | WO |
| WO 0018054 | Mar 2000 | WO |
| WO 0024192 | Apr 2000 | WO |
| Number | Date | Country | |
|---|---|---|---|
| 20040255236 A1 | Dec 2004 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 09476190 | Jan 2000 | US |
| Child | 10877644 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 09296098 | Apr 1999 | US |
| Child | 09476190 | US |
