Aboul Ella Hassanien (Abo)

Major complication of heart valve diseases is congestive heart valve failure. The heart is of essential significance to human beings. Auscultation with a stethoscope is considered as one of the techniques used in the analysis of heart diseases. Heart auscultation is a difficult task to determine the heart condition and requires some superior training of medical doctors. Therefore, the use of computerized techniques in the diagnosis of heart sounds may help the doctors in a clinical environment. Hence, in this study computer-aided heart sound diagnosis is performed to give support to doctors in decision making. In this study, a novel hybrid Rough-Bijective soft set is developed for the classification of heart valve diseases. A rough set (Quick Reduct) based feature selection technique is applied before classification for increasing the classification accuracy. The experimental results demonstrate that the overall classification accuracy offered by the employed Improved Bijective soft set approach (IBISOCLASS) provides higher accuracy compared with other classification techniques including hybrid Rough-Bijective soft set (RBISOCLASS), Bijective soft set (BISOCLASS), Decision table (DT), Naïve Bayes (NB) and J48.

Geotagged photos carry hidden data about the surrounding area, and the owner of the photo. Moreover; Geotagged photos have background information about the user, where the alternative resources of Geo-spatial data lack background information. In this study, we propose identification for the circles of relations of the smartphone user from Geotagged photos. The proposed solution mainly depends on a framework, which is based on smartphone photo gallery. The framework extracts a degree of relation between smartphone user and circles of relations entities. Circles of relations incorporate closest people, places, where the participant visits, and interests. The circles of relations are represented in a social graph, which shows the clusters of social relations and interests of smartphone user. The social graph clarifies the nature and the degree of the relations for the participants. The results of framework introduced the relation between the level of variety of participant social relations, and the degree of relations.

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.

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

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

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.