scholarly journals Modified cuckoo search algorithm: Feature subset selection &Shape,Color and Texture Features Descriptors for Content-Based Image Retrieval

2021 ◽  
Vol 23 (12) ◽  
pp. 525-541
Author(s):  
Mrs.K. Radha ◽  
◽  
Mrs. . R.V.Sudha ◽  
Mrs.M. Meena ◽  
Dr.R. Jayavadivel ◽  
...  
Keyword(s):  
Image Retrieval ◽  
Clustering Algorithm ◽  
Search Algorithm ◽  
Fitness Function ◽  
Texture Features ◽  
Cuckoo Search ◽  
Detection Algorithm ◽  
Feature Subset Selection ◽  
Content Based Image Retrieval ◽  
Feature Subset

With the recent advances in knowledge, the complication of multimedia has increased expressively and new areas of research have opened up in search of new multimedia content. Content-based image retrieval (CBIR) are used to extract images associated with image queries (IQs) from huge databases. The CBIR schemes accessible at present have limited functionality because they only have a partial number of functions. This document presents an improved cookie detection algorithm with coarse sentences for processing large amounts of data using selected examples. The improved cuckoo detection algorithm mimics the behavior of brood attachment parasites in some cuckoo species, including some birds. Modified cuckoo recognition uses approximate set theory to create a fitness function that takes into account the sum of features and the quality of classification as a small amount. For an image entered as IQ from a database, distance metrics are used to find the appropriate image. This is the central idea of CBIR. The projected CBIR method is labelled and can extract shape features based on the RGB color using the and canny Edge (CED) and neutrosophic clustering algorithm scheme. After YCbCrcolor cut, and the CED to get the features to extract the vascular matrix. The combination of these techniques improves the efficiency of the CBR image recovery infrastructure. In this thesis recursive neural network techniques are used to measure the similarity. In addition, the accuracy of the results is: The recall score is measured to evaluate system performance. The proposed CBIR system provides more precise and accurate values than the complex CBIR system.

scholarly journals A Content-Based Image Retrieval Method By Exploiting Cluster Shapes

2018 ◽  
Vol 14 (2) ◽  
pp. 90-102 ◽  
Author(s):  
Hanan Al-Jubouri ◽  
Hongbo Du
Keyword(s):  
Image Retrieval ◽  
Clustering Algorithm ◽  
Texture Features ◽  
Gaussian Mixture ◽  
Semantic Gap ◽  
Content Based Image Retrieval ◽  
Automatic Process ◽  
Query Image ◽  
Number Of Clusters ◽  
Leibler Divergence

Content-Based Image Retrieval (CBIR) is an automatic process of retrieving images that are the most similar to a query image based on their visual content such as colour and texture features. However, CBIR faces the technical challenge known as the semantic gap between high level conceptual meaning and the low-level image based features. This paper presents a new method that addresses the semantic gap issue by exploiting cluster shapes. The method first extracts local colours and textures using Discrete Cosine Transform (DCT) coefficients. The Expectation-Maximization Gaussian Mixture Model (EM/GMM) clustering algorithm is then applied to the local feature vectors to obtain clusters of various shapes. To compare dissimilarity between two images, the method uses a dissimilarity measure based on the principle of Kullback-Leibler divergence to compare pair-wise dissimilarity of cluster shapes. The paper further investigates two respective scenarios when the number of clusters is fixed and adaptively determined according to cluster quality. Experiments are conducted on publicly available WANG and Caltech6 databases. The results demonstrate that the proposed retrieval mechanism based on cluster shapes increases the image discrimination, and when the number of clusters is fixed to a large number, the precision of image retrieval is better than that when the relatively small number of clusters is adaptively determined.

scholarly journals A Hybrid Ant Colony and Cuckoo Search Algorithm for Route Optimization of Heating Engineering

Energies ◽  
2018 ◽  
Vol 11 (10) ◽  
pp. 2675 ◽  
Author(s):  
Yang Zhang ◽  
Huihui Zhao ◽  
Yuming Cao ◽  
Qinhuo Liu ◽  
Zhanfeng Shen ◽  
...  
Keyword(s):  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Search Algorithm ◽  
Fitness Function ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Elapsed Time ◽  
Route Design

