Method and device for monitoring and analyzing signals

Abstract
A method and system for monitoring and analyzing at least one signal are disclosed. An abstract of at least one reference signal is generated and stored in a reference database. An abstract of a query signal to be analyzed is then generated so that the abstract of the query signal can be compared to the abstracts stored in the reference database for a match. The method and system may optionally be used to record information about the query signals, the number of matches recorded, and other useful information about the query signals. Moreover, the method by which abstracts are generated can be programmable based upon selectable criteria. The system can also be programmed with error control software so as to avoid the re-occurrence of a query signal that matches more than one signal stored in the reference database.
Description
BACKGROUND OF THE INVENTION

1. Field of the Invention


The invention relates to the monitoring and analysis of digital information. A method and device are described which relate to signal recognition to enhance identification and monitoring activities.


2. Description of the Related Art


Many methods and protocols are known for transmitting data in digital form for multimedia applications (including computer applications delivered over public networks such as the internet or World Wide Web (“WWW”). These methods may include protocols for the compression of data, such that it may more readily and quickly be delivered over limited bandwidth data lines. Among standard protocols for data compression of digital files may be mentioned the MPEG compression standards for audio and video digital compression, promulgated by the Moving Picture Experts Group. Numerous standard reference works and patents discuss such compression and transmission standards for digitized information.


Digital watermarks help to authenticate the content of digitized multimedia information, and can also discourage piracy. Because piracy is clearly a disincentive to the digital distribution of copyrighted content, 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 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 into the content in such a manner that the content must undergo damage, and therefore reduction of its value, with subsequent, unauthorized distribution, commercial or otherwise. Digital watermarks address many of these concerns. A general discussion of digital watermarking as it has been applied in the art may be found in U.S. Pat. No. 5,687,236 (whose specification is incorporated in whole herein by reference).


Further applications of basic digital watermarking functionality have also been developed. Examples of such applications are shown in U.S. Pat. No. 5,889,868 (whose specification is incorporated in whole herein by reference). Such applications have been drawn, for instance, to implementations of digital watermarks that were deemed most suited to particular transmissions, or particular distribution and storage mediums, given the nature of digitally sampled audio, video, and other multimedia works. There have also been developed techniques for adapting watermark application parameters to the individual characteristics of a given digital sample stream, and for implementation of digital watermarks that are feature-based-i.e., a system in which watermark information is not carried in individual samples, but is carried in the relationships between multiple samples, such as in a waveform shape. For instance, natural extensions may be added to digital watermarks that may also separate frequencies (color or audio), channels in 3D while utilizing discreteness in feature-based encoding only known to those with pseudo-random keys (i.e., cryptographic keys) or possibly tools to access such information, which may one day exist on a quantum level.


A matter of general weakness in digital watermark technology relates directly to the manner of implementation of the watermark. Many approaches to digital watermarking leave detection and decode control with the implementing party of the digital watermark, not the creator of the work to be protected. This weakness removes proper economic incentives for improvement of the technology. One specific form of exploitation mostly regards efforts to obscure subsequent watermark detection. Others regard successful over encoding using the same watermarking process at a subsequent time. Yet another way to perform secure digital watermark implementation is through “key-based” approaches.


SUMMARY OF THE INVENTION

A method for monitoring and analyzing at least one signal is disclosed, which method comprises the steps of: receiving at least one reference signal to be monitored; creating an abstract of the at least one reference signal; storing the abstract of the at least one reference signal in a reference database; receiving at least one query signal to be analyzed; creating an abstract of the at least one query signal; and comparing the abstract of the at least one query signal to the abstract of the at least one reference signal to determine if the abstract of the at least one query signal matches the abstract of the at least one reference signal.


A method for monitoring a plurality of reference signals is also disclosed, which method comprises the steps of: creating an abstract for each one of a plurality of reference signals; storing each of the abstracts in a reference database; receiving at least one query signal to be analyzed; creating an abstract of each at least one query signal; locating an abstract in the reference database that matches the abstract of each at least one query signal; and recording the identify of the reference signal whose abstract matched the abstract of each at least one query signal.


A computerized system for monitoring and analyzing at least one signal is also disclosed, which system comprises: a processor for creating an abstract of a signal using selectable criteria; a first input for receiving at least one reference signal to be monitored, the first input being coupled to the processor such that the processor may generate an abstract for each reference signal input to the processor; a reference database, coupled to the processor, for storing abstracts of each at least one reference signal; a second input for receiving at least one query signal to be analyzed, the second input being coupled to the processor such that the processor may generate an abstract for each query signal; and a comparing device, coupled to the reference database and to the second input, for comparing an abstract of the at least one query signal to the abstracts stored in the reference database to determine if the abstract of the at least one query signal matches any of the stored abstracts.


Further, an electronic system for monitoring and analyzing at least one signal is disclosed which system comprises: a first input for receiving at least one reference signal to be monitored, a first processor for creating an abstract of each reference signal input to the first processor through the first input; a second input for receiving at least one query signal to be analyzed, a second processor for creating an abstract of each query signal; a reference database for storing abstracts of each at least one reference signal; and a comparing device for comparing an abstract of the at least one query signal to the abstracts stored in the reference database to determine if the abstract of the at least one query signal matches any of the stored abstracts.







DETAILED DESCRIPTION OF THE INVENTION

While there are many approaches to data reduction that can be utilized, a primary concern is the ability to reduce the digital signal in such a manner as to retain a “perceptual relationship” between the original signal and its data reduced version. This relationship may either be mathematically discernible or a result of market-dictated needs. The purpose is to afford a more consistent means for classifying signals than proprietary, related text-based approaches. A simple analogy is the way in which a forensic investigator uses a sketch artist to assist in determining the identity of a human.


In one embodiment of the invention, the abstract of a signal may be generated by the following steps: 1) analyze the characteristics of each signal in a group of audible/perceptible variations for the same signal (e.g., analyze each of five versions of the same song-which versions may have the same lyrics and music but which are sung by different artists); and 2) select those characteristics which achieve or remain relatively constant (or in other words, which have minimum variation) for each of the signals in the group. Optionally, the null case may be defined using those characteristics which are common to each member of the group of versions.


Lossless and lossy compression schemes are appropriate candidates for data reduction technologies, as are those subset of approaches that are based on perceptual models, such as AAC, MP3, TwinVQ, JPEG, GIF, MPEG, etc. Where spectral transforms fail to assist in greater data reduction of the signal, other signal characteristics can be identified as candidates for further data reduction. Linear predictive coding (LPC), z-transform analysis, root mean square (rms), signal to peak, may be appropriate tools to measure signal characteristics, but other approaches or combinations of signal characteristic analysis are contemplated. While such signal characteristics may assist in determining particular applications of the present invention, a generalized approach to signal recognition is necessary to optimize the deployment and use of the present invention.


Increasingly, valuable information is being created and stored in digital form. For example, music, photographs and motion pictures can all be stored and transmitted as a series of binary digits—1's and 0's. Digital techniques permit the original information to be duplicated repeatedly with perfect or near perfect accuracy, and each copy is perceived by viewers or listeners as indistinguishable from the original signal. Unfortunately, digital techniques also permit the information to be easily copied without the owner's permission. While digital representations of analog waveforms may be analyzed by perceptually-based or perceptually-limited analysis it is usually costly and time-consuming to model the processes of the highly effective ability of humans to identify and recognize a signal. In those applications where analog signals require analysis, the cost of digitizing the analog signal is minimal when compared to the benefits of increased accuracy and speed of signal analysis and monitoring when the processes contemplated by this invention are utilized.


