Home Oppositional Gravitational Search Algorithm and Artificial Neural Network-based Classification of Kidney Images
Article Open Access

Oppositional Gravitational Search Algorithm and Artificial Neural Network-based Classification of Kidney Images

  • S.M.K. Chaitanya EMAIL logo and P. Rajesh Kumar
Published/Copyright: April 13, 2018
Become an author with De Gruyter Brill

Abstract

Ultrasound (US) imaging has been broadly utilized as part of kidney diagnosis because of its ability to show structural abnormalities like cysts, stones, and infections as well as information about kidney function. The main aim of this research is to effectively classify normal and abnormal kidney images through US based on the selection of relevant features. In this study, abnormal kidney images were classified through gray-scale conversion, region-of-interest generation, multi-scale wavelet-based Gabor feature extraction, probabilistic principal component analysis-based feature selection and adaptive artificial neural network technique. The anticipated method is executed in the working platform of MATLAB, and the results were analyzed and contrasted. Results show that the proposed approach had 94% accuracy and 100% specificity. In addition, its false-acceptance rate is 0%, whereas that of existing methods is not <27%. This shows the precise prediction level of the proposed approach, compared with that of existing methods.

1 Introduction

In medical imaging, any error can cause a threat to proper diagnosis; hence, accurate identification of medical image is a difficult task. To ensure the statistical significance of studies, sufficient amount of data from clinical trials and medical examinations has to be collected. Collection of clinical analyses and laboratory results from electronic databases is useful for research, medical investigations, epidemiological studies, quality control and so on [4, 12]. Many different imaging technologies and implications are covered by medical imaging, such as X-ray-based methods like radiography and computed tomography (CT), magnetic resonance imaging (MRI), ultrasound (US), nuclear medicine with positron emission tomography (PET), single photon emission computed tomography (SPECT) and other methods in optical imaging. To solve complex geometric problems arising in medical image processing, the classification method of segmentation, shape extraction, three-dimensional (3D) modeling and registration of medical data efficient algorithms are required.

The reconstruction of 3D shapes (of organs, bones, tumors, etc.) from two-dimensional (2D) slice is derived from MR or CT scans, which is a key problem in medical computation. A proper surface connects a set of contour data points [12, 16, 17], which are determined by the typical geometric problem. Medical image segmentation is the basis of medical image analysis and understanding. It plays an important role in pathology analysis and treatment and clinical diagnosis. In the imaging process, the formation of medical image is susceptible to some factors such as noise and effect of bias field. These factors lead to intense homogeneity in the image. For image segmentation, numerous software tools are available, both commercial and open source. In image segmentation, the disadvantage of open-source software is that they do not support parallel-image processing. Large-scale processing leads to long computational times and high computational power requirements.

The method consists of automatic multi-resolution image parameterization, which is based on texture description with specialized association rules coupled with image evaluation and machine learning methods. Since this approach yields a large number of relatively low-level features (although much more informative than simple pixel intensity values), we have used additional dimensionality reduction techniques either by discarding some features (feature selection) or by combining them into more informative, high-level features (feature construction) [7, 13, 14, 19].

2 Literature Survey

Huang et al. [9] have explained the segmentation of US kidney images. Using trained prior shapes, they employ a parametric super-ellipse as a global prior shape for a human kidney. The Fisher–Tippett distribution was employed to describe the gray-level statistics. By combining the gray-level statistics with a global character of a kidney shape, they used an active contour model to segment the US kidney images. It involves two sub-problems: one was the optimization of the parameters of a super-ellipse and the other was the segmentation of a US kidney image. An alternating minimization scheme was used to simultaneously optimize the parameters of a super-ellipse and segment an image.

Gunasundari et al. [5] have explained the computer-aided diagnostic system, which plays an important role in the detection of cancer. Feature selection was an important preprocessing step in the classification phase of the diagnostic system. The feature selection was an NP-hard challenging problem that provides many applications in the area relevant to expert and intelligent system. Two modified Boolean particle swarm optimization algorithms, namely velocity bounded and improved velocity bounded, were used to solve the feature selection problem.

Odeh et al. [11] have proposed the use of early imaging markers to predict future renal deterioration in infants with posterior urethral valves. Using National Institutes of Health-sponsored image-processing software, they analyzed a series of initial postnatal US images of the serial posterior urethral valve of the cases seen at a single tertiary referral center. Echogenicity and corticomedullary differentiation were objectively measured as the ratios relative to the adjacent liver or spleen and also between the cortex and the medulla. At last follow-up, the primary study outcome and renal function were dichotomized based on glomerular filtration rate and/or need for renal replacement therapy. Estimates of renal parenchyma quantity and quality measured on initial postnatal US carry prognostic value by determining future risk of stage 5 chronic kidney disease in patients with posterior urethral valves.

Subramanya et al. [15] have explained a computer-aided classification system for three kidney classes, viz. normal, medical renal disease (MRD) and cyst using B-mode US images. Thirty-five B-mode kidney US images consisting of 11 normal, eight MRD and 16 cyst images have been used. Regions of interest (ROIs) have been marked by the radiologist from the parenchyma region of the kidney in case of normal and MRD cases and from regions inside the lesions for cyst cases. To evaluate the contribution of texture features extracted from de-speckled images for the classification task, original images have been preprocessed by eight de-speckling methods. Six categories of texture features were extracted. A one-against-one multi-class support vector machine classifier has been used, which was based on overall classification accuracy (OCA), and features from the ROIs of original images were concatenated with the features from the ROIs of preprocessed images. Based on OCA, few feature sets were considered for feature selection.

