The background description provided herein is for the purpose of generally presenting the context of the disclosure. Work of the presently named inventor(s), to the extent it is described in this background section, as well as aspects of the description that may not otherwise qualify as prior art at the time of filing, are neither expressly nor impliedly admitted as prior art against the present disclosure.
The virtual placement of a pair of eyeglasses on the face of a user allows the user to visualize the manner in which the pair of eyeglasses appear on the face of the user. Use of such a virtual “try-on” system may convince the user to make a purchase of the pair of eyeglasses after viewing the eyeglasses on the face of the user. A realistic simulation of the eyeglasses on the face of the user necessitates the accurate placement of the eyeglasses on a three-dimensional face model of the user. The placement information generally includes translation and rotation information related to the eyeglasses frontal frame relative to the face model of the user. The placement information is exceedingly difficult to obtain with physical measurement because of the proximity of the eyeglasses to the face of the user. Three-dimensional face scanning provides a simple, fast, and accurate way to simulate the application a new pair of eyeglasses on the user's face.
In some embodiments, in the system 100, face scanner 110 captures or scans a face of the subject 112 with eyeglasses and without eyeglasses and generates a 3D model of the face of the subject 112 without the eyeglasses and a 3D model of the face of the subject 112 with the eyeglasses. In system 10, processing of the method for placing a 3D model of a pair of eyeglasses onto the face of the subject 112, described in greater detail with reference to the
Other embodiments that allocate features and processing amongst face scanner 110 and processing system 105 may be employed without departing from the spirit and scope of the method for placing the 3D eyeglasses model onto the face of the subject 112 as described herein. For example, processing steps described with reference to the
This disclosure contemplates any suitable number of processing systems 105. This disclosure contemplates processing system 105 taking any suitable physical form. As example and not by way of limitation, processing system 105 may be an embedded computer system, a system-on-chip (SOC), a single-board computer system (SBC) (such as, for example, a computer-on-module (COM) or system-on-module (SOM)), a desktop computer system, a laptop or notebook computer system, an interactive kiosk, a mainframe, a mesh of computer systems, a mobile telephone, a personal digital assistant (PDA), a server, a tablet computer system, or a combination of two or more of these. Where appropriate, processing system 105 may include one or more processing systems 105; be unitary or distributed; span multiple locations; span multiple machines; span multiple data centers; or reside in a cloud, which may include one or more cloud components in one or more networks. Where appropriate, one or more processing systems 105 may perform without substantial spatial or temporal limitation one or more steps of one or more methods described or illustrated herein. As an example and not by way of limitation, one or more processing systems 105 may perform in real time or in batch mode one or more steps of one or more methods described or illustrated herein. One or more processing systems 105 may perform at different times or at different locations one or more steps of one or more methods described or illustrated herein, where appropriate.
In some embodiments, processing system 105 includes a processor 202, memory 204, storage 206, an input/output (I/O)) interface 208, a communication interface 210, and a bus 212. In some embodiments, the processing system described herein may be considered a computer system. Although this disclosure describes and illustrates a particular computer system having a particular number of particular components in a particular arrangement, this disclosure contemplates any suitable computer system having any suitable number of any suitable components in any suitable arrangement.
In some embodiments, processor 202 includes hardware for executing instructions, such as those making up a computer program. As an example and not by way of limitation, to execute instructions, processor 202 may retrieve (or fetch) the instructions from an internal register, an internal cache, memory 204, or storage 206, decode and execute them; and then write one or more results to an internal register, an internal cache, memory 204, or storage 206. In particular embodiments, processor 202 may include one or more internal caches for data, instructions, or addresses. This disclosure contemplates processor 202 including any suitable number of any suitable internal caches, where appropriate. As an example and not by way of limitation, processor 202 may include one or more instruction caches, one or more data caches, and one or more translation lookaside buffers (TLBs). Instructions in the instruction caches may be copies of instructions in memory 204 or storage 206, and the instruction caches may speed up retrieval of those instructions by processor 202. Data in the data caches may be copies of data in memory 204 or storage 206 for instructions executing at processor 202 to operate on; the results of previous instructions executed at processor 202 for access by subsequent instructions executing at processor 202 or for writing to memory 204 or storage 206; or other suitable data. The data caches may speed up read or write operations by processor 202. The TLBs may speed up virtual-address translation for processor 202. In particular embodiments, processor 202 may include one or more internal registers for data, instructions, or addresses. This disclosure contemplates processor 202 including any suitable number of any suitable internal registers, where appropriate. Where appropriate, processor 202 may include one or more arithmetic logic units (ALUs); be a multi-core processor, or include one or more processors 202. Although this disclosure describes and illustrates a particular processor, this disclosure contemplates any suitable processor.
In some embodiments, memory 204 includes main memory for storing instructions for processor 202 to execute or data for processor 202 to operate on. As an example and not by way of limitation, processing system 105 may load instructions from storage 206 or another source (such as, for example, another processing system 105) to memory 204. Processor 202 may then load the instructions from memory 204 to an internal register or internal cache. To execute the instructions, processor 202 may retrieve the instructions from the internal register or internal cache and decode them. During or after execution of the instructions, processor 202 may write one or more results (which may be intermediate or final results) to the internal register or internal cache. Processor 202 may then write one or more of those results to memory 204. In particular embodiments, processor 202 executes only instructions in one or more internal registers or internal caches or in memory 204 (as opposed to storage 206 or elsewhere) and operates only on data in one or more internal registers or internal caches or in memory 204 (as opposed to storage 206 or elsewhere). One or more memory buses (which may each include an address bus and a data bus) may couple processor 202 to memory 204. Bus 212 may include one or more memory buses, as described below. In particular embodiments, one or more memory management units (MMUs) reside between processor 202 and memory 204 and facilitate accesses to memory 204 requested by processor 202. In particular embodiments, memory 204 includes random access memory (RAM). This RAM may be volatile memory, where appropriate Where appropriate, this RAM may be dynamic RAM (DRAM) or static RAM (SRAM). Moreover, where appropriate, this RAM may be single-ported or multi-ported RAM. This disclosure contemplates any suitable RAM. Memory 204 may include one or more memories 204, where appropriate. Although this disclosure describes and illustrates particular memory, this disclosure contemplates any suitable memory.
In some embodiments, storage 206 includes mass storage for data or instructions. In some embodiments, storage 206 includes an eyeglasses model placement system 216 (described further in detail with respect to
In some embodiments, I/O interface 208 includes hardware, software, or both, providing one or more interfaces for communication between processing system 105 and one or more I/O devices. Processing system 105 may include one or more of these I/O devices, where appropriate. In some embodiments, V/O interface 208 may include a camera 213. In some embodiments, the camera 213 may be configured to operate as a face scanner, e.g., a three-dimensional face scanner. One or more of these I/O devices may enable communication between a person and processing system 105. As an example and not by way of limitation, an I/O device may include a keyboard, keypad, microphone, monitor, mouse, printer, scanner, speaker, still camera, stylus, tablet, touch screen, trackball, video camera, another suitable I/O) device or a combination of two or more of these. An I/O device may include one or more sensors. This disclosure contemplates any suitable I/O devices and any suitable I/O interfaces 208 for them. Where appropriate, VO interface 208 may include one or more device or software drivers enabling processor 202 to drive one or more of these I/O devices. I/O interface 208 may include one or more I/O interfaces 208, where appropriate. Although this disclosure describes and illustrates a particular I/O interface, this disclosure contemplates any suitable I/O interface.
In some embodiments, communication interface 210 includes hardware, software, or both providing one or more interfaces for communication (such as, for example, packet-based communication) between processing system 105 and one or more other processing systems 105 or one or more networks. As an example and not by way of limitation, communication interface 210 may include a network interface controller (NIC) or network adapter for communicating with an Ethernet or other wire-based network or a wireless NIC (WNIC) or wireless adapter for communicating with a wireless network, such as a WI-FI network. This disclosure contemplates any suitable network and any suitable communication interface 210 for it. As an example and not by way of limitation, processing system 105 may communicate with an ad hoc network, a personal area network (PAN), a local area network (LAN), a wide area network (WAN), a metropolitan area network (MAN), or one or more portions of the Internet or a combination of two or more of these. One or more portions of one or more of these networks may be wired or wireless. As an example, processing system 105 may communicate with a wireless PAN (WPAN) (such as, for example, a BLUETOOTH WPAN), a WI-FI network, a WI-MAX network, a cellular telephone network (such as, for example, a Global System for Mobile Communications (GSM) network), or other suitable wireless network or a combination of two or more of these. Processing system 105 may include any suitable communication interface 210 for any of these networks, where appropriate. Communication interface 210 may include one or more communication interfaces 210, where appropriate. Although this disclosure describes and illustrates a particular communication interface, this disclosure contemplates any suitable communication interface.
In some embodiments, bus 212 includes hardware, software, or both coupling components of processing system 105 to each other. As an example and not by way of limitation, bus 212 may include an Accelerated Graphics Port (AGP) or other graphics bus, an Enhanced Industry Standard Architecture (EISA) bus, a front-side bus (FSB), a HYPERTRANSPORT (HT) interconnect, an Industry Standard Architecture (ISA) bus, an INFINIBAND interconnect, a low-pin-count (LPC) bus, a memory bus, a Micro Channel Architecture (MCA) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCIe) bus, a serial advanced technology attachment (SATA) bus, a Video Electronics Standards Association local (VLB) bus, or another suitable bus or a combination of two or more of these. Bus 212 may include one or more buses 112, where appropriate. Although this disclosure describes and illustrates a particular bus, this disclosure contemplates any suitable bus or interconnect.
As described herein, a computer-readable non-transitory storage medium or media may include one or more semiconductor-based or other integrated circuits (ICs) (such, as for example, field-programmable gate arrays (FPGAs) or application-specific ICs (ASICs)), hard disk drives (HDDs), hybrid hard drives (HHDs), optical discs, optical disc drives (ODDs), magneto-optical discs, magneto-optical drives, floppy diskettes, floppy disk drives (FDDs), magnetic tapes, solid-state drives (SSDs), RAM-drives, SECURE DIGITAL cards or drives, any other suitable computer-readable non-transitory storage media, or any suitable combination of two or more of these, where appropriate. A computer-readable non-transitory storage medium may be volatile, non-volatile, or a combination of volatile and non-volatile, where appropriate.
The method described herein with reference to
In some embodiments, at block 405, a first 3D face scan of the subject 112, e.g., without-eyeglasses face scan 20, is received by the eyeglasses model placement system 216 from face scanner 110. In some embodiments, as stated previously, the without-eyeglasses face scan 20 is a 3D facial scan of the face of subject 112 without wearing a pair of eyeglasses.
In some embodiments, at block 410, a second 3D face scan of the subject 112, e.g., with-eyeglasses face scan 22, is received by the eyeglasses model placement system 216 from face scanner 110. In some embodiments, as stated previously, the with-eyeglasses face scan 22 is a 3D facial scan of the face of subject 112 wearing a pair of eyeglasses 21. In some embodiments, each of the face scans (e.g, without-eyeglasses face scan 20 and with-eyeglasses face scan 22) is represented as a 3D model. Each scan or 3D model may be a data structure stored on a disk or in a computer memory, or more typically, each scan is received in a file in a standard 3D file format such as STL, PLY or .OBJ Thus, the term scan as used with, for example, the without-eyeglasses face scan 20 and with-eyeglasses face scan 22, refers to a 3D model that is processed by method 400.
In some embodiments, without loss of generality and as illustrated in
In some embodiments, at block 415, a frontal image 24 of the face of the subject 112 is captured using the without-eyeglasses face scan 20. In some embodiments, the frontal image 24 is a two-dimensional (2D) color image of subject 112 that, as described herein, is used to generate facial landmarks 61 of the subject 112.
In some embodiments, at block 420, facial landmarks 61 are identified using the frontal image 24. In some embodiments, a facial landmark identification unit 280 of
In some embodiments, an automatic facial landmark detector, such as STASM, is used to identify and detect facial landmarks from the frontal image 24. STASM is a programming library for finding features in faces based on the Active Shape Model. The Active Shape Model is described in an article entitled “Active Shape Models with SIFT Descriptors and Mars”, which is available on the Worldwide Web at http://www.milbo.org/stasm-files/active-shape-models-with-sift-and-mars.pdf. Information about the STASM programming library can be found on the Worldwide Web at http://www.milbo.users.sonic.net/stasm/. STASM operates on 2D images that show the front views of faces. Thus, a 2D frontal view of without-eyeglasses face scan 20 is rendered and used with the STASM programming library. This results in a set of 2D points that indicate the outline of major facial features being identified for each respective image.
In some embodiments, at block 425, eyeglasses model placement system 216 ascertains point cloud data (e.g., point cloud 1 or a first point cloud) associated with without-eyeglasses face scan 20 from face scanner 110. In some embodiments, a point cloud is a list of points that form a mesh of the face for each 3D face scan. For example, without-eyeglasses face scan 20 includes a first list of points, e.g., the first point cloud (point cloud 1), that form a mesh of the face of the subject 112 of the first 3D face scan, and with-eyeglasses face scan 22 includes a second list of points, e.g., a second point cloud (point cloud 2), that form a mesh of the face of the subject 112 of the second face scan. In some embodiments, at block 430, eyeglasses model placement system 216 ascertains point cloud data (e.g., point cloud 2 or a second point cloud) associated with with-eyeglasses face scan 22 from face scanner 110. In some embodiments, the first point cloud and the second point cloud are used to recover translation parameters that are used to place the 3D eyeglasses model 79 on the face of subject 112, as discussed further below with respect to, for example, block 435 and block 440.
In some embodiments, at block 435, registration unit 220 registers the without-eyeglasses face scan 20 (e.g., point cloud 1) with the with-eyeglasses face scan 22 (e.g., point cloud 2). That is, the without-eyeglasses face scan 20 and the with-eyeglasses face scan 22 are registered (i.e., placed in a single image space or 3D coordinate system) to recover three-dimensional transformation (i.e. translation and rotational) parameters to align point cloud 2 to point cloud 1. In some embodiments, the without-eyeglasses face scan 20 and the with-eyeglasses scan 22 are registered using a method such as, for example, the Iterative Closest Point (ICP) Method. In some embodiments, an ICP Method, which is a well-known algorithm to find a relative transformation, i.e., rotation and translation, that aligns or “registers” two meshes, i.e., 3D models, in 3D space. An article that describes ICP is Chen, Yang: Gerard Medioni (1991). “Object modelling by registration of multiple range images”. Image Vision Comput. Newton, Mass, USA. Butterworth-Heinemann: pp. 145-155. ICP requires that the two meshes be roughly aligned and it then iteratively finds a best transformation that minimizes some objective measurement such as the mean distance between the vertices. ICP converges faster when the two sets are already closely aligned and the data have substantial overlaps. ICP then proceeds to randomly select some number of matching points between the models based on distance. ICP then computes a transformation (X, Y, Z translation and rotation) from one model (with-eyeglasses face scan 22) to another (without-eyeglasses face scan 20) that minimizes the distance error of all the matching points. The process is repeated until the distance error is within a preset threshold. In some embodiments, the result is a transformation or transformation matrix that best aligns with-eyeglasses face scan 22 to without-eyeglasses face scan 20. Thus, in some embodiments, the ICP Method is used to recover the three-dimensional translation and rotational parameters to align point cloud 2 to point cloud 1. In some embodiments, registration unit 220 uses the ICP method to recover the three-dimensional translation and rotation parameters to align point cloud 2 to point cloud 1. In some embodiments, registration unit 220 provides the recovered transformation to transformation unit 230 for further processing.
In some embodiments, at block 440, transformation unit 230 transforms the second point cloud to point the first point cloud with the recovered transformation such that the second point cloud is in the same coordinate system as first point cloud. In some embodiments, as stated previously, the second point cloud is transformed to the first point cloud with the recovered transformation (e.g., the recovered translation and rotation parameters).
In some embodiments, at block 450, bounding volume generation unit 240 uses the eye landmarks 62 to generate a 3D bounding volume 32. In some embodiments, the 3D bounding volume 32 generated by the bounding volume generation unit 240 encompasses the eye landmarks 62 and serves as an eyeglasses frame region. In some embodiments, the 3D bounding volume is a rectangular box or frame region that is configured to utilize the eye landmarks 62 to provide an estimated position of the eyeglasses. In some embodiments, the size of the 3D bounding volume 32 is selected by the bounding volume generation unit 240 to be a size of a typical pair of eyeglasses (e.g., a frame width of 132 mm, a frame height of 39 mm, and a frame depth 10 mm).
In some embodiments, at block 455, frame point generation unit 250 generates frame points 36 using the 3D bounding volume 32 generated at block 450. In some embodiments, frame points 36 are points associated with eyeglasses frame that are used to recover a first portion of frame placement information. Frame placement information is placement information that is used to position the eyeglass frames in the appropriate location relative to the face of the subject 112. Frame placement information includes an X rotation of the frontal frame of the eyeglasses, a Y rotation of the frontal frame of the eyeglasses, a Z distance of the frontal frame of the eyeglasses, an X translation of the frontal frame of the eyeglasses frame, a Y translation of the frontal frame of the eyeglasses, and a Z rotation of the frontal frame of the eyeglasses. In some embodiments, the first portion of the frame placement information includes the X rotation of the frontal frame of the eyeglasses, the Y rotation of the frontal frame of the eyeglasses, and the Z distance of the frontal frame of the eyeglasses. In some embodiments, a second portion of the frame placement information includes the X translation of the frontal frame of the eyeglasses frame, the Y translation of the frontal frame of the eyeglasses, and the Z rotation of the frontal frame of the eyeglasses.
In some embodiments, as stated previously, frame points 36 are points inside the 3D bounding volume 32 that are associated with the eyeglasses frame that is positioned inside the 3D bounding volume 32. In some embodiments, in order to generate the frame points 36, any points inside the 3D bounding volume 32 of the second point cloud are removed that are within a threshold distance of any point in the first point cloud. In some embodiments, frame point generation unit 250 is configured to generate the frame points 36 by removing any points inside the bounding volume in the second point cloud that are within the threshold distance of any point in first point cloud. In some embodiments, the threshold distance is a distance that may be adjusted depending on the scanning and alignment accuracy to maximize the removal of the face region of the second point cloud and minimize the removal of eyeglasses points. In some embodiments, the remaining points in the second point cloud (e.g., frame points 36) are points that most likely belong to the eyeglasses frame.
In some embodiments, at block 460, frame placement transformation recovery unit 260 determines whether a 3D eyeglasses model 291 is available (e.g., provided as a 3D eyeglasses model file in storage 206 and does not have to be created by the eyeglasses model placement system 216) or not available (e.g., not available in storage 206). In some embodiments, frame placement transformation recovery unit 260 is configured to determine whether a 3D eyeglasses model is available by, for example, scanning storage 206 to determine whether the 3D eyeglasses model file (in a format such as STL, PLY or .OBJ) is located in storage 206.
In some embodiments, at block 465, when the frame placement transformation recovery unit 260 determines that the 3D eyeglasses model 291 is available, the frame placement transformation recovery unit 260 proceeds to recover and generate a first portion of the frame placement information for positioning of the 3D eyeglasses model 291. In some embodiments, the 3D eyeglasses model 291 and frame points 36 are used to recover the first portion of the frame placement information (e.g., X rotation of the frontal frame of the eyeglasses, Y rotation of the frontal frame of the eyeglasses, and Z distance of the frontal frame of the eyeglasses). In some embodiments, in order to recover the first portion of the frame placement information, the 3D eyeglasses model 291 is registered with the frame points 36 using the ICP method previously described herein. In some embodiments, the registration recovers the translational and rotational transformation of the 3D eyeglasses model 291 in first point cloud coordinate space, as illustrated in
In some embodiments, at block 470, when frame placement transformation recovery unit 260 determines that the 3D eyeglasses model 291 is not available for placement of the 3D eyeglasses model, frame placement transformation recovery unit 260 generates a 3D plane 46 that is used to recover the first portion of the frame placement information. That is, the 3D plane 46 (generated by, for example, frame placement transformation recovery unit 260) and frame points 36 (generated by, for example, frame point generation unit 250) are used to recover the first portion of the X rotation of the frontal frame of the eyeglasses, the Y rotation of the frontal frame of the eyeglasses, and the Z distance of the frontal frame of the eyeglasses. In some embodiments, the 3D plane 46 is fit to the frame points 36 by frame placement transformation recovery unit 260 using, for example, a Random sample consensus (RANSAC) method. The RANSAC method is a plane fitting method that is configured to generate a 3D plane that minimizes the distance errors of majority of points to the plane. In some embodiments, the plane fitting technique recovers the Z distance of the 3D plane 46 to the origin and two rotational transformations (a first rotational transformation 50 around the X axis and a second rotational transformation 44 around the Y axis) of the eyeglasses represented by the frame points 36.
In some embodiments, at block 475, the second portion of frame placement information (e.g., an X translation of the frontal frame of the eyeglasses frame, a Y translation of the frontal frame of the eyeglasses frame, and a Z rotation of the frontal frame of the eyeglasses frame) is recovered using the frontal image 24 of
In some embodiments, at block 475, using the first portion of the frame placement information recovered at block 465 or block 470, and the second portion of the frame placement information recovered at block 475, a 3D eyeglasses model 79 of a pair of eyeglasses is placed on the face model of the subject 112. In some embodiments, eyeglasses model placement unit 270 of
In some embodiments, the processing system 105 may be used to compute the transformation of a pair of eyeglasses on the face of the subject 112 but may not generate the eyeglasses model itself (only the placement of the eyeglasses on the face of the subject 112). In some embodiments, if an eyeglasses model of the eyeglasses physically worn by the subject 112 during the scanning process is provided to processing system 105 as input, the processing system 105 places the eyeglasses model on the face of the subject 112 using the computed transformation. In some embodiments, if the eyeglasses model is not given as input, the output of the processing system 105 may simply be a transformation. In some embodiments, it is possible to apply such transformation computed in both cases to other eyeglasses models (not necessary the eyeglasses physically worn by the user) for the purpose of virtual try-on of other eyeglasses with similar size. In some embodiments, for virtual try-on purposes, the computed transformation may apply to various or other models of eyeglasses that are similar in size.
In some embodiments, there may be circumstances in which the frame of the eyeglasses being worn by the subject 112 is too thin to be scanned properly by face scanner 110 or the surface material on the frame of the eyeglasses is not suitable for scanning by face scanner 110 (e.g., glossy surfaces, or translucent materials). In such embodiments, when the eyeglasses frame is too thin or the surface material is not suitable for scanning, the 3D face scan may not generate enough frame points for the accurate recovery of the frame placement information. In such embodiments, external markers 98, depicted by example in
In some embodiments, a computer-implemented method includes receiving a without-eyeglasses face scan of a subject, the without-eyeglasses face scan being a three-dimensional (3D) model of a face of the subject without eyeglasses; receiving a with-eyeglasses face scan of the subject, the with-eyeglasses face scan being a 3D model of the subject with eyeglasses; and using the without-eyeglasses face scan and the with-eyeglasses face scan to place a 3D eyeglasses model on a face model of the subject.
In some embodiments of the computer-implemented method, the 3D eyeglasses model is placed on the face model of the subject using frame placement information, the frame placement information including a first portion of the frame placement information and a second portion of the frame placement information.
In some embodiments of the computer-implemented method, the first portion of the frame placement information includes an X rotation of a frontal frame of an eyeglasses frame, a Y rotation of the frontal frame of the eyeglasses frame, a Z distance from the frontal frame to an origin on a face of a face model, and the second portion of the frame placement information includes an X translation of the frontal frame of the eyeglasses frame, a Y translation of the frontal frame of the eyeglasses frame, and a Z rotation of the frontal frame of the eyeglasses frame.
In some embodiments of the computer-implemented method, the first portion of the frame placement information is generated using frame points and a 3D plane.
In some embodiments of the computer-implemented method, the frame points are generated using a 3D bounding volume.
In some embodiments of the computer-implemented method, the first portion of the frame placement information is generated by fitting the 3D plane to the frame points.
In some embodiments of the computer-implemented method, the second portion of the frame placement information is generated using a frontal image of the without-eyeglasses face scan.
In some embodiments of the computer-implemented method, a bounding box is used to generate the X translation of the frontal frame of the eyeglasses frame, the Y translation of the frontal frame of the eyeglasses frame, and the Z rotation of the frontal frame of the eyeglasses frame.
In some embodiments, a device includes a processor; and a memory in communication with the processor for storing instructions, which when executed by the processor causes the device to: receive a without-eyeglasses face scan of a subject, the without-eyeglasses face scan being a three-dimensional (3D) model of the face of the subject without eyeglasses; receive a with-eyeglasses face scan of the subject, the with-eyeglasses face scan being a 3D model of the subject with eyeglasses; and use the without-eyeglasses face scan and the with-eyeglasses face scan to place a 3D model of a pair of eyeglasses on a face model of the subject.
In some embodiments of the device, the 3D eyeglasses model is placed on the face model of the subject using frame placement information, the frame placement information including a first portion of the frame placement information and a second portion of the frame placement information.
In some embodiments of the device, the first portion of the frame placement information includes an X rotation of a frontal frame of an eyeglasses frame, a Y rotation of the frontal frame of the eyeglasses frame, a Z distance from the frontal frame to an origin on a face of a face model, and the second portion of the frame placement information includes an X translation of the frontal frame of the eyeglasses frame, a Y translation of the frontal frame of the eyeglasses frame, and a Z rotation of the frontal frame of the eyeglasses frame.
In some embodiments of the device, the first portion of the frame placement information is generated using frame points and a 3D plane.
In some embodiments of the device, the frame points are generated using a 3D bounding volume.
In some embodiments of the device, in order to generate the first portion of the frame placement information, the 3D plane is fit to the frame points.
In some embodiments of the device, the second portion of the frame placement information is generated using a frontal image of the without-eyeglasses face scan.
In some embodiments of the device, a bounding box is used to generate the X translation of the frontal frame of the eyeglasses frame, the Y translation of the frontal frame of the eyeglasses frame, and the Z rotation of the frontal frame of the eyeglasses frame.
In some embodiments, a method includes generating eye landmarks from a without-eyeglasses face scan of a subject; generating a bounding volume of a frontal frame of eyeglasses using the eye landmarks; generating frame points from the without-eyeglasses face scan and a with-eyeglasses face scan inside the bounding volume; and using the frame points and a frontal image of the without-eyeglasses face scan to generate frame placement information associated with a positioning of a 3D eyeglasses model on a face model.
In some embodiments of the method, the frame points are used to recover an X rotation of a frontal frame of an eyeglasses frame, a Y rotation of the frontal frame of the eyeglasses frame, and a Z distance of the frontal frame of the eyeglasses frame.
In some embodiments of the method, a plane is fit to the frame points in order to generate the X rotation of the frontal frame of the eyeglasses frame, the Y rotation of the frontal frame of the eyeglasses frame, and the Z distance of the frontal frame of the eyeglasses frame.
In some embodiments of the method, the frontal image of the without-eyeglasses face scan is used to recover an X translation of the frontal frame of the eyeglasses frame, a Y translation of the frontal frame of the eyeglasses frame, and a Z rotation of the frontal frame of the eyeglasses frame.
The present Application claims the benefit of U.S. Provisional Application No. 63/158,304, entitled “3D Scanning of Faces with Eyeglasses” filed Mar. 8, 2021. U.S. Provisional Application No. 63/158,304 is expressly incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
6072467 | Walker | Jun 2000 | A |
6556196 | Blanz et al. | Apr 2003 | B1 |
6842175 | Schmalstieg et al. | Jan 2005 | B1 |
7701439 | Hillis et al. | Apr 2010 | B2 |
8026918 | Murphy | Sep 2011 | B1 |
D683749 | Hally | Jun 2013 | S |
D689874 | Brinda et al. | Sep 2013 | S |
8947351 | Noble | Feb 2015 | B1 |
D726219 | Chaudhri et al. | Apr 2015 | S |
D727352 | Ray et al. | Apr 2015 | S |
D727354 | Park et al. | Apr 2015 | S |
D733740 | Lee et al. | Jul 2015 | S |
9117274 | Liao et al. | Aug 2015 | B2 |
9292089 | Sadek | Mar 2016 | B1 |
D761273 | Kim et al. | Jul 2016 | S |
D763279 | Jou | Aug 2016 | S |
9477368 | Filip et al. | Oct 2016 | B1 |
D775179 | Kimura et al. | Dec 2016 | S |
D775196 | Huang et al. | Dec 2016 | S |
9530252 | Poulos et al. | Dec 2016 | B2 |
D780794 | Kisielius et al. | Mar 2017 | S |
D781905 | Nakaguchi et al. | Mar 2017 | S |
D783037 | Hariharan et al. | Apr 2017 | S |
D784394 | Laing et al. | Apr 2017 | S |
D784395 | Laing et al. | Apr 2017 | S |
D787527 | Wilberding | May 2017 | S |
D788136 | Jaini et al. | May 2017 | S |
D788793 | Ogundokun et al. | Jun 2017 | S |
D789416 | Baluja et al. | Jun 2017 | S |
D789977 | Mijatovic et al. | Jun 2017 | S |
D790567 | Su et al. | Jun 2017 | S |
D791823 | Zhou | Jul 2017 | S |
D793403 | Cross et al. | Aug 2017 | S |
9770203 | Berme et al. | Sep 2017 | B1 |
9817472 | Lee et al. | Nov 2017 | B2 |
D817994 | Jou | May 2018 | S |
D819065 | Xie et al. | May 2018 | S |
D824951 | Kolbrener et al. | Aug 2018 | S |
D828381 | Lee et al. | Sep 2018 | S |
D829231 | Hess et al. | Sep 2018 | S |
D831681 | Eilertsen | Oct 2018 | S |
D835665 | Kimura et al. | Dec 2018 | S |
10168768 | Kinstner | Jan 2019 | B1 |
D842889 | Krainer et al. | Mar 2019 | S |
10220303 | Schmidt et al. | Mar 2019 | B1 |
10248284 | Itani et al. | Apr 2019 | B2 |
D848474 | Baumez et al. | May 2019 | S |
D850468 | Malahy et al. | Jun 2019 | S |
D851123 | Turner | Jun 2019 | S |
D853431 | Sagrillo et al. | Jul 2019 | S |
D854551 | Pistiner et al. | Jul 2019 | S |
D856366 | Richardson | Aug 2019 | S |
D859426 | Poes | Sep 2019 | S |
10473935 | Gribetz et al. | Nov 2019 | B1 |
10521944 | Sareen et al. | Dec 2019 | B2 |
10665019 | Hildreth et al. | May 2020 | B2 |
D888071 | Wilberding | Jun 2020 | S |
D900123 | Lopes | Oct 2020 | S |
10839481 | Chen | Nov 2020 | B1 |
D908713 | Fremine et al. | Jan 2021 | S |
D910655 | Matthewman et al. | Feb 2021 | S |
D910660 | Chaturvedi et al. | Feb 2021 | S |
10916220 | Ngo | Feb 2021 | B2 |
10976804 | Atlas et al. | Apr 2021 | B1 |
10987573 | Nietfeld et al. | Apr 2021 | B2 |
10990240 | Ravasz et al. | Apr 2021 | B1 |
11086476 | Inch et al. | Aug 2021 | B2 |
11276215 | Grossinger et al. | Mar 2022 | B1 |
20040266506 | Herbrich et al. | Dec 2004 | A1 |
20050162419 | Kim | Jul 2005 | A1 |
20080089587 | Kim et al. | Apr 2008 | A1 |
20080215994 | Harrison et al. | Sep 2008 | A1 |
20090044113 | Jones et al. | Feb 2009 | A1 |
20090251471 | Bokor et al. | Oct 2009 | A1 |
20090265642 | Carter et al. | Oct 2009 | A1 |
20100306716 | Perez | Dec 2010 | A1 |
20110148916 | Blattner | Jun 2011 | A1 |
20110267265 | Stinson | Nov 2011 | A1 |
20110302535 | Clerc et al. | Dec 2011 | A1 |
20120069168 | Huang et al. | Mar 2012 | A1 |
20120105473 | Bar-Zeev et al. | May 2012 | A1 |
20120113223 | Hilliges et al. | May 2012 | A1 |
20120117514 | Kim et al. | May 2012 | A1 |
20120143358 | Adams et al. | Jun 2012 | A1 |
20120206345 | Langridge | Aug 2012 | A1 |
20120275686 | Wilson et al. | Nov 2012 | A1 |
20120293544 | Miyamoto et al. | Nov 2012 | A1 |
20130038601 | Han et al. | Feb 2013 | A1 |
20130063345 | Maeda | Mar 2013 | A1 |
20130125066 | Klein et al. | May 2013 | A1 |
20130147793 | Jeon et al. | Jun 2013 | A1 |
20130265220 | Fleischmann et al. | Oct 2013 | A1 |
20140078176 | Kim et al. | Mar 2014 | A1 |
20140125598 | Cheng et al. | May 2014 | A1 |
20140191946 | Cho et al. | Jul 2014 | A1 |
20140236996 | Masuko et al. | Aug 2014 | A1 |
20150035746 | Cockburn et al. | Feb 2015 | A1 |
20150054742 | Imoto et al. | Feb 2015 | A1 |
20150062160 | Sakamoto et al. | Mar 2015 | A1 |
20150123967 | Quinn et al. | May 2015 | A1 |
20150138099 | Major | May 2015 | A1 |
20150153833 | Pinault et al. | Jun 2015 | A1 |
20150160736 | Fujiwara | Jun 2015 | A1 |
20150169076 | Cohen et al. | Jun 2015 | A1 |
20150181679 | Liao et al. | Jun 2015 | A1 |
20150206321 | Scavezze et al. | Jul 2015 | A1 |
20150220150 | Plagemann et al. | Aug 2015 | A1 |
20150261659 | Bader et al. | Sep 2015 | A1 |
20150293666 | Lee et al. | Oct 2015 | A1 |
20150358614 | Jin | Dec 2015 | A1 |
20150371441 | Shim | Dec 2015 | A1 |
20160035133 | Ye | Feb 2016 | A1 |
20160062618 | Fagan et al. | Mar 2016 | A1 |
20160110052 | Kim et al. | Apr 2016 | A1 |
20160147308 | Gelman et al. | May 2016 | A1 |
20160170603 | Bastien et al. | Jun 2016 | A1 |
20160178936 | Yang | Jun 2016 | A1 |
20160314341 | Maranzana et al. | Oct 2016 | A1 |
20160378291 | Pokrzywka | Dec 2016 | A1 |
20170031503 | Rosenberg et al. | Feb 2017 | A1 |
20170060230 | Faaborg et al. | Mar 2017 | A1 |
20170061696 | Li et al. | Mar 2017 | A1 |
20170109936 | Powderly et al. | Apr 2017 | A1 |
20170139478 | Jeon et al. | May 2017 | A1 |
20170192513 | Karmon et al. | Jul 2017 | A1 |
20170236320 | Gribetz et al. | Aug 2017 | A1 |
20170237789 | Harner et al. | Aug 2017 | A1 |
20170262063 | Blénessy et al. | Sep 2017 | A1 |
20170270715 | Lindsay et al. | Sep 2017 | A1 |
20170278304 | Hildreth et al. | Sep 2017 | A1 |
20170287225 | Powderly et al. | Oct 2017 | A1 |
20170296363 | Yetkin et al. | Oct 2017 | A1 |
20170316606 | Khalid et al. | Nov 2017 | A1 |
20170336951 | Palmaro | Nov 2017 | A1 |
20170364198 | Yoganandan et al. | Dec 2017 | A1 |
20180017815 | Chumbley | Jan 2018 | A1 |
20180059901 | Gullicksen | Mar 2018 | A1 |
20180082454 | Sahu et al. | Mar 2018 | A1 |
20180096537 | Kornilov | Apr 2018 | A1 |
20180107278 | Goel et al. | Apr 2018 | A1 |
20180113599 | Yin | Apr 2018 | A1 |
20180144556 | Champion et al. | May 2018 | A1 |
20180150993 | Newell et al. | May 2018 | A1 |
20180307303 | Powderly et al. | Oct 2018 | A1 |
20180322701 | Pahud et al. | Nov 2018 | A1 |
20180335925 | Hsiao et al. | Nov 2018 | A1 |
20180349690 | Rhee et al. | Dec 2018 | A1 |
20190050427 | Wiesel et al. | Feb 2019 | A1 |
20190065027 | Hauenstein et al. | Feb 2019 | A1 |
20190094981 | Bradski et al. | Mar 2019 | A1 |
20190102044 | Wang et al. | Apr 2019 | A1 |
20190107894 | Hebbalaguppe et al. | Apr 2019 | A1 |
20190130172 | Zhong et al. | May 2019 | A1 |
20190213792 | Jakubzak et al. | Jul 2019 | A1 |
20190258318 | Qin et al. | Aug 2019 | A1 |
20190278376 | Kutliroff et al. | Sep 2019 | A1 |
20190279424 | Clausen et al. | Sep 2019 | A1 |
20190286231 | Burns et al. | Sep 2019 | A1 |
20190310757 | Lee et al. | Oct 2019 | A1 |
20190313915 | Tzvieli et al. | Oct 2019 | A1 |
20190340419 | Milman et al. | Nov 2019 | A1 |
20190362562 | Benson | Nov 2019 | A1 |
20190377416 | Alexander | Dec 2019 | A1 |
20190385372 | Cartwright et al. | Dec 2019 | A1 |
20200050289 | Hardie-Bick et al. | Feb 2020 | A1 |
20200051527 | Ngo | Feb 2020 | A1 |
20200082629 | Jones et al. | Mar 2020 | A1 |
20200097077 | Nguyen et al. | Mar 2020 | A1 |
20200097091 | Chou et al. | Mar 2020 | A1 |
20200110280 | Gamperling | Apr 2020 | A1 |
20200111260 | Osborn et al. | Apr 2020 | A1 |
20200211218 | Le Gallou | Jul 2020 | A1 |
20200211512 | Sztuk et al. | Jul 2020 | A1 |
20200225736 | Schwarz et al. | Jul 2020 | A1 |
20200225758 | Tang et al. | Jul 2020 | A1 |
20200226814 | Tang et al. | Jul 2020 | A1 |
20200306640 | Kolen et al. | Oct 2020 | A1 |
20200312002 | Comploi et al. | Oct 2020 | A1 |
20200349635 | Ghoshal | Nov 2020 | A1 |
20210007607 | Frank et al. | Jan 2021 | A1 |
20210011556 | Atlas et al. | Jan 2021 | A1 |
20210019911 | Kusakabe et al. | Jan 2021 | A1 |
20210088811 | Varady | Mar 2021 | A1 |
20210090333 | Ravasz et al. | Mar 2021 | A1 |
20210124475 | Inch et al. | Apr 2021 | A1 |
20210134042 | Streuber et al. | May 2021 | A1 |
20210168324 | Ngo | Jun 2021 | A1 |
20210247846 | Shriram et al. | Aug 2021 | A1 |
20210296003 | Baeurele | Sep 2021 | A1 |
20210312658 | Aoki et al. | Oct 2021 | A1 |
20210383594 | Tang et al. | Dec 2021 | A1 |
20220021972 | Brimijoin, II et al. | Jan 2022 | A1 |
20220157036 | Chen et al. | May 2022 | A1 |
20220292774 | Yang | Sep 2022 | A1 |
20230021339 | Bosnak et al. | Jan 2023 | A1 |
20230252721 | Aleem | Aug 2023 | A1 |
Number | Date | Country |
---|---|---|
107330969 | Nov 2017 | CN |
113050795 | Jun 2021 | CN |
03058518 | Jul 2003 | WO |
2016177290 | Nov 2016 | WO |
WO-2017205903 | Dec 2017 | WO |
WO-2019137215 | Jul 2019 | WO |
2023075771 | May 2023 | WO |
Entry |
---|
Eye landmarks detection via weakly supervised learning, Bin Huang et al., Elsevier, 2019, pp. 1-11 (Year: 2019). |
Automatic Eyeglasses Removal from Face Images, Chenyu Wu et al., IEEE, 2004, pp. 322-336 (Year: 2004). |
A Method of Free-Space Point-of-Regard Estimation Based on 3D Eye Model and Stereo Vision, Zijing Wan et al., MDPI, 2018, pp. 1-17 (Year: 2018). |
Facial landmark detection by semi-supervised deep learning, Xin Tang et al., Elsevier, 2018, pp. 22-32 (Year: 2018). |
Chen Y., et al., “Object Modeling by Registration of Multiple Range Images,” Proceedings of the 1991 IEEE International Conference on Robotics and Automation, Apr. 1991, pp. 2724-2729, Retrieved from the internet: URL: https://graphics.stanford.edu/courses/cs348a-17-winter/Handouts/chen-medioni-align-rob91.pdf. |
Milborrow S., “Active Shape Models with Stasm,” [Retrieved on Sep. 20, 2022], 3 pages, Retrieved from the Internet: URL: http://www.milbo.users.sonic.net/stasm/. |
Milborrow S., et al., “Active Shape Models with SIFT Descriptors and Mars,” Department of Electrical Engineering, 2014, 8 pages, Retrieved from the internet: URL: http://www.milbo.org/stasm-files/active-shape-models-with-sift-and-mars.pdf. |
MRPT: “Ransac C++ Examples,” 2014, 6 pages, Retrieved from the internet: URL: https://www.mrpt.org/tutorials/programming/maths-and-geometry/ransac-c-examples/. |
Wikipedia: “Canny Edge Detector,” [Retrieved on Sep. 20, 2022], 10 pages, Retrieved from the internet: URL: https://en.wikipedia.org/wiki/Canny_edge_detector. |
Wikipedia: “Iterative Closest Point,” [Retrieved on Sep. 20, 2022], 3 pages, Retrieved from the internet: URL: https://en.wikipedia.org/wiki/Iterative_closest_point. |
Goldsmiths M, “Dancing into the Metaverse: A Real-Time virtual Dance Experience,” Youtube [online], Nov. 14, 2021 [Retrieved on Sep. 5, 2023], 2 pages, Retrieved from the Internet: URL: https://www.youtube.com/watch?v=aNg-gqZNYRO. |
Hincapie-Ramos J.D., et al., “GyroWand: IMU-Based Raycasting for Augmented Reality Head-Mounted Displays,” Proceedings of the 3rd Association for Computing Machinery (ACM) Symposium on Spatial User Interaction, Los Angeles, CA, USA, Aug. 8-9, 2015, pp. 89-98. |
International Preliminary Report on Patentability for International Application No. PCT/US2020/052976, mailed May 5, 2022, 9 pages. |
International Preliminary Report on Patentability for International Application No. PCT/US2021/064674, mailed Jul. 6, 2023, 12 pages. |
International Preliminary Report on Patentability for International Application No. PCT/US2022/046196, mailed Apr. 25, 2024, 9 pages. |
International Search Report and Written Opinion for International Application No. PCT/US2020/052976, mailed Dec. 11, 2020, 10 Pages. |
International Search Report and Written Opinion for International Application No. PCT/US2021/064674, mailed Apr. 19, 2022, 13 pages. |
International Search Report and Written Opinion for International Application No. PCT/US2022/046196, mailed Jan. 25, 2023, 11 pages. |
International Search Report and Written Opinion for International Application No. PCT/US2023/020446, mailed Sep. 14, 2023, 14 pages. |
Junghyun A., et al., “Motion Level-of-Detail: A Simplification Method on Crowd Scene,” Proceedings of the 17th International Conference on Computer Animation and Social Agents [online], Jan. 23, 2013 [Retrieved on Sep. 7, 2023], 8 pages, Retrieved from the Internet: URL:https://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=460ED1CB79EFA18B484B256E73A88FF3?. |
Katz N., et al., “Extending Web Browsers with a Unity 3D-Based Virtual Worlds Viewer,” IEEE Computer Society, Sep./Oct. 2011, vol. 15 (5), pp. 15-21. |
Khan M.A., “Multiresolution Coding of Motion Capture Data for Real-Time Multimedia Applications,” Multimedia Tools and Applications, Sep. 16, 2016, vol. 76, pp. 16683-16698. |
Mayer S., et aL, “The Effect of Offset Correction and Cursor on Mid-Air Pointing in Real and Virtual Environments,” Proceedings of the 2018 CHI Conference on Human Factors in Computing Systems, Montreal, QC, Canada, Apr. 21-26, 2018, pp. 1-13. |
Moran F., et al., “Adaptive 3D Content for Multi-Platform On-Line Games,” 2007 International Conference on Cyberworlds (CW'07), Oct. 24, 2007, pp. 194-201. |
Nextworldvr, “Realtime Motion Capture 3ds Max w/ Kinect,” Youtube [online], Mar. 14, 2017 [Retrieved on Sep. 5, 2023], 2 pages, Retrieved from the Internet: URL:https://www.youtube.com/watch?v=vOYWYEOwRGO. |
Olwal A., et al., “The Flexible Pointer: An Interaction Technique for Selection in Augmented and Virtual Reality,” Proceedings of ACM Symposium on User Interface Software and Technology (UIST), Vancouver, BC, Nov. 2-5, 2003, pp. 81-82. |
Qiao X., et al., “Web AR: A Promising Future for Mobile Augmented Reality—State of the Art. Challenges, and Insights,” Proceedings of the IEEE, Apr. 2019, vol. 107 (4), pp. 651-666. |
Renner P., et al., “Ray Casting”, Central Facility Labs [Online], [Retrieved on Apr. 7, 2020], 2 pages, Retrieved from the Internet: URL:https://www.techfak.uni-bielefeld.de/˜tpfeiffe/lehre/VirtualReality/interaction/ray_casting.html. |
Savoye Y., et al., “Multi-Layer Level of Detail for Character Animation,” Workshop in Virtual Reality Interactions and Physical Simulation VRIPHYS (2008) [online], Nov. 18, 2008 [Retrieved on Sep. 7, 2023], 10 pages, Retrieved from the Internet: URL: http://www.animlife.com/publications/vriphys08.pdf. |
Schweigert R., et aL, “EyePointing: A Gaze-Based Selection Technique,” Proceedings of Mensch and Computer, Hamburg, Germany, Sep. 8-11, 2019, pp. 719-723. |
Srinivasa R.R., “Augmented Reality Adaptive Web Content,” 13th IEEE Annual Consumer Communications Networking Conference (CCNC), 2016, pp. 1-4. |
Trademark Application Serial No. 73289805, filed Dec. 15, 1980, 1 page. |
Trademark Application Serial No. 73560027, filed Sep. 25, 1985, 1 page. |
Trademark Application Serial No. 74155000, filed Apr. 8, 1991, 1 page. |
Trademark Application Serial No. 76036844, filed Apr. 28, 2000, 1 page. |
Unity Gets Toolkit for Common AR/VR Interactions, Unity XR interaction Toolkit Preview [Online], Dec. 19, 2019 Retrieved on Apr. 7, 2020], 1 page, Retrieved from the Internet: URL: http://youtu.be/ZPhv4qmT9EQ. |
Whitton M., et al., “Integrating Real and Virtual Objects in Virtual Environments,” Aug. 24, 2007, Retrieved from http://web.archive.org/web/20070824035829/http://www.cs.unc.edu/˜whitton/ExtendedCV/Papers/2005-HCII-Whitton-MixedEnvs.pdf, on May 3, 2017, 10 pages. |
European Search Report for European Patent Application No. 24162068.1, dated Aug. 20, 2024, 8 pages. |
International Preliminary Report on Patentability for International Application No. PCT/US2023/020446, mailed Nov. 7, 2024, 12 pages. |
Number | Date | Country | |
---|---|---|---|
63158304 | Mar 2021 | US |