Blind image separation based on exponentiated transmuted Weibull distribution

In recent years the processing of blind image separation has been investigated. As a result, a number of feature extraction algorithms for direct application of such image structures have been developed. For example, separation of mixed fingerprints found in any crime scene, in which a mixture of two or more fingerprints may be obtained, for identification, we have to separate them. In this paper, we have proposed a new technique for separating a multiple mixed images based on exponentiated transmuted Weibull distribution. To adaptively estimate the parameters of such score functions, an efficient method based on maximum likelihood and genetic algorithm will be used. We also calculate the accuracy of this proposed distribution and compare the algorithmic performance using the efficient approach with other previous generalized distributions. We find from the numerical results that the proposed distribution has flexibility and an efficient resultComment: 14 pages, 12 figures, 4 tables. International Journal of Computer Science and Information Security (IJCSIS),Vol. 14, No. 3, March 2016 (pp. 423-433

Matroidal and Lattices Structures of Rough Sets and Some of Their Topological Characterizations

Matroids, rough set theory and lattices are efficient tools of knowledge discovery. Lattices and matroids are studied on preapproximations spaces. Li et al. proved that a lattice is Boolean if it is clopen set lattice for matroids. In our study, a lattice is Boolean if it is closed for matroids. Moreover, a topological lattice is discussed using its matroidal structure. Atoms in a complete atomic Boolean lattice are completely determined through its topological structure. Finally, a necessary and sufficient condition for a predefinable set is proved in preapproximation spaces. The value k for a predefinable set in lattice of matroidal closed sets is determined

Matroidal and Lattices Structures of Rough Sets and Some of Their Topological Characterizations

Matroids, rough set theory and lattices are efficient tools of knowledge discovery. Lattices and matroids are studied on preapproximations spaces. Li et al. proved that a lattice is Boolean if it is clopen set lattice for matroids. In our study, a lattice is Boolean if it is closed for matroids. Moreover, a topological lattice is discussed using its matroidal structure. Atoms in a complete atomic Boolean lattice are completely determined through its topological structure. Finally, a necessary and sufficient condition for a predefinable set is proved in preapproximation spaces. The value k for a predefinable set in lattice of matroidal closed sets is determined