Muzzle point pattern based techniques for individual cattle identification

For effective copyright protection of digital images, this paper proposes a zero-watermarking algorithm based on local image feature information. The feature matrix of the algorithm is derived from the keypoint set determined by the Speeded-Up Robust Features (SURF) algorithm, and it calculates both the gradient feature descriptors and the vortex-like texture feature (VTF) descriptors of the keypoint set. Unlike traditional texture feature descriptors, the vortex-like texture feature descriptors proposed in this paper contain richer information and exhibit better stability. The advantage of this algorithm lies in its ability to calculate the keypoints of the digital image and provide a stable vector description of the local features of these keypoints, thereby reducing the amount of erroneous information introduced during attacks. Analysis of experimental data shows that the algorithm has good effectiveness, distinguishability, security, and robustness.

Attendance marking in a classroom during a lecture is not only a onerous task but also a time consuming one at that. Due to an unusually high number of students present during the lecture there will always be a probability of proxy attendance(s).Attendance marking with conventional methods has been an area of challenge. The growing need of efficient and automatic techniques of marking attendance is a growing challenge in the area of face recognition. In recent years, the problem of automatic attendance marking has been widely addressed through the use of standard biometrics like fingerprint and Radio frequency Identification tags etc., However,these techniques lack the element of reliability. In this proposed project an automated attendance marking and management system is proposed by making use of face detection and recognition algorithms. Instead of using the conventional methods, this proposed system aims to develop an automated system that records the student’s attendance by using facial recognition technology. The main objective of this work is to make the attendance marking and management system efficient, time saving, simple and easy. Here faces will be recognized using face recognition algorithms. The processed image will then be compared against the existing stored record and then attendance is marked in the database accordingly. Compared to existing system traditional attendance marking system, this system reduces the workload of people. This proposed system will be implemented with 4 phases such as Image Capturing, Segmentation of group image and Face Detection, Face comparison and Recognition, Updating of Attendance in database.

Face Recognition is an efficient technique and one of the most liked biometric software application for the identification and verification of specific individual in a digital image by analysing and comparing patterns. This paper presents a survey on well-known techniques of face recognition. The primary goal of this review is to observe the performance of different face recognition algorithms such as SVM (Support Vector Machine), CNN (Convolutional Neural Network), Eigenface based algorithm, Gabor Wavelet, PCA (Principle Component Analysis) and HMM (Hidden Markov Model). It presents comparative analysis about the efficiency of each algorithm. This paper also figure out about various face recognition applications used in real world and face recognition challenges like Illumination Variation, Pose Variation, Occlusion, Expressions Variation, Low Resolution and Ageing in brief. Another interesting component covered in this paper is review of datasets available for face recognition. So, must needed survey of many recently introduced face recognition aspects and algorithms are presented.

The last decade has seen automatic face recognition evolve from small-scale research systems to a wide range of commercial products. Driven by the FERET face database and evaluation protocol, the currently best commercial systems achieve verification accuracies comparable to those of fingerprint recognizers. In these experiments, only frontal face images taken under controlled lighting conditions were used. As the use of face recognition systems expands toward less restricted environments, the development of algorithms for view and illumination invariant face recognition becomes important. However, the performance of current algorithms degrades significantly when tested across pose and illumination, as documented in a number of evaluations. In this chapter, we review previously proposed algorithms for pose and illumination invariant face recognition. We then describe in detail two successful appearance-based algorithms for face recognition across pose, eigen light-fields, and Bayesian face subregions. We furthermore show how both of these algorithms can be extended toward face recognition across pose and illumination.

Since low-light-level images are generally grayscale images that lack color information, it is necessary to colorize these images to enhance human vision for night vision scene. In this paper, a low-light-level image colorization method is proposed based on Laws’ texture feature descriptor. Laws’ filter can analyze the texture features of the image, which are the pointers we used to find the corresponding color information for low-light-level gray images from the reference color image. The experimental results demonstrate that our colorization method can make night vision images have colors closer to natural perception and help observers better understand night vision scenes.

