PLA—A Privacy-Embedded Lightweight and Efficient Automated Breast Cancer Accurate Diagnosis Framework for the Internet of Medical Things

Abstract

The Internet of Medical Things (IoMT) can automate breast tumor detection and classification with the potential of artificial intelligence. However, the leakage of sensitive data can cause harm to patients. To address this issue, this study proposed an intrauterine breast cancer diagnosis method, namely “Privacy-Embedded Lightweight and Efficient Automated (PLA)”, for IoMT, which represents an approach that combines privacy-preserving techniques, efficiency, and automation to achieve our goals. Firstly, our model is designed to achieve lightweight classification prediction and global information processing of breast cancer by utilizing an advanced IoMT-friendly ViT backbone. Secondly, PLA protects patients’ privacy by federated learning, taking the classification task of breast cancer as the main task and introducing the texture analysis task of breast cancer images as the auxiliary task to train the model. For our PLA framework, the classification accuracy is 0.953, the recall rate is 0.998 for the best, the F1 value is 0.969, the precision value is 0.988, and the classification time is 61.9 ms. The experimental results show that the PLA model performs better than all of the comparison methods in terms of accuracy, with an improvement of more than 0.5%. Furthermore, our proposed model demonstrates significant advantages over the comparison methods regarding time and memory.

1. Introduction

Breast cancer stands as the most prevalent form of cancer among women, with its incidence steadily increasing. Currently, treatment strategies for breast cancer primarily rely on data derived from female patients, disregarding the distinct molecular features observed in male breast cancer cases. As a result, breast cancer has emerged as a significant health concern, necessitating a treatment plan closely aligned with its pathological classification [1,2]. It is vital to recognize that breast cancer is a complex disease encompassing various subtypes, highlighting the importance of tailoring treatment approaches to the unique tumor types and characteristics exhibited by each patient.

In recent years, there have been considerable research studies focusing on utilizing deep learning techniques for the automatic classification of breast cancer based on its pathology [3,4,5,6,7,8,9,10,11,12,13,14]. Nonetheless, medical institutions, being the proprietors of image data, have exhibited a preference for training models using their data due to the stringent privacy and security regulations surrounding medical data [1]. However, this poses a challenge for institutions with limited sample sizes, as training a model that achieves the desired performance for breast cancer detection becomes arduous. Deep convolutional neural networks (DCNNs), recognized as powerful models for general image classification, have been widely employed. However, their performance tends to be sub-optimal when confronted with imbalanced datasets, as demonstrated by a quantitative investigation [15,16,17,18].

Moreover, models trained on limited samples frequently exhibit limited generalization capabilities attributed to the absence of sample diversity [19,20]. Consequently, there is a critical need to develop a framework that not only ensures accurate diagnosis but also safeguards patient privacy, given the severity of breast cancer. Therefore, it becomes imperative to undertake a private and secure lightweight multi-class classification approach for breast cancer.

Furthermore, federated learning (FL) facilitates knowledge fusion by sharing model parameters among clients through federated training instead of data sharing [21,22,23,24]. This approach preserves data privacy and security while enabling collaborative learning across distributed devices. By leveraging FL, the model parameters are aggregated and updated locally at each client, ensuring that sensitive information remains decentralized. This decentralized approach protects individual data and allows for more efficient and scalable machine-learning models in the context of distributed environments. Additionally, FL mitigates data transmission and storage concerns, making it a promising solution for privacy-preserving collaborative learning in healthcare applications.

Nevertheless, the existing research landscape lacks comprehensive exploration into deep-learning-based approaches for breast cancer classification that effectively address two imperative considerations.

1.

The oversight of privacy concerns poses potential risks that may detrimentally affect patient interests.

2.

The cost hurdles associated with image processing and modeling remain inadequately resolved, culminating in sub-optimal classification outcomes.

