Recently, end-to-end deep neural networks-based glaucoma diagnosis approaches have been gaining much attention. However, the feature extractor and classier in these approaches are trained together, which is known as coadaptation. Therefore, the feature distribution in them should adapt to particular decision boundaries. To learn generic data representations and improve the generalization ability of the model, this paper designs a three-stage framework for glaucoma diagnosis. In the first stage, preprocessing is utilized to extract the Region of Interesting around the Optic Disc to reduce the computational cost and nonobjective interference. In the second stage, Deep Sparse Autoencoder is designed to learn hybrid features between the deep features and the original features, which could improve the effectiveness of final high-level feature expression. Meanwhile, L1 regularization is introduced and applied on the hybrid features to obtain deep features with high complementarity under small sample problem. In the third stage, the obtained generic feature representations are fed into different classifiers, in which Support Vector Machine classifier achieves the best diagnosis performance. The proposed approach is evaluated on two publicly available databases. Extensive experimental results indicate that our approach outperforms the state-of-the-art approaches with the accuracy of 96.00%, 97.00% and Area Under Curve of 96.94%, 98.28% for REFUGE and Drishti-GS1 databases, respectively.

As one of the most effective feature learning methods, Nonnegative Matrix Factorization (NMF) has been widely used in many scientific fields, such as computer vision, data mining, and bioinformatics. However, NMF is an unsupervised method that cannot fully utilize the label information of data. Thus, its performance is limited in some recognition and classification problems. To remedy this shortcoming, this paper proposes a Semisupervised Discriminative NMF (SDNMF) method. First, we design a Soft-Labeled NMF (SLNMF) model by introducing a soft-label matrix-based regression term into the original NMF, so that the relationship between the soft-label matrix and low-dimensional features can be constructed to improve the discriminative ability of low-dimensional features. Second, to effectively estimate the soft-label matrix, a Label Propagation (LP) model is adopted to fully explore the spatial distribution relationship between the labeled and unlabeled samples. Third, an Adaptive Graph Learning (AGL) model is proposed to exploit the geometric relationship of samples well, which could enhance the performance of LP. Finally, the above three models (i.e., SLNMF, LP, and AGL) are integrated into a unified framework for effective feature learning, which can not only effectively explore the structural relationship matrix between data, but also predict the labels for unknown samples. Moreover, an iterative optimization algorithm is presented to solve our objective function. The convergence and computational complexity analysis of the proposed SDNMF method are also provided. Extensive experiments are conducted on several standard data sets. Compared with related methods, the experimental results verify that the proposed SDNMF method achieves better performance.

Glaucoma is an eye disease that leads to irreversible vision loss. Accurate Optic Disc (OD) and Optic Cup (OC) segmentation can effectively facilitate ophthalmologist in glaucoma diagnosis. Recently, a series of deep learning approaches attain promising performance in OD and OC segmentation but still face the challenge to precisely segment OC boundary with enhanced computational efficiency. To address this issue, we propose a novel network named Robust Multiscale Feature Extraction with Depthwise Separable Convolution (RMSDSC-Net), which can better solve the challenging tradeoff between segmentation performance and network cost. The proposed RMSDSC-Net is mainly composed of Multiscale Input (MSI), Depthwise Separable Convolution Unit (DSCU), Dilated Convolution Block (DCB), and External Residual Connection (ERC). First, the introduction of MSI can reduce the information loss due to the pooling layers used in the network for capturing rich feature representations. Next, to enhance segmentation performance and computational efficiency, this paper designs DSCU and DCB modules to avoid spatial information loss from minor details of the image and preserve more high-level semantic features. Finally, this paper develops ERC established between the encoding layers and decoding layers to minimize the feature degradation problem. Hence, a high segmentation performance can be achieved using a shallow network. To evaluate the performance of the proposed network, extensive experiments have been enforced on two publicly available databases, DRISHTI-GS and REFUGE. Our approach outperforms the state-of-the-art approaches with the Dice Coefficient of (0.978, 0.919) and (0.965, 0.910) for OD and OC segmentation on DRISHTI-GS and REFUGE databases, respectively. As a result, the proposed approach has a strong potential in analyzing fundus images for glaucoma diagnosis.

Retinal vessel segmentation is a vital step for the diagnosis of many early eye-related diseases. In this work, we propose a new deep learning model, namely Channel Attention Residual U-Net (CAR-UNet), to accurately segment retinal vascular and non-vascular pixels. In this model, we introduced a novel Modified Efficient Channel Attention (MECA) to enhance the discriminative ability of the network by considering the interdependence between feature maps. On the one hand, we apply MECA to the "skip connections" in the traditional U-shaped networks, instead of simply copying the feature maps of the contracting path to the corresponding expansive path. On the other hand, we propose a Channel Attention Double Residual Block (CADRB), which integrates MECA into a residual structure as a core structure to construct the proposed CAR-UNet. The results show that our proposed CAR-UNet has reached the state-of-the-art performance on three publicly available retinal vessel datasets: DRIVE, CHASE DB1 and STARE.

