We present a longitudinal study of face recognition performance on Children Longitudinal Face (CLF) dataset containing 3,682 face images of 919 subjects, in the age group [2,18] years. Each subject has at least four face images acquired over a time span of up to six years. Face comparison scores are obtained from (i) a state-of-the-art COTS matcher (COTS-A), (ii) an open-source matcher (FaceNet), and (iii) a simple sum fusion of scores obtained from COTSA and FaceNet matchers. To improve the performance of the open-source FaceNet matcher for child face recognition, we were able to fine-tune it on an independent training set of 3,294 face images of 1,119 children in the age group [3,18] years. Multilevel statistical models are fit to genuine comparison scores from the CLF dataset to determine the decrease in face recognition accuracy over time. Additionally, we analyze both the verification and open-set identification accuracies in order to evaluate state-of-the-art face recognition technology for tracing and identifying children lost at a young age as victims of child trafficking or abduction.
Secret sharing scheme is an efficient method of transmitting one or more secret images securely. The traditional visual secret sharing schemes share only one secret image at a time. With the advancement of time, there arises a need for sharing more than one secret image. An (n, n) Multi Secret Image Sharing (MSIS) scheme is used to encrypt n secret images into n meaningless shared images and stored it in different database servers. For recovery of secrets n shared images are required. If loss of any shared image then no secret images are recovered. In earlier work n secret images are shared among n or n+1 shared images, which has a problem as one can recover partial secret information from n -- 1 or fewer shared images. Therefore, we need a more efficient and secure (n, n)-MSIS scheme so that less than n shared images does not reveal any information of secret images. In this paper, we propose an three different methods for (n, n)-MSIS scheme. First and second methods of an (n, n)- MSIS scheme, we used XOR and reverse bit operation for grayscale and colored images. In third method of an (n, n)-MSIS scheme, we used the concept of additive inverse (relative to an addition operation) and reverse bit operation for grayscale and colored images. The experimental results show that the proposed schemes requires minimal computation time for encryption and decryption. For quantitative analysis a correlation and Root Mean Square Error (RMSE) techniques are used. The proposed (n, n)-MSIS scheme outperforms the existing state-of-the-art techniques.
10 December 2016 in Multimedia Tools and Applications