The primary aim of this study is to accomplish a thorough and accurate classification of extensive breast cancer tissue samples by leveraging deep learning methodologies. This entails the capability to discern nuanced variations among different breast cancer subtypes. Health applications in smartphones have revolutionized the culture of self-care, enhancing individuals’ ability to monitor and manage their health. These applications have become increasingly popular, contributing to the growing trend of proactive healthcare practices [25]. Expanding upon the abovementioned limitations and motivation, this research harnesses MobileViT and FL techniques to propose a privacy-secure, lightweight, and efficient framework for accurate breast cancer diagnosis and classification. This paper delves into a comprehensive analysis of breast cancer theory, utilizing it as the foundation for method design. Specifically, the proposed approach entails image enhancement, extraction of texture features for classification, and subsequent training of the network model using FL to achieve optimal classification outcomes. Through this study, we aim to enhance the efficacy of patient-protection lightweight multi-class classification for breast cancer.

In summary, this study makes the following notable contributions:

1.

The development of PLA, a deep-learning-based approach aimed at facilitating breast cancer diagnosis within the context of the Internet of Medical Things (IoMT).

2.

The adoption of MobileViT as the foundational backbone of the framework to achieve the desired lightweight and efficient objectives.

3.

Implementing federated learning techniques to safeguard patient data privacy during the training process, specifically on institutional IoMT devices, ensuring timely diagnosis.

4.

A comprehensive evaluation of our model through multiple experiments, resulting in competitive and noteworthy outcomes.

This paper’s organization is as follows: we demonstrate relative works and theoretical analysis in Section 1. We present the backbone of our framework in Section 2. We introduce model design details in Section 3. Implementation setups are described in Section 4. In Section 5, we present the evaluation metrics and their corresponding results. Finally, we discuss the results in Section 6 and provide a conclusion in Section 7.

2. Relative Work

Ding et al. [26] constructed a multimodal multi-instance (MMMI) deep learning model to predict clinical data by performing a classification task. However, Ding’s method did not consider any protection of patient data, despite the model selecting 3701 patients from the Fourth Hospital of Hebei Medical University and 190 patients from four medical centers in Hebei Province as the research subjects.

Liu et al. [27] included the AlexNet-BC model in their study, augmenting its nonlinear learning capability by introducing supplementary loss functions and employing a transfer learning methodology. The network was enlarged by incorporating a fully connected layer into the original AlexNet architecture. This expanded network was pre-trained on the ImageNet dataset and further refined on a more comprehensive breast cancer dataset. Their investigations, performed on three widely used datasets (BreakHist, IDC, and UCSB), confirmed the efficacy and superiority of their suggested approach. Their technique exhibited superior performance to current algorithms at different magnifications, showcasing its durability and good generalization capabilities with an accuracy of 0.984. Nevertheless, it is crucial to acknowledge that they failed to tackle possible privacy problems for contributing patients.

Hu et al. [28] proposed a multi-view input and weighted multi-instance learning method to address the problems of large image size, unclear lesion image features, small anomaly ratio, and imbalanced classification of breast X-ray images. Firstly, the multi-view input method was used to enhance the abnormalities of breast X-ray images while obtaining more potential features from different views of breast X-ray images, and then they were weighted. The aim was to extract the most suspicious lesions from mammograms to address the issues of small abnormal proportions and imbalanced categories. Finally, to verify the effectiveness of the proposed method, the verification was completed on INbreak and MIAS public datasets to prove the progressiveness of the proposed method. However, the multi-view input method generates multiple views of each breast X-ray image, which can be regarded as computationally expensive by leading to unnecessary views and redundancy. To address unnecessary views, various studies have been proposed, such as a study [29] that presents a novel method, namely WM-NMF, and another study [30] that presents an innovative technique called TEMPO for handling multi-view problem efficiently.

Zhang et al. [31] proposed a method for the differential diagnosis of benign pulmonary nodules based on a deep learning multi-classification model. This method uses the ResNet18 network enhanced by the CBAM attention mechanism and a coarse-to-fine multi-classification framework. It analyzes the feature activation maps of deep learning classification methods, aiming to design a fast online pathological evaluation method. Their work achieved 0.957 accuracy, which is excellent.

