Camera based distance measurements

Information

  • Patent Grant
  • 12142005
  • Patent Number
    12,142,005
  • Date Filed
    Wednesday, October 13, 2021
    3 years ago
  • Date Issued
    Tuesday, November 12, 2024
    2 months ago
  • Inventors
  • Original Assignees
    • AUTOBRAINS TECHNOLOGIES LTD
  • Examiners
    • Krasnic; Bernard
    Agents
    • Reches PATENTS
Abstract
Systems, and method and computer readable media that store instructions for distance measurement, the method may include obtaining, from a camera of a vehicle, an image of a surroundings of the vehicle; searching, within the image, for an anchor, wherein the anchor is associated with at least one physical dimension of a known value; and when finding the anchor, determining a distance between the camera and the anchor based on, (a) the at least one physical dimension of a known value, (b) an appearance of the at least one physical dimension of a known value in the image, and (c) a distance-to-appearance relationship that maps appearances to distances, wherein the distance-to-appearance relationship is generated by a calibration process that comprises obtaining one or more calibration images of the anchor, and obtaining one or more distance measurements to the anchor.
Description
BACKGROUND

The three primary autonomous vehicle (AV) sensors are camera, radar and lidar.


Working together, they provide to the AV information about its surroundings and help the AV detect the speed and distance of nearby objects, as well as their three-dimensional shape.


Lidar-based systems provide a real time visualization of the surroundings of the AC based on the distance of each laser point. A computer of the lidar-based system translates the points into a three dimensions (3D) representation and is able to identify other vehicles, humans, roads, buildings, and the like, as a means of enabling the AV to navigate in its surroundings in a safe manner.


The cost of lidar-based system is very high—in order of few magnitude higher than the cost of a cameras—thereby preventing the installation of lidar-based system in most vehicles.


There is a growing need to provide a system that is cost effective and have the capability to generate depth information.


SUMMARY

There may be provided systems, methods and computer readable medium as illustrated in the specification.





BRIEF DESCRIPTION OF THE DRAWINGS

The embodiments of the disclosure will be understood and appreciated more fully from the following detailed description, taken in conjunction with the drawings in which:



FIG. 1 illustrates an example of a method;



FIG. 2 illustrates an example of a method;



FIG. 3 illustrates an example of images and dimensions of anchors;



FIG. 4 illustrates an example of images and dimensions of anchors;



FIG. 5 illustrates an example of a calibration vehicle and its surroundings; and



FIG. 6 illustrates an example of a vehicle and its surroundings.





DESCRIPTION OF EXAMPLE EMBODIMENTS

In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of the invention. However, it will be understood by those skilled in the art that the present invention may be practiced without these specific details. In other instances, well-known methods, procedures, and components have not been described in detail so as not to obscure the present invention.


The subject matter regarded as the invention is particularly pointed out and distinctly claimed in the concluding portion of the specification. The invention, however, both as to organization and method of operation, together with objects, features, and advantages thereof, may best be understood by reference to the following detailed description when read with the accompanying drawings.


It will be appreciated that for simplicity and clarity of illustration, elements shown in the figures have not necessarily been drawn to scale. For example, the dimensions of some of the elements may be exaggerated relative to other elements for clarity. Further, where considered appropriate, reference numerals may be repeated among the figures to indicate corresponding or analogous elements.


Because the illustrated embodiments of the present invention may for the most part, be implemented using electronic components and circuits known to those skilled in the art, details will not be explained in any greater extent than that considered necessary as illustrated above, for the understanding and appreciation of the underlying concepts of the present invention and in order not to obfuscate or distract from the teachings of the present invention.


Any reference in the specification to a method should be applied mutatis mutandis to a device or system capable of executing the method and/or to a non-transitory computer readable medium that stores instructions for executing the method.


Any reference in the specification to a system or device should be applied mutatis mutandis to a method that may be executed by the system, and/or may be applied mutatis mutandis to non-transitory computer readable medium that stores instructions executable by the system.


Any reference in the specification to a non-transitory computer readable medium should be applied mutatis mutandis to a device or system capable of executing instructions stored in the non-transitory computer readable medium and/or may be applied mutatis mutandis to a method for executing the instructions.


Any combination of any module or unit listed in any of the figures, any part of the specification and/or any claims may be provided.


The specification and/or drawings may refer to an image. Any reference to an image should be applied mutatis mutandis to a video stream or to one or more images.


The specification and/or drawings may refer to a processor. The processor may be a processing circuitry. The processing circuitry may be implemented as a central processing unit (CPU), and/or one or more other integrated circuits such as application-specific integrated circuits (ASICs), field programmable gate arrays (FPGAs), full-custom integrated circuits, etc., or a combination of such integrated circuits.


Any combination of any steps of any method illustrated in the specification and/or drawings may be provided.


Any combination of any subject matter of any of claims may be provided.


Any combinations of systems, units, components, processors, sensors, illustrated in the specification and/or drawings may be provided.


The analysis of content of a media unit may be executed by generating a signature of the media unit and by comparing the signature to reference signatures. The reference signatures may be arranged in one or more concept structures or may be arranged in any other manner. The signatures may be used for object detection or for any other use.


The term “substantially” means insignificant deviation—for example differences that do not exceed few percent of a value, differences that are below the accuracy and/or resolution related to the face recognition process. What is substantially may be defined in any manner


An active sensor is a sensor that emits radiation during the sensing process. The radiation may be a light radiation (lidar), radio frequency radiation (radar), acoustic waves (sonar), and the like.


The terms first cameras and second camera are used to indicate that the camera used during a calibration process may differ from the camera used after the calibration process—or may be the same camera.


For simplicity of explanation it is assumed that the active sensor is a lidar.


There may be provide a system, method and a non-transitory computer readable medium for obtaining depth information using images acquired by a camera. The camera is a two-dimensional camera and should not be a three dimensional camera—such as a stereoscopic camera.


The method obtains a mapping between anchors and their appearance in an image to a distance from the camara. An anchor is an object associated with at least one physical dimension of a known value.


The association may mean that the at least one physical dimension is at least one dimension of the object.


The at least one dimension of the object may be any dimension—for example a height, a length, a width, a radius, a diagonal, of the object or any part of the object, and the like. For example—a dimension of a known value of a zebra crossing may be its width.


The association may mean that the at least one physical dimension is a spatial relationship (for example distance) related to parts of the object. For example—a dimension of a known value of a zebra crossing may be a distance between same colored stripes.


The association may mean that the at least one physical dimension is indicative of a spatial relationship (for example—a distance between, an overlap, and the like) between the object to another object. For example—a dimension of a known value of a zebra crossing stripe may be a distance between same colored stripes. Yet for another example—the distance between adjacent road separators


The at least one physical dimension of is of known value may of an exact value may be known (for example—a width of an object may be 40 centimeters).


The at least one physical dimension of is of known value may be within a certain range (for example—a Caucasian adult may have a height that ranges between 160 to 210 centimeters). Larger ranges may reduce the distance determination accuracy—but may be better than having no distance estimate at all.


An anchor may be determined in any manner—for example from a predefined list, based on metadata associated with a description of the anchor, and the like.


Non-limiting examples of anchors are traffic signs, different types of traffic light (types refer to different models, different number of lights, and the like), zebra crossings, road spacers, vehicles of a specific model, different types of pedestrians (child, adult, race), and the like.


There may be provide a system, method and a non-transitory computer readable medium that perform a calibration process or receive the outcome of the calibration process.


The calibration process involves using a camera and an active sensor such as a lidar.


This is followed by obtaining one or more images of a camera, and determining distance information based on the outcome of the calibration process and the appearance of one or more anchors in the one or more images.



FIG. 1 illustrates a calibration method 100.


Method 100 may start by step 110 of receiving information regarding one or more anchors. The information may include an identifier for identifying each object that serves as anchor and the at least one physical dimension of a known value associated with each anchor.


Step 110 may be followed by step 120.


Step 120 may include obtaining multiple calibration images by a second camera and acquiring distance information associated with the calibration images by a an active sensor such as a lidar.


The distance information may be lidar images or any other information regarding distances. The lidar images and the calibration images may be taken concurrently or at least before changing the distance between the camera and its environment.


The distance information is acquired while there is a known spatial relationship between the second camera and the lidar. The second camera and the lidar may be located at the same location, but this is not necessarily so.


The second camera is a two-dimensional camera and not a 3D camera.