Di Noia et al. [3] have studied IgA nephropathy, a disease of the kidneys that affect millions of people worldwide and leads to end-stage kidney disease (ESKD), which requires renal replacement therapy through dialysis or kidney transplantation. Tools are needed to help clinicians predict ESKD risk in IgAN patients, and this was highly recognized in the medical field as a software tool that exploits the power of artificial neural networks (ANNs) to classify patients’ health status potentially leading to ESKD. In a period of 38 years at the University of Bari, the classifier leverages an ensemble of networks trained using collected data. The developed tool has been made available both as an online Web application and as an Android mobile app.

Gupta and Karmeshu [6] raised a major issue in the characterization of clinical US B-mode images and it has been used to identify a few probability distributions that could broadly classify images of human organs. By resorting to the statistical characterization of gray levels in 100 clinical B-mode US kidney images, the concern is addressed. A detailed investigation of central and peripheral kidney regions was carried out. The Pearson family of distributions was employed as a means to model the images and to provide analytical expression of the suitable pdf in terms of parameter κ. In most cases, type I Pearson distribution (corresponding to negative κ) yields the best fit.

3 Problem Definition

In recent years, great progress has been made in automated systems for detecting kidney diseases through ultrasonic systems, which allow the extraction of greater amount and quality of information during imaging of patients. The use of feature extraction, image analysis and pattern recognition techniques for classification are most suited for the evaluation of global conditions. However, no technique has been proven to be best or has improved the accuracy of the system. Hence, improving the classification accuracy by improving the existing classification system as well as the preprocessing models is necessary. The lack of solution and the above-mentioned problems motivated this research.

4 Proposed Normal/Abnormal Kidney US Image Classification Technique

4.1 Contribution of the Proposed Research

US is the most favored therapeutic methodology in analyzing delicate tissue, for example, brain and kidneys. In contrast with other imaging methods such as PET and MRI, US is non-invasive and does not expose the patient to radiation, has low cost, requires minimal scan time and its operation is adaptable. Hence, great improvement is needed on delivering better and innovative US in terms of portability, cost, and size. When using US for diagnosis, procedure, problem-specific visual cues or features must be considered, in keeping in mind the goal of sorting a tissue image as one of the feasible classifications. These features originate from the discernible attributes of cells or nuclei, for instance, size, shape or texture. However, no strategy turned out to be ideal or has enhanced the exactness of the framework.

Hence, in this article, a computer-aided system is introduced for the classification of normal and an abnormal US kidney image, which is based on novel feature extraction and classification methods, to improve the accuracy of classification results. The proposed novel feature extraction method includes a set of multi-scale wavelet-based features and the suggested classification method like ANN approach, where the weight parameters are chosen optimally through opposition-based GSO algorithm (OGSA). First, the multi-scale wavelet-based features were extracted from the ROI of each image, and the probabilistic principal component analysis (PPCA) is performed to reduce the number of features. The selected features were utilized in the design and training of the proposed adaptive neural network (adaptive ANN) classifier. The ANN will classify the images as normal or abnormal through the extracted features. Here, the ANN is hybridized with oppositional-based gravitational search algorithm (OGSA) for better classification. The block diagram of the proposed adaptive ANN abnormality classification method is given in Figure 1.

Figure 1: Proposed Kidney Image Classification Model.
Figure 1:

Proposed Kidney Image Classification Model.

4.2 Sketch of the Proposed Procedure

The steps involved in the proposed method are

  1. Preprocessing

  2. Gabor wavelet-based feature extraction

  3. Feature selection by PPCA

  4. Normal/abnormal classification by adaptive ANN

Each stage of the proposed normal/abnormal classification method is detailed in the upcoming section.

4.2.1 Preprocessing

Preprocessing is the fundamental step of image processing techniques. Preprocessing procedures are usually done to remove the unwanted noise components of the image. Here, color-to-gray conversion is performed to reduce the processing complexity. Finally, ROI generation is performed to reduce the interference of irrelevant regions.

4.2.2 Gabor Wavelet-based Feature Extraction

To define a class, the uniqueness of kidney image is represented by selecting the features. In this approach, five-level wavelet decomposition is made. At each level, the mean, covariance and seven moment invariant features are extracted. Further, for the decomposed horizontal and vertical details, the Gabor features are extracted four different wavelength and six different orientations.

5-Level wavelet decomposition: The 2D discrete wavelet transform (2D-DWT) is used to represent an image for multi-resolution analysis. The 2D-DWT performs a sub-band coding of an image in terms of spectral spatial/frequency components using an iterative and recursive process. The image is first represented by LH (horizontal), HL (vertical) and HH (diagonal) sub-bands that encode the image details in three directions and an LL sub-band that provides an approximation of it. The LL sub-band is considered for further decomposition levels.

Assume p(m, n) as a given image of size (M×N). At each scale s with (s>0), the wavelet transform decomposes into four wavelet bands. From the frequency details, the horizontal and vertical wavelet bands (DsHp,DsHp) at scale s are extracted. For the horizontal and vertical coefficients, the mean, variance and seven moment invariant features were extracted for five different scales.