Fan et al. [32] sought to employ radiomic characteristics derived from dynamic contrast-enhanced magnetic resonance imaging (DCE-MRI) and diffusion-weighted imaging (DWI) to jointly predict the histological grade and Ki-67 expression level of breast cancer. Their methodology included a multi-task learning framework that aimed to predict Ki-67 expression and tumor grade simultaneously by utilizing separate radiomic signals extracted from several MRI sequences. This paradigm considers the common and distinct characteristics of features obtained from diverse picture sources. They assessed their methods using multi-task elastic net regression for selecting features and a multi-task classifier for predicting classifications. This evaluation was conducted using DCE-MRI and DWI data from 144 patients diagnosed with invasive breast cancer, along with matching pathology reports. Further, the study utilized a leave-one-out cross-validation procedure to evaluate the predictive efficacy of several single-task and multi-task learning techniques. The results demonstrated that using a multi-task learning strategy significantly improved the precision in predicting Ki-67 expression and tumor grade. Nevertheless, this approach entails selecting radiomic characteristics linked to two clinical indications, simultaneously requiring the optimization of both the input and output matrices for each MRI session and the resolution of a computationally intricate convex optimization problem.

Theoretical Analysis of Breast Cancer Image Classification

Before delving into a privacy-enabled and lightweight approach for classifying breast cancer, this work thoroughly explored the theoretical aspects of analyzing breast cancer images. Researchers need a specialized understanding of pathological diagnostics due to the numerous forms and types of breast cancer pathological tissues. The mammary glands, separate from the apocrine glands in human skin, comprise lobules, ducts, and other anatomical components [31]. The leading cause of breast cancer is the excessive growth of glandular or ductal epithelial cells, known as hyperplasia [33]. Figure 1, obtained from the BreakHist dataset, depicts benign and malignant breast cancers.

Figure 1 shows the typical electron microscope structure of mature breast tissue slices, generally vertical and columnar cells arranged in a single layer, though they can occasionally reveal uniform layering. The hallmarks of benign tumors include a rise in the number of cells in the tumor, a flattening out of the cell shape, a darker nuclear stain, and clusters or sheets of structural cells. On the other hand, tumor cells that are cancerous exhibit heteromorphic characteristics, such as metastasis to other organs, a variety of shapes and sizes, elevated levels of dispersed cells with different shapes, weaker cell cohesion, and deeper nuclear staining [28,34].

Further categorization is required to differentiate these diverse cell pictures over three degrees accurately. Expanding on this categorization, the research intends to develop a streamlined approach for classifying breast cancer into many categories.

3. Backbone Design of the Model

The PLA model is proposed to address privacy-embedded, lightweight, efficient, and automated classification methods of breast cancer. To improve the ability of the model to extract features and process global and local features, the backbone feature network was designed, and the improved network model was used to extract texture features of breast cancer images to improve its classification and detection performance. The specific design is as follows:

3.1. Image Enhancement Processing

This study selected samples from the BreakHist breast cancer dataset. After completing breast cancer image acquisition, to improve the classification and detection effect of subsequent models on breast cancer images, breast cancer images were enhanced [35]. Let the input breast cancer image be detected by $X(X\in R_{\mathrm{H}\times W\times C})$, where H, W, and C represent the height, width, and channel number of the input image, respectively. In the image enhancement process, an image matrix will be generated to enhance and retain the gray area information. The specific operation formula is as follows:

$$\overline{X}=X\times M$$

(1)

In the formula, M is mainly affected by four parameters, which can be expressed as $(r,d,x,y)$, r represents the proportion of gray in the detected image unit, d represents the side length of the image unit, and x, y represent the distance from the image boundary to the complete image unit [36]. To sum up, the discrete information in the image is deleted, and the image preprocessing is realized.

3.2. Image Texture Feature Extraction

