Cell confluence is an important metric to determine the growth and the best harvest time of adherent cells. At present, the evaluation of cell confluence mainly relies on experienced labor, and thus it is not conducive to the automated cell culture. In this paper, we proposed an improved U-Net algorithm (called DU-Net) for the segmentation of adherent cells. First, the general convolution was replaced by the dilated convolution to expand the receptive fields for feature extraction. Then, the convolutional layers were combined with the batch normalization layers to reduce the dependence of the network on initialization. As a result, the segmentation accuracy and F1-score of the proposed DU-Net for adherent cells with low confluence (<50%) reached 96.94% and 93.87%, respectively, and for those with high confluence (≥50%), they reached 98.63% and 98.98%, respectively. Further, the paired t-test results showed that the proposed DU-Net was statistically superior to the traditional U-Net algorithm. 相似文献
Knowledge and Information Systems - Network robustness measures how well network structure is strong and healthy when it is under attack, such as vertices joining and leaving. It has been widely... 相似文献
In a backbone-assisted industrial wireless network (BAIWN), the technology of successive interference cancellation (SIC) based non-orthogonal multiple access (NOMA) provides potential solutions for improving the delay performance. Previous work emphasizes minimizing the transmission delay by user scheduling without considering power control. However, power control is beneficial for SIC-based NOMA to exploit the power domain and manage co-channel interference to simultaneously serve multiple user nodes with the high spectral and time resource utilization characteristics. In this paper, we consider joint power control and user scheduling to study the scheduling time minimization problem (STMP) with given traffic demands in BAIWNs. Specifically, STMP is formulated as an integer programming problem, which is NP-hard. To tackle the NP-hard problem, we propose a conflict graph-based greedy algorithm, to obtain a sub-optimal solution with low complexity. As a good feature, the decisions of power control and user scheduling can be made by the proposed algorithm only according to the channel state information and traffic demands. The experimental results show that compared with the other methods, the proposed method effectively improves the delay performance regardless of the channel states or the network scales.