Thus, as a result 90 [i.e. 5*2(H, V)*(mean+variance+(ψ1+ψ2ψ7))] features were extracted. The extracted features were

  1. Mean: This is the average value:

    (1) mean=(1ZW)z=1Zw=1WF(z,w),

    where F(z, w) represents the horizontal/vertical wavelet sequence.

  2. Variance: This is defined as the sum of the square distance of each term in the mean distribution divided by the number of terms in the distribution:

    (2) variance=1(Z1)(W1)z=1Zw=1W(F(z,w)mean)2.
  3. Moment invariant features: These were introduced by Hu [8], based on the normalized central moments. The 2D (s, t)th-order moment is defined as

    (3) Mst=zswtF(z,w)dzdw,

    where s, t=0, 1, 2, … .

    Moreover, the 2D (s, t)th-order central moment from which the invariant features are attained is defined as

    (4) CMst=ϑst=(zz¯)s(ww¯)tF(z,w)dzdw,

    where (z̅, w̅) is the image centroid pixel point.

    The image centroids are computed as

    (5) z¯=M10M00;w¯=M01M00.

    It is seen that Equations (3) and (4) are equivalent to each other when the center of moment, Mst, is equal to the image centroids.

    The scale invariance is attained by normalization, and the normalized central moments can be defined as

    (6) NormalizedCMst=λst=ϑstϑstε;ε=(s+t+2)2,

    where s+t=2, 3, 4, ….

    The moment invariant features are

    (7) ψ1=λ20+λ02
    (8) ψ2=(λ20+λ02)2+4λ112
    (9) ψ3=(λ303λ12)2+(3λ21λ03)2
    (10) ψ4=(λ30+λ12)2+(λ21+λ03)2
    (11) ψ5=(λ303λ12)(λ30+λ12)(λ30+λ12)23(λ21+λ03)2+(3λ21λ03)(λ21+λ03)[(3λ30+λ12)2(λ21+λ03)2]
    (12) ψ6=(λ20λ02)(λ30+λ12)2(λ21+λ03)2+4λ11(λ30+λ12)(λ21+λ03)
    (13) ψ7=(3λ21λ03)(λ30+λ12)(λ30+λ12)23(λ21+λ03)2(λ303λ12)(λ21+λ03)[3(λ30+λ12)2(λ21+λ03)2]

    The seven moment invariant features are extracted for the horizontal and vertical coefficients obtained from the wavelet decomposition.

  4. Gabor feature: Gabor filters are applied to an image to extract features from many scales or frequencies which are aligned at different angles. Here, the Gabor features are computed for the wavelet decomposed image. A Gabor filter can be represented by

    (14) g(z,w,γ,ω)=12Πσzσwe12(z12σz2+w12σw2),

    where σz and σw are the standard deviations in z, w directions; γ=1/central frequency represents the wavelength and ω represents the orientation angle. The frequency and orientation gives major detail about the shape and patterns of the kidney image. Here, the features were extracted for four different wavelengths (i.e. γ={2, 4, 6, 8}) and six different orientations (i.e. ω={0, 30, 60, 90, 120, 150}). Moreover, parameters z1 and w1 can be summarized as

    (15) z1=zcosω+wsinω
    (16) w1=zcosω+wsinω

    From the Gabor filter, g(z, w, γ, ω), the Gabor features can be extracted as

    (17) F(g)=F(z,w)g(z,w,γ,ω).

    Here, the Gabor features are computed for the wavelet decomposed image with four different central frequencies and six orientations and yields 24 features at each level of decomposition. As five-level wavelet decomposition is performed, 2160 features [i.e. (5*2*(7+2))*4*6=90*24=2160] were attained for each image.

Thus, the normal/abnormal classification of kidney images based on the extracted 2160 features is a tedious process. Hence, PPCA-based feature selection is introduced.

4.2.3 Feature Selection by PPCA

For better classification the selection of correct number of feature subset is a challenging task. An incorrect choice may lead to over-extraction or under-extraction.

PCA has some limitations. The main limitations are:

  • A lack of a probabilistic or generative model.

  • The technique is globally linear.

  • The covariance matrix is difficult to be evaluated in an accurate manner.

To overcome these two limitations Tipping and Bishop [18] propose a mixture model for probabilistic PCA. PPCA, which allows us to reconstruct the optimal shape, is an efficient tool to reduce the dimension of a data set consisting of a large number of interrelated variables while retaining most of the variations. PPCA extracts projection vectors which contribute to highest covariance and these projection vectors are used to reduce feature dimension. It is achieved by transforming the data set to a new set of ordered variables according to their variances or their importance. Also, PPCA provides a way to compute the low-dimensional representation with a well-formed probability distribution of higher-dimensional data.

In this research, the probabilistic PCA selects K-eigenvectors corresponding to K-highest eigen values from the feature input, i.e. one-dimensional principal components, that maximize the likelihood of the data. Thus, as a result, only 10 features were selected from the 2160 features.

4.2.4 Normal/Abnormal Classification by Adaptive ANN

AANs are inspired by the structure and human brain functionality, which can be imagined as a network consisting of densely interconnected processing elements called neurons. The neural network encompasses a sequence of nodes (neurons) that contain numerous associations among further nodes. The aim is to produce a useful model applicable for problem solving and knowledge engineering. The structure of ANN is given in Figure 2.