The present invention relates to identification of digitally-sampled information, such as images, audio and video. Traditional methods of identification and monitoring of those signals do not rely on “perceptual quality,” but rather upon a separate and additional signal. Within this application, such signals will be called “additive signals” as they provide information about the original images, audio or video, but such information is in addition to the original signal. One traditional, text-based additive signal is title and author information. The title and author, for example, is information about a book, but it is in addition to the text of the book. If a book is being duplicated digitally, the title and author could provide one means of monitoring the number of times the text is being duplicated, for example, through an Internet download. The present invention, however, is directed to the identification of a digital signal—whether text, audio, or video—using only the digital signal itself and then monitoring the number of times the signal is duplicated. Reliance on an additive signal has many shortcomings. For example, first, someone must incorporate the additive signal within the digital data being transmitted, for example, by concatenation or through an embedding process. Such an additive signal, however, can be easily identified and removed by one who wants to utilize the original signal without paying for its usage. If the original signal itself is used to identify the content, an unauthorized user could not avoid payment of a royalty simply by removing the additive signal—because there is no additive signal to remove. Hence, the present invention avoids a major disadvantage of the prior art.


One such additive signal that may be utilized is a digital watermark—which ideally cannot be removed without perceptually altering the original signal.A watermark may also be used as a monitoring signal (for example, by encoding an identifier that uniquely identifies the original digital signal into which the identifier is being embedded). A digital watermark used for monitoring is also an additive signal, and such a signal may make it difficult for the user who wants to duplicate a signal without paying a royalty—mainly by degrading the perceptual quality of the original signal if the watermark (and hence the additive monitoring signal) is removed. This is, however, is a different solution to the problem.


The present invention eliminates the need of any additive monitoring signal because the present invention utilizes the underlying content signal as the identifier itself. Nevertheless, the watermark may increase the value of monitoring techniques by increasing the integrity of the embedded data and by indicating tampering of either the original content signal or the monitoring signal. Moreover, the design of a watermarking embedding algorithm is closely related to the perceptibility of noise in any given signal and can represent an ideal subset of the original signal: the watermark bits are an inverse of the signal to the extent that lossy compression schemes, which can be used, for instance, to optimize a watermarking embedding scheme, can yield information about the extent to which a data signal can be compressed while holding steadfast to the design requirement that the compressed signal maintain its perceptual relationship with the original, uncompressed signal. By describing those bits that are candidates for imperceptible embedding of watermark bits, further data reduction may be applied on the candidate watermarks as an example of retaining a logical and perceptible relationship with the original uncompressed signal.


Of course, the present invention may be used in conjunction with watermarking technology (including the use of keys to accomplish secure digital watermarking), but watermarking is not necessary to practice the present invention. Keys for watermarking may have many forms, including: descriptions of the original carrier file formatting, mapping of embedded data (actually imperceptible changes made to the carrier signal and referenced to the predetermined key or key pairs), assisting in establishing the watermark message data integrity (by incorporation of special one way functions in the watermark message data or key), etc. Discussions of these systems in the patents and pending patent applications are incorporated by reference above. The “recognition” of a particular signal or an instance of its transmission, and its monitoring are operations that may be optimized through the use of digital watermark analysis.


A practical difference between the two approaches of using a separate, additive monitoring signal and using the original signal itself as the monitoring signal is control. If a separate signal is used for monitoring, then the originator of the text, audio or video signal being transmitted and the entity doing the monitoring have to agree as to the nature of the separate signal to be used for monitoring—otherwise, the entity doing the monitoring would not know where to look, for what to look, or how to interpret the monitoring signal once it was identified and detected. On the other hand, if the original signal is used itself as a monitoring signal, then no such agreement is necessary. Moreover, a more logical and self-sufficient relationship between the original and its data-reduced abstract enhances the transparency of any resulting monitoring efforts. The entity doing the monitoring is not looking for a separate, additive monitoring system, and further, need not have to interpret the content of the monitoring signal.


Monitoring implementations can be handled by robust watermark techniques (those techniques that are able to survive many signal manipulations but are not inherently “secure” for verification of a carrier signal absent a logically-related watermarking key) and forensic watermark techniques (which enable embedding of watermarks that are not able to survive perceptible alteration of the carrier signal and thus enable detection of tampering with the originally watermarked carrier signal). The techniques have obvious trade-offs between speed, performance and security of the embedded watermark data.


In other disclosures, we suggest improvements and implementations that relate to digital watermarks in particular and embedded signaling in general. A digital watermark may be used to “tag” content in a manner that is not humanly-perceptible, in order to ensure that the human perception of the signal quality is maintained. Watermarking, however, must inherently alter at least one data bit of the original signal to represent a minimal change from the original signal's “unwatermarked state.” The changes may affect only a bit, at the very least, or be dependent on information hiding relating to signal characteristics, such as phase information, differences between digitized samples, root mean square (RMS) calculations, z-transform analysis, or similar signal characteristic category.


There are weaknesses in using digital watermark technology for monitoring purposes. One weakness relates directly to the way in which watermarks are implemented. Often, the persons responsible for encoding and decoding the digital watermark are not the creator of the valuable work to be protected. As such, the creator has no input on the placement of the monitoring signal within the valuable work being protected. Hence, if a user wishing to avoid payment of the royalty can find a way to decode or remove the watermark, or at least the monitoring signal embedded in the watermark, then the unauthorized user may successfully duplicate the signal with impunity. This could occur, for example, if either of the persons responsible for encoding or decoding were to have their security compromised such that the encoding or decoding algorithms were discovered by the unauthorized user.


With the present invention, no such disadvantages exist because the creator need not rely on anyone to insert a monitoring signal—as no such signal is necessary. Instead, the creator's work itself is used as the monitoring signal. Accordingly, the value in the signal will have a strong relationship with its recognizability.


By way of improving methods for efficient monitoring as well as effective confirmation of the identity of a digitally-sampled signal, the present invention describes useful methods for using digital signal processing for benchmarking a novel basis for differencing signals with binary data comparisons. These techniques may be complemented with perceptual techniques, but are intended to leverage the generally decreasing cost of bandwidth and signal processing power in an age of increasing availability and exchange of digitized binary data.


So long as there exist computationally inexpensive ways of identifying an entire signal with some fractional representation or relationship with the original signal, or its perceptually observable representation, we envision methods for faster and more accurate auditing of signals as they are played, distributed or otherwise shared amongst providers (transmitters) and consumers (receivers). The ability to massively compress a signal to its essence—which is not strictly equivalent to “lossy” or “lossless” compression schemes or perceptual coding techniques, but designed to preserve some underlying “aesthetic quality” of the signal—represents a useful means for signal analysis in a wide variety of applications. The signal analysis, however, must maintain the ability to distinguish the perceptual quality of the signals being compared. For example, a method which analyzed a portion of a song by compressing it to a single line of lyrics fails to maintain the ability to distinguish the perceptual quality of the songs being compared. Specifically, for example, if the song “New York State of Mind” were compressed to the lyrics “I'm in a New York State of Mind,” such a compression fails to maintain the ability to distinguish between the various recorded versions of the song, say, for example between Billy Joel's recording and Barbara Streisand's recording. Such a method is, therefore, incapable of providing accurate monitoring of the artist's recordings because it could not determine which of the two artists is deserving of a royalty—unless of course, there is a separate monitoring signal to provide the name of the artist or other information sufficient to distinguish the two versions. The present invention, however, aims to maintain some level of perceptual quality of the signals being compared and would deem such a compression to be excessive.


