Reviewerly/exHarmony huggingface dataset:
Novel Face Liveness Detection Using Fusion of Features and Machine Learning Classifiers

As the technology is growing which is birth to different types of frauds into areas like face detection, finger print detection etc. Moreover, it becomes very difficult for service providers to maintain security of data. In addition, these systems needs to be protected from spoofing by attackers. Fraudsters can use dummy Eyes, photographs for identification of faces for authentication purposes. These facial recognitions can also be done through face detection from video streams by replaying videos & capturing specific moments of person. Also these kind of attacks can be done successfully as system can't detect the real life faces & faces extracted from videos & photos. In addition, these videos & photos will be easily available on internet & other stored media, so anyone can challenge the system by using it. Now, many algorithms are implemented to detect face liveness for authentication. The paper represents novel face liveness detection using fusion of luminance-based features with help of assorted machine learning classifiers.
microbatchGAN: Stimulating Diversity with Multi-Adversarial Discrimination

We propose to tackle the mode collapse problem in generative adversarial networks (GANs) by using multiple discriminators and assigning a different portion of each minibatch, called microbatch, to each discriminator. We gradually change each discriminator's task from distinguishing between real and fake samples to discriminating samples coming from inside or outside its assigned microbatch by using a diversity parameter α. The generator is then forced to promote variety in each minibatch to make the micro-batch discrimination harder to achieve by each discriminator. Thus, all models in our framework benefit from having variety in the generated set to reduce their respective losses. We show evidence that our solution promotes sample diversity since early training stages on multiple datasets.
Dual Neural Networks Coupling Data Regression With Explicit Priors for Monocular 3D Face Reconstruction

We address the challenging issue of reconstructing a 3D face from one single image under various expressions and illuminations, which is widely applied in multimedia tasks. Methods built upon classical parametric morphable models (3DMMs) gain success on reconstructing the global geometry of a 3D face, but fail to precisely characterize local facial details. Recently, deep neural networks (DNN) have been applied to the reconstruction that directly predicts depth maps, showing compelling performance on detail recovery. Unfortunately, their reconstruction is prone to structural distortions owing to the lack of explicit prior constraints. In this paper, we propose dual neural networks that optimize one energy coupling data fitting with local explicit geometric prior. Specifically, we build one residual network upon traditional convolution layers in order to directly predict 3D structures by fitting an input image. Meanwhile, we devise a novel architecture stacking shallow networks to refine 3D clouds with geometric priors given by Markov random fields (MRFs). Quantitative evaluations demonstrate the superior performance of the dual networks over either end-to-end DNNs or parametric models. Comparisons with the state-of-the-art also show competitive reconstruction quality on various conditions.
Strain Measurement Based on Speeded-up Robust Feature Algorithm Applied to Microimages from a Smartphone-Based Microscope

The objective of this study is to evaluate and improve the accuracy and stability of a strain measurement method that uses the speeded-up robust feature (SURF) method to trace the displacement of feature points in microimages and obtain the strain in objects. The microimages were acquired using a smartphone with a portable microscope, which has a broad prospect of application. An experiment was performed using an unpacked optical fiber as the experimental carrier. The matching effect of the SURF method was analyzed in the microimage, and the M-estimator sample consensus (MSAC) algorithm was used to reject outliers generated by SURF. The results indicated that the accuracy of strain measurement using the proposed method is improved by modifying the feature point tracking method and measurement method. When compared with the fiber Bragg grating (FBG) data, the maximum standard error corresponded to 2.5 με, which satisfies the requirement of structural health monitoring (SHM) in practical engineering.
Local Bitcoin Network Simulator for Performance Evaluation using Lightweight Virtualization

This paper presents a new blockchain network simulator that uses bitcoin's original reference implementation as its main application. The proposed simulator leverages the use of lightweight virtualization technology to build a fine tuned local testing network. To enable fast simulation of a large scale network without disabling mining service, the simulator can adjust the bitcoin mining difficulty level to below the default minimum value. In order to assess the performance of blockchain under different network conditions, the simulator allows to define different network topologies, and integrates Linux kernel traffic control (tc) tool to apply distinct delay or packet loss on the network nodes. Moreover, to validate the efficiency of our simulator we conduct a set of experiments and study the impact of the computation power and network delay on the network's consistency in terms of number of forks and mining revenues. The impact of applying different mining difficulty levels is also studied and the block time as well as fork occurrences are evaluated. Furthermore, a comprehensive survey and taxonomy of existing blockchain simulators are provided along with a discussion justifying the need of new simulator. As part of our contribution, we have made the simulator available on Github <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup> for the community to use and improve it.
A novel image security technique based on nucleic acid concepts

