This forum is disabled, please visit https://forum.opencv.org
 | 1 | initial version |
I think the algorithms I have added are nowhere to be suited for datasets of 100,000 images. If you are going to run the Eigenfaces or Fisherfaces algorithm, you won't be able to allocate that much memory. Algorithms like Local Binary Patterns don't need to allocate that much memory, but finding the best match is going to be very time consuming as it's a Nearest Neighbor Search over the entire dataset. While I can't offer source code or algorithm implementations, I think there are interesting papers available. Among them is one of the face.com team:
As for similarity measures I suggest looking into algorithms like One Shot Similarity Kernels, as I think they still provide state of the art results for similarity measures. There's a great paper by Lior Wolf, Tal Hassner and Yaniv Taigman (face.com Founder/CTO);
You can find some MATLAB Code on the project page for One Shot Similarity Kernels:
| | 2 | No.2 Revision |
I think the If you are new to OpenCV (and computer vision probably), then tackling such a problem is optimistic I would say.
The algorithms I have added are nowhere to be suited for datasets of 100,000 images. If you are going to run the Eigenfaces or Fisherfaces algorithm, you won't be able to allocate that much memory. Algorithms like Local Binary Patterns don't need to allocate that much memory, but finding the best match is going to be very time consuming as it's a Nearest Neighbor Search over the entire dataset.
Coming up with a solution, that scales is far from trivial. While I can't offer source code or and algorithm implementations, I think there are interesting papers available. Among them is one of the face.com team:face.com team (a company quite successful in this area):
As for similarity measures I suggest looking into algorithms like One Shot Similarity Kernels, as I think they still provide state of the art results for similarity measures. There's a great paper by Lior Wolf, Tal Hassner and Yaniv Taigman (face.com Founder/CTO);
You can find some MATLAB Code on the project page for One Shot Similarity Kernels:
| | 3 | No.3 Revision |
If you are new to OpenCV (and computer vision probably), then tackling such a problem is optimistic I would say.
The algorithms I have added are nowhere to be suited for datasets of 100,000 images. If you are going to run the Eigenfaces or Fisherfaces algorithm, you won't be able to allocate that much memory. Algorithms like Local Binary Patterns don't need to allocate that much memory, but finding the best match is going to be very time consuming as it's a Nearest Neighbor Search over the entire dataset.
Coming up with a solution, solution that scales is far from trivial. While I can't offer source code and algorithm implementations, I think there are interesting papers available. Among them is one of the face.com team (a company quite successful in this area):
As for similarity measures I suggest looking into algorithms like One Shot Similarity Kernels, as I think they still provide state of the art results for similarity measures. There's a great paper by Lior Wolf, Tal Hassner and Yaniv Taigman (face.com Founder/CTO);
You can find some MATLAB Code on the project page for One Shot Similarity Kernels:
So do I think such a project feasible, if you are working alone and don't have a (very strong) background in computer vision? I know, that such a project requires a lot of tough problems to be solved in order to create a robust and efficient (and useful) face recognition system. In my opinion way too many tough problem for one person.
| | 4 | No.4 Revision |
If you are new to OpenCV (and computer vision probably), then tackling such a problem is optimistic I would say.
The algorithms I have added are nowhere to be suited for datasets of 100,000 images. If you are going to run the Eigenfaces or Fisherfaces algorithm, you won't be able to allocate that much memory. Algorithms like Local Binary Patterns don't need to allocate that much memory, but finding the best match is going to be very time consuming as it's a Nearest Neighbor Search over the entire dataset.
Coming up with a solution that scales is far from trivial. While I can't offer source code and algorithm implementations, I think there are interesting papers available. Among them is one of the face.com team (a company quite successful in this area):
As for similarity measures I suggest looking into algorithms like One Shot Similarity Kernels, as I think they still provide state of the art results for similarity measures. There's a great paper by Lior Wolf, Tal Hassner and Yaniv Taigman (face.com Founder/CTO);
You can find some MATLAB Code on the project page for One Shot Similarity Kernels:
So do I think such a project feasible, if you are working alone and don't have a (very strong) background in computer vision? I know, that such a project requires a lot of tough problems to be solved in order to create a robust and efficient (and useful) face recognition system. In my opinion way too many tough problem problems for one person.