This analogy can be made clearer if it is understood that there are a large number of approaches to compressing a signal to, say, 1/10,000th of its original size, not for maintaining its signal quality to ensure computational ease for commercial quality distribution, but to assist in identification, analysis or monitoring of the signal. Most compression is either lossy or lossless and is designed with psychoacoustic or psychovisual parameters. That is to say, the signal is compressed to retain what is “humanly-perceptible.” As long as the compression successfully mimics human perception, data space may be saved when the compressed file is compared to the uncompressed or original file. While psychoacoustic and psychovisual compression has some relevance to the present invention, additional data reduction or massive compression is anticipated by the present invention. It is anticipated that the original signal may be compressed to create a realistic or self-similar representation of the original signal, so that the compressed signal can be referenced at a subsequent time as unique binary data that has computational relevance to the original signal. Depending on the application, general data reduction of the original signal can be as simple as massive compression or may relate to the watermark encoding envelope parameter (those bits which a watermarking encoding algorithm deem as candidate bits for mapping independent data or those bits deemed imperceptible to human senses but detectable to a watermark detection algorithm). In this manner, certain media which are commonly known by signal characteristics, a painting, a song, a TV commercial, a dialect, etc., may be analyzed more accurately, and perhaps, more efficiently than a text-based descriptor of the signal. So long as the sender and receiver agree that the data representation is accurate, even insofar as the data-reduction technique has logical relationships with the perceptibility of the original signal, as they must with commonly agreed to text descriptors, no independent cataloging is necessary.


The present invention generally contemplates a signal recognition system that has at least five elements. The actual number of elements may vary depending on the number of domains in which a signal resides (for example, audio is at least one domain while visual carriers are at least two dimensional). The present invention contemplates that the number of elements will be sufficient to effectively and efficiently meet the demands of various classes of signal recognition. The design of the signal recognition that may be used with data reduction is better understood in the context of the general requirements of a pattern or signal recognition system.


The first element is the reference database, which contains information about a plurality of potential signals that will be monitored. In one form, the reference database would contain digital copies of original works of art as they are recorded by the various artists, for example, contain digital copies of all songs that will be played by a particular radio station. In another form, the reference database would contain not perfect digital copies of original works of art, but digital copies of abstracted works of art, for example, contain digital copies of all songs that have been preprocessed such that the copies represent the perceptual characteristics of the original songs. In another form, the reference database would contain digital copies of processed data files, which files represent works of art that have been preprocessed in such a fashion as to identify those perceptual differences that can differentiate one version of a work of art from another version of the same work of art, such as two or more versions of the same song, but by different artists. These examples have obvious application to visually communicated works such as images, trademarks or photographs, and video as well.


The second element is the object locator, which is able to segment a portion of a signal being monitored for analysis (i.e., the “monitored signal”). The segmented portion is also referred to as an “object.” As such, the signal being monitored may be thought of comprising a set of objects. A song recording, for example, can be thought of as having a multitude of objects. The objects need not be of uniform length, size, or content, but merely be a sample of the signal being monitored. Visually communicated informational signals have related objects; color and size are examples.


The third element is the feature selector, which is able to analyze a selected object and identify perceptual features of the object that can be used to uniquely describe the selected object. Ideally, the feature selector can identify all, or nearly all, of the perceptual qualities of the object that differentiate it from a similarly selected object of other signals. Simply, a feature selector has a direct relationship with the perceptibility of features commonly observed. Counterfeiting is an activity which specifically seeks out features to misrepresent the authenticity of any given object. Highly granular, and arguably successful, counterfeiting is typically sought for objects that are easily recognizable and valuable, for example, currency, stamps, and trademarked or copyrighted works and objects that have value to a body politic.


The fourth element is the comparing device which is able to compare the selected object using the features selected by the feature selector to the plurality of signals in the reference database to identify which of the signals matches the monitored signal. Depending upon how the information of the plurality of signals is stored in the reference database and depending upon the available computational capacity (e.g., speed and efficiency), the exact nature of the comparison will vary. For example, the comparing device may compare the selected object directly to the signal information stored in the database. Alternatively, the comparing device may need to process the signal information stored in the database using input from the feature selector and then compare the selected object to the processed signal information. Alternatively, the comparing device may need to process the selected object using input from the feature selector and then compare the processed selected object to the signal information. Alternatively, the comparing device may need to process the signal information stored in the database using input from the feature selector, process the selected object using input from the feature selector, and then compare the processed selected object to the processed signal information.


The fifth element is the recorder which records information about the number of times a given signal is analyzed and detected. The recorder may comprise a database which keeps track of the number of times a song, image, or a movie has been played, or may generate a serial output which can be subsequently processed to determine the total number of times various signals have been detected.


Other elements may be added to the system or incorporated into the five elements identified above. For example, an error handler may be incorporated into the comparing device. If the comparing device identifies multiple signals which appear to contain the object being sought for analysis or monitoring, the error handler may offer further processing in order to identify additional qualities or features in the selected object such that only one of the set of captured signals is found to contain the further analyzed selected object that actually conforms with the object thought to have been transmitted or distributed.


Moreover, one or more of the five identified elements may be implemented with software that runs on the same processor, or which uses multiple processors. In addition, the elements may incorporate dynamic approaches that utilize stochastic, heuristic, or experience-based adjustments to refine the signal analysis being conducted within the system, including, for example, the signal analyses being performed within the feature selector and the comparing device. This additional analyses may be viewed as filters that are designed to meet the expectations of accuracy or speed for any intended application.


Since maintenance of original signal quality is not required by the present invention, increased efficiencies in processing and identification of signals can be achieved. The present invention concerns itself with perceptible relationships only to the extent that efficiencies can be achieved both in accuracy and speed with enabling logical relationships between an original signal and its abstract.


The challenge is to maximize the ability to sufficiently compress a signal to both retain its relationship with the original signal while reducing the data overhead to enable more efficient analysis, archiving and monitoring of these signals. In some cases, data reduction alone will not suffice: the sender and receiver must agree to the accuracy of the recognition. In other cases, agreement will actually depend on a third party who authored or created the signal in question. A digitized signal may have parameters to assist in establishing more accurate identification, for example, a “signal abstract” which naturally, or by agreement with the creator, the copyright owner or other interested parties, can be used to describe the original signal. By utilizing less than the original signal, a computationally inexpensive means of identification can be used. As long as a realistic set of conditions can be arrived at governing the relationship between a signal and its data reduced abstract, increases in effective monitoring and transparency of information data flow across communications channels is likely to result. This feature is significant in that it represents an improvement over how a digitally-sampled signal can be cataloged and identified, though the use of a means that is specifically selected based upon the strengths of a general computing device and the economic needs of a particular market for the digitized information data being monitored. The additional benefit is a more open means to uniformly catalog, analyze, and monitor signals. As well, such benefits can exist for third parties, who have a significant interest in the signal but are not the sender or receiver of said information.


As a general improvement over the art, the present invention incorporates what could best be described as “computer-acoustic” and “computer-visual” modeling, where the signal abstracts are created using data reduction techniques to determine the smallest amount of data, at least a single bit, which can represent and differentiate two digitized signal representations for a given predefined signal set. Each of such representations must have at least a one bit difference with all other members of the database to differentiate each such representation from the others in the database. The predefined signal set is the object being analyzed. The signal identifier/detector should receive its parameters from a database engine. The engine will identify those characteristics (for example, the differences) that can be used to distinguish one digital signal from all other digital signals that are stored in its collection. For those digital signals or objects which are seemingly identical, except that the signal may have different performance or utilization in the newly created object, benefits over additive or text-based identifiers are achieved. Additionally, decisions regarding the success or failure of an accurate detection of any given object may be flexibly implemented or changed to reflect market-based demands of the engine. Appropriate examples are songs or works or art which have been sampled or re-produced by others who are not the original creator.