Image security is very important to protect from any unauthorised user access. In this paper a two-phase secure image encryption has been proposed using the concepts of Deoxyribonucleic acid (DNA) and Ribonucleic acid (RNA). First, the plain image is encrypted based on DNA rules, DNA XOR operator, and chaotic map function in DNA phase and initial cipher image is created. Next, the cipher image is used as the input of RNA phase so that codons truth table for RNA and secret key are exploited for further image encryption. The proposed method has high resistance against common attacks in the field and achieved entropy of 7.9994. The implementation of the proposed method is available on https://github.com/mehdim7/RNA-DNA-Image-Encryption.
A Method for Enhancing Capacity of Local Governance for Climate Change Adaptation

Abstract The lack of capacity for climate change adaptation at the subnational level has been highlighted as a key barrier to implementing the UNFCCC National Adaptation Plans. At the same time, the adaptive capacity of local governance is highly context sensitive, making a “one‐size fits all” approach inappropriate. Thus, a versatile methodological approach for application in various local contexts is required. There are several indicator‐based local governance assessment methods for evaluating the effectiveness of local governance for climate change adaptation. However, they fall short of identifying and prioritizing between key factors within local governance for enhancing adaptive capacity and driving positive change. Building on adaptation theory, the authors propose combining two methodological approaches, the Capital Approach Framework for evaluating the adaptive capacity of local governance and Fuzzy Cognitive Mapping for identifying leverage points, into one integrated modeling approach, which can be applied by local researchers. This paper describes the process and benefits of combining the methodological approaches, with an example provided as supporting information . Assisting decision‐makers and policy planners from subnational governance in identifying leverage points to focus and maximize impact of capacity‐enhancing measures would make a key contribution for successful implementation of the UNFCCC National Adaptation Plans.
A new watermark decoder in DNST domain using singular values and gaussian-cauchy mixture-based vector HMT

There are three indispensable, yet contrasting requirements for a watermarking scheme: imperceptibility, robustness, and payload. Therefore, it is a challenge to obtain a tradeoff among above requirements in image watermark detection. In this paper, we propose a new statistical watermark decoder in discrete non-separable Shearlet transform (DNST) domain using singular values and Gaussian-Cauchy mixture-based vector hidden Markov tree (HMT). Our method can obtain great performance in imperceptibility, robustness and payload, and it is necessary for image copyright protection. We first perform DNST on the host image, and apply singular value decomposition (SVD) to the significant DNST domain high entropy blocks. We then embed the digital watermark into the DNST high entropy blocks by modifying the robust singular values. At the receiver, by combining the Gaussian-Cauchy mixture-based vector HMT and maximum likelihood (ML) decision, we propose a new blind image watermark decoder in DNST domain. Here, robust DNST domain singular values are firstly modeled by using Gaussian-Cauchy mixture-based vector HMT, where the Gaussian-Cauchy mixture marginal distribution and various strong dependencies of DNST domain singular values are incorporated. Then the statistical model parameters of Gaussian-Cauchy mixture-based vector HMT are estimated using parameter-expanded expectation–maximization (PXEM) approach. And finally, a blind image watermark decoder is developed using Gaussian-Cauchy mixture-based vector HMT and ML decision rule. The major contribution of this paper is the use of singular value, Gaussian-Cauchy mixture-based vector HMT and PXEM algorithms, which enhances the performance of watermarking scheme. Experimental results on some test images and comparison with well-known existing methods demonstrate the efficacy and superiority of the proposed method.
Fourier-transform-based two-stage camera calibration method with simple periodical pattern

Clear and focused pattern images are essential prerequisites for accurate feature detection in traditional camera calibration methods, which introduce numerous limitations in various areas, such as long-distance photogrammetry. A feature detection method robust against defocusing is proposed for extracting the centers or corners of a planar square periodic target. A Fourier transform is employed to calculate two wrapped phase maps from the periodic target images, which are then used to accurately extract the feature points. The calibration procedure is divided into two stages to obtain more accurate results. A rough calibration is performed to calculate the rotation angles between the target and the camera. If the tilt angle is larger than 12°, the corresponding images are removed. Subsequently, the remaining images are used for precise calibration. The simulations and the experiments demonstrate that the proposed method can accurately calibrate a camera with a planar square periodic pattern, even in the case of severe defocusing.
Sitting vs. Standing in VR: Towards a Systematic Classification of Challenges and (Dis)Advantages

