Comparison of Swarm Optimization and Memetic Algorithm for Systolic Mapping of Texture Analysis-Reference-Cited by-同舟云学术

Comparison of Swarm Optimization and Memetic Algorithm for Systolic Mapping of Texture Analysis

Published:2020-12-30 Issue: Volume: Page:393-400
ISSN:
Container-title:Innovations in Information and Communication Technology Series
language:en
Short-container-title:IICT

Author:

C Bagavathi¹,R Dhivya devi²,K Siddharthraju²,P Dinesh³

Affiliation:

1. Sri Krishna College of Engineering and Technology, India

2. KPR Institute of Engineering and Technology, India

3. SAI Incubation Centre, India

Abstract

Systolic processors offer a hardware design which can accommodate more functions in a small footprint. Hardware utilization efficiency can be enhanced by appropriately designating the intended hardware with a task in space and time through parallel computing platforms. Regular algorithms known for their computational complexity can be mapped to systolic array by dependence graphs, which allot hardware to the design data. Manual mapping techniques tend to be tedious with more inaccuracy and calls for efficient mapping techniques, automated through algorithmic procedures. Texture Analysis marks the preliminary progression of image analysis and interpretation. Automotive systems, Robotics, Industrial processing and similar automated applications can be simplified through texture analysis. This work deals with employing evolutionary algorithms for mapping texture analysis onto systolic architecture. Memetic Algorithms (MA) and Particle Swarm Optimization (PSO) algorithms were comparatively studied and the efficiency of designing a parallel architecture through systolic array is analyzed through cost function and processing time.

Publisher

IJAICT India Publications

Link

http://www.ijaict.com/Book%20Series/iictseries/books/book2020/abstract/pdf/10.46532@978-81-950008-1-4_086.pdf

Reference67 articles.

1. P. H. Langade, and S.B. Patil, “A Survey on Systolic Array Multiplier and its Implementation on FPGA,” vol. 4, no. 5, pp. 1299 - 1302, 2015.

2. J.H. Weston, C.N. Zhang and Hua Li, “Some Space Considerations of VLSI Systolic Array Mappings,” IEEE, pp. 375-381, 2000.

3. L. D Whitley, A. E. Howe, S. Rana, J.P. Watson, L. Barbulescu, “Comparing Heuristic Search Methods and Genetic Algorithms for Warehouse Scheduling,” In SMC'98 Conference Proceedings, IEEE International Confer- ence on Systems, Man, and Cybernetics, vol. 3, pp. 2430 – 243, 1998.

4. Poonam Garg, “A comparison between Memetic algorithm and Genetic Algorithm for the cryptanalysis of simplified Data Encryption Standard Algorithm,” International Journal of Network Security and Its Applications, vol. 1, no. 1, pp. 34 – 42, 2009.

5. E. Garca-Gonzalo, J. L. Fernndez-Martnez, “A Brief Historical Review of Particle Swarm Optimization (PSO),” Journal of Bioinformatics and Intelligent Control, Vol. 1, pp.3-16, 2012.