In some cases, the engine will also consider the NULL case for a generalized item not in its database, or perhaps in situations where data objects may have collisions. For some applications, the NULL case is not necessary, thus making the whole system faster. For instance, databases which have fewer repetitions of objects or those systems which are intended to recognize signals with time constraints or capture all data objects. Greater efficiency in processing a relational database can be obtained because the rules for comparison are selected for the maximum efficiency of the processing hardware and/or software, whether or not the processing is based on psychoacoustic or psychovisual models. The benefits of massive data reduction, flexibility in constructing appropriate signal recognition protocols and incorporation of cryptographic techniques to further add accuracy and confidence in the system are clearly improvements over the art. For example, where the data reduced abstract needs to have further uniqueness, a hash or signature may be required. And for objects which have further uniqueness requirements, two identical instances of the object could be made unique with cryptographic techniques.


Accuracy in processing and identification may be increased by using one or more of the following fidelity evaluation functions:


1) RMS (root mean square). For example, a RMS function may be used to assist in determining the distance between data based on mathematically determinable Euclidean distance between the beginning and end data points (bits) of a particular signal carrier.


2) Frequency weighted RMS. For example, different weights may be applied to different frequency components of the carrier signal before using RMS. This selective weighting can assist in further distinguishing the distance between beginning and end points of the signal carrier (at a given point in time, described as bandwidth, or the number of total bits that can be transmitted per second) and may be considered to be the mathematical equivalent of passing a carrier signal difference through a data filter and figuring the average power in the output carrier.


3) Absolute error criteria, including particularly the NULL set (described above) The NULL may be utilized in two significant cases: First, in instances where the recognized signal appears to be an identified object which is inaccurately attributed or identified to an object not handled by the database of objects; and second, where a collision of data occurs. For instance, if an artist releases a second performance of a previously recorded song, and the two performances are so similar that their differences are almost imperceptible, then the previously selected criteria may not be able to differentiate the two recordings. Hence, the database must be “recalibrated” to be able to differentiate these two versions. Similarly, if the system identifies not one, but two or more, matches for a particular search, then the database may need “recalibration” to further differentiate the two objects stored in the database.


4) Cognitive Identification. For example, the present invention may use an experience-based analysis within a recognition engine. Once such analysis may involve mathematically determining a spectral transform or its equivalent of the carrier signal. A spectral transform enables signal processing and should maintain, for certain applications, some cognitive or perceptual relationship with the original analog waveform. As a novel feature to the present invention, additional classes may be subject to humanly-perceptible observation. For instance, an experience-based criteria which relates particularly to the envisioned or perceived accuracy of the data information object as it is used or applied in a particular market, product, or implementation. This may include a short 3 second segment of a commercially available and recognizable song which is used for commercials to enable recognition of the good or service being marketed. The complete song is marketed as a separately valued object from the use of a discrete segment of the song (that may be used for promotion or marketing-for the complete song or for an entirely different good or service). To the extent that an owner of the song in question is able to further enable value through the licensing or agreement for use of a segment of the original signal, cognitive identification is a form of filtering to enable differentiations between different and intended uses of the same or subset of the same signal (object). The implementation relating specifically, as disclosed herein, to the predetermined identification or recognition means and/or any specified relationship with subsequent use of the identification means can be used to create a history as to how often a particular signal is misidentified, which history can then be used to optimize identification of that signal in the future. The difference between use of an excerpt of the song to promote a separate and distinct good or service and use of the excerpt to promote recognition of the song itself (for example, by the artist to sell copies of the song) relates informationally to a decision based on recognized and approved use of the song. Both the song and applications of the song in its entirety or as a subset are typically based on agreement by the creator and the sender who seeks to utilize the work. Trust in the means for identification, which can be weighted in the present invention (for example, by adjusting bit-addressable information), is an important factor in adjusting the monitoring or recognition features of the object or carrier signal, and by using any misidentification information, (including any experience-based or heuristic information), additional features of the monitored signal can be used to improve the performance of the monitoring system envisioned herein. The issue of central concern with cognitive identification is a greater understanding of the parameters by which any given object is to be analyzed. To the extent that a creator chooses varying and separate application of his object, those applications having a cognitive difference in a signal recognition sense (e.g., the whole or an excerpt), the system contemplated herein includes rules for governing the application of bit-addressable information to increase the accuracy of the database.


5) Finally, the predetermined parameters that are associated with a discrete case for any given object will have a significant impact upon the ability to accurately process and identify the signals. For example, if a song is transmitted over a FM carrier, then one skilled in the art will appreciate that the FM signal has a predetermined bandwidth which is different from the bandwidth of the original recording, and different even from song when played on an AM carrier, and different yet from a song played using an 8-bit Internet broadcast. Recognition of these differences, however, will permit the selection of an identification means which can be optimized for monitoring a FM broadcasted signal. In other words, the discreteness intended by the sender is limited and directed by the fidelity of the transmission means. Objects may be cataloged and assessing with the understanding that all monitoring will occur using a specific transmission fidelity. For example, a database may be optimized with the understanding that only AM broadcast signals will be monitored. For maximum efficiency, different data bases may be created for different transmission channels, e.g., AM broadcasts, FM broadcasts, Internet broadcasts, etc.


For more information on increasing efficiencies for information systems, see The Mathematical Theory of Communication (1948), by Shannon.


Because bandwidth (which in the digital domain is equated to the total number of bits that can be transmitted in a fixed period of time) is a limited resource which places limitations upon transmission capacity and information coding schemes, the importance of monitoring for information objects transmitted over any given channel must take into consideration the nature and utilization of a given channel. The supply and demand of bandwidth will have a dramatic impact on the transmission, and ultimately, upon the decision to monitor and recognize signals. A discussion of this is found in a co-pending application by the inventor under U.S. patent application Ser. No. 08/674,726 “Exchange Mechanisms for Digital Information Packages with Bandwidth Securitization, Multichannel Digital Watermarks, and Key Management” (which application is incorporated herein by reference as if fully setforth herein).


If a filter is to be used in connection with the recognition or monitoring engine, it may be desirable for the filter to anticipate and take into consideration the following factors, which affect the economics of the transmission as they relate to triggers for payment and/or relate to events requiring audits of the objects which are being transmitted: 1) time of transmission (i.e., the point in time when the transmission occurred), including whether the transmission is of a live performance); 2) location of transmission (e.g., what channel was used for transmission, which usually determines the associated cost for usage of the transmission channel); 3) the point of origination of the transmission (which may be the same for a signal carrier over many distinct channels); and 4) pre-existence of the information carrier signal (pre-recorded or newly created information carrier signal, which may require differentiation in certain markets or instances).


In the case of predetermined carrier signals (those which have been recorded and stored for subsequent use), “positional information carrier signals” are contemplated by this invention, namely, perceptual differences between the seemingly “same” information carrier that can be recognized as consumers of information seek different versions or quality levels of the same carrier signal. Perceptual differences exist between a song and its reproduction from a CD, an AM radio, and an Internet broadcast. To the extent that the creator or consumer of the signal can define a difference in any of the four criteria above, means can be derived (and programmed for selectability) to recognize and distinguish these differences. It is, however, quite possible that the ability to monitor carrier signal transmission with these factors will increase the variety and richness of available carrier signals to existing communications channels. The differentiation between an absolute case for transmission of an object, which is a time dependent event, for instance a live or real time broadcast, versus the relative case, which is prerecorded or stored for transmission at a later point in time, creates recognizable differences for signal monitoring.