The development of remote sensing and intelligent algorithms create an opportunity to include ad hoc technology in the heating route design area. In this paper, classification maps and heating route planning regulations are introduced to create the fitness function. Modifications of ant colony optimization and the cuckoo search algorithm, as well as a hybridization of the two algorithms, are proposed to solve the specific Zhuozhou–Fangshan heating route design. Compared to the fitness function value of the manual route (234.300), the best route selected by modified ant colony optimization (ACO) was 232.343, and the elapsed time for one solution was approximately 1.93 ms. Meanwhile, the best route selected by modified Cuckoo Search (CS) was 244.247, and the elapsed time for one solution was approximately 0.794 ms. The modified ant colony optimization algorithm can find the route with smaller fitness function value, while the modified cuckoo search algorithm can find the route overlapped to the manual selected route better. The modified cuckoo search algorithm runs more quickly but easily sticks into the premature convergence. Additionally, the best route selected by the hybrid ant colony and cuckoo search algorithm is the same as the modified ant colony optimization algorithm (232.343), but with higher efficiency and better stability.

scholarly journals Test Case Generation for Data Flow Testing using Cuckoo Search Algorithm

2019 ◽  
Vol 8 (2S11) ◽  
pp. 2953-2964
Keyword(s):  
Data Flow ◽  
Search Algorithm ◽  
Fitness Function ◽  
Cuckoo Search ◽  
Automatic Generation ◽  
Cuckoo Search Algorithm ◽  
Test Case ◽  
Stochastic Algorithm ◽  
Data Flow Testing ◽  
Work Done

Software testing consumes the major portion of the total efforts required for software development. This activity is very time consuming and labor intensive. It is very hard to do testing in optimal manner. In this paper a new approach is proposed, which uses the nature inspired stochastic algorithm called Cuckoo Search Algorithm (CSA) for the automatic generation of test data for data flow testing. This approach considers all def-use as test adequacy criteria. For assistance to CSA in the state space a new fitness function is also proposed by using the concept of dominator tree and branch distance in a CFG. To validate the proposed approach experiments are carried out on 10 benchmarked programs and findings are contrasted with earlier work done in this domain. Further in order to prove that proposed approach performs better than the above mentioned approaches a statistical difference test (T-test) is also performed.

scholarly journals Implementation of early and late fusion methods for content-based image retrieval

2021 ◽  
Vol 8 (7) ◽  
pp. 97-105
Author(s):  
Ali Ahmed ◽  
◽  
Sara Mohamed ◽  
Keyword(s):  
Image Retrieval ◽  
Texture Features ◽  
Image Features ◽  
Distance Measures ◽  
Content Based Image Retrieval ◽  
Late Fusion ◽  
Query Image ◽  
Fusion Methods ◽  
And Performance ◽  
Image Repository

Content-Based Image Retrieval (CBIR) systems retrieve images from the image repository or database in which they are visually similar to the query image. CBIR plays an important role in various fields such as medical diagnosis, crime prevention, web-based searching, and architecture. CBIR consists mainly of two stages: The first is the extraction of features and the second is the matching of similarities. There are several ways to improve the efficiency and performance of CBIR, such as segmentation, relevance feedback, expansion of queries, and fusion-based methods. The literature has suggested several methods for combining and fusing various image descriptors. In general, fusion strategies are typically divided into two groups, namely early and late fusion strategies. Early fusion is the combination of image features from more than one descriptor into a single vector before the similarity computation, while late fusion refers either to the combination of outputs produced by various retrieval systems or to the combination of different rankings of similarity. In this study, a group of color and texture features is proposed to be used for both methods of fusion strategies. Firstly, an early combination of eighteen color features and twelve texture features are combined into a single vector representation and secondly, the late fusion of three of the most common distance measures are used in the late fusion stage. Our experimental results on two common image datasets show that our proposed method has good performance retrieval results compared to the traditional way of using single features descriptor and also has an acceptable retrieval performance compared to some of the state-of-the-art methods. The overall accuracy of our proposed method is 60.6% and 39.07% for Corel-1K and GHIM-10K ‎datasets, respectively.

Sign in / Sign up

Export Citation Format

Share Document