The multiple calibration images capture the one or more anchors. Each calibration images may capture at least one of the one or more anchors. Assuming that there are multiple anchors—any of the multiple calibration images may include one, some or all of the multiple anchors. For example—one calibration image may include a first anchor, a second calibration image may include a second anchor, a third calibration image may include the first and second anchors, and the like.


At least some of the multiple calibration images may be acquired at different distances from the camera. Thus—one or more calibration images may be acquired at a same distance.


Step 120 may be followed by step 130 of detecting the one or more anchors within the multiple calibration images and obtaining a distance measurement (by the lidar) to the one or more anchors within the multiple calibration images.


Step 130 may include performing one or more distance measurements by an active sensor while utilizing a spatial relationship (aligned or at least with known mapping) between pixels of the images acquired by the active sensor and pixels of the one or more calibration images, to detect the anchor in the images acquired by the active sensor.


The lidar and the second camera can be aligned so that the field of view of the lidar and the second camera are the same.


In this case, once an anchor is detected within a calibration image (acquired by the second camera), its location within the lidar image is also known—and the distance measurement related to this anchor can be taken from the lidar image.


This alignment may eliminate the need to detect the anchor in the lidar image.


Step 130 may include performing one or more distance measurements by an active sensor, and searching the anchor in one or more images acquired by the active sensor and searching for the anchor, by applying an object detection algorithm, in the one or more calibration images.


The lidar and the second camera can be misaligned—but the mapping between pixels of the calibration images and the lidar images should be known—so that the location of the anchor in the lidar image can be deducted from the location of the anchor in the calibration image and the mapping.


This mapping may eliminate the need to detect the anchor in the lidar image.


According to another example—the second camera and the lidar may operate independently from each other—even without alignment of known mapping between pixels.


In this case the lidar images should be processed to detect the anchors within the lidar images.


This is followed by associating the distance information provided from the lidar images to the anchors in the calibration images.


Step 130 may be followed by step 140 of generating a distance-to-appearance relationship that maps appearances to distances.


The appearance of a dimension of a known value in an image may be the size of the dimension within the image—for example the number of pixels in an image that represent the dimension. For example—a traffic light of a known width appears in an image as a box of H×W pixels, so the appearance is W pixels.


The outcome of step 120 is multiple tuples of (appearance of an anchor having a dimension of known value, distance to the anchor), and the distance-to-appearance relationship may be generated during step 130 by any function capable of generating a mapping from multiple instances of tuples.



FIG. 2 illustrates method 200.


Method 200 may start by step 210 of obtaining, from a camera of a vehicle, an image of a surroundings of the vehicle.


The surrounding of the vehicle is any content within the field of view of the camera.


Step 210 may be followed by step 220 of searching, within the image, for an anchor, wherein the anchor is associated with at least one physical dimension of a known value.


Step 220 may be followed by step 230 of determining (when finding an anchor) a distance between the camera and the anchor based on, (a) the at least one physical dimension of a known value, (b) an appearance of the at least one physical dimension of a known value in the image, and (c) a distance-to-appearance relationship that maps appearances to distances.


The distance-to-appearance relationship may be generated by a calibration process that may include obtaining one or more calibration images of the anchor, and obtaining one or more distance measurements to the anchor.


Method 100 is an example of such as calibration process.


Method 200 may include method 100—for example as a preliminary step.


The one or more calibration images are multiple calibration images acquired at different distances from a second camera, and wherein the one or more distance measurements are indicative of the different distances. The executing of the calibration process may include calculating the distance-to-appearance relationship based on the appearances of the at least one physical dimension of a known value in the multiple calibration images and the different distances.


The one or more distance measurements may be executed by an active sensor, wherein the executing of the calibration process comprises searching the anchor in one or more images acquired by the active sensor and searching for the anchor, by applying an object detection algorithm, in the one or more calibration images.


The one or more distance measurements may be executed by an active sensor, wherein the executing of the calibration process comprises utilizing a spatial relationship between pixels of the images acquired by the active sensor and pixels of the one or more calibration images, to detect the anchor in the images acquired by the active sensor.


Step 220 may include approximating the anchor by a bounding box, and measuring at least one dimension of the bounding box to provide a value indicative of the appearance of the at least one physical dimension of the known value in the image.


An example of defining a bounding box is illustrated in U.S. patent application Ser. No. 16/544,940 filing date Aug. 20, 2019 which is incorporated herein by reference.



FIGS. 3 and 4 illustrates various images that include various anchors and some dimensions of known value.



FIG. 3 illustrates a first image 11 in which a give away sign 21 has a known width (for example 26 cm) that appears in the first image as a line of N1 pixels. In second image 12 the same give away sign 21 of the same known width appears as line of N2 pixels.


Assuming that the first and second images are acquired during the calibration process and at different distances (as measured by an active sensor) from the give away sign—these different distances and different appearances may be used for calculating the distance-to-appearance relationship.


Alternatively, assuming that the first and second images were acquired after the calibration process—then the appearance of the give away sign may provide an estimate of the distance of the give away sign from the vehicle at each moment.


It should be noted that if an image includes multiple anchors—then the distance to multiple points within the image may be calculated—based on the distances of these anchors, and their location in the image—for example by extrapolation. It should be noted that the latter may also be based on expected optical characteristics of the camera such as distortions.



FIG. 4 illustrates examples of possible dimensions of known value—for example diameter of a no entry sign 22, width of the give way sign 2,1 height of an adult, zebra crossing width, width of zebra crossing stripe, distance between zebra crossing stripes of the same color.



FIG. 5 illustrates a calibration process vehicle 90 that performs a calibration process. Active sensor 91 performs a distance measurement 93 to a give way sign that is also located within the field of view 94 of the camera 92.



FIG. 6 illustrates vehicle 90′ that does not have an active sensor.


The vehicle 90′ may also include camera 92, a processor 99, a vehicle controller 98, a memory unit 97, one or more vehicle computers—such autonomous driving controller or ADAS computer 96, and a communication unit 95 for communicating with other vehicles and/or a remote computer system such as a cloud computer.


The memory unit may store any data structure such as a distance to appearance relationship database, and the like.


The figure also illustrates a give way sign that has a certain width that appears as N3 pixels—indicating that it is at a distance of D3 from the camera—according to the distance to appearance relationship database 89.


While the foregoing written description of the invention enables one of ordinary skill to make and use what is considered presently to be the best mode thereof, those of ordinary skill will understand and appreciate the existence of variations, combinations, and equivalents of the specific embodiment, method, and examples herein. The invention should therefore not be limited by the above described embodiment, method, and examples, but by all embodiments and methods within the scope and spirit of the invention as claimed.


In the foregoing specification, the invention has been described with reference to specific examples of embodiments of the invention. It will, however, be evident that various modifications and changes may be made therein without departing from the broader spirit and scope of the invention as set forth in the appended claims.


Moreover, the terms “front,” “back,” “top,” “bottom,” “over,” “under” and the like in the description and in the claims, if any, are used for descriptive purposes and not necessarily for describing permanent relative positions. It is understood that the terms so used are interchangeable under appropriate circumstances such that the embodiments of the invention described herein are, for example, capable of operation in other orientations than those illustrated or otherwise described herein.


Furthermore, the terms “assert” or “set” and “negate” (or “deassert” or “clear”) are used herein when referring to the rendering of a signal, status bit, or similar apparatus into its logically true or logically false state, respectively. If the logically true state is a logic level one, the logically false state is a logic level zero. And if the logically true state is a logic level zero, the logically false state is a logic level one.


Those skilled in the art will recognize that the boundaries between logic blocks are merely illustrative and that alternative embodiments may merge logic blocks or circuit elements or impose an alternate decomposition of functionality upon various logic blocks or circuit elements. Thus, it is to be understood that the architectures depicted herein are merely exemplary, and that in fact many other architectures may be implemented which achieve the same functionality.


Any arrangement of components to achieve the same functionality is effectively “associated” such that the desired functionality is achieved. Hence, any two components herein combined to achieve a particular functionality may be seen as “associated with” each other such that the desired functionality is achieved, irrespective of architectures or intermedial components. Likewise, any two components so associated can also be viewed as being “operably connected,” or “operably coupled,” to each other to achieve the desired functionality.


Furthermore, those skilled in the art will recognize that boundaries between the above described operations merely illustrative. The multiple operations may be combined into a single operation, a single operation may be distributed in additional operations and operations may be executed at least partially overlapping in time. Moreover, alternative embodiments may include multiple instances of a particular operation, and the order of operations may be altered in various other embodiments.


