Pixel intensity modulation using modifying gain values

Information

  • Patent Grant
  • 12001013
  • Patent Number
    12,001,013
  • Date Filed
    Monday, January 9, 2023
    a year ago
  • Date Issued
    Tuesday, June 4, 2024
    25 days ago
Abstract
A visual perception device has a look-up table stored in a laser driver chip. The look-up table includes relational gain data to compensate for brighter areas of a laser pattern wherein pixels are located more closely than areas where the pixels are further apart and to compensate for differences in intensity of individual pixels when the intensities of pixels are altered due to design characteristics of an eye piece.
Description
BACKGROUND OF THE INVENTION
1). Field of the Invention

This invention relates to a visual perception device and to a method of creating an image.


2). Discussion of Related Art

Visual perception devices that provide a rendered image have become popular for computing, entertainment and other purposes. A visual perception device is usually a wearable device with a display for rendering the image.


SUMMARY OF THE INVENTION

The invention provides a visual perception device including a data store, relational gain data stored in the data store and representing a plurality of reference locations and a plurality of gain values, each gain value corresponding to a respective reference location, a video data receiver connectable to a video data channel to receive video data including a plurality of pixels, a correlator connected to the relational gain data and the video data receiver and operable to correlate each pixel with a reference location in the relational gain data to find a gain value corresponding to the respective pixel, a beam modulator connected to the video data receiver and the correlator and operable to modify an intensity value of the respective pixel based on the gain value for the respective pixel to determine a modulated intensity value for the respective pixel and a laser projector connected to the beam modulator and operable to generate a respective beam of light corresponding to the modulated intensity value of each respective pixel and transmit the beams of light in a pattern wherein the beams of light are spatially separated.


The invention also provides a method of creating an image including storing relational gain data representing a plurality of reference locations and a plurality of gain values, each gain value corresponding to a respective reference location, receiving video data including a plurality of pixels over a video data channel, correlating each pixel with a reference location in the relational gain data to find a gain value corresponding to the respective pixel, modifying an intensity value of the respective pixel based on the gain value for the respective pixel to determine a modulated intensity value for the respective pixel, generating a respective beam of light corresponding to the modulated intensity value of each respective pixel and transmitting the beams of light in a pattern wherein the beams of light are spatially separated.





BRIEF DESCRIPTION OF THE DRAWINGS

The invention is further described by way of examples with reference to the accompanying drawings, wherein:



FIG. 1 is a diagram that is partially in block diagram form and partially in illustrative form showing a visual perception device according to an embodiment of the invention;



FIG. 2 is a flow chart illustrating a method of creating an image using the visual perception device;



FIG. 3 is a view of a pattern that is created by an optical fiber scanner of the visual perception device, and emphasizes intensity values in video data;



FIG. 4 is a view similar to FIG. 3 illustrating differences in brightness for a given intensity value from video data of each pixel in the pattern;



FIG. 5A is a view that illustrates a modification in intensity of pixels to compensate for differences in brightness of areas of the pattern;



FIG. 5B is a view that illustrates modification of intensity to compensate for differences of brightness of pixels due to design characteristics of relay optics;



FIG. 5C is a view that shows net intensity modifications due to FIGS. 5A and 5B;



FIG. 6 is a view illustrating intensity modifications due to backgrounds that are lighter and darker;



FIGS. 7A to 7C illustrate an eye and an eye tracking camera that is used to capture the eye and rotation of a pupil about a center of the eye;



FIG. 8 is a view of the pattern with no intensity modifications due to pupil location;



FIGS. 9A to 9C illustrate intensity modifications due to pupil location;



FIG. 10 is a block diagram illustrating one approach for constructing a laser driver chip;



FIG. 11 is a block diagram illustrating details of a laser driver chip of the visual perception device of FIG. 1, according to one embodiment;



FIG. 12 is a block diagram illustrating details of a laser driver chip of the visual perception device of FIG. 1, according to another embodiment;



FIG. 13 is a block diagram illustrating details of a laser driver chip of the visual perception device of FIG. 1, according to further embodiment;



FIG. 14 is a view of a pattern illustrating areas of more brightness and areas of less brightness due to variations in pixel density distribution; and



FIG. 15 is a block diagram of a machine in the form of a computer that can find application in the present invention system, in accordance with one embodiment of the invention.





DETAILED DESCRIPTION OF THE INVENTION

A data entry in video data is referred to herein as a “pixel”. The term “pixel” is also used to refer to one location in a two-dimensional pattern where light is created for display to a user. The data entry in the video data includes an intensity value that influences an intensity of the light in the two-dimensional pattern. The term “pixel” is also sometimes used to refer to a particular transformation that happens at a moment in time between when the “pixel” is in the video data and when the “pixel” refers to light in the two-dimensional pattern. In other instances, for example when the video data is used to generate laser light, the term “pixel” may not be used because the focus of the description may be on other aspects such as the functioning of one or more lasers or other light sources.


“Intensity” is used herein to refer to the power coming from a single pixel. “Brightness” is used to refer to the power of multiple pixels, or regions of the viewable image as seen by a user, and depends at least in part on the density of the pixels. In some embodiments, other factors such as relay optics design, environmental lighting conditions, background scene colors and patterns can affect perceived brightness or brightness uniformity of an image. Although more “intensity” of individual pixels will result in more overall brightness over an area, it will be more understandable herein to exclude “intensity” of individual pixels from the definition of “brightness”. As such, “brightness” will be primarily discussed in the context of areas that are brighter or darker due differences in pixel density.



FIG. 1 of the accompanying drawings illustrates a visual perception device 10, according to an embodiment of the invention, including a laser driver chip 12, an off-chip support system 14, a video data channel 16, a laser projector 18, relay optics 20, at least one background camera 22, and at least one eye tracking camera 24.


The laser driver chip 12 includes a video data receiver 26, a beam modulator 28, a look-up table 30 holding relational pattern-based gain data 32, further look-up tables holding relational pupil-based gain data 34 and 36, an eye analyzer 38, a write/read alternator 40, and a correlator in the form of a pixel counter 42.


The video data receiver 26 is connected to the video data channel 16. The beam modulator 28 is connected to the video data receiver 26 and provides an output to the laser projector 18.


The relational pattern-based gain data 32 includes a plurality of reference locations and corresponding gain values. Each reference location corresponds to a particular position of a pattern that is inherent in the functioning of a fiber scanner of the laser projector 18. Each reference location includes gain values for a plurality of colors, in the present example for red, green and for blue. The pixel counter 42 is connected to the video data receiver 26 and to the look-up table 30. The beam modulator 28 is connected to the look-up table 30 and the pixel counter 42.


The relational pupil-based modifying data 34 and 36 are connected to the write/read alternator 40. The write/read alternator 40 is connected to the pixel counter 42 and provides an output to the beam modulator 28. The write/read alternator 40 is connected to the eye analyzer 38 to receive an input from the eye analyzer 38.


The off-chip support system 14 includes a table holding relational background-based gain data 46 and a background analyzer 48. The relational background-based gain data 46 is connected to the pixel counter 42. The background analyzer 48 is connected to the relational background-based gain data 46. The beam modulator 28 is connected to the relational background-based gain data 46.


The laser projector 18 includes a plurality of lasers, which can include including red, green, blue and infrared (IR) lasers 50A, 50B, 50C, and 50D, respectively. The laser projector 18 may activate the lasers 50A to 50D in a sequence based on the image data. For purposes of further discussion, a two-dimensional pattern that is created by one of the lasers, for example, the red laser 50A, is discussed. It will however be understood that each laser 50A to 50D will create a selected pattern, but in a different color. If the patterns for the different colors are the same, then it is likely that their intensity values may differ from color to color.


The laser projector 18 includes an optical fiber scanner 52 that is in communication with the lasers 50A to 50D. An actuator (not shown) may move the optical fiber scanner 52 in two dimensions according to a selected scan pattern. Light received by the optical fiber scanner 52 from the lasers 50A to 50D leaves the optical fiber scanner 52 and is projected to form a two-dimensional pattern 54. The laser light is passed through a lens system (not shown) to prepare it for injection into the image relay 20.


The present embodiment includes a laser projector 18 that generates laser light. Another embodiment may use a different system, for example a light emitting diode-based system, that may generate light other than laser light.


The laser projector 18, eye tracking camera 24, image relay 20 and background camera 22 are all mounted to a common frame and are thus stationary relative to one another. The frame can be worn by a person. The image relay 20 is then located in front of an eye 56 of the person. In the present example, the image relay 20 is a selectively transparent member. Light from a background 58 and objects in the background 58 transmits through the image relay 20 to the eye 56. The person can thus see the background 58 and the objects in the background 58 through the image relay 20. The image relay may be of the kind described in U.S. patent application Ser. No. 14/331,218, which is incorporated herein by reference.


The laser projector 18 is mounted in a position wherein the optical fiber scanner 52 is directed at the image relay 20. The optical fiber scanner 52 is actuated such that the output end follows a selected scan pattern and creates an image by projecting light along scan pattern to create the pattern 54 of projected light in an x-y plane. The image is projected either directly or through a lens system into the image relay 20. Light from the pattern 54 then transmits through a reflective path through the image relay 20 and exits the image relay 20 near the eye 56. Only one light path of one pixel is shown in a y-z plane although it should be understood that each dot, or pixel, in the pattern 54 travels in x-y-z dimensions before leaving the image relay 20. The pattern 54 that is created by the projection of light from optical fiber scanner 52 is the same pattern that makes up the virtual component of the total image received by a user's eye and is viewable by the eye 56 after the light leaves the image relay 20. The eye 56 thus receives real world light from the background 58 and light from the optical fiber scanner 52 via the image relay 20 simultaneously. An augmented reality system is provided wherein a scene of real world objects that the person sees in the background 58 is augmented with rendered content such as a two-dimensional or three-dimensional an image or a video created by light from the laser projector 18. In such a scene the rendered content may be displayed in a manner that gives the perception that rendered content is located on a real world object such as on a real world table or against a real world object such as against a real world wall, or may be displayed in a manner that gives the perception that the rendered content is floating in space in front of the scene of real world objects.


For purposes of explanation, all pixels in the given example have intensity values that are more than zero, although it will be understood that some pixels may have intensity values of zero so that no light is created for those pixels. While the pattern 54 shows pixels being projected over a majority of the field of view, it is possible to only project a limited number of pixels in a desired area of the pattern such that a virtual image smaller than the entire field of view that is projected toward the image relay 20.


The eye tracking camera 24 is mounted in a position to capture images of the eye 56. The eye tracking camera 24 may, for example, receive light from the eye 56. Alternatively, an infrared emitter may emit infrared light that is reflected by the eye 56 and is captured by the eye tracking camera 24. The eye analyzer 38 is connected to the eye tracking camera 24.


Light from the background 58 is captured by the background camera 22. The background camera 22 may, for example, have a detector that detects environmental light in two dimensions transmitted from the background 58. The background analyzer 48 is connected to the background camera 22.


In use, the look-up table 30 including the relational pattern-based gain data 32 is stored in a data store on the laser driver chip 12 (see also FIG. 2:66). The visual perception device 10 is fitted to a head of a person in a position wherein the eye 56 of the person views the background 58 through the image relay 20. The video data receiver 26 receives video data 68 through the video data channel 16 (70). The video data 68 includes a series of pixels that each include a color designation and a respective intensity value that the beam modulator uses to adjust the intensity of the light at the light source.


The beam modulator 28 determines the intensity for each color of a pixel from the video data 68) and provides the data to the laser projector 18. By way of example, the laser projector 18 activates the red laser 50A. The red laser 50A provides red laser light to the optical fiber scanner 52. When the laser light exits the optical fiber scanner 52, the laser light couples into the image relay 20, either directly or indirectly through relay optics, lenses, scanning mirrors, or folding mirrors, at a particular location that depends on the location of the optical fiber scanner 52 at that particular moment in time. The beam modulator 28 may provide green, blue and optionally IR pixel data, including color designation for each pixel, and intensity value to the laser projector 18 in the same way. The beam modulator 28 then provides the second red pixel and its corresponding intensity value to the laser projector. The red laser 50A then creates a red laser light and provides the red laser light to the optical fiber scanner 52. The red laser light leaves the optical fiber scanner 52 and couples into the image relay 20 at a different location than where the first red pixel coupled into the image relay 20. The red laser 50A is repeatedly activated while the optical fiber scanner 52 continues to move in two dimensions. Red laser light couples into the image relay 20 and creates the pattern 54, which is a two-dimensional pattern in an x-y plane. By way of example, the pattern 54 is created by actuating the optical fiber scanner 52 in a scan pattern. As shown, the scan pattern may include a spiral pattern that starts with a small circular shape and then continues to grow larger by increasing the scan radius over time over a two-dimensional area.


The respective beams of laser light of the pattern 54 couple into the image relay 20 at different angles then reflect within the image relay 20, whereafter the beams exit the image relay 20 and the same pattern 54 is viewable by the eye 56.



FIG. 3 illustrates the effect of the intensity value in the given video data 68 on the intensity of the respective laser beams for a particular color. Larger shapes indicate lasers with more intensity, due to a larger intensity value of the pixel in the video data 68, and smaller shapes indicate less intensity.



FIG. 4 illustrates variations in brightness and intensity that occur across a two-dimensional spiral pattern. In the case of a spiral pattern, center points of pixels are more closely spaced near a center of the spiral than in an outer region of the spiral due to a varying speed of the optical fiber and a constant rate of light projection for each pixel. For example, a distance between the first two pixels in the spiral pattern is less than the distance between the last two pixels. The difference in distances is primarily because of changes in velocity wherein the laser projector 18 travels slower between inner light beams and faster between outer light beams in the pattern 54. As a result, a central region of the spiral pattern appears more bright than outer regions of the spiral pattern.


Furthermore, the design of the image relay 20 may cause individual pixels in certain areas of the pattern to be brighter than pixel in other areas of the pattern when the pixels are outcoupled to the user's eye. In FIG. 4, it is assumed that the intensity values in the video data 68 for all the pixels are the same. Even if the intensity values for all the pixels are the same, certain pixels may appear brighter than other pixels due to design characteristics of the relay optics 20. To achieve desired output light levels from the relay optics 20, the effect of design characteristics of image relay 20 on input light is considered in selecting an input light gain value. Such an image relay-specific gain value may be stored within look-up table 30 within the relational pattern-based gain data 32 or may be stored as a separate look-up table. For example, the relay optics 20 may tend to have less light output from one or more corners; to compensate for this known eye piece design characteristic, gain for pixels associated with the corners of the relay optics 20 may be increased to increase the intensity of the light source when projecting that particular pixel, thereby providing a more uniform brightness output image for a user. Similarly, gain for pixels in a center of the relay optics 20, which may have high light output relative to other portions of the relay optics 20, may be decreased to improve overall brightness uniformity of the image seen by the user. In some implementations, the intensity of certain pixels may be increased while the intensity of others is decreased within a same image frame.



