There is a growing interest in utilizing 3D culture models for stem cell and cancer cell research due to their closer resemblance to in vivo environments. In this study, human mesenchymal stem cells (MSCs) were cultured using adipocytes and osteocytes as differentiative mediums on varying concentrations of chitosan substrate. Light microscopy was employed to capture cell images from the first day to the 21st day of differentiation. Accurate image segmentation is crucial for analyzing the morphological features of the spheroids during the experimental period and for understanding MSC differentiation dynamics for therapeutic applications. Therefore, we developed an innovative, weakly supervised model, aided by convolutional neural networks, to perform label-free spheroid segmentation. Since obtaining pixel-level ground truth labels through manual annotation is labor-intensive, our approach improves the overall quality of the ground-truth map by incorporating a multi-stage process within a weakly supervised learning framework. Additionally, we developed a robust learning scheme for spheroid detection, providing a reliable foundation to study MSC differentiation dynamics. The proposed framework was systematically evaluated using low-resolution microscopic data and challenging, noisy backgrounds. The experimental results demonstrate the effectiveness of our segmentation approach in accurately separating the spheroid from the background. Furthermore, it achieves performance comparable to fully supervised state-of-the-art approaches. To quantitatively evaluate our algorithm, extensive experiments were conducted using available annotated data, confirming the reliability and robustness of our method. Our computationally extracted features can confirm the experimental results regarding alterations in MSC viability, attachment, and differentiation dynamics among the substrates with three concentrations of chitosan used. We observed the formation of more compact spheroids with higher solidity and convex area, resulting improved cell attachment and viability on the 2% chitosan substrate. Additionally, this substrate exhibited a higher propensity for differentiation into osteocytes, as evidenced by the formation of smaller and more ellipsoid spheroids.

Protein ubiquitination is a critical post-translational modification (PTMs) involved in numerous cellular processes. Identifying ubiquitination sites (Ubi-sites) on proteins offers valuable insights into their function and regulatory mechanisms. Due to the cost- and time-consuming nature of traditional approaches for Ubi-site detection, there has been a growing interest in leveraging artificial intelligence for computer-aided Ubi-site prediction. In this study, we collected experimentally verified Ubi-sites of human proteins from the dbPTM database, then conducted comprehensive state-of-the art computational methods along with standard evaluation metrics and a proper validation strategy for Ubi-site prediction. We presented the effectiveness of our framework by comparing ten machine learning (ML) based approaches in three different categories: feature-based conventional ML methods, end-to-end sequence-based deep learning (DL) techniques, and hybrid feature-based DL models. Our results revealed that DL approaches outperformed the classical ML methods, achieving a 0.902 F1-score, 0.8198 accuracy, 0.8786 precision, and 0.9147 recall as the best performance for a DL model using both raw amino acid sequences and hand-crafted features. Interestingly, our experimental results disclosed that the performance of DL methods had a positive correlation with the length of amino acid fragments, suggesting that utilizing the entire sequence can lead to more accurate predictions in future research endeavors. Additionally, we developed a meticulously curated benchmark for Ubi-site prediction in human proteins. This benchmark serves as a valuable resource for future studies, enabling fair and accurate comparisons between different methods. Overall, our work highlights the potential of ML, particularly DL techniques, in predicting Ubi-sites and furthering our knowledge of protein regulation through ubiquitination in cells.

Recognition of natural emotions from human faces is an interesting topic with a wide range of potential applications, such as human-computer interaction, automated tutoring systems, image and video retrieval, smart environments, and driver warning systems. Traditionally, facial emotion recognition systems have been evaluated on laboratory controlled data, which is not representative of the environment faced in real-world applications. To robustly recognize the facial emotions in real-world natural situations, this paper proposes an approach called extreme sparse learning, which has the ability to jointly learn a dictionary (set of basis) and a nonlinear classification model. The proposed approach combines the discriminative power of extreme learning machine with the reconstruction property of sparse representation to enable accurate classification when presented with noisy signals and imperfect data recorded in natural settings. In addition, this paper presents a new local spatio-temporal descriptor that is distinctive and pose-invariant. The proposed framework is able to achieve the state-of-the-art recognition accuracy on both acted and spontaneous facial emotion databases.

Although facial expression plays an important role in human interaction, automated facial expression analysis is still a challenging task. This paper presents a novel facial descriptor based on Phase Congruency (PC) and Local Binary Pattern (LBP) for facial expression recognition. The proposed descriptor, named Binary Pattern of Phase Congruency (BPPC), is an oriented and multi-scale local descriptor that is able to encode various patterns of face images. It is constructed by applying LBP on the oriented PC images. We evaluated the proposed method using the Cohn-Kanade (CK+) database. In our experiment, we achieved an overall detection rate of 93.83% for the six basic emotions. This shows the effectiveness of the proposed method.