Also for example, in one embodiment, the illustrated examples may be implemented as circuitry located on a single integrated circuit or within the same device. Alternatively, the examples may be implemented as any number of separate integrated circuits or separate devices interconnected with each other in a suitable manner


However, other modifications, variations and alternatives are also possible. The specifications and drawings are, accordingly, to be regarded in an illustrative rather than in a restrictive sense.


In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word ‘comprising’ does not exclude the presence of other elements or steps then those listed in a claim. Furthermore, the terms “a” or “an,” as used herein, are defined as one or more than one. Also, the use of introductory phrases such as “at least one” and “one or more” in the claims should not be construed to imply that the introduction of another claim element by the indefinite articles “a” or “an” limits any particular claim containing such introduced claim element to inventions containing only one such element, even when the same claim includes the introductory phrases “one or more” or “at least one” and indefinite articles such as “a” or “an.” The same holds true for the use of definite articles. Unless stated otherwise, terms such as “first” and “second” are used to arbitrarily distinguish between the elements such terms describe. Thus, these terms are not necessarily intended to indicate temporal or other prioritization of such elements. The mere fact that certain measures are recited in mutually different claims does not indicate that a combination of these measures cannot be used to advantage.


While certain features of the invention have been illustrated and described herein, many modifications, substitutions, changes, and equivalents will now occur to those of ordinary skill in the art. It is, therefore, to be understood that the appended claims are intended to cover all such modifications and changes as fall within the true spirit of the invention.


It is appreciated that various features of the embodiments of the disclosure which are, for clarity, described in the contexts of separate embodiments may also be provided in combination in a single embodiment. Conversely, various features of the embodiments of the disclosure which are, for brevity, described in the context of a single embodiment may also be provided separately or in any suitable sub-combination.


It will be appreciated by persons skilled in the art that the embodiments of the disclosure are not limited by what has been particularly shown and described hereinabove. Rather the scope of the embodiments of the disclosure is defined by the appended claims and equivalents thereof.

Claims
  • 1. A method for distance measurement, the method comprises: obtaining, from a camera of a vehicle, an image of a surroundings of the vehicle;searching, within the image, for an anchor, wherein the anchor is associated with at least one physical dimension of a known value;when finding the anchor, determining a distance between the camera and the anchor based on, (a) the at least one physical dimension of a known value, (b) an appearance of the at least one physical dimension of a known value in the image, and (c) a distance-to-appearance relationship that maps appearances to distances, wherein the distance-to-appearance relationship is generated by a calibration process that comprises obtaining one or more calibration images of the anchor, and obtaining one or more distance measurements to the anchor;wherein the method further comprises executing the calibration process;wherein the camera is a first camara, the one or more calibration images are multiple calibration images acquired at different distances from a second camera;wherein the one or more distance measurements are indicative of the different distances; andwherein the executing of the calibration process comprises calculating the distance-to-appearance relationship based on the appearances of the at least one physical dimension of a known value in the multiple calibration images and the different distances.
  • 2. The method according to claim 1, wherein the one or more distance measurements are executed by an active sensor, wherein the executing of the calibration process comprises searching the anchor in one or more images acquired by the active sensor and searching for the anchor, by applying an object detection algorithm, in the one or more calibration images.
  • 3. The method according to claim 1, wherein the one or more distance measurements are executed by an active sensor, wherein the executing of the calibration process comprises utilizing a spatial relationship between pixels of the images acquired by the active sensor and pixels of the one or more calibration images, to detect the anchor in the images acquired by the active sensor.
  • 4. The method according to claim 1 wherein the at least one physical dimension of a known value of the anchor is a dimension of the anchor.
  • 5. The method according to claim 1 wherein the at least one physical dimension of a known value of the anchor is a distance between the anchor and another anchor.
  • 6. The method according to claim 1 comprising approximating the anchor by a bounding box, and measuring at least one dimension of the bounding box to provide a value indicative of the appearance of the at least one physical dimension of the known value in the image.
  • 7. A non-transitory computer readable medium that stores instructions executable by a processor for: obtaining, from a camera of a vehicle, an image of a surroundings of the vehicle;searching, within the image, for an anchor, wherein the anchor is associated with at least one physical dimension of a known value;when finding the anchor, determining a distance between the camera and the anchor based on, (a) the at least one physical dimension of a known value, (b) an appearance of the at least one physical dimension of a known value in the image, and (c) a distance-to-appearance relationship that maps appearances to distances, wherein the distance-to-appearance relationship is generated by a calibration process that comprises obtaining one or more calibration images of the anchor, and obtaining one or more distance measurements to the anchor; andexecuting the calibration process;wherein the camera is a first camara, the one or more calibration images are multiple calibration images acquired at different distances from a second camera;wherein the one or more distance measurements are indicative of the different distances; andwherein the executing of the calibration process comprises calculating the distance-to-appearance relationship based on the appearances of the at least one physical dimension of a known value in the multiple calibration images and the different distances.
  • 8. The non-transitory computer readable medium according to claim 7 wherein the one or more distance measurements are executed by an active sensor, wherein the executing of the calibration process comprises searching the anchor in one or more images acquired by the active sensor and searching for the anchor, by applying an object detection algorithm, in the one or more calibration images.
  • 9. The non-transitory computer readable medium according to claim 7 wherein the one or more distance measurements are executed by an active sensor, wherein the executing of the calibration process comprises utilizing a spatial relationship between pixels of the images acquired by the active sensor and pixels of the one or more calibration images, to detect the anchor in the images acquired by the active sensor.
  • 10. The non-transitory computer readable medium according to claim 7 wherein the at least one physical dimension of a known value of the anchor is a dimension of the anchor.
  • 11. The non-transitory computer readable medium according to claim 7 wherein the at least one physical dimension of a known value of the anchor is a distance between the anchor and another anchor.
  • 12. The non-transitory computer readable medium according to claim 7 that stores instructions executable by a processor for approximating the anchor by a bounding box, and measuring at least one dimension of the bounding box to provide a value indicative of the appearance of the at least one physical dimension of the known value in the image.
  • 13. A computerized system comprising a processor that is configured to: receive, from a camera of a vehicle, an image of a surroundings of the vehicle;search, within the image, for an anchor, wherein the anchor is associated with at least one physical dimension of a known value;when finding the anchor, determine a distance between the camera and the anchor based on, (a) the at least one physical dimension of a known value, (b) an appearance of the at least one physical dimension of a known value in the image, and (c) a distance-to-appearance relationship that maps appearances to distances, wherein the distance-to-appearance relationship is generated by a calibration process that comprises obtaining one or more calibration images of the anchor, and obtaining one or more distance measurements to the anchor; andexecute the calibration process;wherein the camera is a first camara, the one or more calibration images are multiple calibration images acquired at different distances from a second camera,wherein the one or more distance measurements are indicative of the different distances; andwherein the executing of the calibration process comprises calculating the distance-to-appearance relationship based on the appearances of the at least one physical dimension of a known value in the multiple calibration images and the different distances.
  • 14. The computerized system according to claim 13 wherein the one or more distance measurements are executed by an active sensor, wherein the processor is configured to execute the calibration process by searching the anchor in one or more images acquired by the active sensor and searching for the anchor, by applying an object detection algorithm, in the one or more calibration images.
  • 15. The computerized system according to claim 13 wherein the one or more distance measurements are executed by an active sensor, wherein the processor is configured to execute the calibration process by utilizing a spatial relationship between pixels of the images acquired by the active sensor and pixels of the one or more calibration images, to detect the anchor in the images acquired by the active sensor.
  • 16. The computerized system according to claim 13 wherein the at least one physical dimension of a known value of the anchor is a dimension of the anchor.
  • 17. The computerized system according to claim 13 wherein the at least one physical dimension of a known value of the anchor is a distance between the anchor and another anchor.