Figure 2: Artificial Neural Network Structure.
Figure 2:

Artificial Neural Network Structure.

The ANN architecture consists of three layers: an input layer, an output layer and one or more hidden layers between these two layers. There are two very significant segments in the neural network system: training phase and testing phase. In the training phase of ANN, the network is trained with the known classes based on the search of minimum error (difference between ANN output and target) as a function of the ANN weights and biases. The interconnection weights are randomly assigned and updated until the error gets minimized.

The projected procedure employs the adaptive ANN for the categorization of normal/abnormal kidney images. At this time, the conventional neural networks are customized by means of OGSA, which is engaged in the optimization of the weight in the neural network. The anticipated adaptive ANN utilizes one input layer with 10 neurons, one hidden layer with 20 neurons and finally, one output layer with only one neuron representing the output classes (normal and abnormal). Moreover, the values assumed for the ANN parameters are learning rate (0.001), momentum value (1.0000e−03), number of training iterations (1000) and root mean square error <0.01. The foremost intention of the adaptive ANN is to classify the input US kidney images to normal/abnormal separation. To training the ANN structure, feed-forward back-propagation algorithm is utilized in our recommended procedure.

4.2.4.1 Adaptive Neural Networks Function Steps

The functioning steps involved in the proposed adaptive ANN are the following:

  • Initialize weights randomly for every neurons except the neurons in the input layer.

  • Optimize weights by OGSA.

  • Develop the neural network with the selected image features, Pn (i.e. reduced feature) as the input units, Qm as the hidden units and N/Ab as the output unit.

4.2.4.2 Opposition-based Gravitational Search Algorithm

The gravitational search algorithm (GSA) is stimulated by the laws of gravity and motion. The algorithm is gathered under a population-based method consisting of different masses. The masses share information to direct the search toward the best location in the search space based on the gravitational force. In the GSA, each mass (agent) encompasses four specifications: position, inertial mass, active gravitational mass and passive gravitational mass. The position of the mass signifies a solution of the issue, and its gravitational and inertial masses are decided by a fitness function. Therefore, each mass offers a solution, and the technique is directed by properly adapting the gravitational and inertia masses. The masses get attracted by the heaviest mass which intensely brings an optimum solution in the search space.

The steps involved in the OGSA algorithm are the following:

Step 1: In terms of weights of ANN, population is initialized (i.e. W=(w1, w2, … wx )) within an interval [u, v]
Step 2: Generate the opposite population of the weights initialized in Step 1. The oppositional solution is given as W*=u+vW
Step 3: For populations generated in Steps 1 and 2, compute the fitness function (min MSE). The population that gives lesser fitness function value is chosen as the new initial population
Step 4: The values of inertial masses and best and worst fitness function values are determined
Step 5: The positions and velocities of the weights are updated
Step 6: Repeat Steps 3–5 until the stopping criterion, i.e. maximum number of iterations, is reached

5 Results and Discussion

The proposed algorithm is executed using MATLAB software, and the experiment was carried out using a system with 4 GB of RAM and 2.10 GHz Intel i-3 processor.

For analysis, the US medical records of the patients with kidney problems as well as the US images of healthy persons were collected from various medical laboratories, particularly from the under pathology laboratories of Apollo Diagnostics and DDRC SRL Diagnostics Pvt Ltd in Tamil Nadu. The subject of data collections are men and women, with age ranging from 23 to 35 years. All subjects were encouraged to drink a lot of water 30 min before data collection to produce a clearer US image. Here, 26 abnormal and six normal US images were taken for the proposed classification method. The acquired data were preprocessed, analyzed and classified for detection of kidney disease in patients.

The experimental results for the diagnosis of kidney abnormality using the proposed OGSA-ANN approach and other similar machine-learning algorithms such as GSA-NN, ANN, GA-ANN, KNN and naive Bayes algorithms are analyzed in this section. The prediction efficiency is measured based on various factors.

5.1 Database Images

A few of the database images (normal and abnormal US kidney images) are shown in Figure 3.

Figure 3: Some of the database images.
Normal (A) and Abnormal (B) US Kidney Images.
Figure 3:

Some of the database images.

Normal (A) and Abnormal (B) US Kidney Images.

5.2 Evaluation Metrics

The assessment metrics are sensitivity, specificity, false positive rate (FPR), false negative rate (FNR) and accuracy. The standard count values such as true positive (TP), true negative (TN), false positive (FP) and false negative (FN) are exploited here.

Sensitivity: This is the ratio of a number of TPs to the sum of TP and FP.

(18) Sensitivity=No.ofTPNo.ofTP+ No.ofFN×100.

Specificity: This is defined as the ratio of a number of TNs to the sum of TNs and FPs.

(19) Specificity=No.ofTNNo.ofTN+No.ofFP×100.

Accuracy: This can be calculated using the measures of sensitivity and specificity. It is denoted as

(20) Accuracy=TP+TNTP+TN+FP+FN×100.

False-positive rate: The FPR, also known as the false-acceptance rate (FAR), refers to the proportion that all negative outcomes that yield positive test outcomes.

(21) FPR=FPFP +TN×100.

False-negative rate: The FNR, also known as the false-rejection rate (FRR), is the proportion of positive outcomes that yield negative test outcomes.