The monitoring and analysis contemplated by this invention may have a variety of purposes, including, for example, the following: to determine the number of times a song is broadcast on a particular radio broadcast or Internet site; to control security though a voice-activated security system; and to identify associations between a beginner's drawing and those of great artists (for example to draw comparisons between technique, compositions, or color schemes). None of these examples could be achieved with any significant degree of accuracy using a text-based analysis. Additionally, strictly text-based systems fail to fully capture the inherent value of the data recognition or monitoring information itself.


SAMPLE EMBODIMENTS
Sample Embodiment 1

A database of audio signals (e.g., songs) is stored or maintained by a radio station or Internet streaming company, who may select a subset of the songs are stored so that the subset may be later broadcast to listeners. The subset, for example, may comprise a sufficient number of songs to fill 24 hours of music programming (between 300 or 500 songs). Traditionally, monitoring is accomplished by embedding some identifier into the signal, or affixing the identifier to the signal, for later analysis and determination of royalty payments. Most of the traditional analysis is performed by actual persons who use play lists and other statistical approximations of audio play, including for example, data obtained through the manual (i.e., by persons) monitoring of a statistically significant sample of stations and transmission times so that an extrapolation may be made to a larger number of comparable markets.


The present invention creates a second database from the first database, wherein each of the stored audio signals in the first database is data reduced in a manner that is not likely to reflect the human perceptual quality of the signal, meaning that a significantly data-reduced signal is not likely to be played back and recognized as the original signal. As a result of the data reduction, the size of the second database (as measured in digital terms) is much smaller than the size of the first database, and is determined by the rate of compression. If, for example, if 24 hours worth of audio signals are compressed at a 10,000:1 compression rate, the reduced data could occupy a little more than 1 megabyte of data. With such a large compression rate, the data to be compared and/or analyzed may become computationally small such that computational speed and efficiency are significantly improved.


With greater compression rates, it is anticipated that similarity may exist between the data compressed abstractions of different analog signals (e.g., recordings by two different artists of the same song). The present invention contemplates the use of bit-addressable differences to distinguish between such cases. In applications where the data to be analyzed has higher value in some predetermined sense, cryptographic protocols, such as a hash or digital signature, can be used to distinguish such close cases.


In a preferred embodiment, the present invention may utilize a centralized database where copies of new recordings may be deposited to ensure that copyright owners, who authorize transmission or use of their recordings by others, can independently verify that the object is correctly monitored. The rules for the creator himself to enter his work would differ from a universally recognized number assigned by an independent authority (say, ISRC, ISBN for recordings and books respectively). Those skilled in the art of algorithmic information theory (AIT) can recognize that it is now possible to describe optimized use of binary data for content and functionality. The differences between objects must relate to decisions made by the user of the data, introducing subjective or cognitive decisions to the design of the contemplated invention as described above. To the extent that objects can have an optimized data size when compared with other objects for any given set of objects, the algorithms for data reduction would have predetermined flexibility directly related to computational efficiency and the set of objects to be monitored. The flexibility in having transparent determination of unique signal abstracts, as opposed to independent third party assignment, is likely to increase confidence in the monitoring effort by the owners of the original signals themselves. The prior art allows for no such transparency to the copyright creators.


Sample Embodiment 2

Another embodiment of the invention relates to visual images, which of course, involve at least two dimensions.


Similar to the goals of a psychoacoustic model, a psychovisual model attempts to represent a visual image with less data, and yet preserve those perceptual qualities that permit a human to recognize the original visual image. Using the very same techniques described above in connection with an audio signal, signal monitoring of visual images may be implemented.


One such application for monitoring and analyzing visual images involves a desire to find works of other artists that relate to a particular theme. For example, finding paintings of sunsets or sunrises. A traditional approach might involve a textual search involving a database wherein the works of other artists have been described in writing. The present invention, however, involves the scanning of an image involving a sun, compressing the data to its essential characteristics (i.e., those perceptual characteristics related to the sun) and then finding matches in a database of other visual images (stored as compressed or even uncompressed data). By studying the work of other artists using such techniques, a novice, for example, could learn much by comparing the presentations of a common theme by different artists.


Another useful application involving this type of monitoring and analyzing is the identification of photographs of potential suspects whose identity matches the sketch of a police artist.


Note that combinations of the monitoring techniques discussed above can be used for audio-visual monitoring, such as video-transmission by a television station or cable station. The techniques would have to compensate, for example, for a cable station that is broadcasting a audio channel unaccompanied by video.


Other embodiments and uses of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. The specification and examples should be considered exemplary only with the true scope and spirit of the invention indicated by the following claims. As will be easily understood by those of ordinary skill in the art, variations and modifications of each of the disclosed embodiments can be easily made within the scope of this invention as defined by the following claims.