After image preprocessing is completed, image features are extracted as an auxiliary task, and details are as follows:

1.

Roughness: Roughness mainly reflects the change in image’s gray level and can be expressed as:

$$F_{\mathrm{roghness}}=\frac{1}{H\times N}\sum _{i=1}^H\sum _{j=1}^N{S}_{\mathrm{kbest}}(i,j)$$

(2)

where $(i,j)$ represents the position coordinate of the pixel; $S_{\mathrm{kbest}}$ represents the optimal size of each pixel in the breast cancer image unit; k stands for pixel range.

2.

Contrast: The contrast reflects the distribution of pixel intensity in the image and can be expressed as:

$$F_{\mathrm{contrast}}=\frac{\sigma }{{\alpha }_4^{\frac{1}{4}}}$$

(3)

The formula $F_{\mathrm{contrast}}$ represents the peak state of the recovery statistic value, the fourth-order moment mean value, and the mean square error of the image gray value. $\sigma$ represented the standard deviation, and ${\alpha }_4$ denotes the kurtosis of the intensity histogram, which can be used as a polarization measurement indicator.

3.

Orientation: Orientation primarily reflects the concentration of image texture intensity along a certain direction, and the formula is shown below:

$$F_{\mathbf{dir}}=1-r_{n_p}\sum _p^{n_p}\sum _{\varphi \in {\omega }_p}{(\varphi -{\varphi }_p)}^2{H}_D\left(\varphi \right)$$

(4)

In the equation, p represents the peak, $n_p$ represents the number of peaks, ${\omega }_p$ represents the range of peaks and valleys, r represents the normalization factor, ${\varphi }_p$ represents the position of the peak p, and $H_D\left(\varphi \right)$ represents the corresponding histogram.

4.

Linearity: Linearity within an image texture refers to a structured and organized arrangement of linear elements. These elements could manifest as straight lines, contours, or patterns contributing to visual composition. The linearity equation is referred to as:

$$F_{\mathrm{lin}}=\frac{{\sum }_{i=1}^H{\sum }_{j=1}^N{P}_d(i,j)cos\left[(i-j)\frac{2\pi }{N}\right]}{{\sum }_{i=1}^H{\sum }_{j=1}^N{P}_d(i,j)}$$

(5)

The measurement of $F_{\mathrm{lin}}$ was based on a weighting scheme that assigned a weight of +1 to co-occurrences in the same direction and a weight of −1 to those in the perpendicular direction. This weighting scheme was incorporated into a mathematical function that utilized a direction co-occurrence matrix denoted by $P_d$. Therefore, $P_d(i,j)$ of the matrix represented the relative frequency of neighborhoods centered at two pixels separated by a distance d along the edge direction. In other words, it indicated the frequency at which one pixel had a quantized direction i, while the other had a quantized direction j, occurring on the image.

Based on the above methods, the image’s texture characteristics can be evaluated using Equations (2)–(5). Then, PLA was designed by fusing it with the Mobile ViT (MViT) module, which is competitive with traditional ViTs on various computer vision tasks. It achieves comparable accuracy to large ViTs while being significantly more efficient. This makes it a promising candidate for deployment on mobile devices. It opens up new possibilities for using vision transformers in the IoMT field. On this basis, the MViT module was introduced as the backbone feature extraction network. A multi-scale fusion network was constructed as the prediction layer [37,38,39,40,41]. In this work, MViT mainly consisted of three parts: local feature information extraction, global feature information extraction, and feature information fusion. These three parts can improve the accuracy of classification detection while reducing computational complexity [42,43]. In the model designed for this study, feature fusion and subcategory classification were used to obtain rich image feature information to achieve the best classification and recognition effect, as shown in Figure 2. Furthermore, the designed framework was emphasized using our proposed algorithm as presented in Algorithm 1.

Algorithm 1 The proposed high-level algorithm for PLA

4. Privacy-Embedded Lightweight Multi-Category Classification Design for Breast Cancer