FIG. 3 thus shows the desired intensity for the respective pixels under the assumption that design characteristics of the image relay 20 do not alter pixel-to-pixel variations of intensity. However, it should be understood that the brightness variations shown in FIG. 3 may be further affected by pixel-to-pixel variations as shown in FIG. 4.


Referring again to FIGS. 1 and 2, the relational pattern-based gain data 32 includes calibration data to compensate for both the differences in brightness in different areas of the spiral pattern and the differences in intensity from one pixel to the next, for example due to different colors, as shown in FIG. 4. The reference locations in the relational pattern-based gain data 32 correspond to the location of each pixel in the pattern 54 created by the laser projector 18. The reference locations are typically a sequence of numbers that are used for look-up purposes.


The pixel counter 42 has a number of different functions, including (i) holding a number (ii) incrementing the number (iii) look-up (iv) forwarding a value and (v) reset. These functions are not shown as separate modules in the apparatus drawing of FIG. 1, but instead as separate functions in the flowchart of FIG. 2.


The pixel counter 42 includes a number that is initially set to zero (80). The pixel counter 42 then counts the pixels that are received by the video data receiver 26 such that, each time a new pixel is received by the video data receiver 26, the pixel counter 42 increases the previously stored number by one (82). The pixel counter 42 then uses the number to find the reference location within the relational pattern-based gain data 32 corresponding to the number tracked by the pixel counter 42. For the first number, the pixel counter 42 finds the first reference location. The pixel counter 42 thus serves as a correlator that is operable to correlate each pixel with a reference location in the relational pattern-based gain data 32. The pixel counter 42 then extracts the corresponding gain value for the reference location that it has found. The gain value represents a pattern-based gain that is determined from the respective number (86).


For purposes of illustration, FIG. 1 shows a line connecting a pattern-based gain value (for example, Gain Value R1) that has been selected using the pixel counter 42, pixel color information, and a reference location, to the beam modulator 28. This connection illustrates the relational look-up functionality of the look-up table 30 wherein a particular pattern-based gain value (Gain Value R1) corresponding to a particular reference location (Reference location 1) is forwarded to the beam modulator 28. It should however be understood that the pattern-based gain value (Gain Value R1) is thus returned to the pixel counter 42 and the pixel counter 42 provides an output of the pattern-based gain value (Gain Value R1) to the beam modulator 28.


The beam modulator 28 multiplies the intensity value from the video data 68 with the gain value from the pixel counter 42 as determined from the relational pattern-based gain data 32. The beam modulator 28 thus calculates a combined intensity value for the respective pixel (88) and a modified intensity value, namely the original intensity value in the video data as modified by the combined gain value. The beam modulator 28 then provides that modified intensity value to the laser projector 18 and the laser projector 18 activates the red laser 50A to an output light level that corresponds to the modified intensity value (90).


When the video data receiver 26 receives the second pixel, the pixel counter 42 increases the reference number by one (82). Each time that another pixel is received, the beam modulator 28 calculates a combined intensity value using the intensity value provided with the video data 68 and the gain value stored in the look-up table 30 associated with the number of the pixel as determined by the reference number stored in the pixel counter 42. The process is repeated until the last pixel in the pattern has been counted. In the case of a spiral pattern, the last pixel may correspond to the outermost pixel in the spiral pattern; however, any pixel can be associated with the beginning, and therefore end, of the pixel counter reference number series. The pixel counter 42 determines that the last pixel has been counted (84). If the last pixel has been counted, the pixel counter 42 resets the number to zero (80) and the scan pattern of the optical fiber 52 is ready to begin again for a subsequent image frame.


The fiber scanner has now reached the outermost point in its spiral pattern and subsequently returns to its original position by following a path that spirals inward from the outermost point back to its original location. The inward and outward spirals are formed at the same resonant frequency, although in some embodiments fewer revolutions are required to return the fiber scanner to its original position than when spiraling outward.



FIG. 5A illustrates the effect of the relational pattern-based gain data 32 in FIG. 1 on the differences in the intensity and brightness due to scan beam velocity and pixel density associated with a spiral shaped scanning pattern of the optical fiber 52. In the pattern on the left, pixels in the center appear brighter than pixels on the outside of the image due to variations in pixel density caused by over the inherent form of the scan pattern when the optical fiber 52 is driven at a constant frequency of revolutions. In the pattern on the left, variations in brightness that may occur due to the design of the image relay 20 are ignored.


An optical fiber scanner has an optical fiber that bends so that a tip of the optical fiber follows a spiral pattern. The spiral pattern begins at a center point and revolves around the center point with an increasing radius. The scan pattern may include many revolutions about the center point. Each revolution may be formed at a frequency that is substantially constant. Each revolution is thus formed in approximately the same length of time. Because outer revolutions cover a longer distance than inner revolutions, the tip of the optical fiber has more velocity when forming the outer revolutions than when forming the inner revolutions. Due to changes in velocity of the scanner, some pixels appear brighter than other pixels. In particular, areas of an image where the scanning beam has a higher velocity results in pixels, or regions of the image, with less brightness. Referring back to FIG. 5A, pixels in regions of a scan pattern associated with higher brightness are indicated with larger hexagons. Pixels in an inner region have more brightness than pixels in an outer region.


For a number of reasons, pixels near a center of the spiral pattern are more densely spaced than pixels in an outer region, resulting in more overall brightness in the center than in an outer region. One reason why pixels in an inner region are more closely spaced is because the optical fiber travels faster when forming the outer circles than when forming the inner circles and pixels are created at a rate that remains substantially constant. Another reason is that, for reasons that are particular to a spiral pattern, there is more path per unit area in a center of a spiral pattern than in an outer region of the spiral pattern and a space between two inner circles may not be any wider than a space between outer circles.


In the pattern on the right of FIG. 5A, larger circles represent larger gain values to compensate for the brightness variations as shown in the pattern on the left. Pixels in outer regions of the pattern 54 are given more intensity by having higher gain values than the gain values associated with pixels in an inner region of the pattern 54. As a result, the pattern 54 is more uniform in its brightness from the inner region of the pattern 54 to the outer region of the pattern 54.



FIG. 5B illustrates the effect of the relational design-based modifying data 32 in FIG. 1 on variations in pixel brightness due to the characteristics of the design of the image relay 20. In the pattern 54 on the left, the pixels in the areas of the image frame that are perceived as being brighter due to the characteristics of the design of the optical relay 20 are shown in larger hexagons than pixels that have less brightness due the effects of the design characteristics of the optical relay 20.


In the pattern on the right of FIG. 5B, larger circles represent larger gain values to compensate for the brightness variations shown in the pattern on the left. When comparing the pattern on the right with the pattern on the left, it can be seen that smaller hexagons representing dimmer regions of the image correspond with larger circles representing larger gain values and larger hexagons representing brighter areas in the image correspond with smaller circles representing smaller gain values. Pixels that are less bright due to the design characteristics of the optical relay 20 correspond to larger gain values from the relational design-based modifying data 32 in FIG. 1 than pixels that are brighter due to the design characteristics of the optical relay 20. Should all the pixels thus have the same intensity value in their video data 68, the gain values shown in the pattern on the right will compensate for brightness variations caused by the optical relay 20 and thus result in output pixels from the optical relay 20 that are equally bright to create an image frame that a user perceives to have uniform brightness.



FIG. 5C illustrates the combination of the effects of FIGS. 5A and 5B. The pattern 54 on the left in FIG. 5C shows areas that tend to be brighter due to more pixel density than areas that have less pixel density and pixels that are brighter due to the design characteristics of the image relay 20. The pattern 54 on the right shows the net intensity modification when combining the gain values illustrated in the right panels of FIGS. 5A and 5B. The gain values in FIGS. 5A and 5B may, for example, be multiplied, or otherwise combined, with one another to obtain the gain values in the right side of FIG. 5C.


The gain values of FIG. 5C are received by the beam modulator 28 from the look-up table 30. The beam modulator 28 multiplies the gain values from the look-up table 30 with the intensity values in the video data 68 received from the video data receiver 26. The intensity values provided with the video data (as shown in FIG. 3) are thus multiplied by the gain values in FIG. 5C, which take into account scan pattern gain value compensations and eye piece design characteristic gain value compensations. These different gain value components combine to determine the overall gain values for each pixel generated by the laser projector 18 and thus the intensities of the individual pixels of the pattern 54 in FIG. 1.


In some embodiments, additional gain values are used to further adjust the intensity of one or more pixels produced by a laser projector. Referring back to FIGS. 1 and 2, the background camera 22 captures an image of the background 58 (92). The background camera 22 may, for example, periodically capture an image of the background 58. A background image may for example be captured every one to five seconds. The background camera 22 provides the image to the background analyzer 48. The background analyzer 48 analyzes the background 58 to determine lighter and darker areas (94) of the background as seen from the perspective of the background camera 22, which may be substantially similar to the view of the background seen by the user. The background analyzer 48 may then create, assign, and/or store gain data per pixel within the relational background-based modifying data 46 (96). The relational background-based gain data 46 may be similar to the relational pattern-based modifying data 32. Gain values are used to achieve an image frame output from the optical relay 20 that is perceived by a user to have uniform image brightness by a user. In additive display systems where background light combines with projected virtual light, virtual light projected over a lighter background appears less bright than virtual light projected over a darker background. To accommodate for this effect, gain values associated with dark or light backgrounds may be generated to adjust intensity of pixels from the laser projector 18 such that a final image output from the optical relay 20 appears uniform in brightness to a user even when the background light varies between light and dark areas. Adjusting for light and dark background regions may require lighter areas of the background 58 to be associated with reference locations having larger gain values than darker areas of the background 58. The background analyzer 48 receives successive images from the background camera 22 and updates the relational background-based modifying data 46 as lighter and darker areas of the background 58 change with movement of the user device.


The pixel counter 42 is connected to the relational background-based gain data 46 to determine a gain value corresponding to the reference number of the pixel counter and thus determines a background-based gain for the pixel associated with the reference number (98). The pixel counter 42 provides the background-based gain value for the number to the beam modulator 28. The beam modulator 28 includes the background-based gain value in the product of the combined gain value (88) used to adjust pixel intensity. An output of the beam modulator 28 to the laser projector 18 thus includes a factor that is a compensation based on lighter or darker areas of the background 58.



FIG. 6 illustrates intensity compensations due to areas of the background 58 having different brightness. For purposes of discussion, the background 58 has an average brightness background and a lighter background. Alternatively, the background 58 can have three different areas, including a darker background, an average brightness background and a lighter background. The terms “darker”, “average”, and “lighter” can indicate light intensity, color, saturation or combinations thereof. areas where the background 58 is of average brightness, or within a selected range of brightness, may remain unmodified. For purposes of illustration, only pattern-based intensity modifications as discussed with reference to FIG. 5A are shown in the area having average brightness background; that is, the intensities of pixels in outer revolutions of the scan pattern are adjusted to be higher than those in more central revolutions. Pixels that will be perceived by a user as overlaying a light background may be associated with increased background-based gain values to increase intensity of those pixels, and thus the brightness of the image in the associated with those pixels. For purposes of illustration, the pattern-based gain values as discussed with reference to FIG. 5A are shown in FIG. 6 on the lighter background area with the smaller inner circles and the further increased gain values associated with the brighter background region are shown with the larger outside. It should however be understood that other factors may also be included, for example the design-based modifications as discussed with reference to FIG. 5B.


In some embodiments, additional gain adjustment may be provided in response to a user's pupil location relative to the optical relay 20. Multiple tables of the pupil-based gain data 34 and 36 may be stored within the laser driver chip 12 at the same time that the look-up table 30 is stored within the laser driver chip 12 (104). One or more eye tracking camera 24 captures video data of the eye 56 (106).



FIG. 7A illustrates the eye 56 and the eye tracking camera 24. The eye 56 has a center 108 and a pupil 110. A gaze direction 112 is defined by an eye tracking system (not shown). In some embodiments, a gaze direction may be defined using points at the center 108 of the eye and a center of the pupil 110. The eye tracking camera 24 may capture an image of the eye 56 from which the location of the pupil 110 can be determined.



FIG. 7B shows the eye 56 after it has rotated about the center 108 as represented by the angle 114 in a horizontal plane and the angle 116 in a vertical plane and has established a new gaze direction 118. The eye tracking camera 24 continues to capture images of the eye 56, and tracks the location and movement of the pupil 110.



FIG. 7C shows the eye 56 after it has rotated about the center 108 as represented by the angle 120 in a vertical plane and an angle 122 in a horizontal plane and has established a new gaze direction 124. The eye tracking camera 24 continues to capture an image of the eye 56 and tracks the movement of the pupil 110. Referring again to FIGS. 1 and 2, the eye tracking camera 24 provides the data captured in FIGS. 7A to 7C to the eye analyzer 38. The eye analyzer 38 then analyzes the eye 56 to determine the pupil location (126). The eye analyzer 38 calculates the center 108 in FIGS. 7A to 7C and the gaze directions 112, 118 and 124.


Every time that the gaze direction of the eye 56 changes, or after a predetermined time increment, the eye analyzer 38 provides the new gaze direction to the write/read alternator 40. The write/read alternator 40 selects a particular table that holds a respective set of relational pupil-based modifying data 34 or 36 based on the gaze direction received from the eye analyzer 38 (128). Only two sets of relational pupil-based modifying data 34 or 36 are shown, although many more tables may be included, each for holding gain values when a respective gaze angle is calculated. Three of the sets of relational pupil-based gain data hold gain values that modify intensity values as shown in FIGS. 7A, 7B and 7C respectively. Once the respective relational pupil-based gain data 34 or 36 is selected by the write/read alternator 40, the write/read alternator 40 connects the table to the pixel counter 42. The respective relational pupil-based gain data 34 or 36 data similar to the relational pattern-based gain data 32 in the look-up table 30. The number that is set by the pixel counter 42 is used to select to a respective gain value from the respective relational pupil-based gain data 34 or 36. The pixel counter 42 thus determines a pupil-based gain value for the number (129). The pixel counter 42 provides the pupil-based gain value to the beam modulator 28. The beam modulator 28 includes the pupil-based gain value for the number as a factor when calculating the combined gain value for the pixel (88).