Claims
  • 1. An electronic system for monitoring and analyzing at least one signal, comprising: a first input that receives at least one reference signal to be monitored,a first processor that creates an abstract of each reference signal input to said first processor through said first input wherein the abstract comprises signal characteristic parameters configured to differentiate between a plurality of versions of the reference signal;a second input that receives at least one query signal to be analyzed,a second processor that creates an abstract of each query signal wherein the abstract comprises signal characteristic parameters of the query signal;a reference database that stores abstracts of each at least one reference signal;a comparing device that compares an abstract of said at least one query signal to the abstracts stored in the reference database to determine if the abstract of said at least one query signal matches any of the stored abstracts wherein a match indicates the query signal is a version of at least one of the reference signals.
  • 2. The system of claim 1, wherein said second input is remotely coupled to the system.
  • 3. The system of claim 1, wherein said second processor is remotely coupled to the system.
  • 4. The system of claim 1, wherein the system transmits the parameters that are being used by the first processor to the second processor.
  • 5. The system of claim 1, wherein the stored abstracts comprise a self-similar representation of at least one reference signal.
  • 6. The system of claim 1, wherein at least two of the stored abstracts comprise information corresponding to two versions of at least one reference signal.
  • 7. The system of claim 1, wherein the stored abstracts comprise data describing a portion of the characteristics of its associated reference signal.
  • 8. The system of claim 7, wherein the characteristics of the reference signal being described comprise at least one of a perceptible characteristic, a cognitive characteristic, a subjective characteristic, a perceptual quality, a recognizable characteristic or combinations thereof.
  • 9. The system of claim 1, wherein each stored abstract comprises data unique to each variation of its corresponding reference signal.
  • 10. The system of claim 1, wherein the system applies a cryptographic protocol to the abstract of said reference signal, said query signal, or both said reference signal and said query signal.
  • 11. The system of claim 10, wherein the cryptographic protocol is one of at least a hash or digital signature and further comprising storing the hashed abstract and/or digitally signed abstract.
  • 12. The system of claim 1, further comprising an embedder to embed uniquely identifiable data into at least one of the received reference signal, the received query signal or both the received reference signal and the received query signal.
  • 13. The system of claim 1, wherein the match indicates that the abstract of the query signal comprises the same perceptual characteristics as the abstract of the matched one of the reference signals.
  • 14. The system of claim 1, wherein the parameters comprise commonly perceptible features.
  • 15. The system of claim 14, wherein the commonly perceptible features are selected.
  • 16. The system of claim 1, wherein said first and said second processors are the same processor.
  • 17. The system of claim 1, wherein the first processor and the second processor are different processors.
  • 18. A method for monitoring the distribution of data signals, comprising: creating an abstract for a data signal wherein the data signal abstract comprises signal characteristic parameters configured to differentiate between a plurality of versions of the data signal;storing the data signal abstract in at least one reference database;receiving a query signal;creating an abstract for the query signal based on the parameters;comparing the created query signal abstract to the at least one database of data signal abstracts, each abstract in the at least one database corresponding to a version of the data signal; anddetermining whether the query signal abstract matches any of the stored data signal abstracts in the at least one database to enable authorized transmission or use of the query signal for the query signal abstract based on whether a match was determined.
  • 19. The method of claim 18, wherein the database is created by at least one of a music company, a movie studio, an image archive, an owner of a general computing device, a user of the data signal, an internet service provider, an information technology company, a body politic, a telecommunications company and combinations thereof.
  • 20. The method of claim 18, wherein the data signals comprise at least one of images, audio, video, and combinations thereof.
  • 21. The method of claim 18, wherein the stored data signal abstracts are derived from one of a cognitive feature or a perceptible characteristic of the associated data signals.
  • 22. The method of claim 18, furthering comprising applying a cryptographic protocol to at least one created signal abstract, at least one database signal abstract or both at least one created signal abstract and at least one database signal abstract.
  • 23. The method of claim 22, wherein the cryptographic protocol comprises one of a hash or digital signature.
  • 24. The method of claim 18, wherein the stored signal abstracts comprise data to differentiate versions of the corresponding data signals.
  • 25. The method of claim 18, wherein each of the stored data signal abstracts comprise information configured to differentiate variations of each referenced corresponding data signal.
  • 26. The method of claim 18, further comprising storing information associated with the comparison step to enable at least one of a re-calibration of the database, a heuristic-based adjustment of the database, a computational efficiency adjustment of the database, an adjustment for database collisions and/or null cases, changes to the recognition or use parameters governing the database and combinations thereof.
  • 27. The method of claim 18, further comprising applying one of a relatedness index or measure of similarity to generate uniquely identifiable information to determine authorization.
  • 28. The method of claim 18, further comprising encoding information into the data signal with a watermarking technique.
  • 29. The process of claim 18, wherein the data signal is received by one of a creator or owner of said data signal.
  • 30. A system for identifying and distributing signals, comprising: a first input that receives a query abstract of a signal to identify;a database containing a plurality of signal abstracts, the plurality of signal abstracts each associated with a corresponding signal wherein each of the plurality of the signal abstracts retains a perceptual relationship with the corresponding signal;a comparing device that compares the query abstract to the plurality of abstracts stored in the reference database to identify a matching signal abstract; anda device for retrieving the signal corresponding to the matching signal abstract; anda device for conducting a transaction, the transaction selected from the group consisting of a download and a subscription.
  • 31. The system of claim 30, wherein each signal abstract comprises a link to its corresponding signal.
  • 32. The system of claim 30, wherein the comparing device determines if the signal abstracts stored in the database are authorized.
  • 33. The system of claim 30, wherein the comparing device determines if the link is an authorized link.
  • 34. The system of claim 30, wherein the reference database is governed by heuristics or experience-based parameters.
  • 35. The system of claim 30, wherein the plurality of abstracts stored in the reference database are derived from one of data reduced versions of said corresponding signals, compressed variations of said corresponding signals, bit-addressable relationships between said corresponding signals, and a least amount of data required to uniquely identify each corresponding signal, and combinations thereof.
  • 36. The system of claim 30, wherein the device for conducting transactions or the device for retrieving the signal is remotely coupled to the system.
  • 37. The system of claim 30, wherein the device for conducting transactions or the device for retrieving the signal is controlled by the database.
  • 38. The system of claim 30, wherein the device for retrieving the signal and the device for conducting transactions comprise the same device.
  • 39. The system of claim 30, further comprising an embedder to watermark signals with uniquely identifiable information.
  • 40. A process for analyzing and identifying at least one signal, comprising: receiving at least one reference signal to be identified,creating an abstract of each reference signal received based on perceptual characteristics representative of parameters to differentiate between versions of the reference signal;storing abstracts of each reference signal received in a database;receiving at least one query signal to be identified,creating an abstract of the received query signal based on the parameters; andcomparing an abstract of said received query signal to the abstracts stored in the database to determine if the abstract of said received query signal is related to any of the stored abstracts.
  • 41. The process of claim 40, wherein said database is independently accessible.
  • 42. The process of claim 40, wherein said received query signal is independently stored.
  • 43. The process of claim 40, wherein the criteria used to compare a received query signal abstract with a stored reference signal abstract are adjustable.
  • 44. The process of claim 40, wherein the stored abstracts comprise a self-similar representation of at least one reference signal.
  • 45. The process of claim 40, wherein at least two of the stored abstracts comprise information corresponding to two versions of at least one reference signal.
  • 46. The process of claim 40, wherein at least one abstract comprises data describing a portion of the characteristics of its associated reference signal.
  • 47. The process of claim 46, wherein the characteristics of the reference signal being described comprise at least one of a perceptible characteristic, a cognitive characteristic, a subjective characteristic, a perceptual quality, a recognizable characteristic or combinations thereof.
  • 48. The process of claim 40, wherein a stored abstract comprises data unique to a variation of its corresponding reference signal.
  • 49. The process of claim 40, wherein the process further comprises applying a cryptographic protocol to the abstract of said reference signal, said query signal, or both said reference signal and said query signal.
  • 50. The process of claim 49, wherein the cryptographic protocol is one of at least a hash or digital signature and further comprising storing the hashed abstract and/or digitally signed abstract.
  • 51. The process of claim 40, further comprising distributing at least one signal based on the comparison step.
  • 52. The process of claim 51, further comprising watermarking the at least one signal to be distributed.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 09/657,181, filed Sep. 7, 2000, entitled, “Method and Device for Monitoring and Analyzing Signals.” This application claims the benefit of pending U.S. patent application Ser. No. 08/999,766, filed Jul. 23, 1997, entitled “Steganographic Method and Device”; pending U.S. patent application Ser. No. 08/772,222, filed Dec. 20, 1996, entitled “Z-Transform Implementation of Digital Watermarks” (issued as U.S. Pat. No. 6,078,664); pending U.S. patent application Ser. No. 09/456,319, filed Dec. 8, 1999, entitled “Z-Transform Implementation of Digital Watermarks” (issued as U.S. Pat. No. 6,853,726); pending U.S. patent application. Ser. No. 08/674,726, filed Jul. 2, 1996, entitled “Exchange Mechanisms for Digital Information Packages with Bandwidth Securitization, Multichannel Digital Watermarks, and Key Management”; pending U.S. patent application Ser. No. 09/545,589, filed Apr. 7, 2000, entitled “Method and System for Digital. Watermarking” (issued as U.S. Pat. No. 7,007,166); pending U.S. patent application Ser. No. 09/046,627, filed Mar. 24, 1998, entitled “Method for Combining Transfer Function with Predetermined Key Creation” (issued as U.S. Pat. No. 6,598,162); pending U.S. patent application Ser. No. 09/053,628, filed Apr. 2, 1998, entitled “Multiple Transform Utilization and Application for Secure Digital Watermarking” (issued as U.S. Pat. No. 6,205,249); pending U.S. patent application Ser. No. 09/281,279, filed Mar. 30, 1999, entitled “Optimization Methods for the Insertion, Protection, and Detection of Digital Watermarks in Digital Data (issued as U.S. Pat. No. 6,522,767)”; U.S. patent application Ser. No. 09,594,719, filed Jun. 16, 2000, entitled “Utilizing Data Reduction in Steganographic and Cryptographic Systems” (which is a continuation-in-part of PCT application No. PCT/US00/06522, filed Mar. 14, 2000, which PCT application claimed priority to U.S. Provisional Application No. 60/125,990, filed Mar. 24, 1999) (issued as U.S. Pat. No. 7,123,718); pending U.S. Application No. 60/169,274, filed Dec. 7, 1999, entitled “Systems, Methods And Devices For Trusted Transactions” (issued as U.S. Pat. No. 7,159,116); and PCT Application No. PCT/US00/21189, filed Aug. 4, 2000 (which claims priority to U.S. Patent Application Ser. No. 60/147,134, filed Aug. 4, 1999, and to U.S. Patent Application No. 60/213,489, filed. Jun. 23, 2000, both of which are entitled, “A Secure Personal Content Server”). The previously identified patents and/or patent applications are hereby incorporated by reference, in their entireties, as if fully stated herein. In addition, this application hereby incorporates by reference, as if fully stated herein, the total disclosures of U.S. Pat. No. 5,613,004 “Steganographic Method and Device”; U.S. Pat. No. 5,745,569 “Method for Stega-Cipher Protection of Computer Code”; and U.S. Pat. No. 5,889,868 “Optimization Methods for the Insertion, Protection, and Detection of Digital Watermarks in Digitized Data.”

