Nithin V. George
Other affiliations: Indian Institute of Technology Bhubaneswar, National Institute of Technology, Rourkela
Bio: Nithin V. George is an academic researcher from Indian Institute of Technology Gandhinagar. The author has contributed to research in topics: Active noise control & Adaptive filter. The author has an hindex of 18, co-authored 85 publications receiving 1151 citations. Previous affiliations of Nithin V. George include Indian Institute of Technology Bhubaneswar & National Institute of Technology, Rourkela.
TL;DR: The focus of this study is on the use of signal processing and some recent soft computing tools on the development of active noise control systems.
Abstract: This paper discusses the evolution of active noise control systems over the past 75 years. The focus of this study is on the use of signal processing and some recent soft computing tools on the development of active noise control systems. Special attention has been paid to the advances in nonlinear active noise control achieved during the past decade.
TL;DR: An attempt has been made to model a nonlinear system using a Hammerstein model, which has been trained using a cuckoo search algorithm, which is a recently proposed stochastic algorithm.
Abstract: A novel nonlinear system identification scheme is proposed.A Hammerstein model has been trained using cuckoo search algorithm.The model is a cascade of a FLANN and an adaptive IIR filter.Simulation study shows enhanced modeling capacity of the proposed scheme.The new schemes offers lesser computational time over other methods studied. An attempt has been made in this paper to model a nonlinear system using a Hammerstein model. The Hammerstein model considered in this paper is a functional link artificial neural network (FLANN) in cascade with an adaptive infinite impulse response (IIR) filter. In order to avoid local optima issues caused by conventional gradient descent training strategies, the model has been trained using a cuckoo search algorithm (CSA), which is a recently proposed stochastic algorithm. Modeling accuracy of the proposed scheme has been compared with that obtained using other popular evolutionary computing algorithms for the Hammerstein model. Enhanced modeling capability of the CSA based scheme is evident from the simulation results.
TL;DR: In this article, a robust FsLMS algorithm is proposed for a functional link artificial neural network (FLANN) based active noise control (ANC) system which is least sensitive to such disturbances and does not call for any prior information on the noise characteristics.
Abstract: The performance of a nonlinear active noise control (ANC) system based on the recently developed filtered-s least mean square (FsLMS) algorithm deteriorates when strong disturbances in the ANC system are acquired by the microphones. To surmount this shortcoming, a novel robust FsLMS (RFsLMS) algorithm is proposed for a functional link artificial neural network (FLANN) based ANC system. The new ANC system is least sensitive to such disturbances and does not call for any prior information on the noise characteristics. The results obtained from simulation study establish the effectiveness of this new ANC scheme.
TL;DR: This paper proposes a functional-link-artificial-neural-network-based (FLANN) multichannel nonlinear active noise control (ANC) system trained using a particle swarm optimization (PSO) algorithm suitable for nonlinear noise processes.
Abstract: This paper proposes a functional-link-artificial-neural-network-based (FLANN) multichannel nonlinear active noise control (ANC) system trained using a particle swarm optimization (PSO) algorithm suitable for nonlinear noise processes. The use of PSO algorithm in a multichannel ANC environment not only reduces the local minima problem but also removes the requirement of computationally expensive modeling of the secondary-path transfer functions. A decentralized version of a multichannel nonlinear ANC is also developed, which facilitates scaling up of an existing ANC setup without rederiving the learning rules. This is possible as the controller module of each channel is independent of others. Simulation study of the two new multichannel ANC systems demonstrates comparable mitigation performance. However, the decentralized one is preferred to as it possesses the added advantage of scalability.
TL;DR: An exhaustive review on the use of structured stochastic search approaches towards system identification and digital filter design is presented, which focuses on the identification of various systems using infinite impulse response adaptive filters and Hammerstein models.
Abstract: An exhaustive review on the use of structured stochastic search approaches towards system identification and digital filter design is presented in this paper. In particular, the paper focuses on the identification of various systems using infinite impulse response adaptive filters and Hammerstein models as well as on the estimation of chaotic systems. In addition to presenting a comprehensive review on the various swarm and evolutionary computing schemes employed for system identification as well as digital filter design, the paper is also envisioned to act as a quick reference for a few popular evolutionary computing algorithms.
••01 Dec 2016
TL;DR: The comprehensive review of Krill Herd Algorithm as applied to different domain is presented, which covers the applications, modifications, and hybridizations of the KH algorithms.
Abstract: Graphical abstractDisplay Omitted HighlightsThe comprehensive review of Krill Herd Algorithm as applied to different domain is presented.The review covers the applications, modifications and hybridizations of the KH algorithms.It provides future research directions across different areas. Krill Herd (KH) algorithm is a class of nature-inspired algorithm, which simulates the herding behavior of krill individuals. It has been successfully utilized to tackle many optimization problems in different domains and found to be very efficient. As a result, the studies has expanded significantly in the last 3 years. This paper presents the extensive (not exhaustive) review of KH algorithm in the area of applications, modifications, and hybridizations across these fields. The description of how KH algorithm was used in the approaches for solving these kinds of problems and further research directions are also discussed.
TL;DR: This review identifies the popularly used algorithms within the domain of bio-inspired algorithms and discusses their principles, developments and scope of application, which would pave the path for future studies to choose algorithms based on fitment.
Abstract: Review of applications of algorithms in bio-inspired computing.Brief description of algorithms without mathematical notations.Brief description of scope of applications of the algorithms.Identification of algorithms whose applications may be explored.Identification of algorithms on which theory development may be explored. With the explosion of data generation, getting optimal solutions to data driven problems is increasingly becoming a challenge, if not impossible. It is increasingly being recognised that applications of intelligent bio-inspired algorithms are necessary for addressing highly complex problems to provide working solutions in time, especially with dynamic problem definitions, fluctuations in constraints, incomplete or imperfect information and limited computation capacity. More and more such intelligent algorithms are thus being explored for solving different complex problems. While some studies are exploring the application of these algorithms in a novel context, other studies are incrementally improving the algorithm itself. However, the fast growth in the domain makes researchers unaware of the progresses across different approaches and hence awareness across algorithms is increasingly reducing, due to which the literature on bio-inspired computing is skewed towards few algorithms only (like neural networks, genetic algorithms, particle swarm and ant colony optimization). To address this concern, we identify the popularly used algorithms within the domain of bio-inspired algorithms and discuss their principles, developments and scope of application. Specifically, we have discussed the neural networks, genetic algorithm, particle swarm, ant colony optimization, artificial bee colony, bacterial foraging, cuckoo search, firefly, leaping frog, bat algorithm, flower pollination and artificial plant optimization algorithm. Further objectives which could be addressed by these twelve algorithms have also be identified and discussed. This review would pave the path for future studies to choose algorithms based on fitment. We have also identified other bio-inspired algorithms, where there are a lot of scope in theory development and applications, due to the absence of significant literature.
01 Jan 2017
TL;DR: An updated review on key developments of computational modeling of peptide–protein interactions (PepPIs) with an aim to assist experimental biologists exploit suitable docking methods to advance peptide interfering strategies against PPIs.
Abstract: Protein–protein interactions (PPIs) execute many fundamental cellular functions and have served as prime drug targets over the last two decades. Interfering intracellular PPIs with small molecules has been extremely difficult for larger or flat binding sites, as antibodies cannot cross the cell membrane to reach such target sites. In recent years, peptides smaller size and balance of conformational rigidity and flexibility have made them promising candidates for targeting challenging binding interfaces with satisfactory binding affinity and specificity. Deciphering and characterizing peptide–protein recognition mechanisms is thus central for the invention of peptide-based strategies to interfere with endogenous protein interactions, or improvement of the binding affinity and specificity of existing approaches. Importantly, a variety of computation-aided rational designs for peptide therapeutics have been developed, which aim to deliver comprehensive docking for peptide–protein interaction interfaces. Over 60 peptides have been approved and administrated globally in clinics. Despite this, advances in various docking models are only on the merge of making their contribution to peptide drug development. In this review, we provide (i) a holistic overview of peptide drug development and the fundamental technologies utilized to date, and (ii) an updated review on key developments of computational modeling of peptide–protein interactions (PepPIs) with an aim to assist experimental biologists exploit suitable docking methods to advance peptide interfering strategies against PPIs.
TL;DR: An overview of WOA is described in this paper, rooted from the bubble-net hunting strategy, besides an overview ofWOA applications that are used to solve optimization problems in various categories.
Abstract: Whale Optimization Algorithm (WOA) is an optimization algorithm developed by Mirjalili and Lewis in 2016. An overview of WOA is described in this paper, rooted from the bubble-net hunting strategy, besides an overview of WOA applications that are used to solve optimization problems in various categories. The best solution has been determined to make something as functional and effective as possible through the optimization process by minimizing or maximizing the parameters involved in the problems. Research and engineering attention have been paid to Meta-heuristics for purposes of decision-making given the growing complexity of models and the needs for quick decision making in the engineering. An updated review of research of WOA is provided in this paper for hybridization, improved, and variants. The categories included in the reviews are Engineering, Clustering, Classification, Robot Path, Image Processing, Networks, Task Scheduling, and other engineering applications. According to the reviewed literature, WOA is mostly used in the engineering area to solve optimization problems. Providing an overview and summarizing the review of WOA applications are the aims of this paper.