Search

We have witnessed rapid advances in both face presentation attack models and presentation attack detection (PAD) in recent years. Compared to widely studied 2D face presentation attacks (e.g. printed photos and video replays), 3D face presentation attacks are more challenging because face recognition systems (FRS) is more easily confused by the 3D characteristics of materials similar to real faces. Existing 3D face spoofing databases, mostly based on 3D facial masks, are restricted to small data size and suffer from poor authenticity due to the difficulty and expense of mask production. In this work, we introduce a wax figure face database (WFFD) as a novel and super-realistic 3D face presentation attack. This database contains 2300 image pairs (totally 4600) and 745 subjects including both real and wax figure faces with high diversity from online collections. On one hand, our experiments have demonstrated the spoofing potential of WFFD on three popular FRSs. On the other hand, we have developed a multi-feature voting scheme for wax figure face detection (anti-spoofing), which combines three discriminative features at the decision level. The proposed detection method was compared against several face PAD approaches and found to outperform other competing methods. Surprisingly, our fusion-based detection method achieves an Average Classification Error Rate (ACER) of 11.73\% on the WFFD database, which is even better than human-based detection.

Compared to 2D face presentation attacks (e.g. printed photos and video replays), 3D type attacks are more challenging to face recognition systems (FRS) by presenting 3D characteristics or materials similar to real faces. Existing 3D face spoofing databases, however, mostly based on 3D masks, are restricted to small data size or poor authenticity due to the production difficulty and high cost. In this work, we introduce the first wax figure face database, WFFD, as one type of super-realistic 3D presentation attacks to spoof the FRS. This database consists of 2200 images with both real and wax figure faces (totally 4400 faces) with a high diversity from online collections. Experiments on this database first investigate the vulnerability of three popular FRS to this kind of new attack. Further, we evaluate the performance of several face presentation attack detection methods to show the attack abilities of this super-realistic face spoofing database.

Chaotic systems perform well as a new rich source of cryptography and pseudo-random coding. Unfortunately their digital dynamical properties would degrade due to the finite computing precision. Proposed in this paper is a modified digital chaotic sequence generator based on chaotic logistic systems with a coupling structure where one chaotic subsystem generates perturbation signals to disturb the control parameter of the other one. The numerical simulations show that the length of chaotic orbits, the output distribution of chaotic system, and the security of chaotic sequences have been greatly improved. Moreover the chaotic sequence period can be extended at least by one order of magnitude longer than that of the uncoupled logistic system and the difficulty in decrypting increases 2128*2128 times indicating that the dynamical degradation of digital chaos is effectively improved. A field programmable gate array (FPGA) implementation of an algorithm is given and the corresponding experiment shows that the output speed of the generated chaotic sequences can reach 571.4 Mbps indicating that the designed generator can be applied to the real-time video image encryption.

STUDY DESIGN The possibility to prevent acute spinal cord injury (ASCI) by selective infliximab combined with methylprednisolone (MP) was assessed in experimental ASCI. OBJECTIVE To investigate the effects of infliximab, MP, and the combination of these 2 agents on expressions of NF-κB (nuclear factor Kappa B), TRADD (tumor necrosis factor receptor associated death domain), and FADD (fas associated death domain) in a rat model of acute spinal cord injury (ASCI), and to confirm the therapeutic efficacy and possible mechanism of infliximab combined with MP in the treatment of ASCI. SUMMARY OF BACKGROUND DATA The theory that SCI can induce tumor necrosis factor-α expression at the injury site has been evaluated. However, there are few data to confirm the therapeutic efficacy of infliximab combinated with MP in the treatment of rat SCI METHODS: One hundred eighty adult male Sprague Dawley rats with 280 to 300 g body weight were allocated randomly and accordingly. We applied Basso, Beattie, Bresnahan locomotor rating scale to assess the hindlimb motor functional score (10 rats × 6 groups), the hematoxylin and eosin stain and immunohistochemistry stain (10 rats × 6 groups) to assay the morphological changes of spinal cord, the arrangement and expressions of NF-κB, TRADD and FADD, and the RT-PCR (10 rats × 6 groups) to evaluate the messenger RNA expressions of NF-κB, TRADD, and FADD. RESULTS The results showed that both infliximab and MP could lower the expressions of NF-κB, TRADD, and FADD 24 hours after the ASCI, and increased Basso, Beattie, Bresnahan score on the 14th and the 21st days after ASCI, suggesting possible neuroprotective effectiveness on attenuating the severity of neurological deficits and improving the locomotor function in the rat ASCI model. Moreover, infliximab combined with MP exhibited the more powerful ability to this amelioration. CONCLUSION Infliximab combined with methylprednisolone may be an effective treatment for the recovery of ASCI. Further study is needed to determine if this neuroprotective effect is seen for long-term outcomes especially in human ASCI.