(22) FNR=FNTP +FN×100.

5.3 Performance Analysis

The performance assessment of the proposed adaptive ANN normal/abnormal kidney image classification method is shown in this section with various existing methods. The analysis is made on the basis of allowing 50% of samples for the training procedure and the remaining 50% samples for the testing process. The TP, TN, FP and FN values attained for the proposed and existing methods are given in Table 1.

Table 1:

Confusion Matrix Values of Proposed and Existing Methods.

OGSA-ANN GSA-NN ANN GA-ANN KNN Naive Bayes
TP 2 1 0 1 0 0
TN 13 9 9 8 13 13
FP 0 4 4 5 0 0
FN 1 2 3 2 3 3

Table 1 shows the FP and FN are low for the proposed OGSA-ANN approach compared with other approaches. However, there is no FP for naive Bayes, but the approach lacks in the prediction of normal images. The sensitivity, specificity and accuracy values computed from the above confusion matrix values are given in Table 2.

Table 2 shows that the specificity value is 100% for techniques like OGSA-ANN, KNN and naive Bayes algorithms, thus showing the better classification effectiveness of the proposed method. However, the GSA-based ANN, GA-based ANN and ANN techniques are offer <75%.

Table 2:

Sensitivity, Specificity and Accuracy Values of Proposed and Existing Methods.

OGSA-ANN GSA-NN ANN GA-ANN KNN Naive Bayes
Sensitivity 0.666667 0.333333 0 0.333333 0 0
Specificity 1 0.692308 0.692308 0.615385 1 1
Accuracy 0.9375 0.625 0.5625 0.5625 0.8125 0.8125

In the case of sensitivity, the proposed OGSA-ANN is 67%, which is better than the remaining techniques, whereas the ANN, KNN and naive Bayes algorithms offer null sensitivity, and 33% sensitivity is attained for the GSA- and GA-based ANN method.

In Table 3, the result obtained for the proposed OGSA-ANN is in bold. While analyzing classification accuracy values, the proposed OGSA-based ANN provides 93%, whereas GSA-ANN gives 67%, GA-ANN and ANN give 53% and KNN and naive Bayes give 80%. Thus, the performance outcomes of the proposed strategy is markedly better in terms of accuracy, sensitivity and specificity measures and outperforms all the existing methods.

Table 3:

FAR, FRR and Accuracy Values of Proposed and Existing State-of-the-Art Methods.

Metrics KNN [1] (%) ARCK [2] (%) MBPN [2] (%) PNN [10] (%) Proposed OGSA-ANN (%)
FAR 28.78 27.18 32.23 34.19 0
FRR 16.28 24.46 13.33 22.88 33.33
Accuracy 75.48 77.48 51 64.16 93.75

5.4 Performance Analysis with State-of-the-Art Methods

The FAR, FRR and accuracy values are compared and given in Table 3.

From the outcomes, the proposed approach clearly outperforms all other existing methods from Akkasaligar and Biradar [1], Dhanalakshmi and Rajamani [2] and Mangayarkarasi and Jamal [10]. The association rules with high confidence for kidney images (ARCK) method also gives 77% accuracy, whereas the proposed method gives 93%. Moreover, the FAR and FRR are also better for the proposed method compared with the existing methods.

6 Conclusion

An efficient abnormality classification method based on adaptive ANN is introduced to classify US kidney images. The classification efficiency is measured in terms of accuracy, sensitivity and specificity measures for the proposed as well as the existing methods like GSA-NN, ANN, GA-ANN, KNN, naive Bayes algorithms and other state-of-the-art methods. From the performance outcomes, the proposed adaptive ANN (i.e. OGSA-based ANN) achieves 94% classification accuracy, whereas the existing methods offer only less than the proposed one. Also, FAR is 0%, whereas the existing methods obtained FAR values not <27%. Thus, from the results obtained, it is clear that the proposed adaptive ANN works better in the classification of US kidney images than all the existing methods. In the future, multi-label classifications will be considered rather than normal/abnormal characterization to examine the discriminative power of our approach for each sort of pathology.

Bibliography

[1] P. T. Akkasaligar and S. Biradar, Classification of medical ultrasound images of kidney, in: IJCA Proceedings on International Conference on Information and Communication Technologies (ICICT), Thrikkakara, Kerala, Vol. 3, 2014.Search in Google Scholar

[2] K. Dhanalakshmi and V. Rajamani, An efficient association rule-based method for diagnosing ultrasound kidney images, in: Computational Intelligence and Computing Research (ICCIC), 2010 IEEE International Conference on IEEE, Tamilnadu College of Engineering, Coimbatore, 2010.10.1109/ICCIC.2010.5705860Search in Google Scholar

[3] T. Di Noia, V. Claudio Ostuni, F. Pesce, G. Binetti, D. Naso, F. Schena and E. Di Sciascio, An end stage kidney disease predictor based on an artificial neural networks ensemble, Exp. Syst. Appl. 40 (2013), 4438–4445.10.1016/j.eswa.2013.01.046Search in Google Scholar

[4] A. Eklund, P. Dufort, D. Forsberg and S. M. La Conte, Medical image processing on the GPU – past, present and future, Med. Image Anal. 17 (2013), 1073–1094.10.1016/j.media.2013.05.008Search in Google Scholar PubMed

