Automatic depression recognition is essential to depression diagnosis. In this paper, we investigate the problem of depression recognition from facial images, each of which is labeled with one Beck Depression Inventory (BDI-II) score. Because of the ambiguity between one facial image and the depression score, the annotators may not present the accurate score but tend to give those around the ground-truth one. To solve the problem, this paper adopts label distribution to annotate each image, in which each (score) label has a relevance degree. First, we apply the Gaussian distribution to generate the depression score distributions, in which the ground-truth score attains the highest degree, while the neighborhood scores also have degrees to some extent. Thus, each image can contribute to not only its ground-truth score but also neighborhood scores. Second, we generate the depression severity level distributions from the score distributions according to the mapping relationship between BDI-II score and severity level. Finally, we propose a novel method to learn joinT depression scoRE And level distribuTion, termed as TREAT. In the experiments, we compare TREAT with several state-of-the-art methods on three publicly released datasets AVEC 2013, AVEC 2014, and AVEC 2019, and the experimental results justified that TREAT achieves the best performance.

The rapid growth of digital healthcare applications has led to an increasing demand for efficient and reliable task scheduling and resource management in edge computing environments. However, the limited resources of edge servers and the need to process delay-sensitive healthcare tasks pose significant challenges. Existing solutions often need help to balance the trade-off between system cost and quality of service, particularly in resource-constrained scenarios. To address these challenges, we propose a novel cooperative task scheduling and resource management framework for digital healthcare applications in edge intelligence systems. Our approach leverages a two-step optimization strategy that combines the Multi-armed Combinatorial Selection Problem (MCSP) for task scheduling and the Sequential Markov Decision Process (SMDP) with alternative reward estimation for computation offloading. The MCSP-based scheduling algorithm efficiently explores the combinatorial task scheduling space to minimize healthcare task completion time and costs. The SMDP-based offloading strategy incorporates alternative reward estimation to improve robustness against dynamic variations in the system environment. Extensive simulations using real-world healthcare data demonstrate the superior performance of our proposed framework compared to state-of-the-art baselines, achieving significant improvements in cost, task success rate, and fairness. The proposed approach enables reliable and efficient digital healthcare services in resource-constrained edge computing environments.