The strategy of storage and organization can be adjusted utilizing the access and distribution law of the spatial data, which will significantly improve system performance of spatial data services. The access and distribution law of the spatial data based on Hotmap and Zipf-like are statics, and can not reflect its global information real-time. A dynamic statistical method based on collaborative cloud is proposed in this paper to resolve above-mentioned problems. The nodes service capabilities are calculated in our algorithm. The node agents with good service capabilities are chosen preferentially in the group to fuse dynamic statistical information. The experimental results show that the performance of our algorithm can be improved by about 29% compared with the algorithm of random nodes. The algorithm can meet the need of dynamic statistics in large scale cloud mode with high efficiency.

Nowadays, a number of forensic algorithms have been developed to detect the manipulations of digital images. However, little consideration has been given to anti-forensic schemes capable of fooling the forensic methods. Aiming at this situation, a novel anti-forensic algorithm is proposed to counter a forensic analysis that can detect double JPEG compression with the same quantization matrix, and the limitation of existing image forensics are illustrated accordingly. The proposed algorithm allows generating tampered images without overall recompression, therefore eliminates the double quantization artifacts which will generally exist in tampered JPEG images. Experiment results show that the tampered images generated by the presented method not only have a good disguise effect, but can also effectively counter the forgery detection method that is based on the detection of double JPEG compression with the same quantization matrix.

In the object-based storage architecture of spatial data, accesses to metadata are 50% to 80% of the total data accesses, so metadata management and partitioning are very important. However, many typical and traditional methods for metadata partitioning, such as directory subtree partitioning, hashing partitioning, etc., should face the issues of hotspot and load balancing. In this paper, we analyzed the accesses to spatial data that follows Zipf-like distribution and has locality of reference, and proposed a dynamic method for metadata partitioning based on intensive access pattern of spatial data. This method considered the temporal locality and spatial locality of accesses to tile, put forward tile access rank algorithm based on the sum of access times per interval time, and got tile access probability by Zipf-like's law for dynamic hashing partitioning of metadata. The experiment results presented the improving of efficiency in tile access rank, and showed that the method for metadata partitioning is an effective solution for hotspot and load balancing issues.

An active-passive security protection method for remote sensing image is proposed in the paper. High strength content encryption method is used to protect the security of remote sensing image in the process of storage and transmission. The encryption side only need to encrypt the image once, users can get different fingerprinting image by decrypting the image with different keys. If user leaks the decrypted image, they will be identified by embedded fingerprinting information. Considering the remote sensing image's special requirements to embed fingerprinting, a way to control the strength of embedded fingerprinting is proposed to reduce the influence to the application of remote sensing image.

H + -implantation in LiNbO 3 induces radiation damage, lattice disorder and corresponding refractive index changes. The refractive index decreases in the nuclear stopping region at the end of the implanted ion's track, but changes very little in the electronic stopping region. Thus, these characteristics can be used for fabrication of planar waveguides. The waveguide fabrication process comprises a furnace annealing in flowing oxygen to remove the damage and optical absorption from the guiding layer as well as to compensate oxygen loss during ion implantation. The damaged buried layer together with electronic excitement forms an optical “well”, which confines optical mode propagation. The results of this work show that H + -implantation can be a promising technique for fabrication of low-loss waveguides.

Key management is an important part of secure multicast. Among the representative solutions to the multicast key management, the de-centralized scheme inherits the merits of others. In this paper, we present a scalable de-centralized multicast key management scheme, introduce the main idea and analyze its advantages and disadvantages. We construct a core tree in the group member at first, whose nodes sharing a DEK and then constituting one key management level. The core node and other members in the same region form another key management level. When the member in the subgroup changes, only local sub-tree re-key. If the member in the core tree changes, the DEK of the core tree is updated. Thus the overhead of re-key decreases. When data are transmitted between different subgroups, the nodes in the core tree decrypt/encrypt data only once before switch it to local subgroup members, thus the cost of data transmission is decreased. When the size of group becomes large, we use batch re-key scheme to alleviate the cost of re-key further. The scheme has highly robustness, good scalability and lower cost

The most important part of a secure conference is conference key management (CKM). Among its representative schemes, the de-centralized one inherits the merits of others. But current solutions are not very suitable for some real-time multicast applications such as videoconference, etc. In this paper, we present a scalable de-centralized CKM scheme, which called DCKM, the main idea is introduced and its advantages are analyzed. With our scheme, the problem of low efficiency in data transmission caused by multiple encryptions/decryptions in existing de-centralized schemes is solved, the data transmission efficiency is improved a lot, and the data latency is reduced. The forward/backward secrecy of conference is guaranteed, too. The DCKM is a secure, robust, scalable, high data transmission efficiency, cost effective CKM scheme.

Video data security is very important for multimedia commerce such as video-on-demand and real-time video multicast. Nowadays, many video encryption methods have been put forward. This paper presents a new kind of video encryption approach that based on the syntax character of compressed digital video bitstreams. Using this approach, we can shuffle the critical data blocks in each video frame with different shuffling tables generated by a cipher key. These critical data blocks have an important impact on image reconstruct, so the result images can't be recognized without valid cipher key. The simulation result shows that this approach provides overall high security, high speed, size preservation and format compliant, so it can meet the demands of security, real-time and low cost at the same time