[5] S. Gunasundari, S. Janakiraman and S. Meenambal, Velocity bounded Boolean particle swarm optimization for improved feature selection in liver and kidney disease diagnosis, Exp. Syst. Appl. 56 (2016), 28–47.10.1016/j.eswa.2016.02.042Search in Google Scholar

[6] A. Gupta and Karmeshu, Efficacy of Pearson distributions for characterization of gray levels in clinical ultrasound kidney images, Signal Image Video Process. 9 (2013), 1317–1334.10.1007/s11760-013-0578-3Search in Google Scholar

[7] C. S. Gur and M. Top, Regional clustering of medical imaging technologies, Comput. Hum. Behav. 61 (2016), 333–343.10.1016/j.chb.2016.03.056Search in Google Scholar

[8] M.-K. Hu, Visual pattern recognition by moment invariants. IRE T. Inform. Theor. 8.2 (1962), 179–187.10.1109/TIT.1962.1057692Search in Google Scholar

[9] J. Huang, X. Yang, Y. Chen and L. Tang, Ultrasound kidney segmentation with a global prior shape, J. Vis. Commun. Image Represent. 24 (2013), 937–943.10.1016/j.jvcir.2013.05.013Search in Google Scholar

[10] T. Mangayarkarasi and D. N. Jamal, PNN-based analysis system to classify renal pathologies in kidney ultrasound images, in: Computing and Communications Technologies (ICCCT), 2017 2nd International Conference on IEEE, Chennai, 2017.10.1109/ICCCT2.2017.7972258Search in Google Scholar

[11] R. Odeh, D. Noone, P. Bowlin, L. H. P. Braga and A. J. Lorenzo, Predicting risk of chronic kidney disease in infants and young children at diagnosis of posterior urethral valves: initial ultrasound kidney characteristics and validation of parenchymal area as forecasters of renal reserve, J. Urol. 196 (2016), 862–868.10.1016/j.juro.2016.03.137Search in Google Scholar PubMed

[12] O. Reiche, K. Häublein, M. Reichenbach, M. Schmid, F. Hannig, J. Teich and D. Fey, Synthesis and optimization of image processing accelerators using domain knowledge, J. Syst. Architect. 61 (2015), 646–658.10.1016/j.sysarc.2015.09.004Search in Google Scholar

[13] F. Rengier, M. F. Häfnerb, R. Unterhinninghofenc, R. Nawrotzkid, J. Kirsch, H.-U. Kauczor and F. L. Giesel, Integration of interactive three-dimensional image post-processing software into undergraduate radiology education effectively improves diagnostic skills and visual-spatial ability, Eur. J. Radiol. 82 (2013), 1366–1371.10.1016/j.ejrad.2013.01.010Search in Google Scholar PubMed

[14] L. Sajn and M. Kukar, Image processing and machine learning for fully automated probabilistic evaluation of medical images, Comput. Methods Prog. Biomed. 104 (2011), e75–e86.10.1016/j.cmpb.2010.06.021Search in Google Scholar PubMed

[15] M. B. Subramanya, V. Kumar, S. Mukherjee and M. Saini, SVM-based CAC system for B-mode kidney ultrasound images, J. Dig. Imaging 28 (2014), 448–458.10.1007/s10278-014-9754-4Search in Google Scholar PubMed PubMed Central

[16] A. Świetlicka, Trained stochastic model of biological neural network used in image processing task, Appl. Math. Comput. 267 (2015), 716–726.10.1016/j.amc.2014.12.082Search in Google Scholar

[17] J. Tian, J. Xue, Y. Dai, J. Chen and J. Zheng, A novel software platform for medical image processing and analyzing, IEEE Trans. Inf. Technol. Biomed. 12 (2008), 800–812.10.1109/TITB.2008.926395Search in Google Scholar PubMed

[18] M. E. Tipping and C. M. Bishop, Probabilistic principal component analysis, J. R. Stat. Soc. B Stat. Method. 61 (1999), 611–622.10.1111/1467-9868.00196Search in Google Scholar

[19] F. Zhao, J. Zhao, W. Zhao, F. Qu and L. Sui, Local region statistics combining multi-parameter intensity fitting module for medical image segmentation with intensity in homogeneity and complex composition, Optics Laser Technol. 82 (2016), 17–27.10.1016/j.optlastec.2016.02.002Search in Google Scholar

Received: 2017-07-14
Published Online: 2018-04-13

©2020 Walter de Gruyter GmbH, Berlin/Boston

This work is licensed under the Creative Commons Attribution 4.0 Public License.