FIGS. 8 and 9A to 9C illustrate intensity modifications based on pupil gaze direction. FIG. 8 shows no pupil-based modification of intensity and only shows pattern-based intensity modifications as shown in the pattern 54 on the right in FIG. 5A. FIG. 8 thus does not show any intensity modifications as necessitated due to the design of the optical relay 20 as discussed with reference to FIG. 5B or due to the background 58 as discussed with reference to FIG. 6.


In FIG. 9A, the pupil is rotated to have a gaze direction to the left relative to a center of the pattern 54 as indicated by the cross-hatching. As a result, pixels to the left have more gain than in FIG. 8. Pixels further from the gaze direction of the pupil, for example the pixels on the right, can have less gain than compared to FIG. 8. Such a configuration may advantageously allow for some power savings, thereby improving battery life for the augmented reality device. Pixels located near the gaze direction of the pupil, but not at the gaze direction of the pupil, can have unmodified gain when compared to FIG. 8.


In FIG. 9B, the pupil is rotated to have a gaze direction that corresponds to a center of the pattern 54. Pixels within a center of the pattern 54 where the gaze direction of the pupil is located have more gain than compared to FIG. 8, while pixels around a perimeter of the pattern 54 have less gain than compared to FIG. 8 and intermediate pixels have unmodified gain.


In FIG. 9C, the pupil is rotated to a location that has a gaze direction towards the right of the pattern 54. Pixels at the gaze direction of the pupil have more gain than compared to FIG. 8, while pixels further from the pupil, for example pixels on the left, have less gain than compared to FIG. 8. Intermediate pixels have unmodified gain when compared to FIG. 8.



FIG. 10 shows an example of a laser driver chip architecture. Video data with an initial current is input to a first digital-to-analog converter (DAC) and a gain is provided as a reference value to the to the first DAC via a second DAC. The video data is modified by the gain reference value to produce modified video data with a modified current. A threshold current, which may be substantially constant, is provided to a third DAC. The modified video data current is added to the threshold current to create an output current which drives a laser light source. As discussed previously herein, it may be advantageous to provide one or more gain values per pixel based on one or more of a known scan pattern, the design of an optical relay, an environment background, and a user gaze direction. Data storage for one or more of the gain value data sets may be disposed on the laser driver chip; however, one or more of the gain value data sets may be disposed off of the chip. Architecture layouts to facilitate such improvements in image frame output through an optical relay are discussed below.



FIG. 11 shows the beam modulator 28, look-up table 30 and pixel counter 42 in more detail for one laser. The laser driver chip 12 in FIG. 1 may for example be a MAXIM MAX3601 chip that is capable of driving three lasers (red, green, and blue) at video pixel rates of 160 MHz to 250 MHz. Each drive channel has two digital-to-analog converters that are used as first and second current drivers 130 and 132 to first and second current sources 134 and 136 respectively. The first current driver 130 is used to output the relatively constant laser threshold current e.g., 80 mA maximum for a MAX3601 chip (referred to herein as a threshold DAC or TDAC). The second drive channel 132 provides an output of the video modulated current e.g., 320 mA maximum for a MAX3601 chip (referred to herein as a video DAC or VDAC). The currents from the current sources 134 and 136 are added together to form the current driving the laser at an output 138. Each current driver 130 and 132 has a gain setting used to scale the maximum output current for that driver.


The video data 68 is provided through a fast interface and allows from 8 to 10 bit data at video rates. A gain value 140 to the second current driver 132 and a threshold data 142 to the first current driver 130 are sent through slow interfaces, typically less than 1 MHz update rate and cannot be varied at video rates. The gain value 140 sets the maximum current output for the specific laser such that the video scales over the required current range and yields the maximum number of color values. In effect the video current is equal to the intensity value in video data 68 times the gain value 140.


The drive channel further has a gain-setting DAC (GDAC) 146 connected to the second current driver 132 to provide the gain value 140. A multiplier 148 is used to multiply separate gains for each pixel from the look-up table 30 and from the video data 68 are multiplied by an overall gain 150 that is used for ambient light or overall brightness adjustments. The result is converted to an analog voltage and used as the gain (reference) input to the second current driver 132.



FIG. 12 shows an alternate configuration wherein the intensity value in the video data 68 is multiplied by the per-pixel gain in the look-up table 30 and the result is provided the second current driver 132. The second current driver 132 requires more input bits in the configuration of FIG. 11 that in the configuration of FIG. 10. The VDAC that forms the second current driver 132 is usually slower than the GDAC 146 in a MAXIM or a MAX3601 chip and it would be more difficult to achieve high video rates using the configuration of FIG. 11 that in the configuration of FIG. 10.



FIG. 13 shows a further configuration wherein the second current driver 132 and a third current driver 152 form two video current drivers that are used to drive separate current sources 136 and 154 respectively. The second current driver 132 has a higher reference voltage than the third current driver 152. A higher bit VDAC is formed by using two lower bit VDACs.



FIG. 14 illustrates a different scan pattern, such as a raster scan, than the spiral scan pattern of FIG. 3. Pixels that appear to have more brightness due to higher pixel density are indicated with larger hexagons. A tip of a resonating optical fiber that follows a raster scan pattern of FIG. 13 travels faster in a central region of the scan pattern than in regions on the left and on the right where the scan pattern changes direction. To compensate for reduced brightness in the central region of the image frame caused by decreased pixel density compared with the right and left side regions, pixels in an inner region may have a modified intensity that is higher than pixels in region on the left and the right. Other scan patterns may have different distributions of pixels and have different areas with more or less brightness due to pixel density variations.


The optical fiber follows a pattern from left to right and then returning from right to left on some slightly lower path and proceeds in this manner until it has completed its lowest path. When the optical fiber has completed its lowest path, it proceeds to follow pattern from left to right and then from right to left on a slightly higher path and proceeds in this manner until it reaches its original starting position at the top.


The invention may find application when using scanners other than optical fiber scanners, for example when using a MEMS scanner. A MEMS scanner has a MEMS mirror that reflects laser light. The MEMS mirror rotates about one or more axes so that the laser light that reflects from the MEMS mirror follows a path that has a predetermined pattern. The MEMS mirror typically resonates at a frequency. Because of the way that the MEMS mirror is configured, the pattern may or may not be a spiral pattern or a raster scan pattern as discussed above with respect to the path that is created with an optical fiber scanner. A MEMS scanner may create a pattern at frequency that results in differences in intensities between pixels and differences in densities of pixels.


As described, one or more lasers are used to generate red, green, blue and optionally infrared light. One skilled in the art will appreciate that the invention may also find application when a superluminescent light emitting diode (LED) or other laser or laser-like system is used.



FIG. 15 shows a diagrammatic representation of a machine in the exemplary form of a computer system 900 within which a set of instructions, for causing the machine to perform any one or more of the methodologies discussed herein, may be executed. In alternative embodiments, the machine operates as a standalone device or may be connected (e.g., networked) to other machines. Further, while only a single machine is illustrated, the term “machine” shall also be taken to include any collection of machines that individually or jointly execute a set (or multiple sets) of instructions to perform any one or more of the methodologies discussed herein.


The laser driver chip 12 includes a data store 160 and its own processor 162. The exemplary computer system 900 includes a processor 902 (e.g., a central processing unit (CPU), a graphics processing unit (GPU) or both), a main memory 904 (e.g., read only memory (ROM), flash memory, dynamic random access memory (DRAM) such as synchronous DRAM (SDRAM) or Rambus DRAM (RDRAM), etc.), and a static memory 906 (e.g., flash memory, static random access memory (SRAM), etc.), which communicate with each other via a bus 908.


The computer system 900 may further include a disk drive unit 916, and a network interface device 920.


The disk drive unit 916 includes a machine-readable medium 922 on which is stored one or more sets of instructions 924 (e.g., software) embodying any one or more of the methodologies or functions described herein. The software may also reside, completely or at least partially, within the main memory 904 and/or within the processor 902 during execution thereof by the computer system 900, the main memory 904 and the processor 902 also constituting machine-readable media.


The software may further be transmitted or received over a network 928 via the network interface device 920.


While the machine-readable medium 922 is shown in an exemplary embodiment to be a single medium, the term “machine-readable medium” should be taken to include a single medium or multiple media (e.g., a centralized or distributed database, and/or associated caches and servers) that store the one or more sets of instructions. The term “machine-readable medium” shall also be taken to include any medium that is capable of storing, encoding, or carrying a set of instructions for execution by the machine and that cause the machine to perform any one or more of the methodologies of the present invention. The term “machine-readable medium” shall accordingly be taken to include, but not be limited to, solid-state memories, optical and magnetic media, and carrier wave signals.


While certain exemplary embodiments have been described and shown in the accompanying drawings, it is to be understood that such embodiments are merely illustrative and not restrictive of the current invention, and that this invention is not restricted to the specific constructions and arrangements shown and described since modifications may occur to those ordinarily skilled in the art.

Claims
  • 1. A visual perception device comprising: a data store;relational gain data stored in the data store and representing a plurality of reference locations and a plurality of gain values, each gain value corresponding to a respective reference location;a video data receiver connectable to a video data channel to receive video data including a plurality of pixels;a correlator connected to the relational gain data and the video data receiver and operable to correlate each pixel with a reference location in the relational gain data to find a gain value corresponding to the respective pixel;a beam modulator connected to the video data receiver and the correlator and operable to modify an intensity value of the respective pixel based on the gain value for the respective pixel to determine a modulated gain value for the respective pixel; anda laser projector connected to the beam modulator and operable to generate a respective beam of light and transmit the beams of light in a pattern wherein the beams of light are spatially separated in two dimensions with the respective beams of light in the two dimensions being modulated according to the respective modulated gain values of each respective one of the pixels.
  • 2. The device of claim 1, further comprising: a look-up table, wherein the relational gain data is stored in the look-up table.
  • 3. The device of claim 1, wherein the correlator is a pixel counter that counts the pixels in the video data and determines a respective reference location in the reference data based on the counting of the pixels, the relational gain data includes three different gain values for each reference location, each gain value corresponding to a different color, the video data includes a plurality of pixels for each of the three colors, and pixels of all three colors are correlated with reference locations in the relational gain data to find a gain value corresponding to the respective pixel.
  • 4. The device of claim 1, wherein the reference locations correspond to the pattern that is created by the projector.
  • 5. The device of claim 4, wherein first and second adjacent light beams in the pattern are further from one another than third and fourth light beams in the pattern and the gain values create more intensity for the first and second light beams than for the third and fourth light beams.
  • 6. The device of claim 5, wherein the laser projector travels faster from the first light beam to the second light beam in the pattern than from the third light beam to the fourth light beam in the pattern.
  • 7. The device of claim 5, wherein the pattern is a spiral pattern and the first and second light beams are in an outer region of the pattern compared to the third and fourth light beams in the pattern.
  • 8. The device of claim 4, further comprising: an eye piece, the beams entering the eye piece, reflecting within the eye piece and exiting the eye piece, wherein the eye piece alters an intensity of the beams relative to one another and the gain values compensate for the eye piece altering the intensity of the beams relative to one another.
  • 9. The device of claim 1, wherein each pixel in the video data has as respective intensity value and the gain value in the relational data is a gain value that the beam modulator uses to modify the intensity value in the video data.
  • 10. The device of claim 9, further comprising: a background camera that captures a background; anda background analyzer connected to the background camera that determines at least one gain value based on the background, wherein the beam modulator uses the gain value based on the background to modify the intensity value in the video data.
  • 11. The device of claim 10, wherein the background analyzer determines at least a first gain value for a lighter area of the background and a second gain value for a darker area of the background and the modulator modifies the intensity value of respective pixels such that a pixel in the lighter area of the background has more intensity than a pixel in a darker area of the background.
  • 12. The device of claim 9, further comprising: an eye camera that captures an eye; andan eye analyzer connected to the eye camera that determines at least one gain value based on a gaze direction of a pupil of the eye, wherein the beam modulator uses the gain value based on the gaze direction of the pupil to modify the intensity value in the video data such that pixels in a gaze direction of the pupil have more intensity than pixels distant from the pupil.
  • 13. The device of claim 12, wherein the beam modulator reduces an intensity of pixels distant from the gaze direction of the pupil.
  • 14. The device of claim 1, wherein the beam modulator includes: a video data digital-to-analog converter (VDAC) that receives the video data;a gain digital-to-analog converter (GDAC) having an input for receiving a gain setting and an output connected to the VDAC to set a gain on the VDAC; anda multiplier connected to the relational data to modify an output of the VDAC.
  • 15. The device of claim 14, wherein the multiplier multiplies the gain that is provided to the GDAC with the gain values of the pixels to modulate the gain that is provided to the GDAC.
  • 16. The device of claim 14, wherein the multiplier multiplies the gain that is provided to the VDAC with the gain values of the pixels to modulate the gain that is provided to the VDAC.
  • 17. The device of claim 16, wherein the VDAC is a first VDAC, further comprising: a second VDAC, wherein the multiplier multiplies the gain that is provided to the second VDAC with the gain values of the pixels to modulate the gain that is provided to the VDAC; andfirst and second current sources connected to and driven by the first and second VDAC's respectively, the current sources being connected in parallel.
  • 18. The device of claim 1 further comprising: a laser driver chip, wherein the beam modulator and the relational gain data are located on the laser driver chip.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 17/256,961, filed on Dec. 29, 2020, which is a National Phase of International Patent Application No: PCT/US2019/040324, filed on Jul. 2, 2019, which claims priority from U.S. Provisional Patent Application No. 62/693,228, filed on Jul. 2, 2018, all of which are incorporated herein by reference in their entirety.