Based on the backbone design above, our model is designed to achieve private security, lightweight efficiency, and an automated classification prediction of breast cancer. Next, this research refers to federal learning in the training stage, takes the multi-class classification task of breast cancer as the main task, and introduces the texture analysis task of breast cancer image as the auxiliary task to train the model to obtain the best classification results of breast cancer images. This study considers the cross-entropy loss function as follows:

$$Loss=-\sum _{i=0}^{s^2}{I}_{i,j}^{\mathrm{obj}}\sum _{c\in \mathrm{classes}}\left[{\widehat{P}}_i^{j}log\left(P_i^j\right)+(1-P_i^j)log(1-P_i^j)\right]$$

(6)

The formula signifies that the prior box within the grid contains the target and denotes the category probability [44]. To ensure the model’s privacy functionality, training is executed following the principles of federated learning, generating an aggregated network model. The detailed federate-learning-based training process is illustrated in Figure 3.

During the training process, N datasets were selected to train the model, update the parameters, and integrate them to obtain the aggregated network model. The whole procedure is described in Algorithm 1. The algorithm outlines the FL processing using a lightweight MobileViT model. Initially, local training is performed on individual models using their sub-datasets for several epochs. Subsequently, the algorithm aggregates the parameters from all models to create global results. Each model is then updated with global parameters, which iterates for a specified number of iterations. Finally, the updated models are aggregated, representing the collaborative knowledge learned from all local datasets and models.

The process is as follows:

1.

Initialize the model: First, the model parameters are initialized on the central server, and the initial parameters are sent to the devices participating in the training.

$$MobileViT=initialize\text{\_}model\left(\right)$$

(7)

Initialize_model() represents the initialization function [45,46].

2.

Distribution of the models and the data: The initialized model is sent to each corresponding device, while the corresponding local dataset is distributed to them. The devices can be different devices or machines, such as smartphones, edge devices, etc.

3.

Local training: The model is trained using the device to update its parameters. This process is performed in parallel on the device without transferring the raw data to the central server. The parameter update formula is:

$$Modeln\text{\_}new=local\text{\_}train(Modeln,datan)$$

(8)

where local_train() represents the local training function, local datasets, and the Mobile ViT Network model.

4.

Parameter aggregation: After the local training is completed, the device sends the respective model parameters to the central server. The central server aggregates these parameters based on pre-defined aggregation strategies (such as the weighted average) to obtain a new global model parameter with the formula:

$$GlobalParams=aggregate\text{\_}params\left(\right(Modeln\text{\_}new\left)\right)$$

(9)

where aggregate_params() represents the aggregate function of the parameter.

5.

Update model: The central server sends the aggregated global model parameters back to the device to update their local models.

6.

Final aggregation: Determine whether convergence conditions are met. If not, repeat steps 3 to 5. If so, the final model parameters can be aggregated using the central server, and the aggregated network model after integration can be expressed as:

$$AggrModel=aggr\text{\_}models(Model1\text{\_}updated,Model2\text{\_}updated)$$

(10)

where aggregate_models() represents the model integration function and two model update parameters. The model training is completed through the above, and the optimal classification results are obtained.

5. Implementation

5.1. System Implementation Details

The system was implemented on a Windows 10 desktop PC for this investigation. The computer was equipped with an 11th generation Intel 8-core CPU and had an NVIDIA GeForce RTX 3080 Ti GPU, which had a 12 GB RAM capacity.

Based on this, the centralized classification model training on data owned by a single client and the single Mobile ViT network model was used to carry out the comparative experimental test to verify the performance of the method, and three comparison methods were selected to juxtapose the classification efficiency.

5.2. Dataset

The BreakHist database consists of 7909 breast histopathology images collected from 82 individuals. The dataset classifies the visuals into two main categories: benign and malignant cancers. Each primary category is subdivided into four subgroups, differentiating the tumor’s morphology when observed under a microscope. Pathologists can collect data by digitizing and annotating slides utilizing full-frame image (WSI) scanners integrated into laboratory information systems. During this procedure, samples were obtained at four distinct levels of magnification: 40×, 100×, 200×, and 400× as shown in