US Referenced Citations (267)
Number Name Date Kind
3947825 Cassada Mar 1976 A
3984624 Waggener Oct 1976 A
3986624 Cates, Jr. et al. Oct 1976 A
4038596 Lee Jul 1977 A
4200770 Hellman et al. Apr 1980 A
4218582 Hellman et al. Aug 1980 A
4339134 Macheel Jul 1982 A
4390898 Bond et al. Jun 1983 A
4405829 Rivest et al. Sep 1983 A
4424414 Hellman et al. Jan 1984 A
4528588 Lofberg Jul 1985 A
4672605 Hustig et al. Jun 1987 A
4748668 Shamir et al. May 1988 A
4789928 Fujisaki Dec 1988 A
4827508 Shear May 1989 A
4876617 Best et al. Oct 1989 A
4896275 Jackson Jan 1990 A
4908873 Philibert et al. Mar 1990 A
4939515 Adelson Jul 1990 A
4969204 Jones et al. Nov 1990 A
4972471 Gross et al. Nov 1990 A
4977594 Shear Dec 1990 A
4979210 Nagata et al. Dec 1990 A
4980782 Ginkel Dec 1990 A
5050213 Shear Sep 1991 A
5073925 Nagata et al. Dec 1991 A
5077665 Silverman et al. Dec 1991 A
5113437 Best et al. May 1992 A
5136581 Muehrcke Aug 1992 A
5136646 Haber et al. Aug 1992 A
5136647 Haber et al. Aug 1992 A
5142576 Nadan Aug 1992 A
5161210 Druyvesteyn et al. Nov 1992 A
5210820 Kenyon May 1993 A
5243423 DeJean et al. Sep 1993 A
5243515 Lee Sep 1993 A
5287407 Holmes Feb 1994 A
5319735 Preuss et al. Jun 1994 A
5341429 Stringer et al. Aug 1994 A
5341477 Pitkin et al. Aug 1994 A
5363448 Koopman et al. Nov 1994 A
5365586 Indeck et al. Nov 1994 A
5369707 Follendore, III Nov 1994 A
5379345 Greenberg Jan 1995 A
5394324 Clearwater Feb 1995 A
5398285 Borgelt et al. Mar 1995 A
5406627 Thompson et al. Apr 1995 A
5408505 Indeck et al. Apr 1995 A
5410598 Shear Apr 1995 A
5412718 Narasimhalu et al. May 1995 A
5418713 Allen May 1995 A
5428606 Moskowitz Jun 1995 A
5450490 Jensen et al. Sep 1995 A
5469536 Blank Nov 1995 A
5471533 Wang et al. Nov 1995 A
5478990 Montanari et al. Dec 1995 A
5479210 Cawley et al. Dec 1995 A
5487168 Geiner et al. Jan 1996 A
5493677 Balogh et al. Feb 1996 A
5497419 Hill Mar 1996 A
5506795 Yamakawa Apr 1996 A
5513126 Harkins et al. Apr 1996 A
5513261 Maher Apr 1996 A
5530739 Okada Jun 1996 A
5530751 Morris Jun 1996 A
5530759 Braudaway et al. Jun 1996 A
5548579 Lebrun et al. Aug 1996 A
5568570 Rabbani Oct 1996 A
5579124 Aijala et al. Nov 1996 A
5581703 Baugher et al. Dec 1996 A
5583488 Sala et al. Dec 1996 A
5598470 Cooper et al. Jan 1997 A
5606609 Houser et al. Feb 1997 A
5613004 Cooperman et al. Mar 1997 A
5617119 Briggs et al. Apr 1997 A
5625690 Michel et al. Apr 1997 A
5629980 Stefik et al. May 1997 A
5633932 Davis et al. May 1997 A
5634040 Her et al. May 1997 A
5636276 Brugger Jun 1997 A
5636292 Rhoads Jun 1997 A
5640569 Miller et al. Jun 1997 A
5646997 Barton Jul 1997 A
5657461 Harkins et al. Aug 1997 A
5659726 Sandford, II et al. Aug 1997 A
5664018 Leighton Sep 1997 A
5673316 Auerbach et al. Sep 1997 A
5677952 Blakley et al. Oct 1997 A
5680462 Miller et al. Oct 1997 A
5687236 Moskowitz et al. Nov 1997 A
5689587 Bender et al. Nov 1997 A
5696828 Koopman, Jr. Dec 1997 A
5719937 Warren et al. Feb 1998 A
5721788 Powell et al. Feb 1998 A
5734752 Knox Mar 1998 A
5737416 Cooper et al. Apr 1998 A
5737733 Eller Apr 1998 A
5740244 Indeck et al. Apr 1998 A
5745569 Moskowitz et al. Apr 1998 A
5748783 Rhoads May 1998 A
5751811 Magnotti et al. May 1998 A
5754697 Fu et al. May 1998 A
5757923 Koopman, Jr. May 1998 A
5765152 Erickson Jun 1998 A
5768396 Sone Jun 1998 A
5774452 Wolosewicz Jun 1998 A
5790677 Fox et al. Aug 1998 A
5799083 Brothers et al. Aug 1998 A
5809139 Girod et al. Sep 1998 A
5809160 Powell et al. Sep 1998 A
5828325 Wolose Wicz et al. Oct 1998 A
5832119 Rhoads Nov 1998 A
5848155 Cox Dec 1998 A
5850481 Rhoads Dec 1998 A
5859920 Daly et al. Jan 1999 A
5860099 Milios et al. Jan 1999 A
5862260 Rhoads Jan 1999 A
5870474 Wasilewski et al. Feb 1999 A
5884033 Duvall et al. Mar 1999 A
5889868 Moskowitz et al. Mar 1999 A
5893067 Bender et al. Apr 1999 A
5894521 Conley Apr 1999 A
5903721 Sixtus May 1999 A
5905800 Moskowitz et al. May 1999 A
5905975 Ausubel May 1999 A
5912972 Barton Jun 1999 A
5915027 Cox et al. Jun 1999 A
5917915 Hirose Jun 1999 A
5918223 Blum Jun 1999 A
5920900 Poole et al. Jul 1999 A
5923763 Walker et al. Jul 1999 A
5930369 Cox et al. Jul 1999 A
5930377 Powell et al. Jul 1999 A
5940134 Wirtz Aug 1999 A
5943422 Van Wie et al. Aug 1999 A
5963909 Warren et al. Oct 1999 A
5973731 Schwab Oct 1999 A
5974141 Saito Oct 1999 A
5991426 Cox et al. Nov 1999 A
5999217 Berners-Lee Dec 1999 A
6009176 Gennaro et al. Dec 1999 A
6029126 Malvar Feb 2000 A
6041316 Allen Mar 2000 A
6049838 Miller et al. Apr 2000 A
6051029 Paterson et al. Apr 2000 A
6061793 Tewfik et al. May 2000 A
6069914 Cox May 2000 A
6078664 Moskowitz et al. Jun 2000 A
6081251 Sakai et al. Jun 2000 A
6081597 Hoffstein et al. Jun 2000 A
6088455 Logan et al. Jul 2000 A
6131162 Yoshiura et al. Oct 2000 A
6141753 Zhao et al. Oct 2000 A
6141754 Choy Oct 2000 A
6154571 Cox et al. Nov 2000 A
6199058 Wong et al. Mar 2001 B1
6205249 Moskowitz Mar 2001 B1
6208745 Florencio et al. Mar 2001 B1
6230268 Miwa et al. May 2001 B1
6233347 Chen et al. May 2001 B1
6233684 Stefik et al. May 2001 B1
6240121 Senoh May 2001 B1
6263313 Milsted et al. Jul 2001 B1
6272634 Tewfik et al. Aug 2001 B1
6275988 Nagashima et al. Aug 2001 B1
6278780 Shimada Aug 2001 B1
6278791 Honsinger et al. Aug 2001 B1
6282300 Bloom et al. Aug 2001 B1
6282650 Davis Aug 2001 B1
6285775 Wu et al. Sep 2001 B1
6301663 Kato et al. Oct 2001 B1
6310962 chung et al. Oct 2001 B1
6330335 Rhoads Dec 2001 B1
6330672 Shur Dec 2001 B1
6345100 Levine Feb 2002 B1
6351765 Pietropaolo et al. Feb 2002 B1
6363483 Keshav Mar 2002 B1
6373892 Ichien et al. Apr 2002 B1
6373960 Conover et al. Apr 2002 B1
6377625 Kim Apr 2002 B1
6381618 Jones et al. Apr 2002 B1
6381747 Wonfor et al. Apr 2002 B1
6385329 Sharma et al. May 2002 B1
6389538 Gruse et al. May 2002 B1
6405203 Collart Jun 2002 B1
6415041 Oami et al. Jul 2002 B1
6425081 Iwamura Jul 2002 B1
6430301 Petrovic Aug 2002 B1
6430302 Rhoads Aug 2002 B2
6442283 Tewfik et al. Aug 2002 B1
6453252 Laroche Sep 2002 B1
6457058 Ullum et al. Sep 2002 B1
6463468 Buch et al. Oct 2002 B1
6493457 Quackenbush Dec 2002 B1
6522769 Rhoads et al. Feb 2003 B1
6523113 Wehrenberg Feb 2003 B1
6530021 Epstein et al. Mar 2003 B1
6532284 Walker et al. Mar 2003 B2
6539475 Cox et al. Mar 2003 B1
6557103 Boncelet, Jr. et al. Apr 2003 B1
6584125 Katto Jun 2003 B1
6587837 Spagna et al. Jul 2003 B1
6598162 Moskowitz Jul 2003 B1
6606393 Xie et al. Aug 2003 B1
6647424 Pearson et al. Nov 2003 B1
6658010 Enns et al. Dec 2003 B1
6665489 Collart Dec 2003 B2
6668246 Yeung et al. Dec 2003 B1
6668325 Collberg et al. Dec 2003 B1
6687683 Harada et al. Feb 2004 B1
6725372 Lewis et al. Apr 2004 B1
6754822 Zhao Jun 2004 B1
6775772 Binding et al. Aug 2004 B1
6784354 Lu et al. Aug 2004 B1
6785815 Serret-Avila et al. Aug 2004 B1
6823455 Macy et al. Nov 2004 B1
6834308 Ikezoye et al. Dec 2004 B1
6842862 Chow et al. Jan 2005 B2
6931534 Jandel et al. Aug 2005 B1
6966002 Torrubia-Saez Nov 2005 B1
6983337 Wold Nov 2005 B2
6977894 Achilles et al. Dec 2005 B1
6978370 Kocher Dec 2005 B1
7020285 Kirovski et al. Mar 2006 B1
7043050 Yuval May 2006 B2
7046808 Metois et al. May 2006 B1
7050396 Cohen et al. May 2006 B1
7051208 Venkatesan et al. May 2006 B2
7058570 Yu et al. Jun 2006 B1
7093295 Saito Aug 2006 B1
7107451 Moskowitz Sep 2006 B2
7150003 Naumovich et al. Dec 2006 B2
7162642 Schumann et al. Jan 2007 B2
7177430 Kim Feb 2007 B2
7206649 Kirovski et al. Apr 2007 B2
7231524 Bums Jun 2007 B2
7240210 Mihcak et al. Jul 2007 B2
7266697 Kirovski et al. Sep 2007 B2
7286451 Wirtz et al. Oct 2007 B2
7289643 Brunk et al. Oct 2007 B2
7363278 Schmelzer et al. Apr 2008 B2
7460994 Herre et al. Dec 2008 B2
20010043594 Ogawa et al. Nov 2001 A1
20020026343 Duenke Feb 2002 A1
20020073043 Herman et al. Jun 2002 A1
20020097873 Petrovic Jul 2002 A1
20020103883 Haverstock et al. Aug 2002 A1
20020161741 Wang et al. Oct 2002 A1
20030126445 Wehrenberg Jul 2003 A1
20030133702 Collart Jul 2003 A1
20040028222 Sewell et al. Feb 2004 A1
20040037449 Davis et al. Feb 2004 A1
20040049695 Choi et al. Mar 2004 A1
20040059918 Xu Mar 2004 A1
20040083369 Erlingsson et al. Apr 2004 A1
20040093521 Hamadeh et al. May 2004 A1
20040125983 Reed et al. Jul 2004 A1
20040128514 Rhoads Jul 2004 A1
20050160271 Brundage et al. Jul 2005 A9
20050246554 Batson Nov 2005 A1
20060005029 Petrovic et al. Jan 2006 A1
20060013395 Brundage et al. Jan 2006 A1
20060013451 Haitsma Jan 2006 A1
20060041753 Haitsma Feb 2006 A1
20070083467 Lindahl et al. Apr 2007 A1
20070127717 Herre et al. Jun 2007 A1
20070253594 Lu et al. Nov 2007 A1
Foreign Referenced Citations (15)
Number Date Country
0372601 Jun 1990 EP
0565947 Oct 1993 EP
0581317 Feb 1994 EP
0649261 Apr 1995 EP
0651554 May 1995 EP
1354276 Dec 2007 EP
100523 Sep 1998 NL
WO 9514289 May 1995 WO
9629795 Sep 1996 WO
9724833 Jul 1997 WO
WO 9744736 Nov 1997 WO
WO9837513 Aug 1998 WO
WO 9952271 Oct 1999 WO
WO 9962044 Dec 1999 WO
WO 9963443 Dec 1999 WO
Related Publications (1)
Number Date Country
20080109417 A1 May 2008 US
Continuations (1)
Number Date Country
Parent 09657181 Sep 2000 US
Child 12005229 US