Adaptive Cuckoo Search based optimal bilateral filtering for denoising of satellite images

2020 ◽  
Vol 100 ◽  
pp. 308-321 ◽  
Author(s):  
Anju Asokan ◽  
J. Anitha
2014 ◽  
Vol 5 (2) ◽  
pp. 1-21 ◽  
Author(s):  
Arpita Sharma ◽  
Samiksha Goel

This paper proposes two novel nature inspired decision level fusion techniques, Cuckoo Search Decision Fusion (CSDF) and Improved Cuckoo Search Decision Fusion (ICSDF) for enhanced and refined extraction of terrain features from remote sensing data. The developed techniques derive their basis from a recently introduced bio-inspired meta-heuristic Cuckoo Search and modify it suitably to be used as a fusion technique. The algorithms are validated on remote sensing satellite images acquired by multispectral sensors namely LISS3 Sensor image of Alwar region in Rajasthan, India and LANDSAT Sensor image of Delhi region, India. Overall accuracies obtained are substantially better than those of the four individual terrain classifiers used for fusion. Results are also compared with majority voting and average weighing policy fusion strategies. A notable achievement of the proposed fusion techniques is that the two difficult to identify terrains namely barren and urban are identified with similar high accuracies as other well identified land cover types, which was not possible by single analyzers.


Author(s):  
Jagan Kumar. N ◽  
Agilandeeswari. L ◽  
Prabukumar. M

<p>The research work is to improve the segmentation of the color satellite images. In this proposed method the color satellite image can be segmented by using Tsallis entropy and granular computing methods with the help of cuckoo search algorithm. The Tsallis and granular computing methods will used to find the maximum possibility of threshold limits and the cuckoo search will find the optimized threshold values based on threshold limit that is calculated by the Tsallis entropy and granular computing methods and the multilevel thresholding  will used for the segmentation of color satellite images based on the optimized threshold value that will find by this work and these methods will help to select the optimized threshold values for multiple thresholding effectively.<strong></strong></p>


Author(s):  
Harish Kundra ◽  
Wasim Khan ◽  
Meenakshi Malik ◽  
Kantilal Pitambar Rane ◽  
Rahul Neware ◽  
...  

The firefly algorithm and cuckoo search are the meta-heuristic algorithms efficient to determine the solution for the searching and optimization problems. The current work proposes an integrated concept of quantum-inspired firefly algorithm with cuckoo search (IQFACS) that adapts both algorithms’ expedient attributes to optimize the solution set. In the IQFACS algorithm, the quantum-inspired firefly algorithm (QFA) ensures the diversification of fireflies-based generated solution set using the superstitions quantum states of the quantum computing concept. The cuckoo search (CS) algorithm uses the Lévy flight attribute to escape the QFA from the premature convergence and stagnation stage more effectively than the quantum principles. Here, the proposed algorithm is applied for the application of optimal path planning. Before using the proposed algorithm for path planning, the algorithm is tested on different optimization benchmark functions to determine the efficacy of the proposed IQFACS algorithm than the firefly algorithm (FA), CS, and hybrid FA and CS algorithm. Using the proposed IQFACS algorithm, path planning is performed on the satellite images with vegetation as the focused region. These satellite images are captured from Google Earth and belong to the different areas of India. Here, satellite images are converted into morphologically processed binary images and considered as maps for path planning. The path planning process is also executed with the FA, CS, and QFA algorithms. The performance of the proposed algorithm and other algorithms are accessed with the evaluation of simulation time and the number of cycles to attain the shortest path from defined source to destination. The error rate measure is also incorporated to analyze the overall performance of the proposed IQFACS algorithm over the other algorithms.


2020 ◽  
Vol 39 (6) ◽  
pp. 8125-8137
Author(s):  
Jackson J Christy ◽  
D Rekha ◽  
V Vijayakumar ◽  
Glaucio H.S. Carvalho

Vehicular Adhoc Networks (VANET) are thought-about as a mainstay in Intelligent Transportation System (ITS). For an efficient vehicular Adhoc network, broadcasting i.e. sharing a safety related message across all vehicles and infrastructure throughout the network is pivotal. Hence an efficient TDMA based MAC protocol for VANETs would serve the purpose of broadcast scheduling. At the same time, high mobility, influential traffic density, and an altering network topology makes it strenuous to form an efficient broadcast schedule. In this paper an evolutionary approach has been chosen to solve the broadcast scheduling problem in VANETs. The paper focusses on identifying an optimal solution with minimal TDMA frames and increased transmissions. These two parameters are the converging factor for the evolutionary algorithms employed. The proposed approach uses an Adaptive Discrete Firefly Algorithm (ADFA) for solving the Broadcast Scheduling Problem (BSP). The results are compared with traditional evolutionary approaches such as Genetic Algorithm and Cuckoo search algorithm. A mathematical analysis to find the probability of achieving a time slot is done using Markov Chain analysis.


Sign in / Sign up

Export Citation Format

Share Document