Millie Pant | Indian Institute Of Technology, Roorkee (original) (raw)
Papers by Millie Pant
World Journal of Modelling and …, Jan 1, 2010
Information Sciences, 2011
Differential evolution (DE) is a reliable and versatile function optimiser especially suited for ... more Differential evolution (DE) is a reliable and versatile function optimiser especially suited for continuous optimisation problems. Practical experience, however, shows that DE easily looses diversity and is susceptible to premature and/or slow convergence. This paper proposes a modified variant of DE algorithm called improved differential evolution (IDE). It works in three phases: decentralisation, evolution and centralisation of the population. Initially, the individuals of the population are partitioned into several groups of ...
… , 2009. CEC'09. IEEE Congress on, Jan 1, 2009
Mathematical Problems in Engineering, 2013
Communications in Computer and Information Science, 2010
ABSTRACT In this paper we propose a novel variant of the Differential Evolution (DE) algorithm ba... more ABSTRACT In this paper we propose a novel variant of the Differential Evolution (DE) algorithm based on local search. The corresponding algorithm is named as Differential Evolution with Interpolated Local Search (DEILS). In DEILS, the local search operation is applied in an adaptive manner. The adaptive behavior enables the algorithm to search its neighborhood in an effective manner and the interpolation helps in exploiting the solutions. In this way a balance is maintained between the exploration and exploitation factors. The performance of DEILS is investigated and compared with basic differential evolution, modified versions of DE and some other evolutionary algorithms. It is found that the proposed scheme improves the performance of DE in terms of quality of solution without compromising with the convergence rate.
2009 World Congress on Nature & Biologically Inspired Computing (NaBIC), 2009
... However DE faces criticism regarding its convergence rate which sometimes slows as it approac... more ... However DE faces criticism regarding its convergence rate which sometimes slows as it approaches ... in the sense that it uses same evolutionary operators like mutation, crossover and selection ... Nevertheless, it's the application of these operators that makes DE different from GA. ...
Contemporary Computing, Jan 1, 2009
Abstract. Differential Evolution (DE) is a powerful yet simple evolutionary algorithm for optimiz... more Abstract. Differential Evolution (DE) is a powerful yet simple evolutionary algorithm for optimization of real valued, multi modal functions. DE is generally considered as a reliable, accurate and robust optimization technique. However, the algorithm suffers from premature ...
Applied Soft Computing, 2014
Information Sciences, 2015
ABSTRACT Digital image watermarking is the process of authenticating a digital image by embedding... more ABSTRACT Digital image watermarking is the process of authenticating a digital image by embedding a watermark into it and thereby protecting the image from copyright infringement. This paper proposes a novel robust image watermarking scheme developed in the wavelet domain based on the singular value decomposition (SVD) and artificial bee colony (ABC) algorithm. The host image is transformed into an invariant wavelet domain by applying redistributed invariant wavelet transform, subsequently the low frequency sub-band of wavelet transformed image is segmented into non-overlapping blocks. The most suitable embedding blocks are selected using the human visual system for the watermark embedding. The watermark bits are embedded into the target blocks by modifying the first column coefficients of the left singular vector matrix of SVD decomposition with the help of a threshold and the visible distortion caused by the embedding is compensated by modifying the coefficients of the right singular vector matrix employing compensation parameters. Furthermore, ABC is employed to obtain the optimized threshold and compensation parameters. Experimental results, compared with the related existing schemes, demonstrated that the proposed scheme not only possesses the strong robustness against image manipulation attacks, but also, is comparable to other schemes in term of visual quality.
International journal of innovative computing, information & control: IJICIC
Musrrat Ali1, Millie Pant1, Ajith Abraham2 and Vaclav Snasel3 1Department of Paper Technology, In... more Musrrat Ali1, Millie Pant1, Ajith Abraham2 and Vaclav Snasel3 1Department of Paper Technology, Indian Institute of Technology Roorkee, Roorkee 247667, India. {musrrat.iitr, millidma}@gmail.com ... 2 Machine Intelligence Research Labs (MIR Labs), Scientific ...
ACM Transactions on Autonomous and Adaptive Systems, 2012
ABSTRACT Differential Evolution (DE) is a well-known Evolutionary Algorithm (EA) for solving glob... more ABSTRACT Differential Evolution (DE) is a well-known Evolutionary Algorithm (EA) for solving global optimization problems. Practical experiences, however, show that DE is vulnerable to problems like slow and/or premature convergence. In this article we propose a simple and modified DE framework, called MDE, which is a fusion of three recent modifications in DE: (1) Opposition-Based Learning (OBL); (2) tournament method for mutation; and (3) single population structure. These features have a specific role which helps in improving the performance of DE. While OBL helps in giving a good initial start to DE, the use of the tournament best base vector in the mutation phase helps in preserving the diversity. Finally the single population structure helps in faster convergence. Their synergized effect balances the exploitation and exploration capabilities of DE without compromising with the solution quality or the convergence rate. The proposed MDE is validated on a set of 25 standard benchmark problems, 7 nontraditional shifted benchmark functions proposed at the special session of CEC2008, and three engineering design problems. Numerical results and statistical analysis show that the proposed MDE is better than or at least comparable to the basic DE and several other state-of-the art DE variants.
Optik - International Journal for Light and Electron Optics, 2014
ABSTRACT
The International Journal of Advanced Manufacturing Technology, 2013
Abstract In this research, a new optimization algorithm, called the cuckoo search algorithm (CS) ... more Abstract In this research, a new optimization algorithm, called the cuckoo search algorithm (CS) algorithm, is introduced for solving manufacturing optimization problems. This research is the first application of the CS to the optimization of machining parameters in the literature. In order to demonstrate the effectiveness of the CS, a milling optimization problem was solved and the results were compared with those obtained using other well-known optimization techniques like, ant colony algorithm, immune algorithm, hybrid immune ...
International Journal of Computing Science and Mathematics, 2010
... In a short span of around 15 years, it has emerged as a powerful optimisation tool and has be... more ... In a short span of around 15 years, it has emerged as a powerful optimisation tool and has been successfully applied to a wide range of problems (Wang and Cheng, 1999; Babu and Munawar, 2000; Babu and Singh, 2000; Angira and Babu, 2005, 2006; Babu and Angira, 2001 ...
European Journal of Operational Research, 2011
Transactions of the Institute of Measurement and Control, 2011
Abstract Population-based heuristic optimization methods like differential evolution (DE) depend ... more Abstract Population-based heuristic optimization methods like differential evolution (DE) depend largely on the generation of the initial population. The initial population not only affects the search for several iterations but often also has an influence on the final solution. The ...
International Journal of Bio-Inspired …, Jan 1, 2011
Second UKSIM European Symposium on …, Jan 1, 2008
Differential Evolution (DE) has emerged as a powerful tool for solving optimization problems in t... more Differential Evolution (DE) has emerged as a powerful tool for solving optimization problems in the last few years. However, the convergence rate of DE still does not meet all the requirements, and attempts to speed up differential evolution are considered necessary. ...
2013 IEEE Symposium on Differential Evolution (SDE), 2013
ABSTRACT
2009 World Congress on Nature & Biologically Inspired Computing (NaBIC), 2009
World Journal of Modelling and …, Jan 1, 2010
Information Sciences, 2011
Differential evolution (DE) is a reliable and versatile function optimiser especially suited for ... more Differential evolution (DE) is a reliable and versatile function optimiser especially suited for continuous optimisation problems. Practical experience, however, shows that DE easily looses diversity and is susceptible to premature and/or slow convergence. This paper proposes a modified variant of DE algorithm called improved differential evolution (IDE). It works in three phases: decentralisation, evolution and centralisation of the population. Initially, the individuals of the population are partitioned into several groups of ...
… , 2009. CEC'09. IEEE Congress on, Jan 1, 2009
Mathematical Problems in Engineering, 2013
Communications in Computer and Information Science, 2010
ABSTRACT In this paper we propose a novel variant of the Differential Evolution (DE) algorithm ba... more ABSTRACT In this paper we propose a novel variant of the Differential Evolution (DE) algorithm based on local search. The corresponding algorithm is named as Differential Evolution with Interpolated Local Search (DEILS). In DEILS, the local search operation is applied in an adaptive manner. The adaptive behavior enables the algorithm to search its neighborhood in an effective manner and the interpolation helps in exploiting the solutions. In this way a balance is maintained between the exploration and exploitation factors. The performance of DEILS is investigated and compared with basic differential evolution, modified versions of DE and some other evolutionary algorithms. It is found that the proposed scheme improves the performance of DE in terms of quality of solution without compromising with the convergence rate.
2009 World Congress on Nature & Biologically Inspired Computing (NaBIC), 2009
... However DE faces criticism regarding its convergence rate which sometimes slows as it approac... more ... However DE faces criticism regarding its convergence rate which sometimes slows as it approaches ... in the sense that it uses same evolutionary operators like mutation, crossover and selection ... Nevertheless, it's the application of these operators that makes DE different from GA. ...
Contemporary Computing, Jan 1, 2009
Abstract. Differential Evolution (DE) is a powerful yet simple evolutionary algorithm for optimiz... more Abstract. Differential Evolution (DE) is a powerful yet simple evolutionary algorithm for optimization of real valued, multi modal functions. DE is generally considered as a reliable, accurate and robust optimization technique. However, the algorithm suffers from premature ...
Applied Soft Computing, 2014
Information Sciences, 2015
ABSTRACT Digital image watermarking is the process of authenticating a digital image by embedding... more ABSTRACT Digital image watermarking is the process of authenticating a digital image by embedding a watermark into it and thereby protecting the image from copyright infringement. This paper proposes a novel robust image watermarking scheme developed in the wavelet domain based on the singular value decomposition (SVD) and artificial bee colony (ABC) algorithm. The host image is transformed into an invariant wavelet domain by applying redistributed invariant wavelet transform, subsequently the low frequency sub-band of wavelet transformed image is segmented into non-overlapping blocks. The most suitable embedding blocks are selected using the human visual system for the watermark embedding. The watermark bits are embedded into the target blocks by modifying the first column coefficients of the left singular vector matrix of SVD decomposition with the help of a threshold and the visible distortion caused by the embedding is compensated by modifying the coefficients of the right singular vector matrix employing compensation parameters. Furthermore, ABC is employed to obtain the optimized threshold and compensation parameters. Experimental results, compared with the related existing schemes, demonstrated that the proposed scheme not only possesses the strong robustness against image manipulation attacks, but also, is comparable to other schemes in term of visual quality.
International journal of innovative computing, information & control: IJICIC
Musrrat Ali1, Millie Pant1, Ajith Abraham2 and Vaclav Snasel3 1Department of Paper Technology, In... more Musrrat Ali1, Millie Pant1, Ajith Abraham2 and Vaclav Snasel3 1Department of Paper Technology, Indian Institute of Technology Roorkee, Roorkee 247667, India. {musrrat.iitr, millidma}@gmail.com ... 2 Machine Intelligence Research Labs (MIR Labs), Scientific ...
ACM Transactions on Autonomous and Adaptive Systems, 2012
ABSTRACT Differential Evolution (DE) is a well-known Evolutionary Algorithm (EA) for solving glob... more ABSTRACT Differential Evolution (DE) is a well-known Evolutionary Algorithm (EA) for solving global optimization problems. Practical experiences, however, show that DE is vulnerable to problems like slow and/or premature convergence. In this article we propose a simple and modified DE framework, called MDE, which is a fusion of three recent modifications in DE: (1) Opposition-Based Learning (OBL); (2) tournament method for mutation; and (3) single population structure. These features have a specific role which helps in improving the performance of DE. While OBL helps in giving a good initial start to DE, the use of the tournament best base vector in the mutation phase helps in preserving the diversity. Finally the single population structure helps in faster convergence. Their synergized effect balances the exploitation and exploration capabilities of DE without compromising with the solution quality or the convergence rate. The proposed MDE is validated on a set of 25 standard benchmark problems, 7 nontraditional shifted benchmark functions proposed at the special session of CEC2008, and three engineering design problems. Numerical results and statistical analysis show that the proposed MDE is better than or at least comparable to the basic DE and several other state-of-the art DE variants.
Optik - International Journal for Light and Electron Optics, 2014
ABSTRACT
The International Journal of Advanced Manufacturing Technology, 2013
Abstract In this research, a new optimization algorithm, called the cuckoo search algorithm (CS) ... more Abstract In this research, a new optimization algorithm, called the cuckoo search algorithm (CS) algorithm, is introduced for solving manufacturing optimization problems. This research is the first application of the CS to the optimization of machining parameters in the literature. In order to demonstrate the effectiveness of the CS, a milling optimization problem was solved and the results were compared with those obtained using other well-known optimization techniques like, ant colony algorithm, immune algorithm, hybrid immune ...
International Journal of Computing Science and Mathematics, 2010
... In a short span of around 15 years, it has emerged as a powerful optimisation tool and has be... more ... In a short span of around 15 years, it has emerged as a powerful optimisation tool and has been successfully applied to a wide range of problems (Wang and Cheng, 1999; Babu and Munawar, 2000; Babu and Singh, 2000; Angira and Babu, 2005, 2006; Babu and Angira, 2001 ...
European Journal of Operational Research, 2011
Transactions of the Institute of Measurement and Control, 2011
Abstract Population-based heuristic optimization methods like differential evolution (DE) depend ... more Abstract Population-based heuristic optimization methods like differential evolution (DE) depend largely on the generation of the initial population. The initial population not only affects the search for several iterations but often also has an influence on the final solution. The ...
International Journal of Bio-Inspired …, Jan 1, 2011
Second UKSIM European Symposium on …, Jan 1, 2008
Differential Evolution (DE) has emerged as a powerful tool for solving optimization problems in t... more Differential Evolution (DE) has emerged as a powerful tool for solving optimization problems in the last few years. However, the convergence rate of DE still does not meet all the requirements, and attempts to speed up differential evolution are considered necessary. ...
2013 IEEE Symposium on Differential Evolution (SDE), 2013
ABSTRACT
2009 World Congress on Nature & Biologically Inspired Computing (NaBIC), 2009