US Referenced Citations (514)
Number Name Date Kind
4344092 Miller Aug 1982 A
4652930 Crawford Mar 1987 A
4810080 Grendol et al. Mar 1989 A
4997268 Dauvergne Mar 1991 A
5007727 Kahaney et al. Apr 1991 A
5074295 Willis Dec 1991 A
5240220 Elberbaum Aug 1993 A
5251635 Dumoulin et al. Oct 1993 A
5410763 Bolle May 1995 A
5455625 Englander Oct 1995 A
5495286 Adair Feb 1996 A
5497463 Stein et al. Mar 1996 A
5659701 Amit et al. Aug 1997 A
5682255 Friesem et al. Oct 1997 A
5689669 Lynch Nov 1997 A
5826092 Flannery Oct 1998 A
5854872 Tai Dec 1998 A
5864365 Sramek et al. Jan 1999 A
5937202 Crosetto Aug 1999 A
6002853 de Hond Dec 1999 A
6012811 Chao et al. Jan 2000 A
6016160 Coombs et al. Jan 2000 A
6064749 Hirota et al. May 2000 A
6076927 Owens Jun 2000 A
6079982 Meader Jun 2000 A
6117923 Amagai et al. Sep 2000 A
6119147 Toomey et al. Sep 2000 A
6124977 Takahashi Sep 2000 A
6179619 Tanaka Jan 2001 B1
6191809 Hori et al. Feb 2001 B1
6219045 Leahy et al. Apr 2001 B1
6243091 Berstis Jun 2001 B1
6271843 Lection et al. Aug 2001 B1
6362817 Powers et al. Mar 2002 B1
6375369 Schneider et al. Apr 2002 B1
6385735 Wilson May 2002 B1
6396522 Vu May 2002 B1
6414679 Miodonski et al. Jul 2002 B1
6538655 Kubota Mar 2003 B1
6541736 Huang et al. Apr 2003 B1
6570563 Honda May 2003 B1
6573903 Gantt Jun 2003 B2
6590593 Robertson et al. Jul 2003 B1
6621508 Shiraishi et al. Sep 2003 B1
6690393 Heron et al. Feb 2004 B2
6757068 Foxlin Jun 2004 B2
6784901 Harvfey et al. Aug 2004 B1
6961055 Doak Nov 2005 B2
7046515 Wyatt May 2006 B1
7051219 Hwang May 2006 B2
7076674 Cervantes Jul 2006 B2
7111290 Yates, Jr. Sep 2006 B1
7119819 Robertson et al. Oct 2006 B1
7219245 Raghuvanshi May 2007 B1
7382288 Wilson Jun 2008 B1
7414629 Santodomingo Aug 2008 B2
7431453 Hogan Oct 2008 B2
7467356 Gettman et al. Dec 2008 B2
7542040 Templeman Jun 2009 B2
7573640 Nivon et al. Aug 2009 B2
7653877 Matsuda Jan 2010 B2
7663625 Chartier et al. Feb 2010 B2
7724980 Shenzhi May 2010 B1
7746343 Charaniya et al. Jun 2010 B1
7751662 Kleemann Jul 2010 B2
7758185 Lewis Jul 2010 B2
7788323 Greenstein et al. Aug 2010 B2
7804507 Yang et al. Sep 2010 B2
7814429 Buffet et al. Oct 2010 B2
7817150 Reichard et al. Oct 2010 B2
7844724 Van Wie et al. Nov 2010 B2
8060759 Arnan et al. Nov 2011 B1
8120851 Iwasa Feb 2012 B2
8214660 Capps, Jr. Jul 2012 B2
8246408 Elliot Aug 2012 B2
8353594 Lewis Jan 2013 B2
8360578 Nummela et al. Jan 2013 B2
8508676 Silverstein et al. Aug 2013 B2
8547638 Levola Oct 2013 B2
8605764 Rothaar Dec 2013 B1
8619365 Harris et al. Dec 2013 B2
8696113 Lewis Apr 2014 B2
8698701 Margulis Apr 2014 B2
8733927 Lewis May 2014 B1
8736636 Kang May 2014 B2
8759929 Shiozawa et al. Jun 2014 B2
8793770 Lim Jul 2014 B2
8823855 Hwang Sep 2014 B2
8847988 Geisner et al. Sep 2014 B2
8874673 Kim Oct 2014 B2
9010929 Lewis Apr 2015 B2
9015501 Gee Apr 2015 B2
9086537 Iwasa et al. Jul 2015 B2
9095437 Boyden et al. Aug 2015 B2
9239473 Lewis Jan 2016 B2
9244293 Lewis Jan 2016 B2
9244533 Friend et al. Jan 2016 B2
9383823 Geisner et al. Jul 2016 B2
9489027 Ogletree Nov 2016 B1
9519305 Wolfe Dec 2016 B2
9581820 Robbins Feb 2017 B2
9582060 Balatsos Feb 2017 B2
9658473 Lewis May 2017 B2
9671566 Abovitz et al. Jun 2017 B2
9671615 Vallius et al. Jun 2017 B1
9696795 Marcolina et al. Jul 2017 B2
9798144 Sako et al. Oct 2017 B2
9874664 Stevens et al. Jan 2018 B2
9880441 Osterhout Jan 2018 B1
9918058 Takahasi et al. Mar 2018 B2
9955862 Freeman et al. May 2018 B2
9978118 Ozgumer et al. May 2018 B1
9996797 Holz et al. Jun 2018 B1
10018844 Levola et al. Jul 2018 B2
10082865 Raynal et al. Sep 2018 B1
10151937 Lewis Dec 2018 B2
10185147 Lewis Jan 2019 B2
10218679 Jawahar Feb 2019 B1
10241545 Richards et al. Mar 2019 B1
10317680 Richards et al. Jun 2019 B1
10436594 Belt et al. Oct 2019 B2
10516853 Gibson et al. Dec 2019 B1
10551879 Richards et al. Feb 2020 B1
10578870 Kimmel Mar 2020 B2
10698202 Kimmel et al. Jun 2020 B2
10856107 Mycek et al. Oct 2020 B2
10825424 Zhang Nov 2020 B2
10987176 Poltaretskyi et al. Apr 2021 B2
11190681 Brook Nov 2021 B1
11209656 Choi Dec 2021 B1
11236993 Hall Feb 2022 B1
20010010598 Aritake et al. Aug 2001 A1
20010018667 Kim Aug 2001 A1
20020007463 Fung Jan 2002 A1
20020108064 Nunally Feb 2002 A1
20020063913 Nakamura et al. May 2002 A1
20020071050 Homberg Jun 2002 A1
20020095463 Matsuda Jul 2002 A1
20020113820 Robinson et al. Aug 2002 A1
20020122648 Mule′ et al. Sep 2002 A1
20020140848 Cooper et al. Oct 2002 A1
20030028816 Bacon Feb 2003 A1
20030048456 Hill Mar 2003 A1
20030067685 Niv Apr 2003 A1
20030077458 Korenaga et al. Apr 2003 A1
20030080976 Satoh et al. May 2003 A1
20030115494 Cervantes Jun 2003 A1
20030218614 Lavelle et al. Nov 2003 A1
20030219992 Schaper Nov 2003 A1
20030226047 Park Dec 2003 A1
20040001533 Tran et al. Jan 2004 A1
20040021600 Wittenberg Feb 2004 A1
20040025069 Gary et al. Feb 2004 A1
20040042377 Nikoloai et al. Mar 2004 A1
20040073822 Greco Apr 2004 A1
20040073825 Itoh Apr 2004 A1
20040111248 Granny et al. Jun 2004 A1
20040113887 Pair et al. Jun 2004 A1
20040174496 Ji et al. Sep 2004 A1
20040186902 Stewart Sep 2004 A1
20040193441 Altieri Sep 2004 A1
20040201857 Foxlin Oct 2004 A1
20040238732 State et al. Dec 2004 A1
20040240072 Schindler et al. Dec 2004 A1
20040246391 Travis Dec 2004 A1
20040268159 Aasheim et al. Dec 2004 A1
20050001977 Zelman Jan 2005 A1
20050034002 Flautner Feb 2005 A1
20050093719 Okamoto et al. May 2005 A1
20050128212 Edecker et al. Jun 2005 A1
20050157159 Komiya et al. Jul 2005 A1
20050177385 Hull Aug 2005 A1
20050231599 Yamasaki Oct 2005 A1
20050273792 Inohara et al. Dec 2005 A1
20060013435 Rhoads Jan 2006 A1
20060015821 Jacques Parker et al. Jan 2006 A1
20060019723 Vorenkamp Jan 2006 A1
20060038880 Starkweather et al. Feb 2006 A1
20060050224 Smith Mar 2006 A1
20060090092 Verhulst Apr 2006 A1
20060126181 Levola Jun 2006 A1
20060129852 Bonola Jun 2006 A1
20060132914 Weiss et al. Jun 2006 A1
20060179329 Terechko Aug 2006 A1
20060221448 Nivon et al. Oct 2006 A1
20060228073 Mukawa et al. Oct 2006 A1
20060250322 Hall et al. Nov 2006 A1
20060259621 Ranganathan Nov 2006 A1
20060268220 Hogan Nov 2006 A1
20070058248 Nguyen et al. Mar 2007 A1
20070103836 Oh May 2007 A1
20070124730 Pytel May 2007 A1
20070159673 Freeman et al. Jul 2007 A1
20070188837 Shimizu et al. Aug 2007 A1
20070198886 Saito Aug 2007 A1
20070204672 Huang et al. Sep 2007 A1
20070213952 Cirelli Sep 2007 A1
20070283247 Brenneman et al. Dec 2007 A1
20080002259 Ishizawa et al. Jan 2008 A1
20080002260 Arrouy et al. Jan 2008 A1
20080030429 Hailpern Feb 2008 A1
20080043334 Itzkovitch et al. Feb 2008 A1
20080046773 Ham Feb 2008 A1
20080063802 Maula et al. Mar 2008 A1
20080068557 Menduni et al. Mar 2008 A1
20080125218 Collins May 2008 A1
20080146942 Dala-Krishna Jun 2008 A1
20080173036 Willaims Jul 2008 A1
20080177506 Kim Jul 2008 A1
20080183190 Adcox et al. Jul 2008 A1
20080205838 Crippa et al. Aug 2008 A1
20080215907 Wilson Sep 2008 A1
20080225393 Rinko Sep 2008 A1
20080235570 Sawada et al. Sep 2008 A1
20080246693 Hailpern et al. Oct 2008 A1
20080316768 Travis Dec 2008 A1
20090076791 Rhoades et al. Mar 2009 A1
20090091583 McCoy Apr 2009 A1
20090153797 Allon et al. Jun 2009 A1
20090224416 Laakkonen et al. Sep 2009 A1
20090245730 Kleemann Oct 2009 A1
20090287728 Martine et al. Nov 2009 A1
20090300528 Stambaugh Dec 2009 A1
20090310633 Ikegami Dec 2009 A1
20100005326 Archer Jan 2010 A1
20100019962 Fujita Jan 2010 A1
20100056274 Uusitalo et al. Mar 2010 A1
20100063854 Purvis et al. Mar 2010 A1
20100070378 Trotman et al. Mar 2010 A1
20100079841 Levola Apr 2010 A1
20100115428 Shuping et al. May 2010 A1
20100153934 Lachner Jun 2010 A1
20100194632 Raento et al. Aug 2010 A1
20100205541 Rappaport et al. Aug 2010 A1
20100214284 Rieffel et al. Aug 2010 A1
20100232016 Landa et al. Sep 2010 A1
20100232031 Batchko et al. Sep 2010 A1
20100244168 Shiozawa et al. Sep 2010 A1
20100274567 Carlson et al. Oct 2010 A1
20100274627 Carlson Oct 2010 A1
20100277803 Pockett et al. Nov 2010 A1
20100284085 Laakkonen Nov 2010 A1
20100287485 Bertolami et al. Nov 2010 A1
20100296163 Sarikko Nov 2010 A1
20100309687 Sampsell et al. Dec 2010 A1
20110010636 Hamilton, II et al. Jan 2011 A1
20110021263 Anderson et al. Jan 2011 A1
20110022870 Mcgrane Jan 2011 A1
20110041083 Gabai et al. Feb 2011 A1
20110050640 Lundback et al. Mar 2011 A1
20110050655 Mukawa Mar 2011 A1
20110064268 Cobb et al. Mar 2011 A1
20110122240 Becker May 2011 A1
20110145617 Thomson et al. Jun 2011 A1
20110170801 Lu et al. Jul 2011 A1
20110218733 Hamza et al. Sep 2011 A1
20110286735 Temblay Nov 2011 A1
20110291969 Rashid et al. Dec 2011 A1
20120011389 Driesen Jan 2012 A1
20120050535 Densham et al. Mar 2012 A1
20120075501 Oyagi et al. Mar 2012 A1
20120081392 Arthur Apr 2012 A1
20120089854 Breakstone Apr 2012 A1
20120113235 Shintani May 2012 A1
20120127062 Bar-Zeev et al. May 2012 A1
20120154557 Perez et al. Jun 2012 A1
20120215094 Rahimian et al. Aug 2012 A1
20120218301 Miller Aug 2012 A1
20120246506 Knight Sep 2012 A1
20120249416 Maciocci et al. Oct 2012 A1
20120249741 Maciocci et al. Oct 2012 A1
20120260083 Andrews Oct 2012 A1
20120307075 Margalitq Dec 2012 A1
20120307362 Silverstein et al. Dec 2012 A1
20120314959 White et al. Dec 2012 A1
20120320460 Levola Dec 2012 A1
20120326948 Crocco et al. Dec 2012 A1
20130021486 Richardon Jan 2013 A1
20130050258 Liu et al. Feb 2013 A1
20130050642 Lewis et al. Feb 2013 A1
20130050833 Lewis et al. Feb 2013 A1
20130051730 Travers et al. Feb 2013 A1
20130061240 Yan et al. Mar 2013 A1
20130077049 Bohn Mar 2013 A1
20130077170 Ukuda Mar 2013 A1
20130094148 Sloane Apr 2013 A1
20130129282 Li May 2013 A1
20130162940 Kurtin et al. Jun 2013 A1
20130169923 Schnoll et al. Jul 2013 A1
20130205126 Kruglick Aug 2013 A1
20130222386 Tannhauser et al. Aug 2013 A1
20130268257 Hu Oct 2013 A1
20130278633 Ahn et al. Oct 2013 A1
20130314789 Saarikko et al. Nov 2013 A1
20130318276 Dalal Nov 2013 A1
20130336138 Venkatraman et al. Dec 2013 A1
20130342564 Kinnebrew et al. Dec 2013 A1
20130342570 Kinnebrew et al. Dec 2013 A1
20130342571 Kinnebrew et al. Dec 2013 A1
20130343408 Cook Dec 2013 A1
20140002329 Nishimaki et al. Jan 2014 A1
20140013098 Yeung Jan 2014 A1
20140016821 Arth et al. Jan 2014 A1
20140022819 Oh et al. Jan 2014 A1
20140078023 Ikeda et al. Mar 2014 A1
20140082526 Park et al. Mar 2014 A1
20140119598 Ramachandran et al. May 2014 A1
20140126769 Reitmayr et al. May 2014 A1
20140140653 Brown et al. May 2014 A1
20140149573 Tofighbakhsh et al. May 2014 A1
20140168260 O'Brien et al. Jun 2014 A1
20140244983 McDonald et al. Aug 2014 A1
20140266987 Magyari Sep 2014 A1
20140267419 Ballard et al. Sep 2014 A1
20140274391 Stafford Sep 2014 A1
20140282105 Nordstrom Sep 2014 A1
20140292645 Tsurumi et al. Oct 2014 A1
20140313228 Kasahara Oct 2014 A1
20140340498 Plagemann et al. Nov 2014 A1
20140359589 Kodsky et al. Dec 2014 A1
20140375680 Ackerman et al. Dec 2014 A1
20150005785 Olson Jan 2015 A1
20150009099 Queen Jan 2015 A1
20150077312 Wang Mar 2015 A1
20150097719 Balachandreswaran Apr 2015 A1
20150123966 Newman May 2015 A1
20150130790 Vazquez, II et al. May 2015 A1
20150134995 Park et al. May 2015 A1
20150138248 Schrader May 2015 A1
20150155939 Oshima et al. Jun 2015 A1
20150168221 Mao et al. Jun 2015 A1
20150205126 Schowengerdt Jul 2015 A1
20150235427 Nobori et al. Aug 2015 A1
20150235431 Schowengerdt Aug 2015 A1
20150253651 Russell et al. Sep 2015 A1
20150256484 Cameron Sep 2015 A1
20150269784 Miyawaki et al. Sep 2015 A1
20150294483 Wells et al. Oct 2015 A1
20150301955 Yakovenko et al. Oct 2015 A1
20150310657 Eden Oct 2015 A1
20150338915 Publicover et al. Nov 2015 A1
20150355481 Hilkes et al. Dec 2015 A1
20160004102 Nisper et al. Jan 2016 A1
20160015470 Border Jan 2016 A1
20160027215 Burns et al. Jan 2016 A1
20160033770 Fujimaki et al. Feb 2016 A1
20160051217 Douglas et al. Feb 2016 A1
20160077338 Robbins et al. Mar 2016 A1
20160085285 Mangione-Smith Mar 2016 A1
20160085300 Robbins et al. Mar 2016 A1
20160091720 Stafford et al. Mar 2016 A1
20160093099 Bridges Mar 2016 A1
20160093269 Buckley Mar 2016 A1
20160103326 Kimura et al. Apr 2016 A1
20160123745 Cotier et al. May 2016 A1
20160139402 Lapstun May 2016 A1
20160139411 Kang et al. May 2016 A1
20160155273 Lyren et al. Jun 2016 A1
20160180596 Gonzalez del Rosario Jun 2016 A1
20160187654 Border et al. Jun 2016 A1
20160191887 Casas Jun 2016 A1
20160202496 Billetz et al. Jul 2016 A1
20160217624 Finn et al. Jul 2016 A1
20160266412 Yoshida Sep 2016 A1
20160267708 Nistico et al. Sep 2016 A1
20160274733 Hasegawa et al. Sep 2016 A1
20160287337 Aram et al. Oct 2016 A1
20160300388 Stafford et al. Oct 2016 A1
20160321551 Priness et al. Nov 2016 A1
20160327798 Xiao et al. Nov 2016 A1
20160334279 Mittleman et al. Nov 2016 A1
20160357255 Lindh et al. Dec 2016 A1
20160370404 Quadrat et al. Dec 2016 A1
20160370510 Thomas Dec 2016 A1
20170038607 Camara Feb 2017 A1
20170060225 Zha et al. Mar 2017 A1
20170061696 Li et al. Mar 2017 A1
20170064066 Das et al. Mar 2017 A1
20170100664 Osterhout et al. Apr 2017 A1
20170102544 Vallius et al. Apr 2017 A1
20170115487 Travis Apr 2017 A1
20170122725 Yeoh et al. May 2017 A1
20170123526 Trail et al. May 2017 A1
20170127295 Black et al. May 2017 A1
20170131569 Aschwanden et al. May 2017 A1
20170147066 Katz et al. May 2017 A1
20170160518 Lanman et al. Jun 2017 A1
20170161951 Fix et al. Jun 2017 A1
20170185261 Perez et al. Jun 2017 A1
20170192239 Nakamura et al. Jul 2017 A1
20170201709 Igarashi et al. Jul 2017 A1
20170205903 Miller et al. Jul 2017 A1
20170206668 Poulos et al. Jul 2017 A1
20170213388 Margolis et al. Jul 2017 A1
20170214907 Lapstun Jul 2017 A1
20170219841 Popovich et al. Aug 2017 A1
20170232345 Rofougaran et al. Aug 2017 A1
20170235126 DiDomenico Aug 2017 A1
20170235129 Kamakura Aug 2017 A1
20170235142 Wall et al. Aug 2017 A1
20170235144 Piskunov et al. Aug 2017 A1
20170235147 Kamakura Aug 2017 A1
20170243403 Daniels et al. Aug 2017 A1
20170246070 Osterhout et al. Aug 2017 A1
20170254832 Ho et al. Sep 2017 A1
20170256096 Faaborg et al. Sep 2017 A1
20170258526 Lang Sep 2017 A1
20170266529 Reikmoto Sep 2017 A1
20170270712 Tyson et al. Sep 2017 A1
20170281054 Stever et al. Oct 2017 A1
20170287376 Bakar et al. Oct 2017 A1
20170293141 Schowengerdt et al. Oct 2017 A1
20170307886 Stenberg et al. Oct 2017 A1
20170307891 Bucknor et al. Oct 2017 A1
20170312032 Amanatullah et al. Nov 2017 A1
20170322418 Liu et al. Nov 2017 A1
20170322426 Tervo Nov 2017 A1
20170329137 Tervo Nov 2017 A1
20170332098 Rusanovskyy et al. Nov 2017 A1
20170336636 Amitai et al. Nov 2017 A1
20170357332 Balan et al. Dec 2017 A1
20170363871 Vallius Dec 2017 A1
20170371394 Chan Dec 2017 A1
20170371661 Sparling Dec 2017 A1
20180014266 Chen Jan 2018 A1
20180024289 Fattal Jan 2018 A1
20180044173 Netzer Feb 2018 A1
20180052007 Teskey et al. Feb 2018 A1
20180052501 Jones, Jr. et al. Feb 2018 A1
20180059305 Popovich et al. Mar 2018 A1
20180067779 Pillalamarri et al. Mar 2018 A1
20180070855 Eichler Mar 2018 A1
20180082480 White et al. Mar 2018 A1
20180084245 Lapstun Mar 2018 A1
20180088185 Woods et al. Mar 2018 A1
20180102981 Kurtzman et al. Apr 2018 A1
20180108179 Tomlin et al. Apr 2018 A1
20180114298 Malaika et al. Apr 2018 A1
20180129112 Osterhout May 2018 A1
20180131907 Schmirler et al. May 2018 A1
20180136466 Ko May 2018 A1
20180144691 Choi et al. May 2018 A1
20180150971 Adachi et al. May 2018 A1
20180151796 Akahane May 2018 A1
20180172995 Lee et al. Jun 2018 A1
20180188115 Hsu et al. Jul 2018 A1
20180189568 Powderly et al. Jul 2018 A1
20180190017 Mendez et al. Jul 2018 A1
20180191990 Motoyama et al. Jul 2018 A1
20180217395 Lin et al. Aug 2018 A1
20180218545 Garcia et al. Aug 2018 A1
20180250589 Cossairt et al. Sep 2018 A1
20180260218 Gopal Sep 2018 A1
20180284877 Klein Oct 2018 A1
20180292654 Wall et al. Oct 2018 A1
20180299678 Singer et al. Oct 2018 A1
20180357472 Dreessen Dec 2018 A1
20190005069 Filgueiras de Araujo et al. Jan 2019 A1
20190011691 Peyman Jan 2019 A1
20190056591 Tervo et al. Feb 2019 A1
20190087015 Lam et al. Mar 2019 A1
20190101758 Zhu et al. Apr 2019 A1
20190107723 Lee et al. Apr 2019 A1
20190137788 Suen May 2019 A1
20190155034 Singer et al. May 2019 A1
20190155439 Mukherjee et al. May 2019 A1
20190158926 Kang May 2019 A1
20190162950 Lapstun May 2019 A1
20190167095 Krueger Jun 2019 A1
20190172216 Ninan et al. Jun 2019 A1
20190178654 Hare Jun 2019 A1
20190182415 Sivan Jun 2019 A1
20190196690 Chong et al. Jun 2019 A1
20190206116 Xu et al. Jul 2019 A1
20190219815 Price Jul 2019 A1
20190243123 Bohn Aug 2019 A1
20190287270 Nakamura et al. Sep 2019 A1
20190318502 He et al. Oct 2019 A1
20190318540 Piemonte et al. Oct 2019 A1
20190321728 Imai et al. Oct 2019 A1
20190347853 Chen et al. Nov 2019 A1
20190380792 Poltaretskyi et al. Dec 2019 A1
20190388182 Kumar et al. Dec 2019 A1
20200066045 Stahl et al. Feb 2020 A1
20200098188 Bar-Zeev et al. Mar 2020 A1
20200100057 Galon et al. Mar 2020 A1
20200110928 Al Jazaery et al. Apr 2020 A1
20200117267 Gibson et al. Apr 2020 A1
20200117270 Gibson et al. Apr 2020 A1
20200184217 Faulkner Jun 2020 A1
20200184653 Faulker Jun 2020 A1
20200202759 Ukai Jun 2020 A1
20200242848 Ambler et al. Jul 2020 A1
20200309944 Thoresen et al. Oct 2020 A1
20200356161 Wagner Nov 2020 A1
20200368616 Delamont Nov 2020 A1
20200391115 Leeper et al. Dec 2020 A1
20200409528 Lee Dec 2020 A1
20210008413 Asikainen et al. Jan 2021 A1
20210033871 Jacoby et al. Feb 2021 A1
20210041951 Gibson et al. Feb 2021 A1
20210053820 Gurin et al. Feb 2021 A1
20210093391 Poltaretskyi et al. Apr 2021 A1
20210093410 Gaborit et al. Apr 2021 A1
20210093414 Moore et al. Apr 2021 A1
20210097886 Kuester et al. Apr 2021 A1
20210124901 Liu et al. Apr 2021 A1
20210132380 Wieczorek May 2021 A1
20210141225 Meynen et al. May 2021 A1
20210142582 Jones et al. May 2021 A1
20210158023 Fu et al. May 2021 A1
20210158627 Cossairt et al. May 2021 A1
20210173480 Osterhout Jun 2021 A1
20220366598 Azimi et al. Nov 2022 A1
Foreign Referenced Citations (117)
Number Date Country
100416340 Sep 2008 CN
101449270 Jun 2009 CN
103460255 Dec 2013 CN
104040410 Sep 2014 CN
104603675 May 2015 CN
105938426 Sep 2016 CN
106662754 May 2017 CN
107683497 Feb 2018 CN
109223121 Jan 2019 CN
105190427 Nov 2019 CN
0504930 Mar 1992 EP
0535402 Apr 1993 EP
0632360 Jan 1995 EP
1215522 Jun 2002 EP
1494110 Jan 2005 EP
1938141 Jul 2008 EP
1943556 Jul 2008 EP
2290428 Mar 2011 EP
2350774 Aug 2011 EP
1237067 Jan 2016 EP
3139245 Mar 2017 EP
3164776 May 2017 EP
3236211 Oct 2017 EP
2723240 Aug 2018 EP
2896986 Feb 2021 EP
2499635 Aug 2013 GB
2542853 Apr 2017 GB
938DEL2004 Jun 2006 IN
H03-036974 Apr 1991 JP
H10-333094 Dec 1998 JP
2002-529806 Sep 2002 JP
2003-029198 Jan 2003 JP
2003-141574 May 2003 JP
2003-228027 Aug 2003 JP
2003-329873 Nov 2003 JP
2005-303843 Oct 2005 JP
2007-012530 Jan 2007 JP
2007-86696 Apr 2007 JP
2007-273733 Oct 2007 JP
2008-257127 Oct 2008 JP
2009-090689 Apr 2009 JP
2009-244869 Oct 2009 JP
2010-014443 Jan 2010 JP
2010-139575 Jun 2010 JP
2011-033993 Feb 2011 JP
2011-257203 Dec 2011 JP
2011-530131 Dec 2011 JP
2012-015774 Jan 2012 JP
2012-235036 Nov 2012 JP
2013-525872 Jun 2013 JP
2013-206322 Oct 2013 JP
2014-500522 Jan 2014 JP
2014-192550 Oct 2014 JP
2015-191032 Nov 2015 JP
2016-502120 Jan 2016 JP
2016-85463 May 2016 JP
2016-516227 Jun 2016 JP
2016-126134 Jul 2016 JP
2017-015697 Jan 2017 JP
2017-153498 Sep 2017 JP
2017-531840 Oct 2017 JP
2017-535825 Nov 2017 JP
6232763 Nov 2017 JP
6333965 May 2018 JP
2005-0010775 Jan 2005 KR
10-2006-0059992 Jun 2006 KR
10-2011-0006408 Jan 2011 KR
10-1372623 Mar 2014 KR
10-2017-0017243 Feb 2017 KR
201219829 May 2012 TW
201803289 Jan 2018 TW
1991000565 Jan 1991 WO
2000030368 Jun 2000 WO
2002071315 Sep 2002 WO
2004095248 Nov 2004 WO
2006132614 Dec 2006 WO
2007041678 Apr 2007 WO
2007037089 May 2007 WO
2007085682 Aug 2007 WO
2007102144 Sep 2007 WO
2008148927 Dec 2008 WO
2009101238 Aug 2009 WO
2010015807 Feb 2010 WO
2014203440 Dec 2010 WO
2012030787 Mar 2012 WO
2013049012 Apr 2013 WO
2013062701 May 2013 WO
2013145536 Oct 2013 WO
2014033306 Mar 2014 WO
2015079610 Jun 2015 WO
2015143641 Oct 2015 WO
2015143641 Oct 2015 WO
2015194597 Dec 2015 WO
2016054092 Apr 2016 WO
2017004695 Jan 2017 WO
2017044761 Mar 2017 WO
2017049163 Mar 2017 WO
2017051595 Mar 2017 WO
2017120475 Jul 2017 WO
2017176861 Oct 2017 WO
2017203201 Nov 2017 WO
2017203201 Nov 2017 WO
2018008232 Jan 2018 WO
2018031261 Feb 2018 WO
2018022523 Feb 2018 WO
2018044537 Mar 2018 WO
2018039273 Mar 2018 WO
2018057564 Mar 2018 WO
2018085287 May 2018 WO
2018087408 May 2018 WO
2018097831 May 2018 WO
2018166921 Sep 2018 WO
2018166921 Sep 2018 WO
2018236587 Dec 2018 WO
2019040493 Feb 2019 WO
2019148154 Aug 2019 WO
2020010226 Jan 2020 WO
Non-Patent Literature Citations (265)
Entry
“ARToolKit: Hardware”, https://web.archive.org/web/20051013062315/http://www.hitl.washington.edu:80/artoolkit/documentation/hardware.htm (downloaded Oct. 26, 2020), Oct. 13, 2015, (3 pages).
“Communication according to Rule 164(1) EPC dated Feb. 23, 2022”, European Patent Application No. 20753144.3 , (11 pages).
“Communication Pursuant to Article 94(3) EPC dated Sep. 4, 2019”, European Patent Application No. 10793707.0 , (4 pages).
“Communication Pursuant to Article 94(3) EPC dated Apr. 25, 2022”, European Patent Application No. 18885707.2 , (5 pages).
“Communication Pursuant to Article 94(3) EPC dated Jan. 4, 2022”, European Patent Application No. 20154070.5 , (8 pages).
“Communication Pursuant to Article 94(3) EPC dated May 30, 2022”, European Patent Application No. 19768418.6 , (6 pages).
“Communication Pursuant to Article 94(3) EPC dated Oct. 21, 2021”, European Patent Application No. 16207441.3 , (4 pages).
“Communication Pursuant to Rule 164(1) EPC dated Jul. 27, 2021”, European Patent Application No. 19833664.6 , (11 pages).
“European Search Report dated Oct. 15, 2020”, European Patent Application No. 20180623.9 , (10 pages).
“Extended European Search Report dated May 20, 2020”, European Patent Application No. 20154070.5 , (7 pages).
“Extended European Search Report dated Jan. 22, 2021”, European Patent Application No. 18890390.0 , (11 pages).
“Extended European Search Report dated Nov. 3, 2020”, European Patent Application No. 18885707.2 , (7 pages).
“Extended European Search Report dated Jun. 30, 2021”, European Patent Application No. 19811971.1 , (9 pages).
“Extended European Search Report dated Mar. 4, 2021”, European Patent Application No. 19768418.6 , (9 pages).
“Extended European Search Report dated Nov. 4, 2020”, European Patent Application No. 20190980.1 , (14 pages).
“Extended European Search Report dated Aug. 24, 2022”, European Patent Application No. 20846338.0 , (13 pages).
“Extended European Search Report dated Aug. 8, 2022”, European Patent Application No. 19898874.3 , (8 pages).
“Extended European Search Report dated Sep. 8, 2022”, European Patent Application No. 20798769.4 , (13 pages).
“Extended European Search Report dated Nov. 3, 2022”, European Patent Application No. 20770244.0 , (23 pages).
“Extended European Search Report dated Jun. 12, 2017”, European Patent Application No. 16207441.3 , (8 pages).
“Extended European Search Report dated Jan. 28, 2022”, European Patent Application No. 19815876.8 , (9 pages).
“Extended European Search Report dated Jan. 4, 2022”, European Patent Application No. 19815085.6 , (9 pages).
“Extended European Search Report dated Jul. 16, 2021”, European Patent Application No. 19810142.0 , (14 pages).
“Extended European Search Report dated Jul. 30, 2021”, European Patent Application No. 19839970.1 , (7 pages).
“Extended European Search Report dated Jun. 19, 2020”, European Patent Application No. 20154750.2 , (10 pages).
“Extended European Search Report dated Mar. 22, 2022”, European Patent Application No. 19843487.0 , (14 pages).
“Extended European Search Report dated May 16, 2022”, European Patent Application No. 19871001.4 , (9 pages).
“Extended European Search Report dated May 30, 2022”, European Patent Application No. 20753144.3 , (10 pages).
“Extended European Search Report dated Oct. 27, 2021”, European Patent Application No. 19833664.6 , (10 pages).
“Extended European Search Report dated Sep. 20, 2021”, European Patent Application No. 19851373.1 , (8 pages).
“Extended European Search Report dated Sep. 28, 2021”, European Patent Application No. 19845418.3 , (13 pages).
“Final Office Action dated Aug. 10, 2020”, U.S. Appl. No. 16/225,961 , (13 pages).
“Final Office Action dated Dec. 4, 2019”, U.S. Appl. No. 15/564,517 , (15 pages).
“Final Office Action dated Feb. 19, 2020”, U.S. Appl. No. 15/552,897 , (17 pages).
“Final Office Action dated Feb. 23, 2022”, U.S. Appl. No. 16/748,193 , (23 pages).
“Final Office Action dated Feb. 3, 2022”, U.S. Appl. No. 16/864,721 , (36 pages).
“Final Office Action dated Jul. 13, 2022”, U.S. Appl. No. 17/262,991 , (18 pages).
“Final Office Action dated Jun. 15, 2021”, U.S. Appl. No. 16/928,313 , (42 pages).
“Final Office Action dated Mar. 1, 2021”, U.S. Appl. No. 16/214,575 , (29 pages).
“Final Office Action dated Mar. 19, 2021”, U.S. Appl. No. 16/530,776 , (25 pages).
“Final Office Action dated Nov. 24, 2020”, U.S. Appl. No. 16/435,933 , (44 pages).
“Final Office Action dated Sep. 17, 2021”, U.S. Appl. No. 16/938,782 , (44 pages).
“First Examination Report dated Jul. 27, 2022”, Chinese Patent Application No. 201980036675.2 , (5 pages).
“First Examination Report dated Jul. 28, 2022”, Indian Patent Application No. 202047024232 , (6 pages).
“First Examination Report dated May 13, 2022”, Indian Patent Application No. 202047026359 , (8 pages).
“First Office Action dated Mar. 14, 2022 with English translation”, Chinese Patent Application No. 201880079474.6 , (11 pages).
“First Office Action dated Sep. 16, 2022 with English translation”, Chinese Patent Application No. 201980063642.7 , (7 pages).
“FS_XR5G: Permanent document, v0.4.0”, Qualcomm Incorporated, 3GPP TSG-SA 4 Meeting 103 retrieved from the Internet: URL:http://www.3gpp.org/ftp/Meetings%5F3GPP%5FSYNC/SA4/Docs/S4%2DI90526%2Ezip [retrieved on Apr. 12, 2019] , Apr. 12, 2019 , (98 pages).
“International Search Report and Written Opinion dated Feb. 12, 2021”, International Application No. PCT/US20/60555 , (25 pages).
“International Search Report and Written Opinion dated Mar. 12, 2020”, International PCT Patent Application No. PCT/US19/67919 , (14 pages).
“International Search Report and Written Opinion dated Aug. 15, 2019”, International PCT Patent Application No. PCT/US19/33987 , (20 pages).
“International Search Report and Written Opinion dated Jun. 15, 2020”, International PCT Patent Application No. PCT/US2020/017023 , (13 pages).
“International Search Report and Written Opinion dated Oct. 16, 2019”, International PCT Patent Application No. PCT/US19/43097 , (10 pages).
“International Search Report and Written Opinion dated Oct. 16, 2019”, International PCT Patent Application No. PCT/US19/36275 , (10 pages).
“International Search Report and Written Opinion dated Oct. 16, 2019”, International PCT Patent Application No. PCT/US19/43099 , (9 pages).
“International Search Report and Written Opinion dated Jun. 17, 2016”, International PCT Patent Application No. PCT/FI2016/050172 , (9 pages).
“International Search Report and Written Opinion dated Feb. 2, 2021”, International PCT Patent Application No. PCT/US20/60550 , (9 pages).
“International Search Report and Written Opinion dated Oct. 22, 2019”, International PCT Patent Application No. PCT/US19/43751 , (9 pages).
“International Search Report and Written Opinion dated Dec. 23, 2019”, International PCT Patent Application No. PCT/US19/44953 , (11 pages).
“International Search Report and Written Opinion dated May 23, 2019”, International PCT Patent Application No. PCT/US18/66514 , (17 pages).
“International Search Report and Written Opinion dated Sep. 26, 2019”, International PCT Patent Application No. PCT/US19/40544 , (12 pages).
“International Search Report and Written Opinion dated Aug. 27, 2019”, International PCT Application No. PCT/US2019/035245 , (8 pages).
“International Search Report and Written Opinion dated Dec. 27, 2019”, International Application No. PCT/US19/47746 , (16 pages).
“International Search Report and Written Opinion dated Dec. 3, 2020”, International Patent Application No. PCT/US20/43596 , (25 pages).
“International Search Report and Written Opinion dated Sep. 30, 2019”, International Patent Application No. PCT/US19/40324 , (7 pages).
“International Search Report and Written Opinion dated Sep. 4, 2020”, International Patent Application No. PCT/US20/31036 , (13 pages).
“International Search Report and Written Opinion dated Jun. 5, 2020”, International Patent Application No. PCT/US20/19871 , (9 pages).
“International Search Report and Written Opinion dated Aug. 8, 2019”, International PCT Patent Application No. PCT/US2019/034763 , (8 pages).
“International Search Report and Written Opinion dated Oct. 8, 2019”, International PCT Patent Application No. PCT/US19/41151 , (7 pages).
“International Search Report and Written Opinion dated Jan. 9, 2020”, International Application No. PCT/US19/55185 , (10 pages).
“International Search Report and Written Opinion dated Feb. 28, 2019”, International Patent Application No. PCT/US18/64686 , (8 pages).
“International Search Report and Written Opinion dated Feb. 7, 2020”, International PCT Patent Application No. PCT/US2019/061265 , (11 pages).
“International Search Report and Written Opinion dated Jun. 11, 2019”, International PCT Application No. PCT/US19/22620 , (7 pages).
“Invitation to Pay Additional Fees dated Aug. 15, 2019”, International PCT Patent Application No. PCT/US19/36275 , (2 pages).
“Invitation to Pay Additional Fees dated Sep. 24, 2020”, International Patent Application No. PCT/US2020/043596 , (3 pages).
“Invitation to Pay Additional Fees dated Oct. 22, 2019”, International PCT Patent Application No. PCT/US19/47746 , (2 pages).
“Invitation to Pay Additional Fees dated Apr. 3, 2020”, International Patent Application No. PCT/US20/17023 , (2 pages).
“Invitation to Pay Additional Fees dated Oct. 17, 2019”, International PCT Patent Application No. PCT/US19/44953 , (2 pages).
“Multi-core processor”, TechTarget , 2013 , (1 page).
“Non Final Office Action dated Apr. 1, 2022”, U.S. Appl. No. 17/256,961 , (65 pages).
“Non Final Office Action dated Apr. 11, 2022”, U.S. Appl. No. 16/938,782 , (52 pages).
“Non Final Office Action dated Apr. 12, 2022”, U.S. Appl. No. 17/262,991 , (60 pages).
“Non Final Office Action dated Aug. 21, 2019”, U.S. Appl. No. 15/564,517 , (14 pages).
“Non Final Office Action dated Aug. 4, 2021”, U.S. Appl. No. 16/864,721 , (21 pages).
“Non Final Office Action dated Dec. 7, 2022”, U.S. Appl. No. 17/357,795 , (63 pages).
“Non Final Office Action dated Feb. 2, 2022”, U.S. Appl. No. 16/783,866 , (8 pages).
“Non Final Office Action dated Jan. 26, 2021”, U.S. Appl. No. 16/928,313 , (33 pages).
“Non Final Office Action dated Jan. 27, 2021”, U.S. Appl. No. 16/225,961 , (15 pages).
“Non Final Office Action dated Jul. 26, 2022”, U.S. Appl. No. 17/098,059 , (28 pages).
“Non Final Office Action dated Jul. 27, 2020”, U.S. Appl. No. 16/435,933 , (16 pages).
“Non Final Office Action dated Jul. 9, 2021”, U.S. Appl. No. 17/002,663 , (43 pages).
“Non Final Office Action dated Jul. 9, 2021”, U.S. Appl. No. 16/833,093 , (47 pages).
“Non Final Office Action dated Jun. 10, 2021”, U.S. Appl. No. 16/938,782 , (40 Pages).
“Non Final Office Action dated Jun. 17, 2020”, U.S. Appl. No. 16/682,911 , (22 pages).
“Non Final Office Action dated Jun. 19, 2020”, U.S. Appl. No. 16/225,961 , (35 pages).
“Non Final Office Action dated Jun. 29, 2021”, U.S. Appl. No. 16/698,588 , (58 pages).
“Non Final Office Action dated Mar. 3, 2021”, U.S. Appl. No. 16/427,337 , (41 pages).
“Non Final Office Action dated Mar. 31, 2022”, U.S. Appl. No. 17/257,814 , (60 pages).
“Non Final Office Action dated Mar. 9, 2022”, U.S. Appl. No. 16/870,676 (57 pages).
“Non Final Office Action dated May 10, 2022”, U.S. Appl. No. 17/140,921 , (25 pages).
“Non Final Office Action dated May 17, 2022”, U.S. Appl. No. 16/748,193 (11 pages).
“Non Final Office Action dated May 26, 2021”, U.S. Appl. No. 16/214,575 , (19 pages).
“Non Final Office Action dated Nov. 5, 2020”, U.S. Appl. No. 16/530,776 , (45 pages).
“Non Final Office Action dated Sep. 1, 2020”, U.S. Appl. No. 16/214,575 , (40 pages).
“Non Final Office Action dated Sep. 19, 2022”, U.S. Appl. No. 17/263,001 , (14 pages).
“Non Final Office Action dated Sep. 20, 2021”, U.S. Appl. No. 17/105,848 , (56 pages).
“Non Final Office Action dated Sep. 29, 2021”, U.S. Appl. No. 16/748,193 , (62 pages).
“Notice of Allowance dated Mar. 25, 2020”, U.S. Appl. No. 15/564,517 , (11 pages).
“Notice of Allowance dated Oct. 5, 2020”, U.S. Appl. No. 16/682,911 , (27 pages).
“Notice of Reason for Rejection dated Oct. 28, 2022 with English translation”, Japanese Patent Application No. 2020-531452 , (3 pages).
“Notice of Reason of Refusal dated Sep. 11, 2020 with English translation”, Japanese Patent Application No. 2019-140435 , (6 pages).
“Office Action dated Nov. 24, 2022 with English Translation”, Japanese Patent Application No. 2020-533730 , (11 pages).
“Phototourism Challenge”, CVPR 2019 Image Matching Workshop. https://image matching-workshop. github.io. , (16 pages).
“Second Office Action dated Jul. 13, 2022 with English Translation”, Chinese Patent Application No. 201880079474.6 , (10 pages).
“Second Office Action dated Jun. 20, 2022 with English Translation”, Chinese Patent Application No. 201880089255.6 , (14 pages).
“Summons to attend oral proceedings pursuant to Rule 115(1) EPC mailed on Jul. 15, 2019”, European Patent Application No. 15162521.7 , (7 pages).
Aarik, J. , et al. , “Effect of crystal structure on optical properties of TiO2 films grown by atomic layer deposition”, Thin Solid Films; Publication [online). May 19, 1998 [retrieved Feb. 19, 2020]. Retrieved from the Internet: <URL: https://www.sciencedirect.com/science/article/pii/S0040609097001351 ?via%3Dihub>; DOI: 10.1016/S0040-6090(97)00135-1; see entire document , (2 pages).
Altwaijry , et al. , “Learning to Detect and Match Keypoints with Deep Architectures”, Proceedings of the British Machine Vision Conference (BMVC), BMVA Press, Sep. 2016, [retrieved on Jan. 8, 2021 (Jan. 1, 2021 )] < URL: http://www.bmva.org/bmvc/2016/papers/paper049/index.html >, en lire document, especially Abstract.
Anonymous , “Koi Pond: Top iPhone App Store Paid App”, https://web.archive.org/web/20080904061233/https://www.iphoneincanada.ca/reviews /koi-pond-top-iphone-app-store-paid-app/—[retrieved on Aug. 9, 2022].
Arandjelović, Relja , et al. , “Three things everyone should know to improve object retrieval”, CVPR, 2012 , (8 pages).
AZOM , “Silica—Silicon Dioxide (SiO2)” , AZO Materials; Publication [Online]. Dec. 13, 2001 [retrieved Feb. 19, 2020]. Retrieved from the Internet: <URL: https://www.azom.com/article.aspx?Article1D=1114>.
Azuma, Ronald T. , “A Survey of Augmented Reality”, Presence: Teleoperators and Virtual Environments 6, 4 (Aug. 1997), 355-385; https://web.archive.org/web/20010604100006/http://www.cs.unc.edu/˜azuma/ARpresence.pdf (downloaded Oct. 26, 2020).
Azuma, Ronald T. , “Predictive Tracking for Augmented Reality”, Department of Computer Science, Chapel Hill NC; TR95-007, Feb. 1995 , 262 pages.
Battaglia, Peter W, et al. , “Relational inductive biases, deep learning, and graph networks”, arXiv:1806.01261, Oct. 17, 2018 , pp. 1-40.
Berg, Alexander C , et al. , “Shape matching and object recognition using low distortion correspondences”, In CVPR, 2005 , (8 pages).
Bian, Jiawang , et al. , “GMS: Grid-based motion statistics for fast, ultra-robust feature correspondence.”, In CVPR (Conference on Computer Vision and Pattern Recognition), 2017 , (10 pages).
Bimber, Oliver , et al. , “Spatial Augmented Reality: Merging Real and Virtual Worlds”, https://web.media.mit.edu/˜raskar/book/BimberRaskarAugmentedRealityBook.pdf; published by A K Peters/CRC Press (Jul. 31, 2005); eBook (3rd Edition, 2007) , (393 pages).
Brachmann, Eric , et al. , “Neural-Guided RANSAC: Learning Where to Sample Model Hypotheses”, In ICCV (International Conference on Computer Vision ), arXiv:1905.04132v2 [cs.CV] Jul. 31, 2019 , (17 pages).
Butail , et al. , “Putting the fish in the fish tank: Immersive VR for animal behavior experiments”, In: 2012 IEEE International Conference on Robotics and Automation. May 18, 2012 (May 18, 2012) Retrieved on Nov. 14, 2020 (Nov. 14, 2020) from <http:/lcdcl.umd.edu/papers/icra2012.pdf> entire document.
Caetano, Tibério S , et al. , “Learning graph matching”, IEEE TPAMI, 31(6):1048-1058, 2009.
Cech, Jan , et al. , “Efficient sequential correspondence selection by cosegmentation”, IEEE TPAMI, 32(9):1568-1581, Sep. 2010.
Chittineni, C. , et al. , “Single filters for combined image geometric manipulation and enhancement”, Proceedings of SPIE vol. 1903, Image and Video Processing, Apr. 8, 1993, San Jose, CA. (Year: 1993) , pp. 111-121.
Cuturi, Marco , “Sinkhorn distances: Lightspeed computation of optimal transport”, NIPS, 2013 , (9 pages).
Dai, Angela , et al. , “ScanNet: Richly-annotated 3d reconstructions of indoor scenes”, In CVPR, arXiv:1702.04405v2 [cs.CV] Apr. 11, 2017 , (22 pages).
Deng, Haowen , et al. , “PPFnet: Global context aware local features for robust 3d point matching”, In CVPR, arXiv:1802.02669v2 [cs.CV] Mar. 1, 2018 , (12 pages).
Detone, Daniel , et al. , “Deep image homography estimation”, In RSS Work-shop: Limits and Potentials of Deep Learning in Robotics, arXiv:1606.03798v1 [cs.CV] Jun. 13, 2016 , (6 pages).
Detone, Daniel , et al. , “Self-improving visual odometry”, arXiv:1812.03245, Dec. 8, 2018 , (9 pages).
Detone, Daniel , et al. , “SuperPoint: Self-supervised interest point detection and description”, In CVPR Workshop on Deep Learning for Visual SLAM, arXiv:1712.07629v4 [cs.CV] Apr. 19, 2018 , (13 pages).
Dusmanu, Mihai , et al. , “D2-net: A trainable CNN for joint detection and description of local features”, CVPR, arXiv:1905.03561v1 [cs.CV] May 9, 2019 , (16 pages).
Ebel, Patrick , et al. , “Beyond cartesian representations for local descriptors”, ICCV, arXiv:1908.05547v1 [cs.CV] Aug. 15, 2019 , (11 pages).
Fischler, Martin A , et al. , “Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography”, Communications of the ACM, 24(6): 1981 , pp. 381-395.
Gilmer, Justin , et al. , “Neural message passing for quantum chemistry”, In ICML, arXiv:1704.01212v2 [cs.LG] Jun. 12, 2017 , (14 pages).
Giuseppe, Donato , et al. , “Stereoscopic helmet mounted system for real time 3D environment reconstruction and indoor ego—motion estimation”, Proc. SPIE 6955, Head- and Helmet-Mounted Displays XIII: Design and Applications, SPIE Defense and Security Symposium, 2008, Orlando, Florida, United States , 69550P.
Goodfellow , “Titanium Dioxide—Titania (TiO2)” , AZO Materials; Publication [online]. Jan. 11, 2002 [retrieved Feb. 19, 2020]. Retrieved from the Internet: <URL: https://www.azom.com/article.aspx?Article1D=1179>.
Hartley, Richard , et al. , “Multiple View Geometry in Computer Vision”, Cambridge University Press, 2003 , pp. 1-673.
Jacob, Robert J.K. , “Eye Tracking in Advanced Interface Design”, Human-Computer Interaction Lab, Naval Research Laboratory, Washington, D.C., date unknown. 2003 , pp. 1-50.
Lee , et al. , “Self-Attention Graph Pooling”, Cornell University Library/Computer Science/ Machine Learning, Apr. 17, 2019 [retrieved on Jan. 8, 2021 from the Internet< URL: https://arxiv.org/abs/1904.08082 >, entire document.
Lee, Juho , et al. , “Set transformer: A frame-work for attention-based permutation-invariant neural networks”, ICML, arXiv:1810.00825v3 [cs.LG] May 26, 2019 , (17 pages).
Leordeanu, Marius , et al. , “A spectral technique for correspondence problems using pairwise constraints”, Proceedings of (ICCV) International Conference on Computer Vision, vol. 2, pp. 1482-1489, Oct. 2005 , (8 pages).
Levola, T. , “Diffractive Optics for Virtual Reality Displays”, Journal of the SID Eurodisplay 14/05, 2005, XP008093627, chapters 2-3, Figures 2 and 10 , pp. 467-475.
Levola, Tapani , “Invited Paper: Novel Diffractive Optical Components for Near to Eye Displays—Nokia Research Center”, SID 2006 Digest, 2006 SID International Symposium, Society for Information Display, vol. XXXVII, May 24, 2005, chapters 1-3, figures 1 and 3 , pp. 64-67.
Li, Yujia , et al. , “Graph matching networks for learning the similarity of graph structured objects”, ICML, arXiv:1904.12787v2 [cs.LG] May 12, 2019 , (18 pages).
Li, Zhengqi , et al. , “Megadepth: Learning single- view depth prediction from internet photos”, In CVPR, fromarXiv: 1804.00607v4 [cs.CV] Nov. 28, 2018 , (10 pages).
Libovicky , et al. , “Input Combination Strategies for Multi-Source Transformer Decoder”, Proceedings of the Third Conference on Machine Translation (WMT). vol. 1: Research Papers, Belgium, Brussels, Oct. 31-Nov. 1, 2018; retrieved on Jan. 8, 2021 (Jan. 8, 2021 ) from < URL: https://doi.org/10.18653/v1/W18-64026 >, entire document.
Loiola, Eliane Maria, et al. , “A survey for the quadratic assignment problem”, European journal of operational research, 176(2): 2007 , pp. 657-690.
Lowe, David G , “Distinctive image features from scale-invariant keypoints”, International Journal of Computer Vision, 60(2): 91-110, 2004 , (28 pages).
Luo, Zixin , et al. , “ContextDesc: Local descriptor augmentation with cross-modality context”, CVPR, arXiv:1904.04084v1 [cs.CV] Apr. 8, 2019 , (14 pages).
Memon, F. , et al. , “Synthesis, Characterization and Optical Constants of Silicon Oxycarbide”, EPJ Web of Conferences; Publication [online). Mar. 23, 2017 [retrieved Feb. 19, 2020).<URL: https://www.epj-conferences.org/articles/epjconf/pdf/2017/08/epjconf_nanop2017 _00002.pdf>; DOI: 10.1051/epjconf/201713900002 , (8 pages).
Molchanov, Pavlo , et al. , “Short-range FMCW monopulse radar for hand-gesture sensing”, 2015 IEEE Radar Conference (RadarCon) (2015) , pp. 1491-1496.
Mrad , et al. , “A framework for System Level Low Power Design Space Exploration”, 1991.
Munkres, James , “Algorithms for the assignment and transportation problems”, Journal of the Society for Industrial and Applied Mathematics, 5(1): 1957 , pp. 32-38.
Ono, Yuki , et al. , “LF-Net: Learning local features from images”, 32nd Conference on Neural Information Processing Systems (NIPS 2018), arXiv:1805.09662v2 [cs.CV] Nov. 22, 2018 , (13 pages).
Paszke, Adam , et al. , “Automatic differentiation in Pytorch”, 31st Conference on Neural Information Processing Systems (NIPS 2017), Long Beach, CA, USA , (4 pages).
Peyré, Gabriel , et al. , “Computational Optimal Transport”, Foundations and Trends in Machine Learning, 11(5-6):355-607, 2019; arXiv:1803.00567v4 [stat.ML] Mar. 18, 2020 , (209 pages).
Qi, Charles Ruizhongtai, et al. , “Pointnet++: Deep hierarchical feature learning on point sets in a metric space.”, 31st Conference on Neural Information Processing Systems (NIPS 2017), Long Beach, CA, USA., Jun. 7, 2017 , (10 pages).
Qi, Charles R , et al. , “Pointnet: Deep Learning on Point Sets for 3D Classification and Segmentation”, CVPR, arXiv:1612.00593v2 [cs.CV] Apr. 10, 2017 , (19 pages).
Radenović, Filip , et al. , “Revisiting Oxford and Paris: Large-Scale Image Retrieval Benchmarking”, CVPR, arXiv:1803.11285v1 [cs.CV] Mar. 29, 2018 , (10 pages).
Raguram, Rahul , et al. , “A comparative analysis of ransac techniques leading to adaptive real-time random sample consensus”, Computer Vision—ECCV 2008, 10th European Conference on Computer Vision, Marseille, France, Oct. 12-18, 2008, Proceedings, Part I , (15 pages).
Ranftl, René , et al. , “Deep fundamental matrix estimation”, European Conference on Computer Vision (ECCV), 2018 , (17 pages).
Revaud, Jerome , et al. , “R2D2: Repeatable and Reliable Detector and Descriptor”, In NeurIPS, arXiv:1906.06195v2 [cs.CV] Jun. 17, 2019 , (12 pages).
Rocco, Ignacio , et al. , “Neighbourhood Consensus Networks”, 32nd Conference on Neural Information Processing Systems (NeurIPS 2018), Montréal, Canada, arXiv:1810.10510v2 [cs.CV] Nov. 29, 2018 , (20 pages).
Rublee, Ethan , et al. , “ORB: An efficient alternative to SIFT or SURF”, Proceedings of the IEEE International Conference on Computer Vision. 2564-2571. 2011; 10.1109/ICCV.2011.612654 , (9 pages).
Sarlin , et al. , “SuperGlue: Learning Feature Matching with Graph Neural Networks”, Cornell University Library/Computer Science/ Computer Vision and Pattern Recognition, Nov. 26, 2019 [retrieved on Jan. 8, 2021 from the Internet< URL: https://arxiv.org/abs/1911.11763 >, entire document.
Sattler, Torsten , et al. , “SCRAMSAC: Improving RANSAC's efficiency with a spatial consistency filter”, ICCV, 2009: 2090-2097. , (8 pages).
Schonberger, Johannes Lutz, et al. , “Pixelwise view selection for un-structured multi-view stereo”, Computer Vision—ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, Oct. 11-14, 2016, Proceedings, Part III, pp. 501-518, 2016.
Schonberger, Johannes Lutz, et al. , “Structure-from-motion revisited”, Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2016, pp. 4104-4113 , (11 pages).
Sheng, Liu , et al. , “Time-multiplexed dual-focal plane head-mounted display with a liquid lens”, Optics Letters, Optical Society of Amer i ca, US, vol. 34, No. 11, Jun. 1, 2009 (Jun. 1, 2009), XP001524475, ISSN: 0146-9592 , pp. 1642-1644.
Sinkhorn, Richard , et al. , “Concerning nonnegative matrices and doubly stochastic matrices.”, Pacific Journal of Mathematics, 1967 , pp. 343-348.
Spencer, T. , et al. , “Decomposition of poly(propylene carbonate) with UV sensitive iodonium 11 salts”, Polymer Degradation and Stability; (online]. Dec. 24, 2010 (retrieved Feb. 19, 2020]. , (17 pages).
Tanriverdi, Vildan , et al. , “Interacting With Eye Movements in Virtual Environments”, Department of Electrical Engineering and Computer Science, Tufts University; Proceedings of the SIGCHI conference on Human Factors in Computing Systems, Apr. 2000 , pp. 1-8.
Thomee, Bart , et al. , “YFCC100m: The new data in multimedia research”, Communications of the ACM, 59(2):64-73, 2016; arXiv:1503.01817v2 [cs.MM] Apr. 25, 2016 , (8 pages).
Torresani, Lorenzo , et al. , “Feature correspondence via graph matching: Models and global optimization”, Computer Vision—ECCV 2008, 10th European Conference on Computer Vision, Marseille, France, Oct. 12-18, 2008, Proceedings, Part II , (15 pages).
Tuytelaars, Tinne , et al. , “Wide baseline stereo matching based on local, affinely invariant regions”, BMVC, 2000 , pp. 1-14.
Ulyanov, Dmitry , et al. , “Instance normalization: The missing ingredient for fast stylization”, arXiv:1607.08022v3 [cs.CV] Nov. 6, 2017 , (6 pages).
Vaswani, Ashish , et al. , “Attention is all you need”, 31st Conference on Neural Information Processing Systems (NIPS 2017), Long Beach, CA, USA; arXiv:1706.03762v5 [cs.CL] Dec. 6, 2017 , (15 pages).
Veli{hacek over (c)}kovi{hacek over (c)}, Petar , et al. , “Graph attention networks”, ICLR, arXiv:1710.10903v3 [stat.ML] Feb. 4, 2018 , (12 pages).
Villani, Cédric , “Optimal transport: old and new”, vol. 338. Springer Science & Business Media, Jun. 2008 , pp. 1-998.
Wang, Xiaolong , et al. , “Non-local neural networks”, CVPR, arXiv:1711.07971v3 [cs.CV] Apr. 13, 2018 , (10 pages).
Wang, Yue , et al. , “Deep Closest Point: Learning representations for point cloud registration”, ICCV, arXiv:1905.03304v1 [cs.CV] May 8, 2019 , (10 pages).
Wang, Yue , et al. , “Dynamic Graph CNN for learning on point clouds”, ACM Transactions on Graphics, arXiv:1801.07829v2 [cs.CV] Jun. 11, 2019 , (13 pages).
Weissel , et al. , “Process cruise control: event-driven clock scaling for dynamic power management”, Proceedings of the 2002 international conference on Compilers, architecture, and synthesis for embedded systems. Oct. 11, 2002 (Oct. 11, 2002) Retrieved on May 16, 2020 (May 16, 2020) from <URL: https://dl.acm.org/doi/pdf/10.1145/581630.581668>.
Yi, Kwang Moo, et al. , “Learning to find good correspondences”, CVPR, arXiv:1711.05971v2 [cs.CV] May 21, 2018 , (13 pages).
Yi, Kwang Moo , et al. , “Lift: Learned invariant feature transform”, ECCV, arXiv:1603.09114v2 [cs.CV] Jul. 29, 2016 , (16 pages).
Zaheer, Manzil , et al. , “Deep Sets”, 31st Conference on Neural Information Processing Systems (NIPS 2017), Long Beach, CA, USA; arXiv:1703.06114v3 [cs.LG] Apr. 14, 2018 , (29 pages).
Zhang, Jiahui , et al. , “Learning two-view correspondences and geometry using order-aware network”, ICCV; aarXiv:1908.04964v1 [cs.CV] Aug. 14, 2019 , (11 pages).
Zhang, Li , et al. , “Dual graph convolutional net-work for semantic segmentation”, BMVC, 2019; arXiv:1909.06121v3 [cs.CV] Aug. 26, 2020 , (18 pages).
“Extended European Search Report dated Dec. 14, 2022”, European Patent Application No. 20886547.7, (8 pages).
“Extended European Search Report dated Jul. 20, 2022”, European Patent Application No. 19885958.9, (9 pages).
“Final Office Action dated Dec. 29, 2022”, U.S. Appl. No. 17/098,059, (32 pages).
“First Office Action dated Feb. 11, 2022 with English translation”, Chinese Patent Application No. 201880089255.6, (17 pages).
“Non Final Office Action dated Feb. 3, 2023”, U.S. Appl. No. 17/429,100, (16 pages).
“Non Final Office Action dated Feb. 3, 2023”, U.S. Appl. No. 17/497,965, (32 pages).
“Non Final Office Action dated Jan. 24, 2023”, U.S. Appl. No. 17/497,940, (10 pages).
“Communication Pursuant to Article 94(3) EPC dated Feb. 28, 2023”, European Patent Application No. 19845418.3 , (6 Pages).
“Communication Pursuant to Article 94(3) EPC dated Jul. 28, 2023”, European Patent Application No. 19843487.0 , (15 pages).
“Communication Pursuant to Article 94(3) EPC dated May 23, 2023”, European Patent Application No. 18890390.0 , (5 pages).
“Communication Pursuant to Article 94(3) EPC dated Oct. 6, 2023”, European Patent Application No. 19851373.1 , (6 pages).
“Communication Pursuant to Rule 164(1) EPC dated Feb. 23, 2022”, European Patent Application No. 20753144.3 , (11 pages).
“Decision of Rejection dated Jan. 5, 2023 with English translation”, Chinese Patent Application No. 201880079474.6 , (10 pages).
“Extended European Search Report dated Jan. 8, 2024”, European Patent Application No. 23195266.4 , (8 pages).
“Extended European Search Report dated Apr. 5, 2023”, European Patent Application No. 20888716.6 , (11 pages).
“Final Office Action dated Oct. 16, 2023”, U.S. Appl. No. 17/098,043 , (7 pages).
“Final Office Action dated Dec. 1, 2023”, U.S. Appl. No. 17/357,795 , (18 pages).
“Final Office Action dated Mar. 10, 2023”, U.S. Appl. No. 17/357,795 , (15 pages).
“Final Office Action dated Sep. 8, 2023 with English translation”, Japanese Patent Application No. 2020-566620 , (18 pages).
“First Examination Report dated Aug. 8, 2023”, Australian Patent Application No. 2018379105 , (3 pages).
“First Office Action dated Apr. 21, 2023 with English translation”, Japanese Patent Application No. 2021-509779 , (26 pages).
“First Office Action dated Dec. 12, 2023 with English translation”, Japanese Patent Application No. 2021-545712 , (8 pages).
“First Office Action dated Jul. 4, 2023 with English translation”, Japanese Patent Application No. 2021-505669 , (6 pages).
“First Office Action dated Nov. 2, 2023 with English translation”, Chinese Patent Application No. 201980090867.1 , (16 pages).
“First Office Action dated Apr. 13, 2023 with English Translation”, Japanese Patent Application No. 2020-567766 , (7 pages).
“First Office Action dated Dec. 22, 2022 with English translation”, Chinese Patent Application No. 201980061450.2 , (11 pages).
“First Office Action dated Jan. 24, 2023 with English translation”, Japanese Patent Application No. 2020-549034 , (7 pages).
“First Office Action dated Jan. 30, 2023 with English translation”, Chinese Patent Application No. 201980082951.9 , (5 pages).
“First Office Action dated Jun. 13, 2023 with English translation”, Japanese Patent Application No. 2020-567853 , (7 pages).
“First Office Action dated Mar. 27, 2023 with English translation”, Japanese Patent Application No. 2020-566617 , (6 pages).
“First Office Action dated Mar. 6, 2023 with English translation”, Korean Patent Application No. 10-2020-7019685 , (7 pages).
“First Office Action dated May 26, 2023 with English translation”, Japanese Patent Application No. 2021-500607 , (6 pages).
“First Office Action dated May 30, 2023 with English translation”, Japanese Patent Application No. 2021-519873 , (8 pages).
“First Office Action dated Sep. 29, 2023 with English translation”, Japanese Patent Application No. 2023-10887 , (5 pages).
“Non Final Office Action dated Nov. 19. 2019”, U.S. Appl. No. 16/355,611 , (31 pages).
“Non Final Office Action dated Apr. 13, 2023”, U.S. Appl. No. 17/098,043 , (7 pages).
“Non Final Office Action dated Aug. 2, 2023”, U.S. Appl. No. 17/807,600 , (25 pages).
“Non Final Office Action dated Jul. 20, 2023”, U.S. Appl. No. 17/650,188 , (11 pages).
“Non Final Office Action dated Jun. 14, 2023”, U.S. Appl. No. 17/516,483 , (10 pages).
“Non Final Office Action dated Mar. 1, 2023”, U.S. Appl. No. 18/046,739 , (34 pages).
“Non Final Office Action dated May 11, 2023”, U.S. Appl. No. 17/822,279 , (24 pages).
“Non Final Office Action dated Nov. 22, 2023”, U.S. Appl. No. 17/268,376 , (8 pages).
“Non Final Office Action dated Nov. 3, 2023”, U.S. Appl. No. 17/416,248 , (17 pages).
“Non Final Office Action dated Oct. 24, 2023”, U.S. Appl. No. 17/259,020 , (21 pages).
“Notice of Allowance dated Jul. 27, 2023 with English translation”, Korean Patent Application No. 10-2020-7019685 , (4 pages).
“Office Action dated Nov. 21, 2023 with English Translation”, Japanese Patent Application No. 2021-535716 , (15 pages).
“Office Action dated Apr. 13, 2023 with English translation”, Japanese Patent Application No. 2020-533730 , (13 pages).
“Office Action dated Dec. 14, 2023 with English translation”, Japanese Patent Application No. 2021-526564 , (13 pages).
“Office Action dated Jul. 20, 2023 with English translation”, Japanese Patent Application No. 2021-505884 , (6 pages).
“Office Action dated Jun. 8, 2023 with English translation”, Japanese Patent Application No. 2021-503762 , (6 pages).
“Office Action dated Mar. 30, 2023 with English translation”, Japanese Patent Application No. 2020-566620 , (10 pages).
“Office Action dated Nov. 7, 2023 with English translation”, Korean Patent Application No. 10-2023-7036734 , (5 pages).
“Penultimate Office Action dated Oct. 19, 2023 with English translation”, Japanese Patent Application No. 2021-509779 , (5 pages).
“Second Office Action dated May 2, 2023 with English Translation”, Japanese Patent Application No. 2020-549034 , (6 pages).
“Second Office Action dated Sep. 25, 2023 with English translation”, Japanese Patent Application No. 2020-567853 , (8 pages).
“Wikipedia Dioptre”, Jun. 22, 2018 (Jun. 22, 2018), XP093066995, Retrieved from the Internet: URL:https://en.wikipedia.org/w/index.php? title=Dioptre&direction=next&oldid=846451540 [retrieved on Jul. 25, 2023] , (3 pages).
Li, Yujia , et al. , “Graph Matching Networks for Learning the Similarity of Graph Structured Objects”, arxiv.org, Cornell University Library, 201 Olin Library Cornell University Ithaca, NY 14853, XP081268608.
Luo, Zixin , et al. , “ContextDesc: Local Descriptor Augmentation With Cross-Modality Context”, 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, XP033686823, DOI: 10.1109/CVPR.2019.00263 [retrieved on Jan. 8, 2020] , pp. 2522-2531.
Zhang, Zen , et al. , “Deep Graphical Feature Learning for the Feature Matching Problem”, 2019 IEEE/CVF International Conference on Computer Vision (ICCV), IEEE, XP033723985, DOI: 10.1109/ICCV.2019.00519 [retrieved on Feb. 24, 2020] , pp. 5086-5095.
“First Office Action mailed Dec. 20, 2023 with English translation”, Chinese Patent Application No. 201980050600.X, (21 pages).
“First Office Action mailed Dec. 27, 2023 with English translation”, Chinese Patent Application No. 201980075942.7, (7 pages).
“Office Action mailed on Nov. 8, 2023 with English translation”, Chinese Patent Application No. 201980060018.1, (12 pages).
“Communication Pursuant to Article 94(3) EPC mailed on Feb. 21, 2024”, European Patent Application No. 20770244.0, (8 pages).
“First Office Action mailed Mar. 1, 2024 with English translation”, Japanese Patent Application No. 2021-553297, (5 pages).
“First Office Action mailed on Feb. 1, 2024 with English translation”, Chinese Patent Application No. 202080018865.4, (9 pages).
“Non Final Office Action mailed on Feb. 26, 2024”, U.S. Appl. No. 18/046,739, (48 pages).
“Office Action mailed on Feb. 19, 2024 with English translation”, Korean Patent Application No. 10-2020-7020552, (18 pages).
“Office Action mailed on Feb. 26, 2024 with English translation”, Chinese Patent Application No. 201980069194.1, (11 pages).
“Office Action mailed on Mar. 6, 2024 with English translation”, Chinese Patent Application No. 201980053016.X, (7 pages).
Related Publications (1)
Number Date Country
20230161152 A1 May 2023 US
Provisional Applications (1)
Number Date Country
62693228 Jul 2018 US
Continuations (1)
Number Date Country
Parent 17256961 US
Child 18151763 US