The present invention provides methods and features for authenticating identification documents and banknotes.
In patent application Ser. No. 09/127,502 (U.S. Pat. No. 6,345,104) we disclose the following: Many security documents are still designed largely by hand. A designer works at a drafting table or computer workstation, and spends many hours laying-out minute (e.g. 5 mm×5 mm) excerpts of the design. To aid integration of watermark and/or calibration pattern data in this process, an accessory layout grid can be provided, identifying the watermark “bias” (e.g. −3 to +3) that is to be included in each 250 micron cell of the security document. If the accessory grid indicates that the luminance should be slightly increased in a cell (e.g. 1%), the designer can take this bias in mind when defining the composition of the cell and include a touch less ink than might otherwise be included. Similarly, if the accessory grid indicates that the luminance should be somewhat strongly increased in a cell (e.g. 5%), the designer can again bear this in mind and try to include more ink than might otherwise be included. Due to the substantial redundancy of most watermark encoding techniques, strict compliance by the designer to these guidelines is not required. Even loose compliance can result in artwork that requires little, if any, further modification to reliably convey watermark and/or calibration information.
Such “designing-in” of embedded information in security documents is facilitated by the number of arbitrary design choices made by security document designers. A few examples from U.S. banknotes include the curls in the presidents' hair, the drape of clothing, the clouds in the skies, the shrubbery in the landscaping, the bricks in the pyramid, the fill patterns in the lettering, and the great number of arbitrary guilloche patterns and other fanciful designs, etc. All include curves, folds, wrinkles, shadow effects, etc., about which the designer has wide discretion in selecting local luminance, etc. Instead of making such choices arbitrarily, the designer can make these choices deliberately so as to serve an informational—as well as an aesthetic—function.
To further aid the security document designer, data defining several different information-carrying patterns (both watermark and/or calibration pattern) can be stored on mass storage of a computer workstation and serve as a library of design elements for future designs. The same user-interface techniques that are employed to pick colors in image-editing software (e.g. Adobe Photoshop) and fill textures in presentation programs (e.g. Microsoft PowerPoint) can similarly be used to present a palette of information patterns to a security document designer. Clicking on a visual representation of the desired pattern makes the pattern available for inclusion in a security document being designed (e.g. filling a desired area).
In the embodiment earlier-described, the calibration pattern is printed as a visible artistic element of the security document. However, the same calibration effect can be provided subliminally if desired. That is, instead of generating artwork mimicking the gray-scale pattern of the reference calibration block, the reference calibration block can itself be encoded into the security document as small changes in local luminance. In many such embodiments, the bias to localized document luminance due to the calibration pattern is simply added to the bias due to the watermark data, and encoded like the watermark data (e.g. as localized changes to the width or position of component line-art lines, as inserted ink droplets, etc.).
The present invention continues and improves these inventive ideas. According to one aspect of the present invention, an identification document includes a security enhancer (e.g., perhaps hidden in line art, artwork or graphic designs). The security enhancer includes a grouping of concentric circles. The concentric circles share a common center, and each circle is equally spaced from one another by a spacing distance d. Personal information carried by the identification document (e.g., driver's license number, birth date, photograph, biometric information, name or address, etc., etc.) is reduced by a hash algorithm. The result of the hash algorithm is a number. The number forms the spacing distance d for the grouping of concentric circles—personalizing the security enhancer to the cardholder. The identification document is printed to include the customized security enhancer.
The repetitive spacing distance d of the plurality of concentric circles in a spatial domain has an identifiable frequency response in a frequency domain. In particular, the corresponding frequency domain response includes a circle with a radius that is indirectly related to the spacing distance d. The frequency domain response (or frequency domain radius) can be evaluated to determine a counterfeit or forgery.
Banknotes, security documents, deeds, legal instruments, etc. can be similarly marked.
Other aspect of the invention utilizes a security enhancer for document identification or classification. A security enhancer's frequency characteristics are compared against expected characteristics to identify or classify the document.
Additional features and advantages of the present invention will become more apparent with reference to the following detailed description and accompanying drawings.
a and 4b respectively illustrate a technique for providing a security enhancer, and a technique for verifying the authenticity of a document including a security enhancer.
a and 5b illustrate parallel line-based security enhancers.
a and 6b illustrate frequency responses for the
The presently preferred embodiments are described with respect to an identification (ID) document. An identification document may include, e.g., a passport, identification paper, driver's license, identification card, company identification badge, secure area or network access badge or card, etc., etc. We note, however, that the present invention is not so limited. Indeed, our inventive techniques can be similarly applied to bank notes, security documents, legal instruments, visas, product packaging and labels, advertisements, badges, papers and printed matter, etc., etc.
With reference to
The printed substrate 21 is usually laminated. The laminate typically includes a polyester or polycarbonate-based top sheet 23 and bottom sheet 25 that respectively overlay the top and bottom of the substrate 21. Heat and/or adhesives and pressure are used to bond the laminate sheets 23 and 25 with the substrate 21. Or a laminate can include a pouch into which the substrate 21 slips. Again, heat and/or adhesives and pressure are used to bond the substrate 21 with a pouch laminate. The laminates provide a protective covering for the printed substrate and provide a level of protection against unauthorized tampering. (For example, a laminate would have to be removed to alter the printed information and then subsequently replaced after the alteration). A laminate layer 23 or 25 may optionally carry information like a card bearer's signature or security features.
In some implementations, information may also be optically or magnetically stored on recording media (e.g., magnetic stripe 27) carried by the laminate 25. Of course the magnetic stripe 27 can be alternatively carried by substrate 21 or laminate 23.
We note that the present invention encompasses ID documents including more or less features and layers than are illustrated in
ID document 10 includes a security enhancer 16. The security enhancer 16 can be printed (or laser engraved) on the substrate 21 or a laminate 23 or 25. Security enhancer 16 provides an indicator to help determine the authenticity of ID document 10. In one implementation, the indicator provides a frequency domain indication. In another implementation, the indicator provides a spatial domain indication. And in yet another implementation, the indicator provides both a frequency domain indication and a spatial domain indication.
With reference to
The circle spacing distance d (
d=k·TRS/r, Equation 1
where k is a constant, and TRS is a transform sampling size factor (e.g., Fast Fourier transform sample size, discrete cosine transform sample size, relative sample size, etc.). The transform sampling size factor TRS helps compensate for differences in sample size (e.g., 64 points vs. 128 points, etc.), if needed. We note that in many situations TRS will be replaced by 1, e.g., when a base sampling size is employed. The distance r may be measured from the DC frequency component (located at the graphical origin in
We use the circle spacing d and/or the circular radius r to provide increased security for ID document 10. With reference to
The result of the hashing algorithm preferably produces a number. (Or the output of the hashing algorithm is used to generate a number). This number is used to set or adjust the spacing distance d (
An authentication method for a document including a security enhancer is discussed with reference to
The radius r is compared to an expected value r or range of values r (step 47). In one implementation, we select the same set of information that was used to originally seed the hash algorithm for setting the circle spacing distance d in ID document 10. The hash algorithm hashes the selected set of information to produce a number d. The number d and the determined radius r are compared via Equation 1, with the constant k and TRS being adjusted, if needed, to account for printing and image capture dpi and sample size. If d and k·TRS/r coincide the ID document is considered authentic (step 48). Otherwise the document is considered untrustworthy (step 49).
In another implementation, we calculate d with the hash algorithm, and then calculate an expected radius r value with Equation 1. We compare the expected r value with the measured or determined r value. If the expected r value and the measured r value are equal (or fall within an acceptable tolerance range) the ID document 10 is considered authentic. Otherwise the ID document 10 is considered untrustworthy.
In still another implementation, after obtaining the measured or determined radius r, we calculate a value d with Equation 1. We determine an expected value for d using the corresponding hashing algorithm. If the expected d value and the calculated d value are equal (or fall within an acceptable tolerance range) the ID document 10 is considered authentic. Otherwise the ID document 10 is considered untrustworthy.
In some implementations our security enhancer includes both a spatial component (e.g., the circle spacing d) and a frequency component (e.g., the frequency circle radius r). The authenticity of a document can be verified by a relationship between the spatial component and the frequency component.
In other implementations we verify authenticity of a document by examining only one of these components. For example, we focus on the spatial domain component. We use pattern recognition and/or line or edge detection techniques to identify the spacing distance d. An image of ID document 10 is captured. The captured image is analyzed with pattern or line detection techniques (software) to discern the pattern associated with the security enhancer. Edge or line detectors, e.g., Hough and/or Radon transforms or generalized versions of such, are employed to discern a spacing distance d between elements of the security feature. The discerned spacing distance d is compared with an expected spacing distance d to determine whether the ID document is authentic.
In another implementation, we focus on the frequency domain component. The frequency response may correspond to a graphic or artwork element that is inherently used in the subject document. We use the frequency response of the security enhancer to identify a type of document. If a frequency response is found to have a first radius (or shape/location/characteristic), or otherwise falls within a predetermined range of radii, the corresponding document is determined to be an ID document. Or if the frequency response is found to have a second radius (or shape/location/characteristic), or otherwise falls within a predetermined range of radii, the corresponding document is determined to be a banknote, etc. Once a document is identified, a copy deterrent system can decide whether to allow printing of the document. For example, if a document is determined, based on its frequency characteristics, to be a bank note or identification document, the copy deterrent system stymies a copy operation.
Our authentication methods are helpful in preventing forgers. For example, suppose an identification document includes a security enhancer. The identification document belongs to say 16-year old Joan. The identification card further includes Joan's photograph and printed information evidencing Joan's personal information (e.g., name, sex, age and address, etc.). Joan decides that she wants to “up-grade” her age, by cutting and pasting her identification card photograph onto her 22-year old sister, Molly's, identification card. Molly's identification card also includes a security enhancer and Molly's personal information (e.g., name, sex, age and address, etc.).
Joan pulls off a professional job replacing Molly's photograph with her own. All seems fine for Joan until an authentication process is used to verify the identification document. A hash of Joan's photograph is used as an expected value d for the spacing distance of the security enhancer. The expected d value, however, does not match the actual value d, since the actual value d was determined from a hash of Molly's photograph, and not Joan's. (Or a frequency domain characteristic corresponding to Molly's security enhancer, like a radius r, is measured and compared with a calculated value or to a calculated spacing distance d). The counterfeit is justly determined.
In an alternative embodiment, ID document 10 includes a digital watermark. Digital watermarking is a process for modifying physical or electronic media to embed a machine-readable code into the media. The media may be modified such that the embedded code is imperceptible or nearly imperceptible to the user, yet may be detected through an automated detection process.
Digital watermarking systems typically have two primary components: an encoder that embeds the digital watermark in a host media signal, and a decoder that detects and reads the embedded digital watermark from a signal suspected of containing a digital watermark (a suspect signal). The encoder embeds a digital watermark by altering the host media signal. The reading component analyzes a suspect signal to detect whether a digital watermark is present. In applications where the digital watermark encodes information, the reader extracts this information from the detected digital watermark.
Several particular digital watermarking techniques have been developed. The reader is presumed to be familiar with the literature in this field. Particular techniques for embedding and detecting imperceptible watermarks in media signals are detailed in the assignee's co-pending U.S. patent application Ser. No. 09/503,881 (now U.S. Pat. No. 6,614,914) and U.S. Pat. No. 6,122,403, which are each herein incorporated by reference.
Returning to the alternative embodiment, a digital watermark embedded in ID document 10 carries a payload or plural-bit data (e.g., a key). The key reveals which set of information is used to seed the hash algorithm. The key can include the set of information itself (e.g., by carrying the birth date or document number) or can include a numeric indicator (e.g., 101 implies the birth date, while 110 implies the document number, etc.). Still further, the key may include a database pointer which can be used to point to a database record. The database record reveals which set of information was used to seed the hash algorithm. In a related implementation, instead of using a digital watermark to carry such information, the document itself may provide the clues. For example, the third number of an ID document number may signal which set of information was used to seed the hash algorithm. Or barcode information and/or a magnetic stripe can provide the key. In a related implementation, we encrypt the digital watermark payload, barcode or data carried by the magnetic stripe to provide additional security.
To verify authenticity in this alternative embodiment, the digital watermark (or other indicator) is decoded to retrieve the key. The key identifies the set of information. The set of information is collected and used to seed the hash algorithm. The hash algorithm produces a number, which if the document is authentic, should correspond to the spacing distance d and/or to the frequency domain radius r.
Up to this point in the disclosure we have focused on a security enhancer 16 that includes a grouping of concentric circles. We note that the present invention is not so limited. Indeed, the present invention encompasses other security enhancers having characteristics that yield identifiable spatial domain and frequency responses. For example, consider the security enhancers illustrated with respect to
d′=k·TRS/r′, Equation 2
where k is a constant and TRS is a transform sampling size factor as discussed above with respect to Equation 1.
Another alternative security enhancer is shown in
d″=K·TRS/r″, Equation 3
where k is a constant, TRS is a transform sampling size factor, as discussed above with respect to Equation 1, and rx″=cos θ, and ry″=sin θ.
We note that other security designs (such as parallel—but squiggly—lines, spaced evenly apart, concentric half-circles, evenly spaced arcs, parallel lines formed by concentric triangle, squares, octagons, etc., etc.) will yield identifiable frequency responses. These other security designs can be suitable interchanged with the present invention, particularly if the design characteristics can be adjusted to accommodate personal information or predetermined security features. We note that while these other designs may be used as security enhancers, they may have a plurality of frequency responses which may need to be sorted to identify the authenticating frequency clue.
A library of security enhancers can be made available to a designer or ID document issuer. The library may include graphics or digital representations of the group of concentric circles, squiggly lines, parallel lines, etc. In the case of an ID document, after capturing a photograph or personal information related to the cardholder, a hash algorithm reduces a set of captured photograph or personal information to a spacing distance d. The library (or a cooperating software module) uses the spacing d to adjust a selected security enhancer. The selected security enhancer is thus personalized to the cardholder. (We note that in the case of an ID document issuer, like a state DMV, the selection of a security enhancer will typically be standardized. Hence, each ID document may include the same basic security enhancer, but each security enhancer will be personalized via the individualized spacing distance).
One alternative frequency-circle radius calculation (or determination) technique converts a Cartesian circle representation (e.g.,
Detection in Noisy Environments
Now consider the frequency domain (i.e., Fourier Domain) space shown in
Alternative Applications
An alternative application of our present invention is a copy detection mechanism. We can minimize the circle spacing d (e.g.,
Another inventive alternative application uniquely assigns a spacing distance d per user or printer location. The security enhancer automatically defaults to a particular spacing depending on who is handling a document. Say for example, that John has a copy of a classified document. John prints the document. Prior to printing, a security application (perhaps a plug-in or operating system module) applies a security enhancer to the print. The security enhancer includes a spacing that is uniquely assigned to John. Then, if the printed document is found in an unexpected channel, the spacing can be analyzed to determine who printed, and therefore leaked, the document. The security enhancer can be similarly modified to reflect a certain printer or intended receiver of the document.
Conclusion
The foregoing are just exemplary implementations of the present invention. It will be recognized that there are a great number of variations on these basic themes. The foregoing illustrates but a few applications of the detailed technology. There are many others.
For example, the security feature illustrated in
We note that our inventive techniques can be expanded to video. A video frame may include a security enhancer (e.g., subliminally placed, or as background). The spacing may be set by reference to a video distributor, target recipient, or studio, etc. The security feature may also be applied to rough cuts as a marking tool and to prevent unauthorized distribution. The security enhancer can be visible in such situations.
To provide a comprehensive disclosure without unduly lengthening this specification, applicants incorporate by reference, in their entireties, the disclosures of the above-cited patents and applications, along with U.S. patent application Ser. No. 10/027,783, filed Dec. 19, 2001 (published as U.S. 2002-0126872 A1). The particular combinations of elements and features in the above-detailed embodiments are exemplary only; the interchanging and substitution of these teachings with other teachings in this application and the incorporated-by-reference patents/applications are also contemplated.
Although not belabored herein, artisans will understand that the systems and methods described above can be implemented using a variety of hardware and software systems. Alternatively, dedicated hardware, or programmable logic circuits, can be employed for such operations.
In view of the wide variety of embodiments to which the principles and features discussed above can be applied, it should be apparent that the detailed embodiments are illustrative only and should not be taken as limiting the scope of the invention. Rather, we claim as our invention all such modifications as may come within the scope and spirit of the following claims and equivalents thereof.
This application is a continuation of U.S. patent application Ser. No. 11/825,258, filed Jul. 3, 2007 (U.S. Pat. No. 7,570,784), which is a continuation of U.S. patent application Ser. No. 11/312,247, filed Dec. 19, 2005 (U.S. Pat. No. 7,239,734), which is a divisional of U.S. patent application Ser. No. 10/170,223, filed Jun. 10, 2002 (U.S. Pat. No. 6,978,036). The Ser. No. 10/170,223 application is related to U.S. patent application Ser. No. 09/939,298, filed Aug. 24, 2001 (U.S. Pat. No. 6,804,379), which is a continuation of Ser. No. 09/127,502, filed Jul. 31, 1998 (U.S. Pat. No. 6,345,104). Each of the above-mentioned patent documents is hereby incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
4218674 | Brosow et al. | Aug 1980 | A |
4582986 | Stockburger et al. | Apr 1986 | A |
4590366 | Rothfjell | May 1986 | A |
4639779 | Greenberg | Jan 1987 | A |
4728984 | Daniele | Mar 1988 | A |
4805020 | Greenberg | Feb 1989 | A |
4807031 | Broughton et al. | Feb 1989 | A |
4843562 | Kenyon et al. | Jun 1989 | A |
4908873 | Philibert et al. | Mar 1990 | A |
4969041 | O'Grady et al. | Nov 1990 | A |
5018767 | Wicker | May 1991 | A |
5216724 | Suzuki et al. | Jun 1993 | A |
5221833 | Hecht | Jun 1993 | A |
5243423 | DeJean et al. | Sep 1993 | A |
5284364 | Jain | Feb 1994 | A |
5337361 | Wang et al. | Aug 1994 | A |
5374976 | Spannenburg | Dec 1994 | A |
5396559 | McGrew | Mar 1995 | A |
5436970 | Ray et al. | Jul 1995 | A |
5469222 | Sprague | Nov 1995 | A |
5471533 | Wang et al. | Nov 1995 | A |
5481294 | Thomas et al. | Jan 1996 | A |
5481377 | Udagawa et al. | Jan 1996 | A |
5495581 | Tsai | Feb 1996 | A |
5505494 | Belluci et al. | Apr 1996 | A |
5515451 | Tsuji et al. | May 1996 | A |
5541741 | Suzuki | Jul 1996 | A |
5579124 | Aijala et al. | Nov 1996 | A |
5592561 | Moore | Jan 1997 | A |
5629770 | Brassil et al. | May 1997 | A |
5636292 | Rhoads | Jun 1997 | A |
5646997 | Barton | Jul 1997 | A |
5652626 | Kawakami et al. | Jul 1997 | A |
5663766 | Sizer, II | Sep 1997 | A |
5664018 | Leighton | Sep 1997 | A |
5678155 | Miyaza | Oct 1997 | A |
5679938 | Templeton et al. | Oct 1997 | A |
5721788 | Powell et al. | Feb 1998 | A |
5731880 | Takaragi et al. | Mar 1998 | A |
5737025 | Dougherty et al. | Apr 1998 | A |
5745604 | Rhoads | Apr 1998 | A |
5748763 | Rhoads | May 1998 | A |
5748783 | Rhoads | May 1998 | A |
5751854 | Saitoh et al. | May 1998 | A |
5768426 | Rhoads | Jun 1998 | A |
5772250 | Gasper | Jun 1998 | A |
5786587 | Colgate, Jr. | Jul 1998 | A |
5799092 | Kristol et al. | Aug 1998 | A |
5841886 | Rhoads | Nov 1998 | A |
5845008 | Katoh et al. | Dec 1998 | A |
5850481 | Rhoads | Dec 1998 | A |
5864623 | Messina et al. | Jan 1999 | A |
5912972 | Barton | Jun 1999 | A |
5951055 | Mowery, Jr. | Sep 1999 | A |
5982956 | Lahmi | Nov 1999 | A |
5984366 | Priddy | Nov 1999 | A |
6014453 | Sonoda et al. | Jan 2000 | A |
6024287 | Takai et al. | Feb 2000 | A |
6026193 | Rhoads | Feb 2000 | A |
6039357 | Kendrick | Mar 2000 | A |
6076738 | Bloomberg et al. | Jun 2000 | A |
6081345 | Curry | Jun 2000 | A |
6086706 | Brassil et al. | Jul 2000 | A |
6088161 | Lee | Jul 2000 | A |
6091844 | Fujii et al. | Jul 2000 | A |
6104812 | Koltai et al. | Aug 2000 | A |
6122392 | Rhoads | Sep 2000 | A |
6122403 | Rhoads | Sep 2000 | A |
6181813 | Fan et al. | Jan 2001 | B1 |
6185683 | Ginter et al. | Feb 2001 | B1 |
6188787 | Ohmae et al. | Feb 2001 | B1 |
6201616 | Sasanuma et al. | Mar 2001 | B1 |
6243480 | Zhao et al. | Jun 2001 | B1 |
6266430 | Rhoads | Jul 2001 | B1 |
6285776 | Rhoads | Sep 2001 | B1 |
6286761 | Wen | Sep 2001 | B1 |
6289108 | Rhoads | Sep 2001 | B1 |
6289125 | Katoh et al. | Sep 2001 | B1 |
6321648 | Berson et al. | Nov 2001 | B1 |
6330335 | Rhoads | Dec 2001 | B1 |
6332031 | Rhoads et al. | Dec 2001 | B1 |
6343138 | Rhoads | Jan 2002 | B1 |
6343204 | Yang | Jan 2002 | B1 |
6345104 | Rhoads | Feb 2002 | B1 |
6353672 | Rhoads | Mar 2002 | B1 |
6359985 | Koch et al. | Mar 2002 | B1 |
6363159 | Rhoads | Mar 2002 | B1 |
6370271 | Fu et al. | Apr 2002 | B2 |
6389151 | Carr et al. | May 2002 | B1 |
6400470 | Takaragi et al. | Jun 2002 | B1 |
6400827 | Rhoads | Jun 2002 | B1 |
6404898 | Rhoads | Jun 2002 | B1 |
6404925 | Foote et al. | Jun 2002 | B1 |
6408082 | Rhoads et al. | Jun 2002 | B1 |
6411392 | Bender et al. | Jun 2002 | B1 |
6427020 | Rhoads | Jul 2002 | B1 |
6430302 | Rhoads | Aug 2002 | B2 |
6433946 | Ogino | Aug 2002 | B2 |
6449379 | Rhoads | Sep 2002 | B1 |
6463416 | Messina | Oct 2002 | B1 |
6487301 | Zhao | Nov 2002 | B1 |
6496591 | Rhoads | Dec 2002 | B1 |
6505779 | Power et al. | Jan 2003 | B1 |
6515755 | Hasegawa | Feb 2003 | B1 |
6519352 | Rhoads | Feb 2003 | B2 |
6522771 | Rhoads | Feb 2003 | B2 |
6535618 | Rhoads | Mar 2003 | B1 |
6539095 | Rhoads | Mar 2003 | B1 |
6542618 | Rhoads | Apr 2003 | B1 |
6542620 | Rhoads | Apr 2003 | B1 |
6560349 | Rhoads | May 2003 | B1 |
6567534 | Rhoads | May 2003 | B1 |
6567535 | Rhoads | May 2003 | B2 |
6567780 | Rhoads | May 2003 | B2 |
6574350 | Rhoads et al. | Jun 2003 | B1 |
6580819 | Rhoads | Jun 2003 | B1 |
6587821 | Rhoads | Jul 2003 | B1 |
6590997 | Rhoads | Jul 2003 | B2 |
6614914 | Rhoads et al. | Sep 2003 | B1 |
6647129 | Rhoads | Nov 2003 | B2 |
6654480 | Rhoads | Nov 2003 | B2 |
6654887 | Rhoads | Nov 2003 | B2 |
6674886 | Davis et al. | Jan 2004 | B2 |
6675146 | Rhoads | Jan 2004 | B2 |
6681028 | Rodriguez et al. | Jan 2004 | B2 |
6694041 | Brunk | Feb 2004 | B1 |
6714594 | Dimitrova et al. | Mar 2004 | B2 |
6724912 | Carr et al. | Apr 2004 | B1 |
6738491 | Ikenoue et al. | May 2004 | B1 |
6738495 | Rhoads et al. | May 2004 | B2 |
6744907 | Rhoads | Jun 2004 | B2 |
6750985 | Rhoads | Jun 2004 | B2 |
6754377 | Rhoads | Jun 2004 | B2 |
6757406 | Rhoads | Jun 2004 | B2 |
6760464 | Brunk | Jul 2004 | B2 |
6768808 | Rhoads | Jul 2004 | B2 |
6771796 | Rhoads | Aug 2004 | B2 |
6774917 | Foote et al. | Aug 2004 | B1 |
6778682 | Rhoads | Aug 2004 | B2 |
6804377 | Reed et al. | Oct 2004 | B2 |
6804379 | Rhoads | Oct 2004 | B2 |
6827283 | Kappe et al. | Dec 2004 | B2 |
6871789 | Hilton et al. | Mar 2005 | B2 |
6882738 | Davis et al. | Apr 2005 | B2 |
6944298 | Rhoads | Sep 2005 | B1 |
6959100 | Rhoads | Oct 2005 | B2 |
6959386 | Rhoads | Oct 2005 | B2 |
6961444 | Levy | Nov 2005 | B2 |
6970573 | Carr et al. | Nov 2005 | B2 |
6978036 | Alattar et al. | Dec 2005 | B2 |
6983051 | Rhoads | Jan 2006 | B1 |
6987861 | Rhoads | Jan 2006 | B2 |
6987862 | Rhoads | Jan 2006 | B2 |
6993152 | Patterson et al. | Jan 2006 | B2 |
6993154 | Brunk | Jan 2006 | B2 |
6997482 | Mathys | Feb 2006 | B2 |
7003132 | Rhoads | Feb 2006 | B2 |
7016516 | Rhoads | Mar 2006 | B2 |
7020303 | Levy et al. | Mar 2006 | B2 |
7020349 | Brunk | Mar 2006 | B2 |
7027612 | Patterson et al. | Apr 2006 | B2 |
7027614 | Reed | Apr 2006 | B2 |
7054462 | Rhoads et al. | May 2006 | B2 |
7054463 | Rhoads et al. | May 2006 | B2 |
7055034 | Levy | May 2006 | B1 |
7076084 | Davis et al. | Jul 2006 | B2 |
7080041 | Nagel | Jul 2006 | B2 |
7113569 | Okumura et al. | Sep 2006 | B2 |
7113615 | Rhoads et al. | Sep 2006 | B2 |
7116781 | Rhoads | Oct 2006 | B2 |
7127744 | Levy | Oct 2006 | B2 |
7130087 | Rhoads | Oct 2006 | B2 |
7142691 | Levy | Nov 2006 | B2 |
7152786 | Brundage et al. | Dec 2006 | B2 |
7181022 | Rhoads | Feb 2007 | B2 |
7184570 | Rhoads | Feb 2007 | B2 |
7197164 | Levy | Mar 2007 | B2 |
7239734 | Alattar et al. | Jul 2007 | B2 |
7242790 | Rhoads | Jul 2007 | B2 |
7246239 | Rodriguez et al. | Jul 2007 | B2 |
7248715 | Levy | Jul 2007 | B2 |
7263203 | Rhoads et al. | Aug 2007 | B2 |
7266217 | Rhoads et al. | Sep 2007 | B2 |
7269275 | Carr et al. | Sep 2007 | B2 |
7277468 | Tian et al. | Oct 2007 | B2 |
7286684 | Rhoads et al. | Oct 2007 | B2 |
7305104 | Carr et al. | Dec 2007 | B2 |
7305117 | Davis et al. | Dec 2007 | B2 |
7313253 | Davis et al. | Dec 2007 | B2 |
7321667 | Stach | Jan 2008 | B2 |
7330563 | Rhoads | Feb 2008 | B2 |
7340076 | Stach et al. | Mar 2008 | B2 |
7346776 | Levy et al. | Mar 2008 | B2 |
7349555 | Rhoads | Mar 2008 | B2 |
7359528 | Rhoads | Apr 2008 | B2 |
7372976 | Rhoads et al. | May 2008 | B2 |
7415129 | Rhoads | Aug 2008 | B2 |
7418111 | Rhoads | Aug 2008 | B2 |
7424131 | Alattar et al. | Sep 2008 | B2 |
7424132 | Rhoads | Sep 2008 | B2 |
7499564 | Rhoads | Mar 2009 | B2 |
7502937 | McKinley et al. | Mar 2009 | B2 |
7532741 | Stach | May 2009 | B2 |
7536555 | Rhoads | May 2009 | B2 |
7539325 | Rhoads et al. | May 2009 | B2 |
7548643 | Davis et al. | Jun 2009 | B2 |
7555139 | Rhoads et al. | Jun 2009 | B2 |
7567686 | Rhoads | Jul 2009 | B2 |
7570784 | Alattar | Aug 2009 | B2 |
7580832 | Allamanche et al. | Aug 2009 | B2 |
7602940 | Rhoads et al. | Oct 2009 | B2 |
7602977 | Rhoads et al. | Oct 2009 | B2 |
7606390 | Rhoads | Oct 2009 | B2 |
7607016 | Brunk et al. | Oct 2009 | B2 |
7620200 | Rhoads | Nov 2009 | B2 |
7639837 | Carr et al. | Dec 2009 | B2 |
7643649 | Davis et al. | Jan 2010 | B2 |
7656930 | Tian et al. | Feb 2010 | B2 |
7672477 | Rhoads | Mar 2010 | B2 |
7676059 | Rhoads | Mar 2010 | B2 |
7693965 | Rhoads | Apr 2010 | B2 |
7697719 | Rhoads | Apr 2010 | B2 |
7702511 | Rhoads | Apr 2010 | B2 |
7711143 | Rhoads | May 2010 | B2 |
7720249 | Rhoads | May 2010 | B2 |
7720255 | Rhoads | May 2010 | B2 |
7724919 | Rhoads | May 2010 | B2 |
7763179 | Levy et al. | Jul 2010 | B2 |
7796826 | Rhoads et al. | Sep 2010 | B2 |
7831062 | Stach | Nov 2010 | B2 |
20010017709 | Murakami et al. | Aug 2001 | A1 |
20010022848 | Rhoads | Sep 2001 | A1 |
20010024510 | Iwamura | Sep 2001 | A1 |
20010026377 | Ikegami | Oct 2001 | A1 |
20010030759 | Hayashi et al. | Oct 2001 | A1 |
20020018223 | Kahikara | Feb 2002 | A1 |
20020018228 | Torigoe | Feb 2002 | A1 |
20020028021 | Foote et al. | Mar 2002 | A1 |
20020037083 | Weare et al. | Mar 2002 | A1 |
20020051237 | Ohara | May 2002 | A1 |
20020054692 | Suzuki et al. | May 2002 | A1 |
20020080995 | Rhoads | Jun 2002 | A1 |
20020097420 | Takaragi et al. | Jul 2002 | A1 |
20020126872 | Brunk et al. | Sep 2002 | A1 |
20020136429 | Stach et al. | Sep 2002 | A1 |
20020172425 | Venkatesan et al. | Nov 2002 | A1 |
20030005303 | Auslander et al. | Jan 2003 | A1 |
20030021440 | Rhoads | Jan 2003 | A1 |
20030138128 | Rhoads | Jul 2003 | A1 |
20040007625 | Kappe et al. | Jan 2004 | A1 |
20040030899 | Lee et al. | Feb 2004 | A1 |
20040057581 | Rhoads | Mar 2004 | A1 |
20040181671 | Brundage et al. | Sep 2004 | A1 |
20040263911 | Rodriguez et al. | Dec 2004 | A1 |
20050065974 | Mihcak et al. | Mar 2005 | A1 |
20050071377 | Mihcak et al. | Mar 2005 | A1 |
20050197724 | Neogi | Sep 2005 | A1 |
20060028689 | Perry et al. | Feb 2006 | A1 |
20060062386 | Rhoads | Mar 2006 | A1 |
20070016790 | Brundage et al. | Jan 2007 | A1 |
20070172098 | Rhoads et al. | Jul 2007 | A1 |
20070180251 | Carr et al. | Aug 2007 | A1 |
20070201835 | Rhoads | Aug 2007 | A1 |
20080016360 | Rodriguez et al. | Jan 2008 | A1 |
20080131083 | Rhoads | Jun 2008 | A1 |
20080131084 | Rhoads | Jun 2008 | A1 |
20080149713 | Brundage | Jun 2008 | A1 |
20080243512 | Breebart et al. | Oct 2008 | A1 |
20080253740 | Rhoads | Oct 2008 | A1 |
20080270801 | Levy et al. | Oct 2008 | A1 |
20080275906 | Rhoads et al. | Nov 2008 | A1 |
20090252401 | Davis et al. | Oct 2009 | A1 |
20100008534 | Rhoads | Jan 2010 | A1 |
20100008536 | Rhoads | Jan 2010 | A1 |
20100008537 | Rhoads | Jan 2010 | A1 |
20100021004 | Rhoads | Jan 2010 | A1 |
20100040255 | Rhoads | Feb 2010 | A1 |
20100042843 | Brunk et al. | Feb 2010 | A1 |
20100119108 | Rhoads | May 2010 | A1 |
20100131767 | Rhoads | May 2010 | A1 |
20100142752 | Rhoads et al. | Jun 2010 | A1 |
20100146285 | Rhoads et al. | Jun 2010 | A1 |
20100163629 | Rhoads et al. | Jul 2010 | A1 |
20100172538 | Rhoads | Jul 2010 | A1 |
Number | Date | Country |
---|---|---|
2943436 | May 1981 | DE |
650146 | Apr 1995 | EP |
1059800 | Dec 2000 | EP |
1122939 | Aug 2001 | EP |
824821 | Apr 2002 | EP |
711061 | May 2002 | EP |
0649074 | Apr 2005 | EP |
1691539 | Aug 2006 | EP |
2346110 | Aug 2000 | GB |
2346111 | Aug 2000 | GB |
3185585 | Aug 1991 | JP |
11265396 | Sep 1999 | JP |
WO 9513597 | May 1995 | WO |
WO 9631049 | Oct 1996 | WO |
WO 9833658 | Aug 1998 | WO |
WO 0062258 | Oct 2000 | WO |
WO 0225599 | Mar 2002 | WO |
WO 0239397 | May 2002 | WO |
WO 0239719 | May 2002 | WO |
WO 02056264 | Jul 2002 | WO |
WO 02093930 | Nov 2002 | WO |
WO 2006048368 | May 2006 | WO |
Number | Date | Country | |
---|---|---|---|
20100027969 A1 | Feb 2010 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10170223 | Jun 2002 | US |
Child | 11312247 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11825258 | Jul 2007 | US |
Child | 12534381 | US | |
Parent | 11312247 | Dec 2005 | US |
Child | 11825258 | US |