This application is related to U.S. application Ser. No. 11/088,542, filed Mar. 23, 2005, titled “Generating and Serving Tiles in a Digital Mapping System.” In addition, this application is related to U.S. application Ser. No. 11/051,534, filed Feb. 5, 2005, titled “A Digital Mapping System.” In addition, this application is related to U.S. application Ser. No. 11/181,386, filed Jul. 13, 2005, titled “Visually-Oriented Driving Directions in Digital Mapping System.” Each of these applications is herein incorporated in its entirety by reference.
The invention relates to optical character recognition (OCR), and more particularly, to database assisted OCR for images such as street scenes.
There is a current trend for capturing photographic data (pictures) of cities, streets, businesses, etc. These pictures are typically captured in a way that also captures GPS location and orientation (e.g., facing 67 degrees east). This data can then be used by mapping services, to enhance and augment the quality of the data being returned. For example, when returning a map of 123 University Avenue, Palo Alto Calif. 94301, street level pictures of this location can also be returned, which can significantly improve the user experience and the value of the map information returned.
One problem here is that the mapping from a GPS location to a street address, and vice versa, is not always very accurate. This problem can be traced to the way map data is collected. In general, the GPS location of certain “anchor” street addresses along a particular street is known, but addresses in-between these anchors are interpolated. As such, significant discrepancies can sometimes be observed between the actual GPS location of an address and the interpolated location. As a result, the street images shown by a mapping service for a particular address could end up being shifted by as much as 100 yards or more.
What is needed, therefore, are techniques that improve the accuracy of interpolated or otherwise estimated street address locations.
One embodiment of the present invention provides a method for assisting optical character recognition (OCR) of an image using a database. The method includes querying a database to identify at least one keyword corresponding to text expected to be in an image, and performing OCR of the image to determine if the keyword is present in the image. In one such configuration, the image is associated with known GPS location data, and the keyword(s) can be derived from information associated with the image, such as a business name, address, street name, or other descriptive information. The keywords are used to assist the OCR process in identifying text in the image. Another embodiment of the present invention further extends the above method, by determining, in response to determining that the keyword is present in the image, an actual GPS location associated with that keyword. In another such embodiment, the keyword is further associated a key event captured in the image (e.g., such as a touch down in a sub-titled/closed-captioned video image). In another such embodiment, querying the database identifies a number of textual and non-textual expected features. In this case, the method may further include performing image analysis of the image to determine if non-textual expected features are present. The image can be, for example, one of a photograph or video frame.
Another embodiment of the present invention provides a method for assisting optical character recognition (OCR) of a street scene image using a database. In this embodiment, the method includes querying a database to identify a feature expected in a street scene image of one or more street addresses, the street scene image associated with known GPS data. The method continues with performing OCR of the street scene image to determine if the expected feature is present in the street scene image. In response to determining that the expected feature is present, the method continues with determining an actual GPS location for a street address associated with that expected feature. The method may include updating the database to include the actual GPS location. In one particular case, querying the database identifies a number of textual and non-textual features. In such an embodiment, the method may further include performing image analysis of the street scene image to determine if non-textual expected features are present.
Another embodiment of the present invention provides a method for assisting optical character recognition (OCR) of a street scene image using a mapping system database. The method includes determining a target GPS location for a street scene image using known GPS data associated with that street scene image, estimating a street address of the target GPS location, and identifying a target address range based on the street address of the target GPS location. The method continues with querying a mapping system database to identify a business name having a street address in the target address range, and performing OCR of the street scene image to determine if key words associated with the identified business name are present. In response to determining that at least one key word associated with the identified business name is present, the method continues with determining an actual GPS location for the street address of that business name, based on the known GPS data. The method may include updating the mapping system database to include the actual GPS location. The method may include repeating the method for a number of additional target GPS locations. In one particular case, performing OCR of the street scene image to determine if key words associated with the identified business name are present further includes performing image analysis of the street scene image to determine if expected non-textual features associated with the identified business name are present. The street scene image can be, for example, a panoramic image that includes a plurality of street addresses. Alternatively, the street scene image (e.g., regular or panoramic) can be one street address. The known GPS data includes, for instance, known GPS locations for at least two locations captured in the street scene image. The mapping system database may include, for example, a business listings directory, and/or other digital mapping system data.
The features and advantages described herein are not all-inclusive and, in particular, many additional features and advantages will be apparent to one of ordinary skill in the art in view of the figures and description. Moreover, it should be noted that the language used in the specification has been principally selected for readability and instructional purposes, and not to limit the scope of the inventive subject matter.
a illustrates a typical city block that includes a number of physical addresses.
b illustrates a conventional mapping system's representation of the city block shown in
Optical character recognition (OCR) for images such as street scenes (e.g., storefronts) is generally a difficult problem because of the variety of fonts, styles, colors, sizes, orientations, occlusions and partial occlusions that can be observed in the textual content of such scenes. However, a database query can provide useful information that can assist the OCR process.
For instance, a query to a digital mapping database can provide information such as one or more businesses in a vicinity, the street name, and a range of possible addresses. In accordance with an embodiment of the present invention, this mapping information is used as prior information or constraints for an OCR engine that is interpreting the corresponding street scene. The result of the OCR process can also be used to refine or otherwise update the mapping system database, particularly if the GPS location and orientation where the picture was taken is known. The result is much greater accuracy of the digital map data provided to the user.
Example Application
Consider the following example shown in
b illustrates a conventional mapping system's representation of the city block shown in
However, a common situation is where there are only a few addresses between the anchor address of 100 and 200 (e.g., 180, 170, 168, and 164, as shown in
In more detail, and with reference to
As such, the user may be confused or otherwise have a difficult time when attempting to actually locate 164 University Ave. This problem is exacerbated on longer streets and streets that have one or more breaks in the middle. In the latter case, it is possible that the returned map data provided to the user could send the user to the wrong section of the street. If the user does not know that the street continues after a break (e.g., to allow for a park or large campus), then that user may conclude that the target street address does not actually exist.
As will be apparent in light of this disclosure, database assisted OCR can be used to significantly improve this situation. For instance, assume a collection of images or photographs taken between 100 University Ave and 200 University Ave are available. Alternatively, assume a wide panorama image showing the entire city block between 100 and 200 University Ave is available. In any such case, a significant amount of existing database information is known about the images. For instance, a mapping database (e.g., Navteq or Google Local) would indicate that the street numbers are all even numbers ranging in numerical order between 100 and 200. Furthermore, actual street numbers are known. In addition, business names at these addresses are known, as well as the order that these businesses occur along the street.
This existing database information can be used as a set of constraints for an OCR engine specifically trained to work on city scenes. For example, a list of constraints (such as the mentioned existing database information) could be used by an OCR engine to reduce the problem to word spotting (i.e., is this word or number detected in this image?). Alternatively, or in addition to, Hidden Markov Models (HMM) and other statistical approaches can be used to provide a set of constraints, as used in OCR applications such as forms recognition.
Through such a constrained OCR approach, a much refined mapping from street addresses to GPS locations is provided. Numerous benefits can be realized, including refinement of the underlying database (e.g., Navteq), and improved user experience (the right images would be displayed for each street address). In addition, this approach as described herein could be used as a more efficient and cost-effective process to collect Navteq-type data. Note that this approach is not limited to digital pictures and mapping systems but could also be used for video data, or panorama images of the style currently produced for the CityBlock Project at Stanford University.
System Architecture
In the embodiment shown in
During on-line operations, requests (e.g., HTTP) for map data (e.g., written and graphical driving directions, maps, local data, etc.) are received by the digital mapping system 215. The request can be initiated, for example, by a user engaging a web browser of a computing device to access the system. In response to such a client request, the digital mapping system 215 accesses the map data database 210 and integrates the relevant map data into the response to the request. This map data can then be served to the requestor via a network (e.g., Internet or local area network) and web browser of the requestor's computing device.
The digital mapping system 215 can be implemented with conventional or custom technology. The map data database 210 can also be implemented with conventional or custom technology (e.g., for storing Navteq and/or Google Local map data). In one particular embodiment, the digital mapping system 215 and map data database 210 are implemented as described in the previously incorporated U.S. application Ser. No. 11/088,542. The remote client (not shown) receives the requested graphical map data, and requests any map tiles it doesn't already have displayed or cached (e.g., as explained in the previously incorporated U.S. application Ser. No. 11/051,534). When the tiles are received from the server side of the digital mapping system, the client draws and displays the map, along with the driving directions. The client side can also be used to draw (e.g., overlay) graphical driving directions, location markers, etc on the map image. However, the present invention is not intended to be limited to systems that provide tile-based maps. Rather, embodiments of the present invention can also be used with other mapping systems, such as non-tile vector-based and raster-based mapping systems. Still other embodiments of the present invention can be used to provide database assisted OCR for applications other than digital mapping systems.
For instance, consider a system for analyzing video that includes sub-titles (including closed-captioning). In this embodiment, the database for assisting the OCR process would include the sub-titles for each frame of video (and other textual information, such as “laughter” or “explosion”). Here, the OCR engine would be constrained, for example, to look for sub-titled dialog in the frames of video. Once the OCR process identifies the target sub-titled text, the frame and/or time associated with that text could be noted. Such an application might be useful, for example, in the context of a smart video playback system. In more detail, assume a sports fan that has video recorded the broadcast of a game with closed-captioning enabled (to textually capture the commentary). A playback system configured in accordance with an embodiment of the present invention would include a database storing the commentary transcript of the game, or an even more refined data collection, such as a set of key event terms (e.g., “touch down,” “home run,” “goal,” “score,” “unsportsmanlike conduct,” “4th and goal,” “punt,” “double play,” “interception,” etc). An OCR engine would then search for the transcript text or key event terms (or other expected features) in the frames of sub-titled video. Transcript pages or key events could then be correlated to video frames for quick reference. The smart video playback system could then be trained to only play frames leading up to (and just after) the frames where a significant event occurred.
Street Scene Image OCR Module
As can be seen, the module 205 includes a storefront image database 305, a business listings database 310, an image registration module 315, an optical character recognition (OCR) module 320, a target address range estimator module 325, and a target GPS calculator module 330. Numerous variations on this configuration for performing database assisted OCR will be apparent in light of this disclosure, and the present invention is not intended to be limited to any one such embodiment.
In operation at preprocessing time (off-line), the street scene image OCR module 205 employs one or more databases of street scene images (e.g., storefront image database 305), together with one or more corresponding databases of business listings (e.g., business listings database 310) and/or map data databases (e.g., map data database 210). Each database can be structured to facilitate efficient access of data, and include various types of information. For example, each street-level image (e.g., digital photograph taken using a GPS-enable camera) stored in the storefront image database 305 can be indexed by geocode, and associated with corresponding GPS coordinates. The business listings database 310 and map data database 210 can be structured, for example, as conventionally done.
In an alternative embodiment, the illustrated databases are integrated into a single database that is accessed to assist the OCR process. Also, other databases or information sets could be included, such as a conventional residential listings (e.g., white pages directory) database or other such listing service databases. Further note that the image databases may include multiple views and/or zoom levels of each photographed area. For instance, one storefront image can be taken from an angle as it would be seen from one direction of the street (e.g., traveling north), while another storefront image of the same address could be taken from an angle as it would be seen from the other direction of the street (e.g., traveling south). Thus, depending on the driving direction route, either image could be used.
The storefront image database 305 can store different kinds of images. In one example embodiment, there are two primary modes in which the system 205 can operate: mode 1 and mode 2. Either mode can be used, or a combination of the modes can be used.
Mode 1 uses panoramic images, where a single panoramic image captures multiple street addresses (e.g., one city block, or a string of contiguous address locations on a street), such as shown in
If so desired, exact GPS coordinates of every pixel or vertical line in a panoramic image can be known. In more detail, a differential GPS antenna on a moving vehicle can be employed, along with wheel speed sensors, inertial measurement unit, and other sensors, which together, enable a very accurate GPS coordinate to be computed for every pixel in the panorama. However, such high accuracy is not required. As long as GPS coordinates at some regularly sampled points (such as street corners) are known, sufficiently accurate GPS coordinates of locations in-between could be interpolated, as previously discussed.
Mode 2 uses more traditional imagery, such as digital pictures taken with regular digital cameras, or any camera that generates images upon which OCR can be performed (e.g., disposable cameras). In this mode, a single set of GPS coordinates is known for each picture, corresponding to the exact location where each picture was taken. Each picture corresponds to one particular street address. Thus, given a series of such picture/GPS data pairs, exact GPS coordinates are known for each corresponding address location on that street. Alternatively, the end pictures of a series can be associated with known GPS data, so that the GPS data for the in-between addresses can be estimated with reasonable accuracy.
The image registration module 320 is programmed or otherwise configured to construct a mapping between images and business listings. In one embodiment, this mapping is accomplished by a combination of image segmentation using standard image-processing techniques (e.g., edge detection, etc.) and interpolation of a business's street address within the range of street addresses known to be contained in the image. Image registration can be done for the street scene images stored in the storefront image database 305, and any other images that can be used in the OCR image analysis process (e.g., such as satellite images). The mapping can be implemented, for example, with a pointer or address scheme that effectively connects images from an image database to listings in the business listings database. Alternatively, a single database can be built as the image registration process is carried out, where the records of the single database are indexed by geocode and/or GPS coordinates, and each record includes image data and related business listings information.
In the embodiment shown, image processing (e.g., OCR) is performed by accessing the images by way of the image registration module 315 (e.g., which can access the images stored in the database 305 using a pointer or addressing scheme). Other embodiments can access the images directly from their respective databases. In any case, once a target address range is known, images associated with that range can be identified and subjected to image processing using the OCR module 320, to determine actual GPS location data for each of the addresses detected in the images.
The target address range provided to the OCR module 320 can be determined using the target GPS calculator module 330 and the target address range estimator module 325. In more detail, actual GPS location data associated with a particular image is provided to the target GPS calculator module 330 from, for example, the storefront image database 305 or the image registration module 315. This actual GPS location data can be, for instance, known GPS data associated with two anchor points of an image (e.g., such as discussed with reference to 100 and 200 University Ave of
In any such case, when two actual GPS coordinates are known, the target GPS calculator module 330 can use that known GPS data to calculate any in-between GPS data. For instance, a target GPS location (GPStarget) at the midpoint between two known actual GPS locations (GPS1 and GPS2) can be calculated using linear interpolation (e.g., GPStarget=[|GPS1−GPS2|/2]+GPS1). This is particularly useful for panoramic images that include multiple address locations between two anchor points (as is the case sometimes in mode 1). Likewise, this calculation is useful for a contiguous series of single address images, where only the images at that beginning and end of the series have GPS location data (as is the case sometimes in mode 2). In short, if the actual target GPS location data is not known, it can be interpolated or otherwise calculated based on known GPS location data. If the target GPS location data is already known, then no calculation by module 330 would be necessary.
The target GPS location data (whether previously known or calculated by module 330) is then provided to the target address range estimator module 325, which uses the target GPS location data to estimate a target address range. For instance, the target GPS location data can be used to identify a corresponding address in a table lookup operation (e.g., of database 305 or module 315). Once the corresponding address is identified, the business listings database 310 can be queried to return a number (e.g., 10) of addresses before that corresponding address, and a number (e.g., 10) of addresses after that corresponding address, so as to provide a range of target addresses. Alternatively (or in addition to), the map data database 210 can be queried to return the set of addresses before that corresponding address, and the set of addresses after that corresponding address, so as to provide the range of target addresses.
In another embodiment, the target address range estimator module 325 can estimate the target address range using interpolation. For example, if the target address is somewhere in the middle of the city block shown in
In any case, once the target address range is determined, then the available databases can be queried to provide information that can be used to constrain the OCR process. For instance, the business listings database 310 can be queried to identify the store names at the addresses included in the target address range. Alternatively, the map data database 210 can be queried to identify the store names at the addresses included in the target address range. Alternatively, both databases 210 and 310 can be queried to identify the store names, and the results can then be cross-checked for correlation and to identify business names missing from one of the databases. Each of these results can be used an expected feature for constraining the OCR process.
The OCR module 320 can now be applied to the storefront image or images to read the storefront signage (if any) and other readable imagery, using OCR algorithms and techniques as further improved by the present invention. As previously explained, the OCR process can be constrained based on the query results of the databases 205 and/or 310. In one particular embodiment, the OCR module 320 is constrained by the business names returned from the database query or queries. For instance, the OCR module 320 can be constrained to look for text such as “McDonalds,” “Fry's Electronics,” “H&R Block,” and “Pizza Hut.” The OCR module 320 can also be constrained, for example, by identifying the type of store or stores in the target address range, based on the corresponding category listings in the business listings database 310 (e.g., “bars and restaurants” or “flowers” as done in a conventional yellow pages directory). Recall that the image registration module 315 has already mapped the images to corresponding listings within the business listings database 310, thereby facilitating this context identification for the OCR process. In addition, text related to that business listings category can be obtained, for example, by accessing web sites of stores in that category, and adjusting the language model used for OCR module 320, accordingly. This supplemental information from the map database 210 and/or business listings database 310, and/or websites enables the OCR module 335 to be further informed of the context in which it is operating (in addition to knowing the store names for which it is searching).
In one particular configuration, the constrained OCR search can be carried out using a template matching technique. In more detail, for each expected feature to be used for a given image, at least one identification template is generated. The identification templates can be bitmaps, vectors, splines, or other representations of the expected feature. For any given expected feature, a number of different templates can be constructed in various font types, or font sizes, or font styles. Further, where the expected feature has a predetermined and consistently used font style, shape, or other form (e.g., the specific font used for “McDonald's”), then this font is used for the generation of the identification templates. As the OCR module processes the image, image features are compared with at least one of the identification templates. The OCR module then uses the results of the comparison to make the OCR determination.
For instance, suppose that one of the candidate words being searched for in an image is “165”. In this case, a number of bitmap renditions of “165” could be generated at various scales and using various fonts to form the identification templates. Then, features of the image could be compared to the renditions, to see if that numerical pattern was in the image. Such approaches work particularly well, for example, for identifying street numbers, where the range of fonts is relatively limited. There are numerous such template matching approaches that can be used, as will be apparent in light of this disclosure. Along the same lines, another way to constrain the OCR is by using a “digits only” lexicon or language pack. This limits the search to street numbers only (or other numeric patterns), but because of the constraint introduced, greater accuracy is achieved. In one such embodiment, the image can be binarized using, for example, the Niblack approach (e.g., Wayne Niblack, An Introduction to Image Processing, Prentice-Hall, Englewood Cliffs, NJ, 1986, pp. 115-116, which is herein incorporated in its entirety by reference), and then running a commercial OCR package (e.g., Abbyy FineReader) with a digits-only lexicon. Other such image processing techniques can be used as well.
In addition to OCR, the OCR module 335 can also be programmed or otherwise configured to further analyze storefront images. In one embodiment, this supplemental image analysis is carried out at both a coarse level (e.g., width, height, color histograms) and a more refined level (e.g., segmentation into facade, doors, windows, roof, architectural elements such as pillars and balconies; decorative elements such as awnings, signage, neon lights, painted designs). Such analysis can carried out, for example, using standard image-processing techniques (e.g., computer vision). Standard feature extraction algorithms typically extract high level information from images, such as shapes, colors, etc. Pattern recognition algorithms can then be applied to classify the extracted information so as to “recognize” objects in the storefront images. The patterns and other features identified during this supplemental image analysis may be helpful, for instance, where a particular storefront indicated in an image does not include any helpful text that can be identified by OCR processing.
For instance, the supplemental image analysis can be used to identify trade dress and logos. In more detail, the image processing constraints provided from the databases 210 and/or 310 might include store names (e.g., McDonalds and Pizza Hut) as well as known trade dress and logos corresponding to those store names (e.g., Golden Arches for McDonalds and the unique-shaped red roof for Pizza Hut). Thus, the OCR module 320 can be looking for “McDonalds” and “Pizza Hut”, while supplemental image analysis can be looking for the Golden Arches and the unique red roof design. Note that the supplemental image analysis can be programmed into the OCR module 320, or can exist independently as a distinct module. The various types of image analysis can be carried out in parallel, if so desired.
Once the OCR module 320 identifies targeted features (e.g., business names and/or other targeted text, symbols, colors, graphics, logos, etc) in the image, then the known GPS coordinate(s) associated with that image can then be assigned to the corresponding addresses determined by the target address range estimator module 325. As such, each address captured in the image will now have actual GPS coordinates (as opposed to interpolated or otherwise estimated). This actual GPS location data can then be integrated into the map data database 210 (or other databases) to further improve its accuracy.
Thus, efficient and effective OCR on images of natural scenes is enabled. This efficiency and effectiveness is derived from constraints learned from database queries to one or more databases or other information stores (e.g., websites). Numerous variations and applications will be apparent in light of this disclosure. One such application is to use database assisted OCR techniques described herein to implement or otherwise complement a digital mapping system, such as the one described in the previously incorporated U.S. application Ser. No. 11/181,386, thereby enabling the service of highly accurate and visually-oriented driving directions.
Methodology
For this example, assume a street scene image being analyzed includes a number of address location, including two address locations having known GPS locations, with some address locations therebetween having unknown GPS locations. The method begins with determining 405 a target GPS location using anchor addresses and/or other addresses having known GPS locations, as previously explained (e.g., GPStarget=[|GPS1−GPS2|/2]+GPS1). Note that this equation can be repeated a number of times to find multiple target GPS locations (e.g., GPStarget1=[|GPS1−GPS2|/2]+GPS1); GPStarget2=[|GPS1−GPStarget1|/2]+GPS1); GPStarget3=[|GPS1−GPStarget2|/2]+GPS1). The resolution of calculated target GPS locations will depend on the particular street being analyzed. In one embodiment, a GPS location is calculated for every 3 meters of the actual street.
The method continues with estimating 410 an address of the target GPS location (e.g., [100+200]/2=150, with respect to the University Ave example of
The method continues with querying 420 the map database to identify business names having a street address in target address range. The method continues with performing 425 OCR of the street scene image to determine if key words (and/or other descriptive features, as previously explained) associated with the identified business names are present.
In response to determining that a keyword is present, the method continues with determining 430 an actual GPS location for the street address of that particular business name (as indicated by detected the keywords). The method continues with updating 435 the map database to include the correct GPS location for the street address of that business. The method then continues with determining 440 if there are more target GPS locations to analyze. If so, then the method repeats for each particular target GPS location. If there are no more target GPS locations to analyze, then the method concludes.
Variations on this embodiment will be apparent in light of this disclosure. For instance, another embodiment is a method. for assisting OCR of an image using a database of expected keywords (and/or other expected data). Here, the method includes querying the database (any storage facility) to identify at least one keyword corresponding to text expected to be in an image, and performing OCR of the image to determine if the keyword is present in the image. As an alternative to OCR (or in addition to OCR), image analysis may be performed to identify if expected non-textual features retrieved from the database are included in the image.
The foregoing description of the embodiments of the invention has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed. Many modifications and variations are possible in light of this disclosure. It is intended that the scope of the invention be limited not by this detailed description, but rather by the claims appended hereto.
Number | Name | Date | Kind |
---|---|---|---|
4972319 | DeLorme | Nov 1990 | A |
5051928 | Gruters | Sep 1991 | A |
5559707 | DeLorme et al. | Sep 1996 | A |
5579471 | Barber et al. | Nov 1996 | A |
5613051 | Iodice et al. | Mar 1997 | A |
5615324 | Kuboyama | Mar 1997 | A |
5646751 | Motamed et al. | Jul 1997 | A |
5724579 | Suzuki | Mar 1998 | A |
5737533 | de Hond | Apr 1998 | A |
5760783 | Migdal et al. | Jun 1998 | A |
5768633 | Allen et al. | Jun 1998 | A |
5802492 | DeLorme et al. | Sep 1998 | A |
5848373 | DeLorme et al. | Dec 1998 | A |
5884247 | Christy | Mar 1999 | A |
5910805 | Hickey et al. | Jun 1999 | A |
5926116 | Kitano et al. | Jul 1999 | A |
5938709 | Hale et al. | Aug 1999 | A |
6002809 | Feig | Dec 1999 | A |
6023241 | Clapper | Feb 2000 | A |
6031963 | Kitamura et al. | Feb 2000 | A |
6054990 | Tran | Apr 2000 | A |
6055536 | Shimakawa et al. | Apr 2000 | A |
6098015 | Nimura et al. | Aug 2000 | A |
6100897 | Mayer et al. | Aug 2000 | A |
6111583 | Yaron et al. | Aug 2000 | A |
6144338 | Davies | Nov 2000 | A |
6148105 | Wakisaka et al. | Nov 2000 | A |
6167382 | Sparks et al. | Dec 2000 | A |
6181817 | Zabih et al. | Jan 2001 | B1 |
6182010 | Berstis | Jan 2001 | B1 |
6202026 | Nimura | Mar 2001 | B1 |
6208626 | Brewer | Mar 2001 | B1 |
6208934 | Bechtolsheim | Mar 2001 | B1 |
6233523 | Sood | May 2001 | B1 |
6247019 | Davies | Jun 2001 | B1 |
6252608 | Snyder et al. | Jun 2001 | B1 |
6262741 | Davies | Jul 2001 | B1 |
6266614 | Alumbaugh | Jul 2001 | B1 |
6272231 | Maurer et al. | Aug 2001 | B1 |
6278938 | Alumbaugh | Aug 2001 | B1 |
6301370 | Steffens et al. | Oct 2001 | B1 |
6307573 | Barros | Oct 2001 | B1 |
6321158 | DeLorme et al. | Nov 2001 | B1 |
6346938 | Chan et al. | Feb 2002 | B1 |
6388684 | Iwamura | May 2002 | B1 |
6393147 | Danneels et al. | May 2002 | B2 |
6421053 | Johns et al. | Jul 2002 | B1 |
6470264 | Bide | Oct 2002 | B2 |
6473691 | Winter et al. | Oct 2002 | B1 |
6496189 | Yaron et al. | Dec 2002 | B1 |
6504571 | Narayanaswami et al. | Jan 2003 | B1 |
6538656 | Cheung et al. | Mar 2003 | B1 |
6573905 | MacInnis et al. | Jun 2003 | B1 |
6724382 | Kenyon et al. | Apr 2004 | B2 |
6826472 | Kamei et al. | Nov 2004 | B1 |
7016532 | Boncyk et al. | Mar 2006 | B2 |
7054741 | Harrison et al. | May 2006 | B2 |
7136915 | Rieger, III | Nov 2006 | B2 |
7210119 | Pothos et al. | Apr 2007 | B2 |
7260474 | Thayathil et al. | Aug 2007 | B1 |
7353034 | Haney | Apr 2008 | B2 |
7373244 | Kreft | May 2008 | B2 |
7451041 | Laumeyer et al. | Nov 2008 | B2 |
7542882 | Agrawala et al. | Jun 2009 | B2 |
7565240 | Tomizawa | Jul 2009 | B2 |
7580045 | Harrison et al. | Aug 2009 | B2 |
7610219 | Sayed | Oct 2009 | B2 |
7617296 | Bank | Nov 2009 | B2 |
20010032070 | Teicher | Oct 2001 | A1 |
20010034661 | Ferreira | Oct 2001 | A1 |
20010044837 | Talib et al. | Nov 2001 | A1 |
20020002478 | Swart et al. | Jan 2002 | A1 |
20020049728 | Kaku | Apr 2002 | A1 |
20020055957 | Ohsawa | May 2002 | A1 |
20020067353 | Kenyon et al. | Jun 2002 | A1 |
20020067374 | Kenyon | Jun 2002 | A1 |
20020067379 | Kenyon et al. | Jun 2002 | A1 |
20020089524 | Ikeda | Jul 2002 | A1 |
20020095328 | Swart et al. | Jul 2002 | A1 |
20020099613 | Swart et al. | Jul 2002 | A1 |
20020101568 | Eberl et al. | Aug 2002 | A1 |
20020102966 | Lev et al. | Aug 2002 | A1 |
20020103813 | Frigon | Aug 2002 | A1 |
20020140988 | Cheatle et al. | Oct 2002 | A1 |
20020156866 | Schneider | Oct 2002 | A1 |
20020159657 | DeLorme | Oct 2002 | A1 |
20020184203 | Naster et al. | Dec 2002 | A1 |
20020187774 | Ritter et al. | Dec 2002 | A1 |
20030041087 | Pothos et al. | Feb 2003 | A1 |
20030044068 | Kagehiro et al. | Mar 2003 | A1 |
20030044608 | Yoshizawa et al. | Mar 2003 | A1 |
20030050065 | Alletson et al. | Mar 2003 | A1 |
20030061211 | Shultz et al. | Mar 2003 | A1 |
20030078897 | Florance et al. | Apr 2003 | A1 |
20030164819 | Waibel | Sep 2003 | A1 |
20030182052 | DeLorme et al. | Sep 2003 | A1 |
20040004616 | Konya et al. | Jan 2004 | A1 |
20040128215 | Florance et al. | Jul 2004 | A1 |
20040153434 | Cogen et al. | Aug 2004 | A1 |
20040208372 | Boncyk et al. | Oct 2004 | A1 |
20050041862 | Lo | Feb 2005 | A1 |
20050065856 | Roberts et al. | Mar 2005 | A1 |
20050131634 | Ignatin | Jun 2005 | A1 |
20050171686 | Davis | Aug 2005 | A1 |
20050216287 | Crosby et al. | Sep 2005 | A1 |
20050216448 | Talib et al. | Sep 2005 | A1 |
20050246487 | Ergan et al. | Nov 2005 | A1 |
20050246627 | Sayed | Nov 2005 | A1 |
20050270299 | Rasmussen et al. | Dec 2005 | A1 |
20050270311 | Rasmussen et al. | Dec 2005 | A1 |
20050286493 | Angelhag | Dec 2005 | A1 |
20060012677 | Neven et al. | Jan 2006 | A1 |
20060017562 | Bachelder | Jan 2006 | A1 |
20060026202 | Isberg et al. | Feb 2006 | A1 |
20060041375 | Witmer et al. | Feb 2006 | A1 |
20060075442 | Meadow | Apr 2006 | A1 |
20060123053 | Scannell | Jun 2006 | A1 |
20060173841 | Bill | Aug 2006 | A1 |
20060200383 | Arutunian et al. | Sep 2006 | A1 |
20060241859 | Kimchi et al. | Oct 2006 | A1 |
20060271286 | Rosenberg | Nov 2006 | A1 |
20070010942 | Bill | Jan 2007 | A1 |
20070011145 | Snyder | Jan 2007 | A1 |
20070022007 | Lawe | Jan 2007 | A1 |
20070050340 | Von Kaenel et al. | Mar 2007 | A1 |
20070073583 | Grouf et al. | Mar 2007 | A1 |
20070073584 | Grouf et al. | Mar 2007 | A1 |
20070100801 | Celik et al. | May 2007 | A1 |
20070100802 | Celik | May 2007 | A1 |
20070100867 | Celik et al. | May 2007 | A1 |
20070106468 | Eichenbaum et al. | May 2007 | A1 |
20070154067 | Laumeyer et al. | Jul 2007 | A1 |
20070156524 | Grouf et al. | Jul 2007 | A1 |
20070156525 | Grouf et al. | Jul 2007 | A1 |
20070179867 | Glazer et al. | Aug 2007 | A1 |
20070192189 | Popowich et al. | Aug 2007 | A1 |
20070198182 | Singh | Aug 2007 | A1 |
20070203643 | Ramaswamy et al. | Aug 2007 | A1 |
20070239348 | Cheung | Oct 2007 | A1 |
20070244753 | Grouf et al. | Oct 2007 | A1 |
20070265858 | Pansari et al. | Nov 2007 | A1 |
20080027642 | Winberry et al. | Jan 2008 | A1 |
20080040212 | Grouf et al. | Feb 2008 | A1 |
20080052150 | Grouf et al. | Feb 2008 | A1 |
20080052151 | Xie et al. | Feb 2008 | A1 |
20100185514 | Glazer et al. | Jul 2010 | A1 |
Number | Date | Country |
---|---|---|
2169421 | Nov 1996 | CA |
101 10 979 | Sep 2002 | DE |
0 920 179 | Jun 1999 | EP |
0 944 019 | Sep 1999 | EP |
0967556 | Dec 1999 | EP |
61-135270 (A) | Jun 1986 | JP |
2000-029448 (A) | Jan 2000 | JP |
2002-032280 (A) | Jan 2002 | JP |
2003-208597 (A) | Jul 2003 | JP |
WO 0104790 | Jan 2001 | WO |
WO 02082799 | Oct 2002 | WO |
WO 03001435 | Jan 2003 | WO |
WO 03041000 | May 2003 | WO |
WO 2004038613 | May 2004 | WO |
WO 2005114476 | Dec 2005 | WO |
Number | Date | Country | |
---|---|---|---|
20070140595 A1 | Jun 2007 | US |