Table 1. BreaKHist dataset image distribution.

Magnification	Benign	Malignant	Total
40×	598	1398	1996
100×	642	1437	2079
200×	594	1418	2012
400×	590	1232	1822
Total	2424	5485	7909

below.

5.3. Metrics

The assessment metrics are computed based on a confusion matrix, which provides information on the predicted true negatives, false positives, false negatives, and the overall number of predictions. Accuracy, precision, recall, F1 score, and balanced accuracy are all components of these metrics. The specificity of the model quantifies its ability to identify false negatives accurately. The recall metric quantifies the model’s ability to identify positive outcomes accurately. Accuracy is a metric that evaluates the percentage of correctly classified cases, both positive and negative. A high degree of precision in classification implies that most positive and negative scenarios were accurately classified. The F1 score determines the optimal balance between recall and accuracy. When assessing the effectiveness of a model, balanced accuracy, which is the mean of recall and specificity, is a crucial metric, particularly when there is an unequal distribution of classes.

6. Evaluations

A comparison between several models, including ours, is presented in

Table 2. Summary of different models and their performance.

Model	Image Size	Feature Extractor	Train/Test/Validation	Classification Accuracy on 40×
Sudharshan et al. [40]	Rnd (64 × 64)	PFTAS	70%/30%/0%	0.878
Alqahtani et al. [47]	Rnd (224 × 224)	ResNet50	85%/15%/0%	0.888
Zerouaoui et al. [48]	Rnd (256 × 256)	Multi-model	Unknown	0.926
Kumar et al. [49]	Rnd (299 × 299)	ResNet152	Unknown	0.824
Agarwal et al. [50]	WSI	ResNet50	Unknown	0.947
Djouima et al. [51]	Rnd (384 × 384)	DensNet201	70%/20%/10%	0.920
Singh et al. [52]	Rnd (224 × 224)	Hybrid model	65%/35%/0%	0.808
Jakhar et al. [53]	WSI	Random forest, Extra tree	80%/20%/0%	0.934
Juhong et al. [54]	WSI	SRGAN-ResNeXt, Inception U-net	Unknown	0.947
Chhipa et al. [55]	WSI	ResNet152 + MVPNet	64%/20%/16%	0.907
This model	WSI	PLA	70%/20%/10%	0.953

using accuracy metrics from the literature. Upon evaluation using the test dataset, the model with the highest accuracy was 0.947. Nevertheless, our model performs better than others by attaining the maximum accuracy of 0.953, thus showcasing its exceptional performance.

To assess the performance of our model, we followed a conventional train/test split approach: 70% of the accessible data were allocated for training purposes, while 20% were set aside for testing. By employing this approach, an unbiased evaluation of the model’s capability for generalization is guaranteed.

In addition, we performed an additional experiment employing a hold-out validation strategy to verify the robustness of our model. A subset comprising 10% of the total available data was chosen and employed as the validation set. Utilizing a validation set distinct from the training and testing data allowed us to evaluate the model’s performance on samples that had not yet been encountered.

Our PLA model is prepared for integration into the systems of the participating client institutions within the IoMT framework. It provides medical professionals with significant computer-assisted assistance in their diagnostic procedures. The model specifically examines digitized biopsies submitted to patients’ medical records. This real-time analysis enhances the confidence of pathologists and other medical experts in tumor classification, leading to more accurate and reliable diagnoses.

By leveraging the capabilities of our PLA model within the IoMT systems, medical professionals can make more informed decisions and provide improved patient care. The integration of our model has the potential to significantly enhance the efficiency and accuracy of tumor classification, contributing to better treatment outcomes and patient management.

Three diverse experiments were examined to carry out privacy-embedded lightweight multi-class classification of breast cancer, and the classification accuracy of the three methods was evaluated. The comparative results are shown in Figure 4.

