Publications

Export 82 results:
Sort by: Author [ Title  (Desc)] Type Year
A B C D E F G H [I] J K L M N O P Q R S T U V W X Y Z   [Show ALL]
I
Ghonaim, W., N. I. Ghali, A. E. Hassanien, and S. Banerjee, "An improvement of chaos-based hash function in cryptanalysis approach: An experience with chaotic neural networks and semi-collision attack", Memetic Computing, vol. 5, no. 3: Springer Berlin Heidelberg, pp. 179–185, 2013. Abstract
n/a
Ghonaim, W., N. I. Ghali, A. E. Hassanien, and S. Banerjee, "An improvement of chaos-based hash function in cryptanalysis approach: An experience with chaotic neural networks and semi-collision attack", Memetic Computing, vol. 5, no. 3: Springer Berlin Heidelberg, pp. 179–185, 2013. Abstract
n/a
abd elaziz, M., and A. E. Hassanien, "An improved social spider optimization algorithm based on rough sets for solving minimum number attribute reduction problem,", Neural Computing and Applications, 2017 , 2017. AbstractWebsite

The minimum number attribute reduction problem is an important issue when dealing with huge amounts of data. The problem of minimum attribute reduction is formally known to be as an NP complete nonlinearly constrained optimization problem. Social spider optimization algorithm is a new meta-heuristic algorithm of the swarm intelligence field to global solution. The social spider optimization algorithm is emulates the behavior of cooperation between spiders based on the biological laws of the cooperative colony. Inspired by the social spiders, in this paper, an improved social spider algorithm for the minimal reduction problem was proposed. In the proposed algorithm, the fitness function depends on the rough sets dependency degree and it takes into a consideration the number of selected features. For each spider, the fitness function is computed and compared with the global best fitness value. If the current value is better, then the global best fitness is replaced with it and its position became the reduct set. Then, the position of each spider is updated according to its type. This process is repeated until the stopping criterion is satisfied. To validate the proposed algorithm, several real clinical medical datasets which are available from the UCI Machine Learning Repository were used to compute the performance of the proposed algorithm. The experimental results illustrate that the proposed algorithm is superior to state-of-the-art swarm-based in terms of classification accuracy while limiting number of features.

Eid, H. F., A. T. Azar, and A. E. Hassanien, "Improved real-time discretize network intrusion detection system", Proceedings of seventh international conference on bio-inspired computing: theories and applications (BIC-TA 2012): Springer India, pp. 99–109, 2013. Abstract
n/a
Eid, H. F., A. T. Azar, and A. E. Hassanien, "Improved real-time discretize network intrusion detection system", Proceedings of seventh international conference on bio-inspired computing: theories and applications (BIC-TA 2012): Springer India, pp. 99–109, 2013. Abstract
n/a
Fattah, M. A., M. I. Waly, M. A. A. ELsoud, A. E. Hassanien, M. F. Tolba, J. Platos, and G. Schaefer, "An improved prediction approach for progression of ocular hypertension to primary open angle glaucoma", Proceedings of the Fifth International Conference on Innovations in Bio-Inspired Computing and Applications IBICA 2014: Springer International Publishing, pp. 405–412, 2014. Abstract
n/a
Hassanien, A. E., T. Gaber, U. Mokhtar, and H. Hefny, "An Improved Moth Flame Optimization Algorithm based on Rough Sets for Tomato Diseases Detection", Journal of Computers and Electronics in Agriculture, vol. 136, issue 15, pp. 86-96 , 2017. AbstractWebsite