In this paper, a three stage hierarchical image retrieval scheme using a color, texture and shape visual contents (or descriptors) is proposed, since single visual content is not produce an adequate retrieval results effectively. This scheme has reduced the searching space during the image retrieval process at a certain extent due to the hierarchical mode. In initial stage, the shape feature descriptor has been computed by simple fusion of histograms of gradients and invariant moments of segmented image planes. The shape based retrieval process has reduced the search space by discarding the non-relevant images from the universal dataset (or original dataset) effectively and kept the retrieved images into the intermediate dataset. In the second stage, the texture feature descriptors have been computed from the intermediate sub-image dataset by applying the adaptive tetrolet transform on image plane of preprocessed HSV color image. This transform provides the multi-resolution images with finer details by employing the tetrominoes and the proper arrangement of tetrominoes contributes the effective local geometry of image plane. The gray level co-occurrence matrix based texture feature descriptor is obtained by computing second order statistical parameters from each decomposed sub-image. At this stage, the most of the irrelevant images are discarded by retrieving the images from intermediate dataset but still some undesired images are left, those will be handled at the last stage. At this stage, fused color information is captured by applying the color autocorrelogram on both the non-uniform quantized color components of the preprocessed HSV color image. Finally, the color feature descriptor produces the desired retrieval results by discarding the irrelevant images from the texture based sub-image dataset. The proposed scheme has also low computational overhead due to the use of three descriptors at different stages separately. The retrieved results show the better accuracy as compared to the other related visual contents based image retrieval schemes.

The release of the latest iPhone device by Apple, named the iPhone 5s which incorporates a fingerprint-based biometric scanner, was met with a lot of criticism from the security and privacy community. It was soon demonstrated that the biometric reader on this new iPhone is just as vulnerable to spoofing attacks as devised by researchers such as Matsumoto et al. 2002. It is an excepted fact that making use of biometrics for effective security during the identification and authentication process is not recommended Woodward and Orleans, 2004. People leave latent biometric prints of their fingerprints on everything they touch. Biometric technology is vexed with this problem - a biometric characteristic is not essentially covert, as people deposit their biometric characteristics in various ways in the environment they interact with. This paper proposes an approach to allow a person to use a smart device such as the iPhone 5s, for secure biometric authentication over a networked environment for secure electronic transactions. The paper illustrates that a smart device can be considered as a 'smart token', to address the security concerns associated with biometric technology.

Biometric cryptosystems are widely studied recently, which bind a cryptographic key with the biometric characteristic of a user in such a way that the key cannot be recovered without a successful biometric authentication. By now, the key is generated from extra random number generators, which makes the system more complex. A novel method is proposed, which generates the key from biometric characteristics directly, and makes the biometric cryptosystems much cheaper, simpler and more convenient. To make the keys secure enough, the TD-ERCS is adopted and revised in the proposed algorithm. Experiments show that the algorithm is sensitive to biometric characteristics, free of collision, and the generated keys seem also random. It is believed that such a algorithm can be practically used for various biometric cryptosystems.

In this paper, face recognition algorithms under three low-quality conditions, namely, complex illumination, low resolution and partial occlusion, are summarized, and relatively new face recognition algorithms under low-quality conditions are introduced and explained. Such as the algorithm of face recognition with occlusion based on partition, face recognition algorithm based on Iteratively Reweighted Robust Principal Component and face recognition with occlusion based on MEBML, illumination face recognition based on RPCA and Convolutional Neural Network, face recognition based on Illumination Normalization and Block-based Adaptive Local Ternary Pattern, low-resolution face recognition based on blocking CS-LBP and weighted PCA algorithm, pose Robust low-resolution face recognition via CKEDA and other face recognition algorithm under low-quality conditions. The existing problems and development trend of face recognition under low quality conditions are analyzed.

Introduction to face recognition and evaluation of algorithm performance