The results show that the classification accuracy of all three approaches decreases with an increasing sample size (see Figure 4). Nevertheless, our suggested model reliably achieves classification accuracies over 0.953 regardless of the sample size. The comparison approach, on the other hand, reliably obtains an accuracy rate lower than 0.935. These noteworthy variations highlight how our suggested approach outperforms the state-of-the-art in private-security lightweight multi-category breast cancer categorization. The classification recall rates of the three approaches are compared in Figure 5 for a more in-depth look at performance. With an average recall of 0.968, the comparison approach falls short compared to the suggested method’s 0.998 recall record. These results provide more evidence that our proposed approach works in this setting. In addition,

Table 3. Comparison of accuracy, precision, recall, and F1 values for different sample sizes [EXP-A = design model, EXP-B = centralized model, EXP-C = single mobile ViT network model].

EXP Type	Metrics	Number of Samples
		7909	4000	2000	1000
EXP-A	ACC	0.953	0.965	0.893	0.610
	Precision	0.988	0.958	0.930	0.613
	Recall	0.994	0.998	0.941	0.915
	F1	0.925	0.977	0.932	0.734
EXP-B	ACC	0.941	0.861	0.828	0.613
	Precision	0.979	0.919	0.936	0.956
	Recall	0.988	0.930	0.887	0.881
	F1	0.983	0.918	0.960	0.968
EXP-C	ACC	0.877	0.845	0.610	0.610
	Precision	0.881	0.883	0.613	0.613
	Recall	0.974	0.949	0.915	0.915
	F1	0.934	0.915	0.734	0.734

displays the F1 value, computed by a thorough study incorporating recall rates and classification accuracy.

As shown in Table 3, using the model designed in this paper, the F1 values were 0.969 on average, which is better than the comparison method, demonstrating that the proposed classification method has a high recall and classification accuracy.

It is important to acknowledge that the BreakHist dataset exhibits a severe data imbalance issue, with the number of benign images being approximately 2.2 times greater than that of malignant images. This significant class imbalance can lead to a classification model that is overly accurate for benign images but performs poorly on malignant images.

In our analysis, we observed that the result for the EXP-A setup, which included 4000 samples, performed better than all other setups. However, it is essential to note that this improvement might have occurred by coincidence, as the splitting strategy handled the data imbalance problem more effectively in this particular setup.

In contrast, the EXP-B and EXP-C setups, which utilized all available samples, consistently achieved the best results across all evaluations. Therefore, we have decided to consider the results obtained using all samples as the best result for the EXP-A setup. This ensures that the evaluation is more robust and representative of the model’s performance across the dataset, considering the inherent data imbalance challenge.

Finally, apply three methods for classification and compare their classification efficiency. The comparison results are shown in

Table 4. Comparison of classification consumption time and memory usage for different sample sizes and models.

Particulars (Time/Memory)	Samples
	1000	2000	4000	7909
Design Model Time (ms)	45.2	52.1	57.8	59.2
Design Model Memory (MB)	9.42	9.42	9.42	9.42
ResNet18 Time (ms)	56.4	63.6	70.5	72.6
ResNet18 Memory (MB)	48.6	48.6	48.6	48.6
VGG11 Time (ms)	60.6	67.6	77.8	79.1
VGG11 Memory (MB)	138	138	138	138
Inception v3 Time (ms)	64.4	71.6	78.5	80.1
Inception v3 Memory (MB)	238	238	238	238

.

Table 4 demonstrates that using our suggested approach for classification results in an average processing time of under 61.9 ms, which is significantly faster than the comparative technique, which has an average processing time of over 70.3 ms. The design model outperforms ResNet18, VGG11, and Inception v3 in terms of both time and memory efficiency, being faster by 17.8–23.3%, 25.2–30.7%, and 29.2–33.5%, respectively, while requiring 79.1–81.6%, 92.6–94.4%, and 94.4–96.2% less memory. The significant disparity highlights the better efficacy in categorization and advantageous real-world implementation of our approach in picture classification.