Plant diseases is one of the major bottlenecks in agricultural production that have bad effects on the economic of any country. Automatic detection of such disease could minimize these effects. Features selection is a usual pre-processing step used for automatic disease detection systems. It is an important process for detecting and eliminating noisy, irrelevant, and redundant data. Thus, it could lead to improve the detection performance. In this paper, an improved moth-flame approach to automatically detect tomato diseases was proposed. The moth-flame fitness function depends on the rough sets dependency degree and it takes into a consideration the number of selected features. The proposed algorithm used both of the power of exploration of the moth flame and the high performance of rough sets for the feature selection task to find the set of features maximizing the classification accuracy which was evaluated using the support vector machine (SVM). The performance of the MFORSFS algorithm was evaluated using many benchmark datasets taken from UCI machine learning data repository and then compared with feature selection approaches based on Particle Swarm Optimization (PSO) and Genetic Algorithms (GA) with rough sets. The proposed algorithm was then used in a real-life problem, detecting tomato diseases (Powdery mildew and early blight) where a real dataset of tomato disease were manually built and a tomato disease detection approach was proposed and evaluated using this dataset. The experimental results showed that the proposed algorithm was efficient in terms of Recall, Precision, Accuracy and F-Score, as long as feature size reduction and execution time.

Hassanien, A. E., T. Gaber, U. Mokhtar, and H. Hefny, "An improved moth flame optimization algorithm based on rough sets for tomato diseases detection", Computers and Electronics in Agriculture, vol. 136: Elsevier, pp. 86–96, 2017. Abstract
n/a
Asad, A. H., A. T. Azar, M. M. M. Fouad, and A. E. Hassanien, "An improved ant colony system for retinal blood vessel segmentation", Computer Science and Information Systems (FedCSIS), 2013 Federated Conference on: IEEE, pp. 199–205, 2013. Abstract
n/a
Hamdy, A., H. Hefny, M. A. Salama, A. E. Hassanien, and T. - H. Kim, "The importance of handling multivariate attributes in the identification of heart valve diseases using heart signals", Computer Science and Information Systems (FedCSIS), 2012 Federated Conference on: IEEE, pp. 75–79, 2012. Abstract
n/a
Hamdy, A., H. Hefny, M. A. Salama, A. E. Hassanien, and T. - H. Kim, "The importance of handling multivariate attributes in the identification of heart valve diseases using heart signals", Computer Science and Information Systems (FedCSIS), 2012 Federated Conference on: IEEE, pp. 75–79, 2012. Abstract
n/a
Hamdy, A., H. Hefny, M. A. Salama, A. E. Hassanien, and T. - H. Kim, "The importance of handling multivariate attributes in the identification of heart valve diseases using heart signals", Computer Science and Information Systems (FedCSIS), 2012 Federated Conference on: IEEE, pp. 75–79, 2012. Abstract
n/a
Awad, A. I., and A. E. Hassanien, "Impact of some biometric modalities on forensic science", Computational Intelligence in Digital Forensics: Forensic Investigation and Applications: Springer International Publishing, pp. 47–62, 2014. Abstract
n/a
Houssein, E. H., M. A. S. Ali, and A. E. Hassanien, "An image steganography algorithm using Haar Discrete Wavelet Transform with Advanced Encryption System", Computer Science and Information Systems (FedCSIS), 2016 Federated Conference on: IEEE, pp. 641–644, 2016. Abstract
n/a
Hassanien, A. E., and M. Nakajima, "Image morphing with snake model and thin-plate spline interpolation", Voice, Video, and Data Communications: International Society for Optics and Photonics, pp. 407–416, 1997. Abstract
n/a
Hassanien, A. E., and M. Nakajima:, "Image Morphing of Facial Images Transformation based on Navier Elastic Body Splines", IEEE Computer Animation (CA'98) , Philadelphia, Pennsylvania, USA,, 8-10 June,, 1998. Abstract

We propose an image morphing algorithm which uses Navier elastic body splines to generate warp functions for interpolating scattered data points. The spline is based on a partial differential equation proposed by Navier that describes the equilibrium displacement of an elastic body subjected to forces. The spline maps can be expressed as the linear combination of an affine transformation and a Navier interpolation spline. The proposed algorithm generates a smooth warp that reflects feature point correspondences. It is efficient in time complexity and smoothly interpolated morphed images with only a remarkably small number of specified feature points. The algorithm allows each feature point in the source image to be mapped to the corresponding feature point in the destination image. Once the images are warped to align the positions of features and their shapes, the in-between facial animation from two given facial images can be defined by cross dissolving the positions of correspondence features and their shapes and colors. We describe an efficient cross dissolve algorithm for generating the in-between images

Hassanien, A., and M. Nakajima, "Image morphing of facial images transformation based on navier elastic body splines", Computer Animation 98. Proceedings: IEEE, pp. 119–125, 1998. Abstract
n/a
Hassanien, A. E., and M. Nakajima, "Image Morphing by using Thin Plate Spline Transformation and Snake Model", 電子情報通信学会技術研究報告. EID, 電子ディスプレイ, vol. 97, no. 527: 一般社団法人電子情報通信学会, pp. 43–48, 1998. Abstract
n/a
Aboul-Ella, H., and M. Nakajima, "Image metamorphosis transformation of facial images based on elastic body splines ", Signal Processing , issue Volume 70, Issue 2,, pp. 129–137 , 1998. Abstracts01651684.gifWebsite

In this paper, we propose a new image metamorphosis algorithm which uses elastic body splines to generate warp functions for interpolating scattered data points. The spline is based on a partial differential equation proposed by Navier that describes the equilibrium displacement of an elastic body subjected to forces. The spline maps can be expressed as the linear combination of an affine transformation and a Navier spline. The proposed algorithm generates a smooth warp that reflects feature point correspondences. It is efficient in time complexity and smoothly interpolated morphed images with only a remarkably small number of specified feature points. The algorithm allows each feature point in the source image to be mapped to the corresponding feature point in the destination image. Once the images are warped to align the positions of features and their shapes, the in-between facial animation from two given facial images can be defined by cross dissolving the positions of correspondence features and their shapes and colors. We describe an efficient cross-dissolve algorithm for generating the in-between images

Hassanien, A. E., and H. T. A. K. A. H. A. S. H. I. M. NAKAJIMA, "Image Metamorphosis based on Elastic Body Spline and Snake Model", 映像情報メディア学会技術報告, vol. 21, no. 42: 一般社団法人映像情報メディア学会, pp. 25–30, 1997. Abstract
n/a
Tobin, K. W., E. Chaum, J. Gregor, T. P. Karnowski, J. R. Price, and J. Wall, "Image Informatics for Clinical and Preclinical Biomedical Analysis", Computational Intelligence in Medical Imaging: Techniques and Applications: CRC Press, pp. 239, 2009. Abstract
n/a
Reham Gharbia, A. T. Azar, A. E. Baz, and A. E. Hassanien, "Image fusion techniques in remote sensing", arXiv preprint arXiv:1403.5473, 2014. Abstract
n/a
Liu, H., Y. Ji, and A. E. Hassanien, "Image Color Transfer Approach by Analogy with Taylor Expansion. vol. 2 issue 2, 2013", International Journal of System Dynamics Applications,, vol. 2, issue 2, pp. 43-54, 2013. AbstractWebsite

The Taylor expansion has shown in many fields to be an extremely powerful tool. In this paper, we investigated image features and their relationships by analogy with Taylor expansion. The kind of expansion could be helpful for us to analyze image feature and engraftment, such as transferring color between images. By analogy with Taylor expansion, we designed the image color transfer algorithm by the first and second-order information. The luminance histogram represents the first-order information of image, and the co-occurrence matrix represents the second-order information of image. Some results illustrate our algorithm is effective. In our study, each polynomial in our analogy Taylor expansion of images is considered as one of image features, which makes us re-understand images and its features. It provided us a cue that the features of image, such as color, texture, dimension, time series, would be not isolated but mutual relational based on image expansion.

Liu, H., Y. Ji, and A. E. Hassanien, "Image Color Transfer Approach by Analogy with Taylor Expansion", International Journal of System Dynamics Applications (IJSDA), vol. 2, no. 2: IGI Global, pp. 43–54, 2013. Abstract
n/a
Hassanien, A. E., and J. M. H. Ali, "Image classification and retrieval algorithm based on rough set theory", South African Computer Journal, vol. 2003, no. 30: South African Computer Society (SAICSIT), pp. 9–16, 2003. Abstract
n/a
Tourism