This paper describes a novel vehicle plate recognition algorithm based on text detection and improved neocognitron neural network, similar to [1] and based on Fukushima's neocognitron. The proposed recognition algorithm allows us to improve the recognition speed and accuracy comparing to both traditional neocognitron and some state-of-art algorithms (multilayer perceptron, topological methods). It can be used as a solution for image classification and analysis tasks. As an example, the neocognitron can be utilized for symbols recognition [2]. We propose several modifications comparing to the Fukushima's modification of the neocognitron: namely, layer dimensions adjustment, threshold function and connection Gaussian kernel parameters estimation. The patterns' width and height are taken into account independently in order to improve the recognition of patterns of slightly different dimensions. The learning and recognition calculations are performed as FFT convolutions in order to overcome the complexity of the neocognitron output calculations. The algorithm was tested on low-resolution (360 ×288) video sequences and gave more accurate results comparing to the state-of-the-art methods for low-resolution test set.

The challenge of container code localization and recognition is that the code varies in size, position, and arrangements according to the container style and environmental changes. This paper proposes an automatic container code localization and recognition system via an efficient code detector and a sequence recognizer. The code detector locates text features on the backend of the container and extracts the code through segmentation, which increases the stability of code localization. The proposed recognition algorithm regards the code as three separate sequences and recognizes them through a recurrentconvolutional neural network to improve efficiency and accuracy. To verify the validity, a test dataset is established containing about 700 high-resolution images and over 2000 gray-scale code patches. The proposed code localization and recognition algorithm is verified on the dataset in experiments and achieves overall accuracy of 93.98% at about 0.1s per-frame.

In the photoelectric detection system, the photoelectric detector can convert the optical signal to be measured into a current signal, and the current amplifier transforms the current signal output by the detector into a voltage signal for amplification. In this study, the photo-multiplier tube (PMT) is selected as the photoelectric detector. Compared with other photoelectric detectors, it can obtain higher internal gain, higher sensitivity, and better response performance. The current amplifier is prepared by pre-amplifier and voltage amplifier. In order to capture photoelectric signals well, a large-format scanning system is set up to design each component module, control module, and host computer module of the system. Besides, a machine learning-based algorithm is proposed, namely semi-supervised manifold image recognition algorithm, which is used for identify photoelectric detection images. In the test process, the printed circuit board (PCB) and sapphire material are firstly used as the substrate of the current amplifier, and their influences in the circuit are compared. The peak value of the output noise of each substrate circuit is around 2.8 mV when the input of the current amplifier is short-circuited. Then, the signal gain and signal bandwidth of the photoelectric detection system remain stable when there is no optical signal input. During the process of changing the system signal gain ratio, the noise output of the system is the lowest when the voltage of PMT is 0.50 V and the current amplifier gain is set to 2.2 × 105 V/A. The proposed recognition algorithm can identify different types of targets well. After the image is projected into a two-dimensional space by the algorithm, the distance between classes increases, and the targets in the class promote aggregation, thereby enhancing the identify-ability between samples.

The sparse representation based classification (SRC) can effectively improve the face recognition rate. Smoothed l 0 algorithm has much faster calculation speed and requires fewer measured values than the other sparse representation method. In this paper, the sparse representation and smoothed l 0 algorithm for face recognition are presented to improve the face recognition under various conditions such as face disguise, illumination and pose changes, etc. The experiments on the AR, Extended Yale B and FERET face database verify the effectiveness of the presented method. The experimental results show that the face recognition algorithm increases to a certain extent in terms of recognition robustness and time than the original SRC.

Template-Protection-Techniken stellen eine wichtige Ergänzung zu biometrischen Systemen, um das gewünschte Sicherheitsniveau zu erreichen und die Anforderungen an den Schutz der Privatsphäre zu erfüllen. Diese Techniken ermöglichen Erneuerung und Widerruf der Referenzendaten in biometrischen Systemen. In dieser Arbeit wird ein systematisches Evaluierungsframework entwickelt, das sich an die wesentlichen Kriterien und Anforderungen an biometrische Template-Protection-Verfahren festhält. Seine Anwendbarkeit wird durch die Analyse der verschiedenen Algorithmen demonstriert. Die in dieser Arbeit präsentierte Evaluierung ist grundlegend für eine vollständige Analyse. Darüber hinaus ermöglicht es einen Nachweis der Sicherheit und Einhaltung der Privatsphäre. Es schafft eine Basis für Zertifizierung und Benchmark der Template-Protection-Verfahren.