With this work, we propose a draft classification of advantages and disadvantages between sitting and standing user interfaces in VR to stimulate discussion and future work.
Hierarchical growing grid networks for skeleton based action recognition

In this paper, a novel cognitive architecture for action recognition is developed by applying layers of growing grid neural networks.Using these layers makes the system capable of automatically arranging its representational structure. In addition to the expansion of the neural map during the growth phase, the system is provided with a prior knowledge of the input space, which increases the processing speed of the learning phase. Apart from two layers of growing grid networks the architecture is composed of a preprocessing layer, an ordered vector representation layer and a one-layer supervised neural network. These layers are designed to solve the action recognition problem. The first-layer growing grid receives the input data of human actions and the neural map generates an action pattern vector representing each action sequence by connecting the elicited activation of the trained map. The pattern vectors are then sent to the ordered vector representation layer to build the time-invariant input vectors of key activations for the second-layer growing grid. The second-layer growing grid categorizes the input vectors to the corresponding action clusters/sub-clusters and finally the one-layer supervised neural network labels the shaped clusters with action labels. Three experiments using different datasets of actions show that the system is capable of learning to categorize the actions quickly and efficiently. The performance of the growing grid architecture is com-pared with the results from a system based on Self-Organizing Maps, showing that the growing grid architecture performs significantly superior on the action recognition tasks.
Talk2Lab: The Smart Lab of the Future

In today's world of advancing technology, pervasive and ubiquitous systems have become more common, and have been adapted for many different areas of use. The Internet-of-Things (IoT) movement has increased in popularity, and there are now many affordable, customizable smart devices available for various purposes. These devices are commonly found in the home, but have yet to infiltrate the scientific laboratory in the same way. Some laboratories do use IoT devices to control and monitor equipment, but smart laboratories just do not exist in the same way as smart homes, until now. This article introduces the use cases for a smart integrated laboratory, and describes a prototype system, Talk2Lab, that was implemented in an experimental laser facility. Talk2Lab uses a combination of sensors, Raspberry Pis, camera feeds, and multiple interaction methods (voice, text, and visual dashboards) to facilitate laboratory communication. It was evaluated by the laboratory users for usability, and to identify potential areas of expansion. The work to date illustrates the type of systems that can be created using IoT devices. From the results of the user evaluation, we have conceptualized a future vision for Talk2Lab: a fully interconnected laboratory of the future.
Automatic network restructuring and risk mitigation through business process asset dependency analysis

In the 4th industrial revolution era, security of multiple interconnected devices has become a critical issue. A rapidly increasing number of cybersecurity incidents emerge due to complex interconnected sensors, devices, and systems used in the Internet of Things. In this paper, we tackle the need for automation in security risk analysis and restructuring of such networks. The presented framework models the connections of assets and devices so as to depict their interdependencies on a company's business processes and effectively reduces their overall risk against cybersecurity threats. It achieves this by (1) identifying critical components and dependency structural risks, (2) prioritizing assets based on their influence on business processes and (3) proposing network restructures and asset clusters. To do that, the proposed algorithm utilizes (i) dependency risk graphs for modeling and analyzing networks dependencies, (ii) graph minimum spanning trees, and (iii) network centrality metrics. We test the implementation on a real-world company and demonstrate its effectiveness. Results show that the framework can automatically identify critical components and dependency structural risks and propose different network topologies by creating the optimum number of asset subnets, while retaining business operations. Tests show that the closeness centrality metric combined with the midpoint on extreme values calculation type works best for network asset grouping and subnetting.
Static Analysis for ECMAScript String Manipulation Programs

In recent years, dynamic languages, such as JavaScript or Python, have been increasingly used in a wide range of fields and applications. Their tricky and misunderstood behaviors pose a great challenge for static analysis of these languages. A key aspect of any dynamic language program is the multiple usage of strings, since they can be implicitly converted to another type value, transformed by string-to-code primitives or used to access an object-property. Unfortunately, string analyses for dynamic languages still lack precision and do not take into account some important string features. In this scenario, more precise string analyses become a necessity. The goal of this paper is to place a first step for precisely handling dynamic language string features. In particular, we propose a new abstract domain approximating strings as finite state automata and an abstract interpretation-based static analysis for the most common string manipulating operations provided by the ECMAScript specification. The proposed analysis comes with a prototype static analyzer implementation for an imperative string manipulating language, allowing us to show and evaluate the improved precision of the proposed analysis.
Enhancing Cross-Modal Retrieval Based on Modality-Specific and Embedding Spaces

