Text based-image clustering (TBIC) is an insufficient approach for clustering related web images. It is a challenging task to abstract the visual features of images with the support of textual information in a database. In content-based image clustering (CBIC), image data are clustered on the foundation of specific features like texture, colors, boundaries, shapes. In this paper, an effective CBIC) technique is presented, which uses texture and statistical features of the images. The statistical features or moments of colors (mean, skewness, standard deviation, kurtosis, and variance) are extracted from the images. These features are collected in a one dimension array, and then genetic algorithm (GA) is applied for image clustering.

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f

Chacha 20 is a stream cypher that is used as lightweight on many CPUs that ‎do not have dedicated AES instructions. As stated by Google, that is the reason why they use it on many ‎devices, such as mobile devices, for authentication in TLS protocol. This paper ‎proposes an improvement of chaha20 stream cypher algorithm based on tent and ‎Chebyshev functions (IChacha20). The main objectives of the proposed IChacha20 ‎algorithm are increasing security layer, designing a robust structure of the IChacha20 ‎to be enabled to resist various types of attacks, implementing the proposed ‎algorithm for encryption of colour images, and transiting it in a secure manner. The ‎ test results proved that the MSE, PSNR, UQI and NCC metrics

      In this paper, a modified three-step iteration algorithm for approximating a joint fixed point of non-expansive and contraction mapping is studied. Under appropriate conditions, several strong convergence theorems and Δ-convergence theorems are established in a complete CAT (0) space. a numerical example is introduced to show that this modified iteration algorithm is faster than other iteration algorithms. Finally, we prove that the modified iteration algorithm is stable. Therefore these results are extended and improved to a novel results that are stated by other researchers. Our results are also complement to many well-known theorems in the literature. This type of research can be played a vital role in computer programming

LK Abood, RA Ali, M Maliki, International Journal of Science and Research, 2015 - Cited by 2

     In this paper the design of hybrid retina matching algorithm that is used in identification systems is considered. Retina based recognition is apparent as the most secure method for identification of an identity utilized to differentiate persons.

     The characteristics of Speeded up Robust Feature (SURF) and Binary Robust Invariant Scalable Key-Points (BRISK) algorithm have been used in order to produce a fast matching algorithm than the classical ones, those characteristics are important for real-time applications which usually need quick processing of a growing quantity of data. The algorithm is divided into three stages: retinal image processing and segmentation, extracting the lo