Face clustering method and device, and storage medium
A clustering method and clustering technology, applied in the direction of instruments, character and pattern recognition, computer components, etc., can solve the problems of low accuracy rate and sudden increase in calculation amount, achieve fast speed, ensure accuracy, and avoid accuracy rate Reduced effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0055] The face clustering method provided in this embodiment can be used to cluster pedestrians in the surveillance video and detect frequent pedestrians. The surveillance video can come from the face capture camera set up in the necessary passage; the camera lens is facing the walking direction of the crowd to ensure that a clear face can be captured. Multiple cameras can be set up to fully cover multiple channels. The captured face images are sent to the backend server for processing.
[0056] Among them, the acquisition of face capture images includes face detection and tracking, recognition of face regions, continuous capture during the period when a face appears in the video range, evaluation of the captured face quality, and selection of the best quality one. Zhang to save. Obtaining a face capture image is a general method and will not be repeated here.
[0057] Such as figure 1 It is a face clustering method, comprising the following steps:
[0058] Step S110, ca...
Embodiment 2
[0106] Such as Figure 7 The shown face clustering device includes:
[0107] The first calculation module 110 is used to calculate the feature vector to be classified of the human face image to be classified;
[0108] The query module 120 is configured to query the face feature kd tree according to the feature vectors to be classified, obtain K neighbor feature vectors and obtain K features between the neighbor feature vectors and the feature vectors to be classified Distance, K is a natural number that is not 0; the face feature kd tree includes a plurality of classified feature vectors, and the classified feature vectors are associated with a class;
[0109] The second calculation module 130 is used to sort the K feature distances from small to large, and select the nearest neighbor feature vectors corresponding to the first M feature distances from the sorted K feature distances as the close feature vectors, and M is not greater than K And it is a natural number that is n...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