A new approach that drastically improves cross-modal retrieval performance in vision and language (hereinafter referred to as “vision and language retrieval”) is proposed in this paper. Vision and language retrieval takes data of one modality as a query to retrieve relevant data of another modality, and it enables flexible retrieval across different modalities. Most of the existing methods learn optimal embeddings of visual and lingual information to a single common representation space. However, we argue that the forced embedding optimization results in loss of key information for sentences and images. In this paper, we propose an effective utilization of representation spaces in a simple but robust vision and language retrieval method. The proposed method makes use of multiple individual representation spaces through text-to-image and image-to-text models. Experimental results showed that the proposed approach enhances the performance of existing methods that embed visual and lingual information to a single common representation space.
Robust Combined Binarization Method of Non-Uniformly Illuminated Document Images for Alphanumerical Character Recognition

Image binarization is one of the key operations decreasing the amount of information used in further analysis of image data, significantly influencing the final results. Although in some applications, where well illuminated images may be easily captured, ensuring a high contrast, even a simple global thresholding may be sufficient, there are some more challenging solutions, e.g., based on the analysis of natural images or assuming the presence of some quality degradations, such as in historical document images. Considering the variety of image binarization methods, as well as their different applications and types of images, one cannot expect a single universal thresholding method that would be the best solution for all images. Nevertheless, since one of the most common operations preceded by the binarization is the Optical Character Recognition (OCR), which may also be applied for non-uniformly illuminated images captured by camera sensors mounted in mobile phones, the development of even better binarization methods in view of the maximization of the OCR accuracy is still expected. Therefore, in this paper, the idea of the use of robust combined measures is presented, making it possible to bring together the advantages of various methods, including some recently proposed approaches based on entropy filtering and a multi-layered stack of regions. The experimental results, obtained for a dataset of 176 non-uniformly illuminated document images, referred to as the WEZUT OCR Dataset, confirm the validity and usefulness of the proposed approach, leading to a significant increase of the recognition accuracy.
Differential Parametric Formalism for the Evolution of Gaussian States: Nonunitary Evolution and Invariant States

In the differential approach elaborated, we study the evolution of the parameters of Gaussian, mixed, continuous variable density matrices, whose dynamics are given by Hermitian Hamiltonians expressed as quadratic forms of the position and momentum operators or quadrature components. Specifically, we obtain in generic form the differential equations for the covariance matrix, the mean values, and the density matrix parameters of a multipartite Gaussian state, unitarily evolving according to a Hamiltonian H ^ . We also present the corresponding differential equations, which describe the nonunitary evolution of the subsystems. The resulting nonlinear equations are used to solve the dynamics of the system instead of the Schrödinger equation. The formalism elaborated allows us to define new specific invariant and quasi-invariant states, as well as states with invariant covariance matrices, i.e., states were only the mean values evolve according to the classical Hamilton equations. By using density matrices in the position and in the tomographic-probability representations, we study examples of these properties. As examples, we present novel invariant states for the two-mode frequency converter and quasi-invariant states for the bipartite parametric amplifier.
Bayesian Skip-Autoencoders for Unsupervised Hyperintense Anomaly Detection in High Resolution Brain Mri

Autoencoder-based approaches for Unsupervised Anomaly Detection (UAD) in brain MRI have recently gained a lot of attention and have shown promising performance. However, brain MR images are particularly complex and require large model capacity for learning a proper reconstruction, which existing methods encounter by restricting themselves to downsampled data or anatomical subregions. In this work, we show that models with limited capacity can be trained and used for UAD in full brain MR images at their native resolution by introducing skip-connections, a concept which has already proven beneficial for biomedical image segmentation and image-to-image translation, and a dropout-based mechanism to prevent the model from learning an identity mapping. In an ablative study on two different pathologies we show considerable improvements over State-of-the-Art Autoencoder-based UAD models. The stochastic nature of the model also allows to investigate epistemic uncertainty in our so-called Skip-Autoencoder, which is briefly portrayed.