Similarity score of two images using different measures.

In the field of computer vision and image processing, image similarity has been a central concern for decades. If you compare two pictures, Image Similarity returns a value that tells you how physically they are close. A quantitative measure of the degree of correspondence between the images concerned is given by this test. The score of the similarity between images varies from 0 to 1. In this paper, ORB (Oriented Fast Rotated Brief) algorithm is used to measure the similarity and other types of similarity measures like Structural Similarity Index (SSIM), pixel similarity, Earth mover's Distance are used to obtain the score. When two images are compared, it shows how much identical (common) objects are there in the two images. So, the accuracy or similarity score is about 87 percent when the two images are compared

Optimizing Fast Fourier Transform (FFT) Image Compression using Intelligent Water Drop (IWD) Algorithm

Digital image compression is the technique in digital image processing where special attention is provided in decreasing the number of bits required to represent a digital image. A wide range of techniques have been developed over the years, and novel approaches continue to emerge. This paper proposes a new technique for optimizing image compression using Fast Fourier Transform (FFT) and Intelligent Water Drop (IWD) algorithm. IWD-based FFT Compression is a emerging ethodology, and we expect compression findings to be much better than the methods currently being applied in the domain. This work aims to enhance the degree of compression of the image while maintaining the features that contribute most. It optimizes the FFT threshold values using swarm-based optimization technique (IWD) and compares the results in terms of Structural Similarity Index Measure (SSIM). The criterion of structural similarity of image quality is based on the premise that the human visual system is highly adapted to obtain structural information from the scene, so a measure of structural similarity provides a reasonable estimate of the perceived image quality

Water-pumping permanent magnet synchronous motor optimization based on customized torque-speed operating area and performance characteristics

© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting /republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other worksThis paper presents a novel methodology for optimizing Permanent Magnet Synchronous Motors for Water-Pumping applications. The algorithm is designed to start the optimization process from a predefined torque-speed area, its desired envelope, and the performance characteristics of the motor to be obtained after the optimization process, providing the information in an efficiency map, according to a predefined control strategy (MTPA, MTPV, etc.). This work also implements an image comparison technique based on the structural similarity index to evaluate the objective function.Peer ReviewedPostprint (author's final draft

Pattern matching and pattern discovery algorithms for protein topologies

We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgraph isomorphism and finding maximal common subgraphs in a restricted class of ordered graphs. We have developed a subgraph isomorphism algorithm for ordered graphs, which performs well on the given set of data. The maximal common subgraph problem then is solved by repeated subgraph extension and checking for isomorphisms. Despite the apparent inefficiency such approach gives an algorithm with time complexity proportional to the number of graphs in the input set and is still practical on the given set of data. As a result we obtain fast methods which can be used for building a database of protein topological motifs, and for the comparison of a given protein of known secondary structure against a motif database