US Referenced Citations (579)
Number Name Date Kind
4601395 Juvinall et al. Jul 1986 A
4733353 Jaswa Mar 1988 A
4932645 Schorey et al. Jun 1990 A
4972363 Nguyen et al. Nov 1990 A
5078501 Hekker et al. Jan 1992 A
5214746 Fogel et al. May 1993 A
5307451 Clark Apr 1994 A
5369773 Hammerstrom Nov 1994 A
5412564 Ecer May 1995 A
5436653 Ellis et al. Jul 1995 A
5568181 Greenwood et al. Oct 1996 A
5638425 Meador, I et al. Jun 1997 A
5745678 Herzberg et al. Apr 1998 A
5754938 Herz et al. May 1998 A
5763069 Jordan Jun 1998 A
5806061 Chaudhuri et al. Sep 1998 A
5835087 Herz et al. Nov 1998 A
5835901 Duvoisin et al. Nov 1998 A
5852435 Vigneaux et al. Dec 1998 A
5870754 Dimitrova et al. Feb 1999 A
5873080 Coden et al. Feb 1999 A
5887193 Takahashi et al. Mar 1999 A
5926812 Hilsenrath et al. Jul 1999 A
5978754 Kumano Nov 1999 A
5991306 Burns et al. Nov 1999 A
5999637 Toyoda et al. Dec 1999 A
6052481 Grajski et al. Apr 2000 A
6070167 Qian et al. May 2000 A
6076088 Paik et al. Jun 2000 A
6122628 Castelli et al. Sep 2000 A
6128651 Cezar Oct 2000 A
6137911 Zhilyaev Oct 2000 A
6144767 Bottou et al. Nov 2000 A
6147636 Gershenson Nov 2000 A
6163510 Lee et al. Dec 2000 A
6243375 Speicher Jun 2001 B1
6243713 Nelson et al. Jun 2001 B1
6275599 Adler et al. Aug 2001 B1
6314419 Faisal Nov 2001 B1
6329986 Cheng Dec 2001 B1
6381656 Shankman Apr 2002 B1
6411229 Kobayashi Jun 2002 B2
6422617 Fukumoto et al. Jul 2002 B1
6459991 Takiguchi et al. Oct 2002 B1
6507672 Watkins et al. Jan 2003 B1
6523046 Liu et al. Feb 2003 B2
6524861 Anderson Feb 2003 B1
6546405 Gupta et al. Apr 2003 B2
6550018 Abonamah et al. Apr 2003 B1
6557042 He et al. Apr 2003 B1
6594699 Sahai et al. Jul 2003 B1
6601026 Appelt et al. Jul 2003 B2
6611628 Sekiguchi et al. Aug 2003 B1
6618711 Ananth Sep 2003 B1
6643620 Contolini et al. Nov 2003 B1
6643643 Lee et al. Nov 2003 B1
6665657 Dibachi Dec 2003 B1
6681032 Bortolussi et al. Jan 2004 B2
6704725 Lee Mar 2004 B1
6732149 Kephart May 2004 B1
6742094 Igari May 2004 B2
6751363 Natsev et al. Jun 2004 B1
6751613 Lee et al. Jun 2004 B1
6754435 Kim Jun 2004 B2
6763069 Divakaran et al. Jul 2004 B1
6763519 McColl et al. Jul 2004 B1
6774917 Foote et al. Aug 2004 B1
6795818 Lee Sep 2004 B1
6804356 Krishnamachari Oct 2004 B1
6813395 Kinjo Nov 2004 B1
6819797 Smith et al. Nov 2004 B1
6877134 Fuller et al. Apr 2005 B1
6901207 Watkins May 2005 B1
6938025 Lulich et al. Aug 2005 B1
6985172 Rigney et al. Jan 2006 B1
7013051 Sekiguchi et al. Mar 2006 B2
7020654 Najmi Mar 2006 B1
7023979 Wu et al. Apr 2006 B1
7043473 Rassool et al. May 2006 B1
7158681 Persiantsev Jan 2007 B2
7215828 Luo May 2007 B2
7260564 Lynn et al. Aug 2007 B1
7289643 Brunk et al. Oct 2007 B2
7299261 Oliver et al. Nov 2007 B1
7302089 Smits Nov 2007 B1
7302117 Sekiguchi et al. Nov 2007 B2
7313805 Rosin et al. Dec 2007 B1
7340358 Yoneyama Mar 2008 B2
7346629 Kapur et al. Mar 2008 B2
7353224 Chen et al. Apr 2008 B2
7376672 Weare May 2008 B2
7383179 Alves et al. Jun 2008 B2
7433895 Li et al. Oct 2008 B2
7464086 Black et al. Dec 2008 B2
7529659 Wold May 2009 B2
7577656 Kawai et al. Aug 2009 B2
7657100 Gokturk et al. Feb 2010 B2
7660468 Gokturk et al. Feb 2010 B2
7805446 Potok et al. Sep 2010 B2
7860895 Scofield et al. Dec 2010 B1
7872669 Darrell et al. Jan 2011 B2
7921288 Hildebrand Apr 2011 B1
7933407 Keidar et al. Apr 2011 B2
8023739 Hohimer et al. Sep 2011 B2
8026944 Sah Sep 2011 B1
8266185 Raichelgauz et al. Sep 2012 B2
8285718 Ong et al. Oct 2012 B1
8312031 Raichelgauz et al. Nov 2012 B2
8315442 Gokturk et al. Nov 2012 B2
8345982 Gokturk et al. Jan 2013 B2
8386400 Raichelgauz et al. Feb 2013 B2
8396876 Kennedy et al. Mar 2013 B2
8418206 Bryant et al. Apr 2013 B2
8442321 Chang et al. May 2013 B1
8457827 Ferguson et al. Jun 2013 B1
8495489 Everingham Jul 2013 B1
8635531 Graham et al. Jan 2014 B2
8655801 Raichelgauz et al. Feb 2014 B2
8655878 Kulkarni et al. Feb 2014 B1
RE44963 Shannon Jun 2014 E
8799195 Raichelgauz et al. Aug 2014 B2
8799196 Raichelquaz et al. Aug 2014 B2
8818916 Raichelgauz et al. Aug 2014 B2
8868861 Shimizu et al. Oct 2014 B2
8886648 Procopio et al. Nov 2014 B1
8954887 Tseng et al. Feb 2015 B1
8990199 Ramesh et al. Mar 2015 B1
9009086 Raichelgauz et al. Apr 2015 B2
9104747 Raichelgauz et al. Aug 2015 B2
9165406 Gray et al. Oct 2015 B1
9235557 Raichelgauz et al. Jan 2016 B2
9286623 Raichelgauz et al. Mar 2016 B2
9311308 Sankarasubramaniam et al. Apr 2016 B2
9323754 Ramanathan et al. Apr 2016 B2
9392324 Maltar et al. Jul 2016 B1
9416499 Cronin et al. Aug 2016 B2
9466068 Raichelgauz et al. Oct 2016 B2
9646006 Raichelgauz et al. May 2017 B2
9679062 Schillings et al. Jun 2017 B2
9807442 Bhatia et al. Oct 2017 B2
9863928 Peterson et al. Jan 2018 B1
9875445 Amer et al. Jan 2018 B2
9953533 Graves Apr 2018 B1
9953535 Canavor et al. Apr 2018 B1
9984369 Li et al. May 2018 B2
10048700 Curlander et al. Aug 2018 B1
10157291 Kenthapadi et al. Dec 2018 B1
10235882 Aoude et al. Mar 2019 B1
10253468 Linville et al. Apr 2019 B1
10395332 Konrardy et al. Aug 2019 B1
10414398 Ochi Sep 2019 B2
10416670 Fields et al. Sep 2019 B1
10417914 Vose et al. Sep 2019 B1
10467893 Soryal et al. Nov 2019 B1
10545023 Herbach et al. Jan 2020 B1
10684626 Martin Jun 2020 B1
10916124 Geisler Feb 2021 B2
10922788 Yu et al. Feb 2021 B1
10967877 Asakura et al. Apr 2021 B2
20010019633 Tenze et al. Sep 2001 A1
20010034219 Hewitt et al. Oct 2001 A1
20010038876 Anderson Nov 2001 A1
20020004743 Kutaragi et al. Jan 2002 A1
20020010682 Johnson Jan 2002 A1
20020010715 Chinn et al. Jan 2002 A1
20020019881 Bokhari et al. Feb 2002 A1
20020032677 Morgenthaler et al. Mar 2002 A1
20020038299 Zernik et al. Mar 2002 A1
20020042914 Walker et al. Apr 2002 A1
20020072935 Rowse et al. Jun 2002 A1
20020087530 Smith et al. Jul 2002 A1
20020087828 Arimilli et al. Jul 2002 A1
20020091947 Nakamura Jul 2002 A1
20020107827 Benitez-Jimenez et al. Aug 2002 A1
20020113812 Walker et al. Aug 2002 A1
20020126002 Patchell Sep 2002 A1
20020126872 Brunk et al. Sep 2002 A1
20020129140 Peled et al. Sep 2002 A1
20020147637 Kraft et al. Oct 2002 A1
20020157116 Jasinschi Oct 2002 A1
20020163532 Thomas et al. Nov 2002 A1
20020174095 Lulich et al. Nov 2002 A1
20020181336 Shields Dec 2002 A1
20020184505 Mihcak et al. Dec 2002 A1
20030004966 Bolle et al. Jan 2003 A1
20030005432 Ellis et al. Jan 2003 A1
20030037010 Schmelzer Feb 2003 A1
20030041047 Chang et al. Feb 2003 A1
20030089216 Birmingham et al. May 2003 A1
20030093790 Logan et al. May 2003 A1
20030101150 Agnihotri et al. May 2003 A1
20030105739 Essafi et al. Jun 2003 A1
20030110236 Yang et al. Jun 2003 A1
20030115191 Copperman et al. Jun 2003 A1
20030126147 Essafi et al. Jul 2003 A1
20030140257 Peterka et al. Jul 2003 A1
20030145002 Kleinberger et al. Jul 2003 A1
20030158839 Faybishenko et al. Aug 2003 A1
20030165269 Fedorovskaya et al. Sep 2003 A1
20030174859 Kim Sep 2003 A1
20030184598 Graham Oct 2003 A1
20030200217 Ackerman Oct 2003 A1
20030217335 Chung et al. Nov 2003 A1
20030229531 Heckerman et al. Dec 2003 A1
20040095376 Graham et al. May 2004 A1
20040098671 Graham et al. May 2004 A1
20040111432 Adams et al. Jun 2004 A1
20040117638 Monroe Jun 2004 A1
20040128511 Sun et al. Jul 2004 A1
20040153426 Nugent Aug 2004 A1
20040162820 James et al. Aug 2004 A1
20040257233 Proebsting Dec 2004 A1
20040267774 Lin et al. Dec 2004 A1
20050021394 Miedema et al. Jan 2005 A1
20050080788 Murata Apr 2005 A1
20050114198 Koningstein et al. May 2005 A1
20050131884 Gross et al. Jun 2005 A1
20050149369 Sevdermish Jul 2005 A1
20050163375 Grady Jul 2005 A1
20050172130 Roberts Aug 2005 A1
20050177372 Wang et al. Aug 2005 A1
20050193093 Mathew et al. Sep 2005 A1
20050226511 Short Oct 2005 A1
20050238198 Brown et al. Oct 2005 A1
20050238238 Xu et al. Oct 2005 A1
20050249398 Khamene et al. Nov 2005 A1
20050256820 Dugan et al. Nov 2005 A1
20050262428 Little et al. Nov 2005 A1
20050281439 Lange Dec 2005 A1
20050289163 Gordon et al. Dec 2005 A1
20050289590 Cheok et al. Dec 2005 A1
20060004745 Kuhn et al. Jan 2006 A1
20060015580 Gabriel et al. Jan 2006 A1
20060020958 Allamanche et al. Jan 2006 A1
20060033163 Chen Feb 2006 A1
20060050993 Stentiford Mar 2006 A1
20060069668 Braddy et al. Mar 2006 A1
20060074588 Blodgett et al. Apr 2006 A1
20060080311 Potok et al. Apr 2006 A1
20060093190 Cheng et al. May 2006 A1
20060112035 Cecchi et al. May 2006 A1
20060129822 Snijder et al. Jun 2006 A1
20060217818 Fujiwara Sep 2006 A1
20060217828 Hicken Sep 2006 A1
20060218191 Gopalakrishnan Sep 2006 A1
20060224529 Kermani Oct 2006 A1
20060236343 Chang Oct 2006 A1
20060242130 Sadri et al. Oct 2006 A1
20060248558 Barton et al. Nov 2006 A1
20060251338 Gokturk et al. Nov 2006 A1
20060253423 McLane et al. Nov 2006 A1
20060267975 Moses et al. Nov 2006 A1
20060288002 Epstein et al. Dec 2006 A1
20070022374 Huang et al. Jan 2007 A1
20070033170 Sull et al. Feb 2007 A1
20070038614 Guha Feb 2007 A1
20070042757 Jung et al. Feb 2007 A1
20070061302 Ramer et al. Mar 2007 A1
20070067304 Ives Mar 2007 A1
20070074147 Wold Mar 2007 A1
20070081088 Gotoh et al. Apr 2007 A1
20070083611 Farago et al. Apr 2007 A1
20070091106 Moroney Apr 2007 A1
20070130159 Gulli et al. Jun 2007 A1
20070136782 Ramaswamy et al. Jun 2007 A1
20070156720 Maren Jul 2007 A1
20070244902 Seide et al. Oct 2007 A1
20070253594 Lu et al. Nov 2007 A1
20070282513 Michi et al. Dec 2007 A1
20070294187 Scherrer Dec 2007 A1
20070298152 Baets Dec 2007 A1
20080006615 Rosario et al. Jan 2008 A1
20080049789 Vedantham et al. Feb 2008 A1
20080071465 Chapman et al. Mar 2008 A1
20080072256 Boicey et al. Mar 2008 A1
20080079729 Brailovsky Apr 2008 A1
20080152231 Gokturk et al. Jun 2008 A1
20080159622 Agnihotri et al. Jul 2008 A1
20080161986 Breed Jul 2008 A1
20080165018 Breed Jul 2008 A1
20080165861 Wen et al. Jul 2008 A1
20080201299 Lehikoinen et al. Aug 2008 A1
20080201314 Smith et al. Aug 2008 A1
20080201361 Castro et al. Aug 2008 A1
20080228749 Brown Sep 2008 A1
20080228995 Tan et al. Sep 2008 A1
20080237359 Silverbrook et al. Oct 2008 A1
20080247543 Mick et al. Oct 2008 A1
20080253737 Kimura et al. Oct 2008 A1
20080263579 Mears et al. Oct 2008 A1
20080270373 Oostveen et al. Oct 2008 A1
20080294278 Borgeson et al. Nov 2008 A1
20080307454 Ahanger et al. Dec 2008 A1
20080313140 Pereira et al. Dec 2008 A1
20090024641 Quigley et al. Jan 2009 A1
20090037088 Taguchi Feb 2009 A1
20090043637 Eder Feb 2009 A1
20090096634 Emam et al. Apr 2009 A1
20090125544 Brindley May 2009 A1
20090157575 Schobben et al. Jun 2009 A1
20090165031 Li et al. Jun 2009 A1
20090172030 Schiff et al. Jul 2009 A1
20090208106 Dunlop et al. Aug 2009 A1
20090208118 Csurka Aug 2009 A1
20090216761 Raichelgauz et al. Aug 2009 A1
20090220138 Zhang et al. Sep 2009 A1
20090232361 Miller Sep 2009 A1
20090234878 Herz et al. Sep 2009 A1
20090245573 Saptharishi et al. Oct 2009 A1
20090254572 Redlich et al. Oct 2009 A1
20090282218 Raichelgauz et al. Nov 2009 A1
20090297048 Slotine et al. Dec 2009 A1
20100010751 Blodgett et al. Jan 2010 A1
20100010752 Blodgett et al. Jan 2010 A1
20100030474 Sawada Feb 2010 A1
20100035648 Huang Feb 2010 A1
20100042646 Raichelgauz et al. Feb 2010 A1
20100049374 Ferrin et al. Feb 2010 A1
20100082684 Churchill et al. Apr 2010 A1
20100104184 Bronstein et al. Apr 2010 A1
20100125569 Nair et al. May 2010 A1
20100161652 Bellare et al. Jun 2010 A1
20100162405 Cook et al. Jun 2010 A1
20100191391 Zeng Jul 2010 A1
20100198626 Cho et al. Aug 2010 A1
20100212015 Jin et al. Aug 2010 A1
20100262609 Raichelgauz et al. Oct 2010 A1
20100284604 Chrysanthakopoulos Nov 2010 A1
20100293057 Haveliwala et al. Nov 2010 A1
20100312736 Kello Dec 2010 A1
20100318493 Wessling Dec 2010 A1
20100325138 Lee et al. Dec 2010 A1
20100325581 Finkelstein et al. Dec 2010 A1
20110035373 Berg et al. Feb 2011 A1
20110055585 Lee Mar 2011 A1
20110060496 Nielsen et al. Mar 2011 A1
20110077028 Wilkes, III et al. Mar 2011 A1
20110164180 Lee Jul 2011 A1
20110164810 Zang et al. Jul 2011 A1
20110190972 Timmons et al. Aug 2011 A1
20110216209 Fredlund et al. Sep 2011 A1
20110218946 Stern et al. Sep 2011 A1
20110276680 Rimon Nov 2011 A1
20110296315 Lin et al. Dec 2011 A1
20110307542 Wang et al. Dec 2011 A1
20120041969 Priyadarshan et al. Feb 2012 A1
20120131454 Shah May 2012 A1
20120136853 Kennedy et al. May 2012 A1
20120155726 Li et al. Jun 2012 A1
20120167133 Carroll et al. Jun 2012 A1
20120179642 Sweeney et al. Jul 2012 A1
20120185445 Borden et al. Jul 2012 A1
20120207346 Kohli et al. Aug 2012 A1
20120219191 Benzarti et al. Aug 2012 A1
20120221470 Lyon Aug 2012 A1
20120227074 Hill et al. Sep 2012 A1
20120239690 Asikainen et al. Sep 2012 A1
20120239694 Avner et al. Sep 2012 A1
20120265735 McMillan et al. Oct 2012 A1
20120294514 Saunders et al. Nov 2012 A1
20120299961 Ramkumar et al. Nov 2012 A1
20120301105 Rehg et al. Nov 2012 A1
20120331011 Raichelgauz et al. Dec 2012 A1
20130043990 Al-Jafar Feb 2013 A1
20130066856 Ong et al. Mar 2013 A1
20130067364 Berntson et al. Mar 2013 A1
20130086499 Dyor et al. Apr 2013 A1
20130089248 Remiszewski et al. Apr 2013 A1
20130151522 Aggarwal et al. Jun 2013 A1
20130159298 Mason et al. Jun 2013 A1
20130211705 Geelen et al. Aug 2013 A1
20130226930 Arngren et al. Aug 2013 A1
20130227023 Raichelgauz et al. Aug 2013 A1
20130283401 Pabla et al. Oct 2013 A1
20130346412 Raichelgauz et al. Dec 2013 A1
20140019264 Wachman et al. Jan 2014 A1
20140025692 Pappas Jan 2014 A1
20140037138 Sato et al. Feb 2014 A1
20140125703 Roveta et al. May 2014 A1
20140139670 Kesavan et al. May 2014 A1
20140147829 Jerauld May 2014 A1
20140149918 Asokan et al. May 2014 A1
20140152698 Kim et al. Jun 2014 A1
20140156691 Conwell Jun 2014 A1
20140169681 Drake Jun 2014 A1
20140176604 Venkitaraman et al. Jun 2014 A1
20140193077 Shiiyama et al. Jul 2014 A1
20140195093 Litkouhi et al. Jul 2014 A1
20140198986 Marchesotti Jul 2014 A1
20140201126 Zadeh et al. Jul 2014 A1
20140201330 Lopez et al. Jul 2014 A1
20140236414 Droz et al. Aug 2014 A1
20140247342 Ellenby et al. Sep 2014 A1
20140250032 Huang et al. Sep 2014 A1
20140282655 Roberts Sep 2014 A1
20140288453 Liu et al. Sep 2014 A1
20140300722 Garcia Oct 2014 A1
20140328512 Gurwicz et al. Nov 2014 A1
20140330830 Raichelgauz et al. Nov 2014 A1
20140341476 Kulick et al. Nov 2014 A1
20140363044 Williams et al. Dec 2014 A1
20150052089 Kozloski et al. Feb 2015 A1
20150057869 Healey et al. Feb 2015 A1
20150071457 Burciu Mar 2015 A1
20150100562 Kohlmeier et al. Apr 2015 A1
20150117784 Lin et al. Apr 2015 A1
20150120627 Hunzinger et al. Apr 2015 A1
20150120760 Wang et al. Apr 2015 A1
20150123968 Holverda et al. May 2015 A1
20150127516 Studnitzer et al. May 2015 A1
20150130643 Nagy May 2015 A1
20150153735 Clarke et al. Jun 2015 A1
20150166069 Engelman et al. Jun 2015 A1
20150190284 Censo et al. Jul 2015 A1
20150203116 Fairgrieve et al. Jul 2015 A1
20150213325 Krishnamoorthi et al. Jul 2015 A1
20150224988 Buerkle et al. Aug 2015 A1
20150248586 Gaidon et al. Sep 2015 A1
20150254344 Kulkarni et al. Sep 2015 A1
20150266455 Wilson Sep 2015 A1
20150286742 Zhang et al. Oct 2015 A1
20150286872 Medioni et al. Oct 2015 A1
20150293976 Guo et al. Oct 2015 A1
20150324356 Gutierrez et al. Nov 2015 A1
20150332588 Bulan et al. Nov 2015 A1
20160007083 Gurha Jan 2016 A1
20160026707 Ong et al. Jan 2016 A1
20160046298 Deruyck et al. Feb 2016 A1
20160078339 Li et al. Mar 2016 A1
20160127641 Gove May 2016 A1
20160132194 Grue et al. May 2016 A1
20160133130 Grimm et al. May 2016 A1
20160142625 Weksler et al. May 2016 A1
20160193996 Stefan Jul 2016 A1
20160221592 Puttagunta et al. Aug 2016 A1
20160275766 Venetianer et al. Sep 2016 A1
20160284095 Chalom et al. Sep 2016 A1
20160302046 Velusamy Oct 2016 A1
20160306798 Guo et al. Oct 2016 A1
20160330394 Shahraray et al. Nov 2016 A1
20160355181 Teraoka et al. Dec 2016 A1
20160379091 Lin et al. Dec 2016 A1
20170007521 Monsonis et al. Jan 2017 A1
20170008521 Braunstein et al. Jan 2017 A1
20170017638 Satyavarta et al. Jan 2017 A1
20170018178 Poechmueller et al. Jan 2017 A1
20170072851 Shenoy et al. Mar 2017 A1
20170075036 Pikhletsky et al. Mar 2017 A1
20170078621 Sahay et al. Mar 2017 A1
20170090473 Cooper et al. Mar 2017 A1
20170092122 Sharan Mar 2017 A1
20170111576 Tojo et al. Apr 2017 A1
20170136842 Anderson et al. May 2017 A1
20170154241 Shambik et al. Jun 2017 A1
20170180623 Lin Jun 2017 A1
20170243370 Hoye et al. Aug 2017 A1
20170263128 Chandran et al. Sep 2017 A1
20170293296 Stenneth et al. Oct 2017 A1
20170297401 Hrovat et al. Oct 2017 A1
20170344023 Laubinger et al. Nov 2017 A1
20170351268 Anderson et al. Dec 2017 A1
20180022361 Rao et al. Jan 2018 A1
20180025235 Fridman Jan 2018 A1
20180046869 Cordell et al. Feb 2018 A1
20180060690 Lee et al. Mar 2018 A1
20180061253 Hyun Mar 2018 A1
20180082591 Pandy Mar 2018 A1
20180101177 Cohen Apr 2018 A1
20180108258 Dilger Apr 2018 A1
20180113461 Potnis et al. Apr 2018 A1
20180144640 Price et al. May 2018 A1
20180151073 Minemura et al. May 2018 A1
20180157666 Raichelgauz et al. Jun 2018 A1
20180157903 Tu et al. Jun 2018 A1
20180170392 Yang et al. Jun 2018 A1
20180174001 Kang Jun 2018 A1
20180188731 Matthiesen et al. Jul 2018 A1
20180188746 Lesher et al. Jul 2018 A1
20180189613 Wolf et al. Jul 2018 A1
20180204335 Agata et al. Jul 2018 A1
20180210462 Switkes et al. Jul 2018 A1
20180218608 Offenhaeuser et al. Aug 2018 A1
20180268292 Choi et al. Sep 2018 A1
20180338229 Nemec et al. Nov 2018 A1
20180354505 Meier et al. Dec 2018 A1
20180356817 Poeppel Dec 2018 A1
20180373929 Ye Dec 2018 A1
20190034764 Oh et al. Jan 2019 A1
20190064929 Tomeh et al. Feb 2019 A1
20190071093 Ma et al. Mar 2019 A1
20190072965 Zhang et al. Mar 2019 A1
20190072966 Zhang et al. Mar 2019 A1
20190073908 Neubecker et al. Mar 2019 A1
20190088135 Do et al. Mar 2019 A1
20190096135 Mutto et al. Mar 2019 A1
20190139419 Wendt et al. May 2019 A1
20190147259 Molin et al. May 2019 A1
20190163204 Bai et al. May 2019 A1
20190171912 Vallespi-Gonzalez et al. Jun 2019 A1
20190193751 Fernando et al. Jun 2019 A1
20190196471 Vaughn et al. Jun 2019 A1
20190205798 Rosas-Maxemin et al. Jul 2019 A1
20190213324 Thorn Jul 2019 A1
20190220011 Penna Jul 2019 A1
20190225214 Pohl et al. Jul 2019 A1
20190246042 Liu Aug 2019 A1
20190253614 Oleson et al. Aug 2019 A1
20190279046 Han et al. Sep 2019 A1
20190279293 Tang et al. Sep 2019 A1
20190287515 Li et al. Sep 2019 A1
20190291720 Xiao et al. Sep 2019 A1
20190304102 Chen et al. Oct 2019 A1
20190311226 Xiao et al. Oct 2019 A1
20190315346 Yoo et al. Oct 2019 A1
20190337521 Stauber Nov 2019 A1
20190340924 Abari et al. Nov 2019 A1
20190347492 Morimura et al. Nov 2019 A1
20190355132 Kushleyev et al. Nov 2019 A1
20190378006 Fukuda et al. Dec 2019 A1
20190384303 Muller et al. Dec 2019 A1
20190392831 Pohl Dec 2019 A1
20200012871 Lee et al. Jan 2020 A1
20200027002 Hickson et al. Jan 2020 A1
20200027351 Gotoda et al. Jan 2020 A1
20200027355 Sujan et al. Jan 2020 A1
20200053262 Wexler et al. Feb 2020 A1
20200074326 Balakrishnan et al. Mar 2020 A1
20200086881 Abendroth et al. Mar 2020 A1
20200090426 Barnes et al. Mar 2020 A1
20200110982 Gou et al. Apr 2020 A1
20200117902 Wexler et al. Apr 2020 A1
20200120267 Netto et al. Apr 2020 A1
20200125927 Kim Apr 2020 A1
20200156784 Carnell May 2020 A1
20200175384 Zhang et al. Jun 2020 A1
20200175550 Raichelgauz et al. Jun 2020 A1
20200269864 Zhang et al. Aug 2020 A1
20200272940 Sun et al. Aug 2020 A1
20200293035 Sakurada et al. Sep 2020 A1
20200302295 Tung et al. Sep 2020 A1
20200304707 Williams et al. Sep 2020 A1
20200324778 Diamond et al. Oct 2020 A1
20200370890 Hamilton et al. Nov 2020 A1
20200371518 Kang Nov 2020 A1
20200410322 Naphade et al. Dec 2020 A1
20210009270 Chen et al. Jan 2021 A1
20210041248 Li et al. Feb 2021 A1
20210049908 Pipe et al. Feb 2021 A1
20210055741 Kawanai et al. Feb 2021 A1
20210056492 Zass Feb 2021 A1
20210056852 Lund et al. Feb 2021 A1
20210096565 Xie et al. Apr 2021 A1
20210097309 Kaku et al. Apr 2021 A1
20210148831 Raichelgauz et al. May 2021 A1
20210164177 Wientjes Jun 2021 A1
20210182539 Rassool Jun 2021 A1
20210192357 Sinha et al. Jun 2021 A1
20210209332 Nishio et al. Jul 2021 A1
20210224917 Gaudin et al. Jul 2021 A1
20210248904 Nguyen Aug 2021 A1
20210266437 Wexler et al. Aug 2021 A1
20210272207 Fields et al. Sep 2021 A1
20210284183 Marenco et al. Sep 2021 A1
20210284191 Raichelgauz et al. Sep 2021 A1
20210316747 Klein Oct 2021 A1
20210390351 Romain, II Dec 2021 A1
20210390840 Rejal et al. Dec 2021 A1
20210409593 Zacharias et al. Dec 2021 A1
20220005291 Konrardy et al. Jan 2022 A1
20220038620 Demers Feb 2022 A1
20220058393 Calvert et al. Feb 2022 A1
20220126864 Moustafa et al. Apr 2022 A1
20220161815 Beek et al. May 2022 A1
20220187847 Cella et al. Jun 2022 A1
20220191389 Lei Jun 2022 A1
20220234501 Odinaev et al. Jul 2022 A1
20220286603 Lv et al. Sep 2022 A1
20220327886 Mathur et al. Oct 2022 A1
20220345621 Shi et al. Oct 2022 A1
Foreign Referenced Citations (21)
Number Date Country
2007201966 Feb 2010 AU
101539530 Sep 2009 CN
107472252 Apr 2022 CN
111866468 Jun 2022 CN
102012009297 Dec 2012 DE
102016122686 May 2018 DE
1085464 Jan 2007 EP
3910540 Nov 2021 EP
2018511807 Apr 2018 JP
0231764 Apr 2002 WO
2003067467 Aug 2003 WO
2005027457 Mar 2005 WO
2007049282 May 2007 WO
2014076002 May 2014 WO
2014137337 Sep 2014 WO
2014141282 Sep 2014 WO
2016040376 Mar 2016 WO
2016070193 May 2016 WO
WO-2017060739 Apr 2017 WO
2018035145 Feb 2018 WO
2018132088 Jul 2018 WO
Non-Patent Literature Citations (58)
Entry
Wilk et al., “The Potential of Social-Aware Multimedia Prefetching on Mobile Devices”, International Conference and Workshops on networked Systems (NetSys), 2015, pp. 1-5.
Yanagawa et al, “Columbia University's Baseline Detectors for 374 LSCOM Semantic Visual Concepts”, Columbia University ADVENT Technical Report # 222-2006-8, Mar. 20, 2007, pp. 1-17.
Yanagawa et al., “Columbia University's Baseline Detectors for 374 LSCOM Semantic Visual Concepts”, Columbia University ADVENT Technical Report #222, 2007, pp. 2006-2008.
Yanai, Generic Image Classification Using Visual Knowledge on the Web, pp. 167-174 (Year: 2003).
Zhou et al, “Ensembling neural networks: Many could be better than all”, National Laboratory for Novel Software Technology, Nanjing University, Hankou Road 22, Nanjing 210093, PR China Received Nov. 16, 2001, Available online Mar. 12, 2002, pp. 239-263.
Zhou et al, “Medical Diagnosis With C4.5 Rule Preceded by Artificial Neural Network Ensemble”, IEEE Transactions on Information Technology in Biomedicine, vol. 7, Issue: 1, Mar. 2003, pp. 37-42.
Zhu et al., “Technology-Assisted Dietary Assesment”, Proc SPIE. Mar. 20, 2008, pp. 1-15.
Zou et al., “A Content-Based Image Authentication System with Lossless Data Hiding”, ICME 2003, pp. 213-216.
“Computer Vision Demonstration Website”, Electronics and Computer Science, University of Southampton, 2005, USA.
Big Bang Theory Series 04 Episode 12, aired Jan. 6, 2011; [retrieved from Internet:].
Boari et al, “Adaptive Routing for Dynamic Applications in Massively Parallel Architectures”, 1995 IEEE, Spring 1995, pp. 1-14.
Burgsteiner et al., “Movement Prediction from Real-World Images Using a Liquid State machine”, Innovations in Applied Artificial Intelligence Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence, LNCS, Springer-Verlag, BE, vol. 3533, Jun. 2005, pp. 121-130.
C. Huang et al., “ACT: An Autonomous Drone Cinematography System for Action Scenes,” 2018 IEEE International Conference onRobotics and Automation (ICRA), 2018, pp. 7039-7046, doi: 10.1109/ICRA.2018.8460703. (Year: 2018).
Cernansky et al, “Feed-forward Echo State Networks”, Proceedings of International Joint Conference on Neural Networks, Montreal, Canada, Jul. 31-Aug. 4, 2005, pp. 1-4.
Chinchor, Nancy A. et al.; Multimedia Analysis + Visual Analytics = Multimedia Analytics; IEEE Computer Society; 2010; pp. 52-60. (Year: 2010).
Fathy et al, “A Parallel Design and Implementation For Backpropagation Neural Network Using MIMD Architecture”, 8th Mediterranean Electrotechnical Conference, 19'96. MELECON '96, Date of Conference: May 13-16, 1996, vol. 3 pp. 1472-1475, vol. 3.
Freisleben et al, “Recognition of Fractal Images Using a Neural Network”, Lecture Notes in Computer Science, 1993, vol. 6861, 1993, pp. 631-637.
Galvane, Quentin, et al. “Automated cinematography with unmanned aerial vehicles.” arXiv preprint arXiv:1712.04353 (2017). (Year: 2017).
Garcia, “Solving the Weighted Region Least Cost Path Problem Using Transputers”, Naval Postgraduate School, Monterey, California, Dec. 1989.
Guo et al, AdOn: An Intelligent Overlay Video Advertising System (Year: 2009).
Hogue, “Tree Pattern Inference and Matching for Wrapper Induction on the World Wide Web”, Master's Thesis, Massachusetts Institute of Technology, Jun. 2004, pp. 1-106.
Howlett et al, “A Multi-Computer Neural Network Architecture in a Virtual Sensor System Application”, International journal of knowledge-based intelligent engineering systems, 4 (2). pp. 86-93, 133N 1327-2314, (Year: 2000).
Hu, Weiming, et al. “A survey on visual content-based video indexing and retrieval.” IEEE Transactions on Systems, Man, andCybernetics, Part C (Applications and Reviews) 41.6 (2011 ): 797-819. (Year: 2011).
Hua et al., “Robust Video Signature Based on Ordinal Measure”, Image Processing, 2004, 2004 International Conference on Image Processing (ICIP), vol. 1, IEEE, pp. 685-688, 2004.
Huang, Chong, et al. “One-shot imitation filming of human motion videos.” arXiv preprint arXiv:1912.10609 (2019). (Year: 2019).
J. Chen and P. Carr, “Mimicking Human Camera Operators,” 2015 IEEE Winter Conference on Applications of Computer Vision, 2015, pp. 215-222, doi: 10.1109/WACV.2015.36. (Year: 2015).
Johnson et al, “Pulse-Coupled Neural Nets: Translation, Rotation, Scale, Distortion, and Intensity Signal Invariance for Images”, Applied Optics, vol. 33, No. 26, 1994, pp. 6239-6253.
Joubert, Niels, et al. “Towards a drone cinematographer: Guiding quadrotor cameras using visual composition principles.” arXivpreprint arXiv: 1610.01691 (2016). (Year: 2916).
Lau et al., “Semantic Web Service Adaptation Model for a Pervasive Learning Scenario”, 2008 IEEE Conference on Innovative Technologies in Intelligent Systems and Industrial Applications, 2008, pp. 98-103.
Li et al (“Matching Commercial Clips from TV Streams Using a Unique, Robust and Compact Signature” 2005) (Year: 2005).
Li, Yijun, Jesse S. Jin, and Xiaofang Zhou. “Matching commercial clips from TV streams using a unique, robust and compactsignature.” Digital Image Computing: Techniques and Applications (DICTA'05). IEEE, 2005. (Year: 2005).
Lin et al., “Generating robust digital signature for image/video authentication”, Multimedia and Security Workshop at ACM Multimedia '98, Bristol, U.K., Sep. 1998, pp. 245-251.
Lu et al, “Structural Digital Signature for Image Authentication: An Incidental Distortion Resistant Scheme”, IEEE Transactions on Multimedia, vol. 5, No. 2, Jun. 2003, pp. 161-173.
Lyon, “Computational Models of Neural Auditory Processing”, IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP '84, Date of Conference: Mar. 1984, vol. 9, pp. 41-44.
M. Gschwindt,, “Can a Robot Become a Movie Director? Learning Artistic Principles for Aerial Cinematography,” 2019 IEEE/RSJw International Conference on Intelligent Robots and Systems (IROS), 2019, pp. 1107-1114, doi: 10.1109/IROS40897.2019.896759 (Year: 2019).
Marian Stewart B et al., “Independent component representations for face recognition”, Proceedings of the SPIE Symposium on Electronic Imaging: Science and Technology; Conference on Human Vision and Electronic Imaging III, San Jose, California, Jan. 1998, pp. 1-12.
May et al, “The Transputer”, Springer-Verlag Berlin Heidelberg 1989, vol. 41.
Mcnamara et al., “Diversity Decay in opportunistic Content Sharing Systems”, 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, pp. 1-3.
Morad et al., “Performance, Power Efficiency and Scalability of Asymmetric Cluster Chip Multiprocessors”, Computer Architecture Letters, vol. 4, Jul. 4, 2005, pp. 1-4, XP002466254.
Nagy et al, “A Transputer, Based, Flexible, Real-Time Control System for Robotic Manipulators”, UKACC International Conference on CONTROL '96, Sep. 2-5, 1996, Conference Publication No. 427, IEE 1996.
Natschlager et al., “The “Liquid Computer”: A novel strategy for real-time computing on time series”, Special Issue on Foundations of Information Processing of telematik, vol. 8, No. 1, 2002, pp. 39-43, XP002466253.
Odinaev et al, “Cliques in Neural Ensembles as Perception Carriers”, Technion—Institute of Technology, 2006 International Joint Conference on neural Networks, Canada, 2006, pp. 285-292.
Ortiz-Boyer et al, “CIXL2: A Crossover Operator for Evolutionary Algorithms Based on Population Features”, Journal of Artificial Intelligence Research 24 (2005) Submitted Nov. 2004; published Jul. 2005, pp. 1-48.
Pandya etal. A Survey on QR Codes: in context of Research and Application. International Journal of Emerging Technology and U Advanced Engineering. ISSN 2250-2459, ISO 9001:2008 Certified Journal, vol. 4, Issue 3, Mar. 2014 (Year: 2014).
Queluz, “Content-Based Integrity Protection of Digital Images”, SPIE Conf. on Security and Watermarking of Multimedia Contents, San Jose, Jan. 1999, pp. 85-93.
Retrieval, Story. Ehsan Younessian. Diss. Nanyang Technological University, 2013: i-187 (Year: 2013).
Santos et al., “SCORM-MPEG: an Ontology of Interoperable Metadata for multimediaand E-Learning”, 23rd International Conference on Software, Telecommunications and Computer Networks (SoftCom), 2015, pp. 224-228.
Scheper et al, “Nonlinear dynamics in neural computation”, ESANN'2006 proceedings—European Symposium on Artificial Neural Networks, Bruges (Belgium), Apr. 26-28, 2006, d-side publication, ISBN 2-930307-06-4, pp. 1-12.
Schneider et al, “A Robust Content based Digital Signature for Image Authentication”, Proc. ICIP 1996, Lausane, Switzerland, Oct. 1996, pp. 227-230.
Stolberg et al (“HIBRID-SOC: A Multi-Core SOC Architecture for Multimedia Signal Processing” 2003).
Stolberg et al, “HIBRID-SOC: A Mul ti-Core SOC Architecture for Mul Timedia Signal Processing”, 2003 IEEE, pp. 189-194.
Theodoropoulos et al, “Simulating Asynchronous Architectures on Transputer Networks”, Proceedings of the Fourth Euromicro Workshop On Parallel and Distributed Processing, 1996. PDP '96, pp. 274-281.
Vallet et al (“Personalized Content Retrieval in Context Using Ontological Knowledge” Mar. 2007) (Year: 2007).
Vallet, David, et al. “Personalized content retrieval in context using ontological knowledge.” IEEE Transactions on circuits andsystems for video technology 17.3 (2007): 336-346. (Year: 2007).
Verstraeten et al, “Isolated word recognition with the Liquid State Machine: a case study”, Department of Electronics and Information Systems, Ghent University, Sint-Pietersnieuwstraat 41, 9000 Gent, Belgium, Available onlline Jul. 14, 2005, pp. 521-528.
Wang et al., “Classifying Objectionable Websites Based onImage Content”, Stanford University, pp. 1-12, (Year: 1998).
Ware et al, “Locating and Identifying Components in a Robot's Workspace using a Hybrid Computer Architecture” Proceedings of the 1995 IEEE International Symposium on Intelligent Control, Aug. 27-29, 1995, pp. 139-144.
Whitby-Strevens, “The transputer”, 1985 IEEE, pp. 292-300.
Related Publications (1)
Number Date Country
20220114756 A1 Apr 2022 US
Provisional Applications (1)
Number Date Country
63091303 Oct 2020 US