Articles in the same Issue

  1. An Optimized K-Harmonic Means Algorithm Combined with Modified Particle Swarm Optimization and Cuckoo Search Algorithm
  2. Texture Feature Extraction Using Intuitionistic Fuzzy Local Binary Pattern
  3. Leaf Disease Segmentation From Agricultural Images via Hybridization of Active Contour Model and OFA
  4. Deadline Constrained Task Scheduling Method Using a Combination of Center-Based Genetic Algorithm and Group Search Optimization
  5. Efficient Classification of DDoS Attacks Using an Ensemble Feature Selection Algorithm
  6. Distributed Multi-agent Bidding-Based Approach for the Collaborative Mapping of Unknown Indoor Environments by a Homogeneous Mobile Robot Team
  7. An Efficient Technique for Three-Dimensional Image Visualization Through Two-Dimensional Images for Medical Data
  8. Combined Multi-Agent Method to Control Inter-Department Common Events Collision for University Courses Timetabling
  9. An Improved Particle Swarm Optimization Algorithm for Global Multidimensional Optimization
  10. A Kernel Probabilistic Model for Semi-supervised Co-clustering Ensemble
  11. Pythagorean Hesitant Fuzzy Information Aggregation and Their Application to Multi-Attribute Group Decision-Making Problems
  12. Using an Efficient Optimal Classifier for Soil Classification in Spatial Data Mining Over Big Data
  13. A Bayesian Multiresolution Approach for Noise Removal in Medical Magnetic Resonance Images
  14. Gbest-Guided Artificial Bee Colony Optimization Algorithm-Based Optimal Incorporation of Shunt Capacitors in Distribution Networks under Load Growth
  15. Graded Soft Expert Set as a Generalization of Hesitant Fuzzy Set
  16. Universal Liver Extraction Algorithm: An Improved Chan–Vese Model
  17. Software Effort Estimation Using Modified Fuzzy C Means Clustering and Hybrid ABC-MCS Optimization in Neural Network
  18. Handwritten Indic Script Recognition Based on the Dempster–Shafer Theory of Evidence
  19. An Integrated Intuitionistic Fuzzy AHP and TOPSIS Approach to Evaluation of Outsource Manufacturers
  20. Automatically Assess Day Similarity Using Visual Lifelogs
  21. A Novel Bio-Inspired Algorithm Based on Social Spiders for Improving Performance and Efficiency of Data Clustering
  22. Discriminative Training Using Noise Robust Integrated Features and Refined HMM Modeling
  23. Self-Adaptive Mussels Wandering Optimization Algorithm with Application for Artificial Neural Network Training
  24. A Framework for Image Alignment of TerraSAR-X Images Using Fractional Derivatives and View Synthesis Approach
  25. Intelligent Systems for Structural Damage Assessment
  26. Some Interval-Valued Pythagorean Fuzzy Einstein Weighted Averaging Aggregation Operators and Their Application to Group Decision Making
  27. Fuzzy Adaptive Genetic Algorithm for Improving the Solution of Industrial Optimization Problems
  28. Approach to Multiple Attribute Group Decision Making Based on Hesitant Fuzzy Linguistic Aggregation Operators
  29. Cubic Ordered Weighted Distance Operator and Application in Group Decision-Making
  30. Fault Signal Recognition in Power Distribution System using Deep Belief Network
  31. Selector: PSO as Model Selector for Dual-Stage Diabetes Network
  32. Oppositional Gravitational Search Algorithm and Artificial Neural Network-based Classification of Kidney Images
  33. Improving Image Search through MKFCM Clustering Strategy-Based Re-ranking Measure
  34. Sparse Decomposition Technique for Segmentation and Compression of Compound Images
  35. Automatic Genetic Fuzzy c-Means
  36. Harmony Search Algorithm for Patient Admission Scheduling Problem
  37. Speech Signal Compression Algorithm Based on the JPEG Technique
  38. i-Vector-Based Speaker Verification on Limited Data Using Fusion Techniques
  39. Prediction of User Future Request Utilizing the Combination of Both ANN and FCM in Web Page Recommendation
  40. Presentation of ACT/R-RBF Hybrid Architecture to Develop Decision Making in Continuous and Non-continuous Data
  41. An Overview of Segmentation Algorithms for the Analysis of Anomalies on Medical Images
  42. Blind Restoration Algorithm Using Residual Measures for Motion-Blurred Noisy Images
  43. Extreme Learning Machine for Credit Risk Analysis
  44. A Genetic Algorithm Approach for Group Recommender System Based on Partial Rankings
  45. Improvements in Spoken Query System to Access the Agricultural Commodity Prices and Weather Information in Kannada Language/Dialects
  46. A One-Pass Approach for Slope and Slant Estimation of Tri-Script Handwritten Words
  47. Secure Communication through MultiAgent System-Based Diabetes Diagnosing and Classification
  48. Development of a Two-Stage Segmentation-Based Word Searching Method for Handwritten Document Images
  49. Pythagorean Fuzzy Einstein Hybrid Averaging Aggregation Operator and its Application to Multiple-Attribute Group Decision Making
  50. Ensembles of Text and Time-Series Models for Automatic Generation of Financial Trading Signals from Social Media Content
  51. A Flame Detection Method Based on Novel Gradient Features
  52. Modeling and Optimization of a Liquid Flow Process using an Artificial Neural Network-Based Flower Pollination Algorithm
  53. Spectral Graph-based Features for Recognition of Handwritten Characters: A Case Study on Handwritten Devanagari Numerals
  54. A Grey Wolf Optimizer for Text Document Clustering
  55. Classification of Masses in Digital Mammograms Using the Genetic Ensemble Method
  56. A Hybrid Grey Wolf Optimiser Algorithm for Solving Time Series Classification Problems
  57. Gray Method for Multiple Attribute Decision Making with Incomplete Weight Information under the Pythagorean Fuzzy Setting
  58. Multi-Agent System Based on the Extreme Learning Machine and Fuzzy Control for Intelligent Energy Management in Microgrid
  59. Deep CNN Combined With Relevance Feedback for Trademark Image Retrieval
  60. Cognitively Motivated Query Abstraction Model Based on Associative Root-Pattern Networks
  61. Improved Adaptive Neuro-Fuzzy Inference System Using Gray Wolf Optimization: A Case Study in Predicting Biochar Yield
  62. Predict Forex Trend via Convolutional Neural Networks
  63. Optimizing Integrated Features for Hindi Automatic Speech Recognition System
  64. A Novel Weakest t-norm based Fuzzy Fault Tree Analysis Through Qualitative Data Processing and Its Application in System Reliability Evaluation
  65. FCNB: Fuzzy Correlative Naive Bayes Classifier with MapReduce Framework for Big Data Classification
  66. A Modified Jaya Algorithm for Mixed-Variable Optimization Problems
  67. An Improved Robust Fuzzy Algorithm for Unsupervised Learning
  68. Hybridizing the Cuckoo Search Algorithm with Different Mutation Operators for Numerical Optimization Problems
  69. An Efficient Lossless ROI Image Compression Using Wavelet-Based Modified Region Growing Algorithm
  70. Predicting Automatic Trigger Speed for Vehicle-Activated Signs
  71. Group Recommender Systems – An Evolutionary Approach Based on Multi-expert System for Consensus
  72. Enriching Documents by Linking Salient Entities and Lexical-Semantic Expansion
  73. A New Feature Selection Method for Sentiment Analysis in Short Text
  74. Optimizing Software Modularity with Minimum Possible Variations
  75. Optimizing the Self-Organizing Team Size Using a Genetic Algorithm in Agile Practices
  76. Aspect-Oriented Sentiment Analysis: A Topic Modeling-Powered Approach
  77. Feature Pair Index Graph for Clustering
  78. Tangramob: An Agent-Based Simulation Framework for Validating Urban Smart Mobility Solutions
  79. A New Algorithm Based on Magic Square and a Novel Chaotic System for Image Encryption
  80. Video Steganography Using Knight Tour Algorithm and LSB Method for Encrypted Data
  81. Clay-Based Brick Porosity Estimation Using Image Processing Techniques
  82. AGCS Technique to Improve the Performance of Neural Networks
  83. A Color Image Encryption Technique Based on Bit-Level Permutation and Alternate Logistic Maps
  84. A Hybrid of Deep CNN and Bidirectional LSTM for Automatic Speech Recognition
  85. Database Creation and Dialect-Wise Comparative Analysis of Prosodic Features for Punjabi Language
  86. Trapezoidal Linguistic Cubic Fuzzy TOPSIS Method and Application in a Group Decision Making Program
  87. Histopathological Image Segmentation Using Modified Kernel-Based Fuzzy C-Means and Edge Bridge and Fill Technique
  88. Proximal Support Vector Machine-Based Hybrid Approach for Edge Detection in Noisy Images
  89. Early Detection of Parkinson’s Disease by Using SPECT Imaging and Biomarkers
  90. Image Compression Based on Block SVD Power Method
  91. Noise Reduction Using Modified Wiener Filter in Digital Hearing Aid for Speech Signal Enhancement
  92. Secure Fingerprint Authentication Using Deep Learning and Minutiae Verification
  93. The Use of Natural Language Processing Approach for Converting Pseudo Code to C# Code
  94. Non-word Attributes’ Efficiency in Text Mining Authorship Prediction
  95. Design and Evaluation of Outlier Detection Based on Semantic Condensed Nearest Neighbor
  96. An Efficient Quality Inspection of Food Products Using Neural Network Classification
  97. Opposition Intensity-Based Cuckoo Search Algorithm for Data Privacy Preservation
  98. M-HMOGA: A New Multi-Objective Feature Selection Algorithm for Handwritten Numeral Classification
  99. Analogy-Based Approaches to Improve Software Project Effort Estimation Accuracy
  100. Linear Regression Supporting Vector Machine and Hybrid LOG Filter-Based Image Restoration
  101. Fractional Fuzzy Clustering and Particle Whale Optimization-Based MapReduce Framework for Big Data Clustering
  102. Implementation of Improved Ship-Iceberg Classifier Using Deep Learning
  103. Hybrid Approach for Face Recognition from a Single Sample per Person by Combining VLC and GOM
  104. Polarity Analysis of Customer Reviews Based on Part-of-Speech Subcategory
  105. A 4D Trajectory Prediction Model Based on the BP Neural Network
  106. A Blind Medical Image Watermarking for Secure E-Healthcare Application Using Crypto-Watermarking System
  107. Discriminating Healthy Wheat Grains from Grains Infected with Fusarium graminearum Using Texture Characteristics of Image-Processing Technique, Discriminant Analysis, and Support Vector Machine Methods
  108. License Plate Recognition in Urban Road Based on Vehicle Tracking and Result Integration
  109. Binary Genetic Swarm Optimization: A Combination of GA and PSO for Feature Selection
  110. Enhanced Twitter Sentiment Analysis Using Hybrid Approach and by Accounting Local Contextual Semantic
  111. Cloud Security: LKM and Optimal Fuzzy System for Intrusion Detection in Cloud Environment
  112. Power Average Operators of Trapezoidal Cubic Fuzzy Numbers and Application to Multi-attribute Group Decision Making
Downloaded on 11.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/jisys-2017-0458/html
Scroll to top button