Background subtraction is the dominant approach in the domain of moving object detection. Lots of research has been done to design or improve background subtraction models. However, there are a few well-known and state-of-the-art models that can be applied as a benchmark. Generally, these models are applied to different dataset benchmarks. Most of the time, choosing an appropriate dataset is challenging due to the lack of dataset availability and the tedious process of creating ground-truth frames for the sake of quantitative evaluation. Therefore, in this article, we collected local video scenes of a street and river taken by a stationary camera, focusing on dynamic background challenges. We presented a new technique for creating ground-truth frames using modeling, composing, tracking, and rendering each frame. Eventually, we applied three promising algorithms used in this domain: GMM, KNN, and ViBe, to our local dataset. Results obtained by quantitative evaluations revealed the effectiveness of our new technique for generating the ground-truth scenes to be benchmarked with the original scenes using a number of statistical metrics.
The main objective of this work is to introduce and investigate fixed point (F. p) theorems for maps that satisfy contractive conditions in weak partial metric spaces (W.P.M.S), and give some new generalization of the fixed point theorems of Mathews and Heckmann. Our results extend, and unify a multitude of (F. p) theorems and generalize some results in (W.P.M.S). An example is given as an illustration of our results.
Hiding secret information in the image is a challenging and painstaking task in computer security and steganography system. Certainly, the absolute intricacy of attacks to security system makes it more attractive.in this research on steganography system involving information hiding,Huffman codding used to compress the secret code before embedding which provide high capacity and some security. Fibonacci decomposition used to represent the pixels in the cover image, which increase the robustness of the system. One byte used for mapping all the pixels properties. This makes the PSNR of the system higher due to random distribution of embedded bits. Finally, three kinds of evaluation are applied such as PSNR, chi-square attack, a
... Show MoreNew data on jumping spiders (Salticidae) and tangle-web spiders (Theridiidae) of Armenia are provided on the basis of recently collected specimens in various regions of Armenia. One species, Ballus rufipes (Simon, 1868) is recorded as new to the Caucasus Region, in addition to the following species: Neon reticulatus (Blackwall, 1853), Pellenes brevis (Simon, 1868), Salticus scenicus (Clerck, 1757) and Synageles dalmaticus (Keyserling, 1863) that belong to a family Salticidae, are recorded in Armenia for the first time.
A further 7 species of Theridiidae are recorded in Armenia for the first time Kochiura aulica (C. L. Koch, 1838), Steatoda albomaculata (De Geer, 1778), Steatoda bipunctata (Linnaeus, 1758), Steatoda castanea Clerk, 175
This paper presents a new RGB image encryption scheme using multi chaotic maps. Encrypting an image is performed via chaotic maps to confirm the properties of secure cipher namely confusion and diffusion are satisfied. Also, the key sequence for encrypting an image is generated using a combination of 1D logistic and Sine chaotic maps. Experimental results and the compassion results indicate that the suggested scheme provides high security against several types of attack, large secret keyspace and highly sensitive.
In this paper, we propose a new approach of regularization for the left censored data (Tobit). Specifically, we propose a new Bayesian group Bridge for left-censored regression ( BGBRLC). We developed a new Bayesian hierarchical model and we suggest a new Gibbs sampler for posterior sampling. The results show that the new approach performs very well compared to some existing approaches.
Cryptography is a major concern in communication systems. IoE technology is a new trend of smart systems based on various constrained devices. Lightweight cryptographic algorithms are mainly solved the most security concern of constrained devices and IoE systems. On the other hand, most lightweight algorithms are suffering from the trade-off between complexity and performance. Moreover, the strength of the cryptosystems, including the speed of the algorithm and the complexity of the system against the cryptanalysis. A chaotic system is based on nonlinear dynamic equations that are sensitive to initial conditions and produce high randomness which is a good choice for cryptosystems. In this work, we proposed a new five-dimensional of a chaoti
... Show MoreIn this Paper, we proposed two new predictor corrector methods for solving Kepler's equation in hyperbolic case using quadrature formula which plays an important and significant rule in the evaluation of the integrals. The two procedures are developed that, in two or three iterations, solve the hyperbolic orbit equation in a very efficient manner, and to an accuracy that proves to be always better than 10-15. The solution is examined with and with grid size , using the first guesses hyperbolic eccentric anomaly is and , where is the eccentricity and is the hyperbolic mean anomaly.
In this paper, a new hybrid algorithm for linear programming model based on Aggregate production planning problems is proposed. The new hybrid algorithm of a simulated annealing (SA) and particle swarm optimization (PSO) algorithms. PSO algorithm employed for a good balance between exploration and exploitation in SA in order to be effective and efficient (speed and quality) for solving linear programming model. Finding results show that the proposed approach is achieving within a reasonable computational time comparing with PSO and SA algorithms.
Enhancing quality image fusion was proposed using new algorithms in auto-focus image fusion. The first algorithm is based on determining the standard deviation to combine two images. The second algorithm concentrates on the contrast at edge points and correlation method as the criteria parameter for the resulted image quality. This algorithm considers three blocks with different sizes at the homogenous region and moves it 10 pixels within the same homogenous region. These blocks examine the statistical properties of the block and decide automatically the next step. The resulted combined image is better in the contras
... Show MoreChaotic systems have been proved to be useful and effective for cryptography. Through this work, a new Feistel cipher depend upon chaos systems and Feistel network structure with dynamic secret key size according to the message size have been proposed. Compared with the classical traditional ciphers like Feistel-based structure ciphers, Data Encryption Standards (DES), is the common example of Feistel-based ciphers, the process of confusion and diffusion, will contains the dynamical permutation choice boxes, dynamical substitution choice boxes, which will be generated once and hence, considered static,
While using chaotic maps, in the suggested system, called