The present disclosure relates generally to systems and methods for autonomously identifying a person of a member pool based on pictures of the person, and more particularly identifying a person based on pictures of the person without requiring the person's cooperation.
Within a facility, where the access is limited to members, a facial recognition method may provide the identity of the member by comparing the subject's photo to photos of a member pool. The facility may be a physical fitness facility such as a gym. Prior art methods may have the following limitations:
(1) Facial recognition techniques typically require a frontal face capture of the subject to achieve a good performance; however, it may be difficult to install a camera to obtain a member's frontal face picture unless a member cooperates. Common problems of facial photos taken without user cooperation may include high yaw, pitch and roll; small size; and blurring due to motion. Therefore, facial recognition techniques may not provide a good recognition performance.
(2) As the size of member body grows, the accuracy of facial recognition algorithms may degrade. This situation may occur because the facial features may not be sufficient to distinguish members whose faces appear similar and the probability of having similar faces increases with the size of member body.
(3) The above two problems may be resolved by using non-facial features such as hair style, hair color, accessories such as necklaces, clothing, and gaits may be a tie breaker in determining facial recognition. However, many non-facial features may be time limited because they are not natural attributes of the person.
Accordingly, what is needed are systems and methods that can overcome these limitations and provide autonomous methods and systems to identify a person of a member pool based on pictures of the person, without the person's cooperation.
References will be made to embodiments of the invention, examples of which may be illustrated in the accompanying figures. These figures are intended to be illustrative, not limiting. Although the invention is generally described in the context of these embodiments, it should be understood that it is not intended to limit the scope of the invention to these particular embodiments. Items in the figures are not to scale.
Figure (“FIG.”) 1A graphically illustrates a flow chart for member recognition according to embodiments of the present document.
In the following description, for purposes of explanation, specific details are set forth in order to provide an understanding of the invention. It will be apparent, however, to one skilled in the art that the invention can be practiced without these details. Furthermore, one skilled in the art will recognize that embodiments of the present invention, described below, may be implemented in a variety of ways, such as a process, an apparatus, a system, a device, or a method on a tangible computer-readable medium.
Components, or modules, shown in diagrams are illustrative of exemplary embodiments of the invention and are meant to avoid obscuring the invention. It shall also be understood that throughout this discussion that components may be described as separate functional units, which may comprise sub-units, but those skilled in the art will recognize that various components, or portions thereof, may be divided into separate components or may be integrated together, including integrated within a single system or component. It should be noted that functions or operations discussed herein may be implemented as components. Components may be implemented in software, hardware, or a combination thereof.
Furthermore, connections between components or systems within the figures are not intended to be limited to direct connections. Rather, data between these components may be modified, re-formatted, or otherwise changed by intermediary components. Also, additional or fewer connections may be used. It shall also be noted that the terms “coupled,” “connected,” or “communicatively coupled” shall be understood to include direct connections, indirect connections through one or more intermediary devices, and wireless connections.
Reference in the specification to “one embodiment,” “preferred embodiment,” “an embodiment,” or “embodiments” means that a particular feature, structure, characteristic, or function described in connection with the embodiment is included in at least one embodiment of the invention and may be in more than one embodiment. Also, the appearances of the above-noted phrases in various places in the specification are not necessarily all referring to the same embodiment or embodiments.
The use of certain terms in various places in the specification is for illustration and should not be construed as limiting. A service, function, or resource is not limited to a single service, function, or resource; usage of these terms may refer to a grouping of related services, functions, or resources, which may be distributed or aggregated.
The terms “include,” “including,” “comprise,” and “comprising” shall be understood to be open terms and any lists the follow are examples and not meant to be limited to the listed items. Any headings used herein are for organizational purposes only and shall not be used to limit the scope of the description or the claims. Each reference mentioned in this patent document is incorporate by reference herein in its entirety.
Furthermore, one skilled in the art shall recognize that: (1) certain steps may optionally be performed; (2) steps may not be limited to the specific order set forth herein; (3) certain steps may be performed in different orders; and (4) certain steps may be done concurrently.
The present disclosure describes systems and methods that can overcome prior art limitations, as described herein, and provide autonomous methods and systems to identify a person of a member pool based on pictures of the person, without requiring the person's cooperation. To achieve these objectives, contextual information of the picture(s) along with the picture(s) are utilized. Contextual information may be the information that is related to current circumstances when the picture was taken. For example, but without limitations, the contextual information may include the location of the camera, time when the picture was taken, the relative location of the camera to the other cameras, the list of members who were in the facility, the list of members who were recognized by other cameras within the facility, the transaction history of the members, the reservation information, etc.
Embodiments of the present disclosure may be used in a facility that is only accessible by a group of member. Such facilities may include, but without limitation, gyms, educational institutes, shops, and other facilities with access control.
The following definitions may apply to embodiments of the present disclosure:
Example (1) Consider a gym where there is a check-in counter and two (2) group exercise studios. At a check-in counter, a camera may be installed such that it is easy to get a frontal facial picture of members at check-in. A camera may be installed in each group exercise studio, but the camera may not be well configured to get frontal facial pictures of entering members due to space or other limitations. At the check-in counter, because a frontal facial picture is available, a member can be recognized by prior art methods. However, at the studio, prior art methods cannot provide an accurate recognition because a frontal facial picture may not be available.
The present disclosure may use a subset of the following contextual information to improve the recognition performance: time of check-in, the list of check-in members, the list of members in other group exercise studio, the member pictures taken at the check-in counter, the list of members who reserved the class, the class schedule, the list of members who previously attended the same class and/or the same type of classes, and/or the previous locations of the members for example detected by other cameras.
For Example (1),
(A) Obtain the probability that each member in member pool attends the gym based on the time of check-in, the list of check-in members, the list of members in other group exercise studio, the list of members who reserved the class, the class schedule, the list of members who previously attended the same class and/or the same type of classes and/or instructor, and/or the previous locations of the members for example detected by other cameras. For example, the probability that a member attend the class is set to zero if the member is not listed in any of the aforementioned lists. In other example, the probability that Member m attends the Class c is pmc if the member has attended the same class for last 6 month with probability pmc and the member has checked into the gym before the class starts. (step 102)
(B) Find the list of members whose probability of attendance to the class meets a threshold. For example, this list can include all members if pmc is non-zero. In another example, the list can include members if pmc is greater than p T, where T is equal to a threshold. (step 104)
(C) Obtain the probability of a match between the face in a picture, taken during a gym activity, and the profile pictures of members listed in (B), (step 104). In this step, any facial recognition methods can be used and then the output of the recognition methods can be converted to probability based on historical matching rate. Note that the profile pictures may include the picture taken at the check-in counter. (step 106)
(D) Obtain the probability of match between the non-facial features in the picture and the recent profile pictures including picture(s) taken at the check-in counter on the same day. The non-facial features may include, but without limitation, hairstyle, hair color, accessories such as necklaces, clothing, and gaits. Non-facial features are short-lived (transient), so the present disclosure may compare the features to only recent pictures. Different features may have a different time-constant, i.e., time when the feature expires. For example, the hair color may last weeks or months whereas the accessories are valid feature only for hour. (step 108)
(E) Combine the probabilities computed in Steps (A), (C), and/or (D) and find the member who maximizes the combined probability. Note that the probability of the combine steps may include combining probabilities from different pictures if the pictures were taken of the same person. (step 110) One skill in the art will recognize that probabilities may be combined by various methods. In some embodiments, probabilities may be combined by multiplication of the probabilities. In some another embodiments, probabilities may be combined by combining likelihood ratios. In some another embodiments, probabilities may be combined by using Bayes rule.
For Example (2),
Consider member recognition system of
Each camera ci( ) produces Pi,k=[Pi,k,1, . . . , Pi,k,M] pictures for each member. Based on the contextual data, mi ( ) produces pa,i,k,m the a priori probability of member m appears at camera i when the picture Pi,k,m was taken. Note that a member does not necessarily appear in all cameras, and a member may appear in more than once in a camera. Using the pictures and a priori probabilities, the recognition block ri( ) computes pi,k,m, the probability that k-th picture from camera i is from the member m. Finally, the decision block d( ) determine the identity of pictures by combining the probabilities from all recognition blocks. Per
In one embodiment, the decision block uses maximum likelihood detection that maximizes the likelihood that the picture k from camera c is from member m.
Simplified recognition blocks are shown in
In simplified recognition block 400, a detector (di( ), i≠c 418) for camera i 416 computes the tentative decision on the identity of the picture taken by the camera i 416. And then, the non-facial features of the pictures whose tentative decision is in set Lc,k, which is the list of members likely to be at camera c when picture Pc,k was taken, are compared with the non-facial feature of picture Pc,k from camera c 402. See Profile Pictures of N members 410, Facial feature Comparison for Pc,k 404, Non-Facial feature Comparison for Pc,k 408, and Compute probability 406. The output of Compute probability 406 is pc,k,n, 403.
Tentative decision for camera i can be made solely based on the pictures taken by camera i. For example, if the probability that Pik is a picture of member j with very high probability, we can tentatively conclude Iik as j and put this input to 416. Tentative input can be results of any processing consisting of subset of the entire processing described in this document.
The output of each recognition block (ri(.) i, i≠c 420) is {pi,1, . . . , pi,K}, where is pi,k is a vector that contains the probabilities that the picture k from camera i 416 is from each member in the N member group set. And then the probabilities from different cameras are compared using parity check block. Parity check is a block that computes the a priori probabilities based on spatial and temporal constraints across cameras. For example, if a member m is captured in Camera j which is far from Camera i around the same time, the probability that the member m appeared in Camera i is very low, so the a priori probability pa,i,k should be lowered. Note that the a priori probability is updated based on the recognition result; therefore, the decision quality can be improved by iterating the same procedure for multiple times.
In summary, a method for determining a member's identity in a member-only facility may comprise: 1) obtaining contextual information and the member data based on member's participation in member activities comprising current and historical participation; 2) obtaining a first set of probabilities for the each member in the member pool where the probabilities are the likelihood for a member to appear in the first set of pictures captured during member activities and are computed based on the contextual information and the member data.; 3) obtaining a second set probabilities for a match between a face in a first set of pictures and a first set of profile pictures of members listed in the member pool wherein the first set of profile pictures may include pictures of members that were taken during member activities at different time or different location; 4) combining the first set of probabilities and the second set of probabilities to determine the member with largest combined probability; (5) obtaining a third set of probabilities for a match between non-facial features in the first set of pictures, which was taken at the member activities, and a second set of profile pictures, wherein the second set of profile pictures may include pictures of members that were taken during member activities that occurred within a time interval that is shorter or equal to a time constant of the non-facial feature before and/or after a time when the first set of pictures were take; and 6) combining the first set of probabilities, the second set of probabilities, and/or the third set of probabilities to determine another member with largest combined probability.
The probability data on each member in a member pool, and the lists of member data based on their participation in a member pool activity comprise one or more of the following:
The time interval may be a current day, i.e. same day, of the member pool activity.
A system for determining a member's identity in a member pool activity may comprise: 1) one or more cameras that map the plurality of appearances to a plurality of visual data; 2) a mapping function that maps the plurality of the identities and information based on picture time and camera's location to generate contextual information and a set of a-priori probabilities that one of the plurality of identities appears at one of the one or more cameras when one of the plurality of visual data was mapped; 3) one or more recognition functions that map the plurality of visual data to a second set of probabilities which matched each of the one of the plurality visual data with each of the one of the plurality of identities; and 4) a decision function that combines the set of a priori probabilities and the second set of probabilities to determine one of the plurality of the identities. The member maps a plurality of identities to a plurality of appearances.
In embodiments, aspects of the present patent document may be directed to or implemented on information handling systems/computing systems. For purposes of this disclosure, a computing system may include any instrumentality or aggregate of instrumentalities operable to compute, calculate, determine, classify, process, transmit, receive, retrieve, originate, route, switch, store, display, communicate, manifest, detect, record, reproduce, handle, or utilize any form of information, intelligence, or data for business, scientific, control, or other purposes. For example, a computing system may be a personal computer (e.g., laptop), tablet computer, pamphlet, personal digital assistant (PDA), smart phone, smart watch, smart package, server (e.g., blade server or rack server), a network storage device, or any other suitable device and may vary in size, shape, performance, functionality, and price. The computing system may include random access memory (RAM), one or more processing resources such as a central processing unit (CPU) or hardware or software control logic, ROM, and/or other types of memory. Additional components of the computing system may include one or more disk drives, one or more network ports for communicating with external devices as well as various input and output (I/O) devices, such as a keyboard, a mouse, touchscreen and/or a video display. The computing system may also include one or more buses operable to transmit communications between the various hardware components.
As illustrated in
A number of controllers and peripheral devices may also be provided, as shown in
In the illustrated system, all major system components may connect to a bus 616, which may represent more than one physical bus. However, various system components may or may not be in physical proximity to one another. For example, input data and/or output data may be remotely transmitted from one physical location to another. In addition, programs that implement various aspects of this invention may be accessed from a remote location (e.g., a server) over a network. Such data and/or programs may be conveyed through any of a variety of machine-readable medium including, but are not limited to: magnetic media such as hard disks, floppy disks, and magnetic tape; optical media such as CD-ROMs and holographic devices; magneto-optical media; and hardware devices that are specially configured to store or to store and execute program code, such as application specific integrated circuits (ASICs), programmable logic devices (PLDs), flash memory devices, and ROM and RAM devices.
Embodiments of the present invention may be encoded upon one or more non-transitory computer-readable media with instructions for one or more processors or processing units to cause steps to be performed. It shall be noted that the one or more non-transitory computer-readable media shall include volatile and non-volatile memory. It shall be noted that alternative implementations are possible, including a hardware implementation or a software/hardware implementation. Hardware-implemented functions may be realized using ASIC(s), programmable arrays, digital signal processing circuitry, or the like. Accordingly, the “means” terms in any claims are intended to cover both software and hardware implementations. Similarly, the term “computer-readable medium or media” as used herein includes software and/or hardware having a program of instructions embodied thereon, or a combination thereof. With these implementation alternatives in mind, it is to be understood that the figures and accompanying description provide the functional information one skilled in the art would require to write program code (i.e., software) and/or to fabricate circuits (i.e., hardware) to perform the processing required.
It shall be noted that embodiments of the present invention may further relate to computer products with a non-transitory, tangible computer-readable medium that have computer code thereon for performing various computer-implemented operations. The media and computer code may be those specially designed and constructed for the purposes of the present invention, or they may be of the kind known or available to those having skill in the relevant arts. Examples of tangible computer-readable media include, but are not limited to: magnetic media such as hard disks, floppy disks, and magnetic tape; optical media such as CD-ROMs and holographic devices; magneto-optical media; and hardware devices that are specially configured to store or to store and execute program code, such as application specific integrated circuits (ASICs), programmable logic devices (PLDs), flash memory devices, and ROM and RAM devices. Examples of computer code include machine code, such as produced by a compiler, and files containing higher level code that are executed by a computer using an interpreter. Embodiments of the present invention may be implemented in whole or in part as machine-executable instructions that may be in program modules that are executed by a processing device. Examples of program modules include libraries, programs, routines, objects, components, and data structures. In distributed computing environments, program modules may be physically located in settings that are local, remote, or both.
One skilled in the art will recognize no computing system or programming language is critical to the practice of the present invention. One skilled in the art will also recognize that a number of the elements described above may be physically and/or functionally separated into sub-modules or combined together.
It will be appreciated to those skilled in the art that the preceding examples and embodiments are exemplary and not limiting to the scope of the present disclosure. It is intended that all permutations, enhancements, equivalents, combinations, and improvements thereto that are apparent to those skilled in the art upon a reading of the specification and a study of the drawings are included within the true spirit and scope of the present disclosure. It shall also be noted that elements of any claims may be arranged differently including having multiple dependencies, configurations, and combinations.
The present application claims priority benefit, under 35 U.S.C. § 119(e), to commonly-assigned U.S. Patent Application No. 62/720,758, filed on Aug. 21, 2018, entitled “SYSTEMS AND METHODS FOR MEMBER FACIAL RECOGNITION BASED ON CONTEXT INFORMATION,” listing as inventors Chan Soo Hwang, Young Geun Cho, and Daxiao Yu, which application is herein incorporated by reference as to its entire content. Each reference mentioned in this patent document is incorporated by reference herein in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
6032109 | Ritmiller, III | Feb 2000 | A |
6043493 | Kim et al. | Mar 2000 | A |
7114079 | Cook et al. | Sep 2006 | B1 |
7602421 | Hunter et al. | Oct 2009 | B2 |
7889381 | Suzuki et al. | Feb 2011 | B2 |
8320643 | Nakanowatari et al. | Nov 2012 | B2 |
8340366 | Masuda et al. | Dec 2012 | B2 |
8457367 | Sipe et al. | Jun 2013 | B1 |
8544033 | Acharya et al. | Sep 2013 | B1 |
8856541 | Chaudhury et al. | Oct 2014 | B1 |
9245172 | Koseki et al. | Jan 2016 | B2 |
9300925 | Zhang | Mar 2016 | B1 |
9336456 | DeLean | May 2016 | B2 |
9342744 | Asa et al. | May 2016 | B2 |
9691221 | Block et al. | Jun 2017 | B2 |
9830631 | Dhua et al. | Nov 2017 | B1 |
10303930 | Yu et al. | May 2019 | B2 |
20020113862 | Center, Jr. et al. | Aug 2002 | A1 |
20050012818 | Kiely et al. | Jan 2005 | A1 |
20050091338 | de la Huerga | Apr 2005 | A1 |
20050164651 | Ollis et al. | Jul 2005 | A1 |
20050213796 | Koma et al. | Sep 2005 | A1 |
20060018522 | Sunzeri et al. | Jan 2006 | A1 |
20070110422 | Minato et al. | May 2007 | A1 |
20070117623 | Nelson et al. | May 2007 | A1 |
20090043422 | Lee et al. | Feb 2009 | A1 |
20090060293 | Nagao et al. | Mar 2009 | A1 |
20090167883 | Nozaki | Jul 2009 | A1 |
20090185723 | Kurtz et al. | Jul 2009 | A1 |
20110103643 | Salsman et al. | May 2011 | A1 |
20120230555 | Miura et al. | Sep 2012 | A1 |
20120251079 | Meschter et al. | Oct 2012 | A1 |
20130002869 | Yuasa et al. | Jan 2013 | A1 |
20130208952 | Auchinleck | Aug 2013 | A1 |
20130251216 | Smowton et al. | Sep 2013 | A1 |
20132511216 | Smowton et al. | Sep 2013 | |
20140044318 | Derakhshani et al. | Feb 2014 | A1 |
20140330408 | Rolley | Nov 2014 | A1 |
20150363642 | Irie | Dec 2015 | A1 |
20160012379 | Iwai | Jan 2016 | A1 |
20160261911 | Soundararajan et al. | Sep 2016 | A1 |
20170078454 | Berookhim et al. | Mar 2017 | A1 |
20170140141 | Yan | May 2017 | A1 |
20170245101 | Chandrasekaran et al. | Aug 2017 | A1 |
20170323376 | Glaser | Nov 2017 | A1 |
20170347039 | Baumert et al. | Nov 2017 | A1 |
20180232592 | Stewart et al. | Aug 2018 | A1 |
20180336687 | Mudretsov et al. | Nov 2018 | A1 |
20200012772 | Cho | Jan 2020 | A1 |
Number | Date | Country |
---|---|---|
101401426 | Apr 2009 | CN |
102754436 | Oct 2012 | CN |
102804905 | Nov 2012 | CN |
104170316 | Dec 2012 | CN |
104380323 | Apr 2013 | CN |
103383723 | Nov 2013 | CN |
104636751 | May 2015 | CN |
1998567 | Apr 2016 | EP |
Entry |
---|
Castro et al., From Face Recognition to Models to Identity: A Bayesian Approach to Learning about Unknown Identities from Unsupervised Data, ECCV2018, arXiv: 1807.07872v1 [cs.CV], pp. 1-22. (Year: 2018). |
Non-Final Office Action dated Aug. 5, 2020, in related U.S. Appl. No. 16/355,688, (48 pgs). |
Non-Final Office Action dated Jun. 26, 2020 in related U.S. Appl. No. 16/355,683, (51 pgs). |
International Search Report and Written Opinion dated Nov. 21, 2019, in International Patent Application No. PCT/US2019/47318, filed Aug. 20, 2019 (9 pgs). |
Supplementary European Search Report dated Sep. 30, 2019, in European Patent Application No. 17776709.2, (62 pgs). |
Supplementary Partial European Search Report dated Oct. 29, 2019, in European Patent Application No. 17760776.6, (33 pgs). |
Notice of Allowance dated Oct. 7, 2020 in the related U.S. Appl. No. 16/355,683, (20 pgs). |
International Search Report and Written Opinion dated May 18, 2017 in related International Patent Application No. PCT/US2017/020354, filed Mar. 2, 2017, (14 pgs). |
International Search Report and Written Opinion dated Jun. 15, 2017 in related International Patent Application No. PCT/US2017/025183, filed Mar. 30, 2017, (17 pgs). |
Non-Final Office Action dated Sep. 21, 2018, in U.S. Appl. No. 15/475,046, (11 pgs). |
Non-Final Office Action Response filed Oct. 25, 2018, in U.S. Appl. No. 15/475,046, (9 pgs). |
Non-Final Office Action dated Jun. 27, 2018, in U.S. Appl. No. 15/448,194, (19 pgs). |
Non-Final Office Action Response dated Sep. 25, 2018, in U.S. Appl. No. 15/448,194, (11 pgs). |
Notice of Allowance dated Jan. 17, 2019, in U.S. Appl. No. 15/448,194, (25 pgs). |
Notice of Allowance dated Jan. 25, 2019, in U.S. Appl. No. 15/475,046, (24 pgs). |
Supplementary European Search Report dated Apr. 28, 2020, in related European Application No. EP17760773.6, (44 pgs). |
First Office Action dated Apr. 14, 2020 in related Chinese Patent Application No. 201780022142.X, (25 pgs). |
Supplementary European Search Report in related Application No. EP17760773, (85 pgs). |
Notice to Grant Patent Right dated Oct. 30, 2020 in the related CN Application No. 201780022142.X, (4 pgs). |
Chinese office action dated Jul. 5, 2021, in the Chinese patent application No. 201780027135.9, (22 pgs). |
Chinese office action response filed Sep. 17, 2021, in the Chinese patent application No. 201780027135.9, (7 pgs). |
Number | Date | Country | |
---|---|---|---|
20200065548 A1 | Feb 2020 | US |
Number | Date | Country | |
---|---|---|---|
62720758 | Aug 2018 | US |