Figure 6 showcases the comprehensive results for the PLA model’s overall performance, which remains satisfactory. However, it is worth mentioning that the results of the 1000 and 2000 samples’ experiments were not as good as we anticipated, which are plateaus in the early stage. Our analysis suggests this is likely due to the smaller number of samples used in those experiments. Throughout all the experiments, the average train loss of our model is close to zero. The validation loss is 0.23 for the best, and the average test loss is lower than 0.24 across all experiments.

Moving to Figure 7, it demonstrates that the loss for all experiments rises after a certain number of epochs. The result indicates that the model is overfitting to the training data. Compared to our PLA model, the training loss is much higher, and the validation loss and test loss are near 0.8, which is much worse than our PLA framework numerically. From our perspective, for medical care applications, it is unacceptable for a model’s accuracy to fluctuate drastically due to overfitting.

Lastly, in Figure 8, the experiments for the original mobile vision transformer model performed similarly to the centralized PLA model. While these findings indicate a comparable performance, the observed loss plots suggest room for further improvement to render it more suitable for deployment in real medical settings.

7. Discussion

Though our method significantly improves accuracy while reducing unnecessary computational overhead, it still has some disadvantages compared to traditional centralized training. One disadvantage is the possible performance degradation due to incomplete data. In FL, each client only has access to local data, which may not represent the entire dataset. This limited data availability can lead to reduced model performance, as the model may not be able to generalize effectively without a complete dataset.

Another disadvantage is the presence of client heterogeneity. Different clients may differ in computing power, network connections, and data quality in FL. This heterogeneity can create challenges in coordinating the training process and aggregating model updates. Clients with limited resources or unreliable connections may not contribute effectively to training, potentially affecting overall model performance.

Finally, the proposed approach has some limitations that must be considered. One of them is that the model is designed to be lightweight and compact. While this design choice may have advantages regarding efficiency and resource usage, there may also be potential performance limitations when processing large datasets. Theoretical assumptions about how small models will perform on large datasets may not provide explicit answers because there may be uncertainty about how small models will generalize and handle more complex datasets. Furthermore, the pursuit of lightweight models may impose limitations on the capacity and representation capabilities of the model, which may limit its ability to capture complex patterns and nuances in data, which may be critical for specific complex tasks or datasets.

It is essential to recognize these limitations and carefully evaluate the trade-offs between model size, performance, and the specific requirements of a particular application. Further empirical studies and experiments may be needed to evaluate the performance of the proposed method on large datasets and to understand its limitations more precisely.

8. Conclusions

This study used the BreakHist dataset for analysis to propose a privacy-embedded, lightweight, and efficient framework. The efficacy of our approach lies in its incorporation of theoretical knowledge on breast cancer, utilizing image enhancement processing and the PLA model to extract crucial textural characteristics. Image enhancement improved the quality of the image by highlighting the characteristics of breast cancer lesions. Additionally, the proposed framework uses federated learning principles and is intended for deployment in IoMT applications. FL revolutionizes the training of PLA models by enabling collaborative learning without compromising data privacy. It also provides a secure and confidential framework for training models on sensitive or personal data by kee** data decentralized and utilizing privacy-preserving techniques. Moreover, each client only needs to use local data for model training and then transmit model updates to the central server for aggregation. This avoids large data transmission and reduces communication overhead and network latency during training. In addition, it allows model training to be performed in parallel on multiple clients to minimize the training time. Each client can independently perform model updates and parameter optimization without waiting for other clients to complete training. This parallel training method significantly improves training efficiency and reduces the overall training time. Therefore, it substantially reduces the model training time by allocating training tasks to multiple clients for parallel processing while reducing data transmission and communication overhead and utilizing the similar computing capabilities of multiple clients. Through comprehensive experiments, we evaluated the design model, centralized model, and single mobile ViT network model from various perspectives, and the results demonstrated the proposed method’s feasibility, efficiency, and superiority.