Feature representation learning is a key issue in artificial intelligence research. Multiview multimedia data can provide rich information, which makes feature representation become one of the current research hotspots in data analysis. Recently, a large number of multiview data feature representation methods have been proposed, among which matrix factorization shows the excellent performance. Therefore, we propose an adaptive‐weighted multiview deep basis matrix factorization (AMDBMF) method that integrates matrix factorization, deep learning, and view fusion together. Specifically, we first perform deep basis matrix factorization on data of each view. Then, all views are integrated to complete the procedure of multiview feature learning. Finally, we propose an adaptive weighting strategy to fuse the low‐dimensional features of each view so that a unified feature representation can be obtained for multiview multimedia data. We also design an iterative update algorithm to optimize the objective function and justify the convergence of the optimization algorithm through numerical experiments. We conducted clustering experiments on five multiview multimedia datasets and compare the proposed method with several excellent current methods. The experimental results demonstrate that the clustering performance of the proposed method is better than those of the other comparison methods.

With the rapid growth of 6G communication and smart sensor technology, the Internet of Things (IoT) has attracted much attention now. In the 6G‐based IoT applications on the multiprocessor platform, the partitioned scheduling has been widely applied. However, these partitioned scheduling approaches could cause system resource waste and uneven workload among processors. In this paper, a smart semipartitioned scheduling strategy (SSPS) was proposed for mixed‐criticality systems (MCS) in 6G‐based edge computing. Besides tasks’ acceptance rate and weighted schedulability, QoS is considered in SSPS to improve the service quality of the system. The SSPS allocates tasks into each processor, and some tasks can migrate to other processors as soon as possible. By comparing with the several existing algorithms, the experimental results show that the SSPS achieves the best in the schedulability and QoS of the system.

The precise segmentation of retinal blood vessels is of great significance for early diagnosis of eye-related diseases such as diabetes and hypertension. In this work, we propose a lightweight network named Spatial Attention U-Net (SA-UNet) that does not require thousands of annotated training samples and can be utilized in a data augmentation manner to use the available annotated samples more efficiently. SA-UNet introduces a spatial attention module which infers the attention map along the spatial dimension, and multiplies the attention map by the input feature map for adaptive feature refinement. In addition, the proposed network employs structured dropout convolutional blocks instead of the original convolutional blocks of U-Net to prevent the network from overfitting. We evaluate SA-UNet based on two benchmark retinal datasets: the Vascular Extraction (DRIVE) dataset and the Child Heart and Health Study (CHASE_DB1) dataset. The results show that the proposed SA-UNet achieves state-of-the-art performance on both datasets. The implementation and the trained networks are available on Github1.

Summary Multipath TCP (MPTCP) is a promising transport protocol that allows a multihomed device to simultaneously use multiple network interfaces to send application data over multiple paths. However, although applying MPTCP to data delivery introduces many and attractive benefits, the MPTCP is vulnerable to network attacks. When a path within the MPTCP connection suffers from some types of attacks (eg, a denial‐of‐service attack) and becomes underperforming, it will undoubtedly cause transmission interruption in the stable paths and thus degrade the application‐level performance. Unfortunately, the MPTCP path management mechanism is very simple and cannot timely prevent the usage of underperforming paths in multipath transmission. In this paper, we introduce a new “potentially underperforming” (PU) concept to MPTCP and propose a novel PU‐aware path usage management mechanism ((PU)2M2) for MPTCP aiming to (1) detect and declare an underperforming path and prevent the usage of underperforming paths in multipath transmission, (2) provide a finite‐state‐machine model to change per‐path's state accordingly and effectively manage multiple paths for data transmission, and (3) alleviate the packet reordering problem and make MPTCP avoid throughput performance degradation during network underperforming. We demonstrate the benefits of applying (PU)2M2 to MPTCP.

This paper presents a framework for the real-time rendering of plant leaves with global illumination effects. Realistic rendering of leaves requires a sophisticated appearance model and accurate lighting computation. For leaf appearance we introduce a parametric model that describes leaves in terms of spatially-variant BRDFs and BTDFs. These BRDFs and BTDFs, incorporating analysis of subsurface scattering inside leaf tissues and rough surface scattering on leaf surfaces, can be measured from real leaves. More importantly, this description is compact and can be loaded into graphics hardware for fast run-time shading calculations, which are essential for achieving high frame rates. For lighting computation, we present an algorithm that extends the Precomputed Radiance Transfer (PRT) approach to all-frequency lighting for leaves. In particular, we handle the combined illumination effects due to low-frequency environment light and high-frequency sunlight. This is done by decomposing the local incident radiance of sunlight into direct and indirect components. The direct component, which contains most of the high frequencies, is not pre-computed with spherical harmonics as in PRT; instead it is evaluated on-the-fly using pre-computed light-visibility convolution data. We demonstrate our framework by the rendering of a variety of leaves and assemblies thereof.

Environment mapping, or reflection mapping, has been widely used in the game and movie industries to give objects a realistic illumination atmosphere. For moving objects, direct frame-by-frame calculation of environment maps and correspondence-based interpolation are both impractical for real-time applications due to the large computational costs. To deal with this problem, "fake" environment mapping with a fixed, pre-generated environment image has been commonly used, but clearly such an approximation is inadequate for a highly reflective object whose environment is constantly changing as it moves. In this paper, we present an approach that sparsely samples environment maps of a moving object and rapidly interpolates them for high performance. Two techniques are introduced for fast environment map interpolation without computation of scene shading. The first method utilizes scene geometry to facilitate interpolation, and the second involves geometry reconstruction from depth buffer values to reduce inefficiencies caused by complex scene geometry. These two techniques can easily be implemented in graphics hardware, and test results show that they achieve significant boosts in performance over frame-by-frame environment map computation with little loss in visual quality.