• A simple and effective multi-site brain disease recognition framework based on tensor decomposition and personalized federated learning is proposed to quickly integrate samples from different hospitals/sites while enabling personalized feature extraction at each site. • A designed Dynamic Prototype Aggregation (DPA) module utilizes a sliding window technique to capture the intrinsic characteristics of time-varying BOLD signals. • A dual-feature aggregation module is designed to aggregate coarse-grained shared features and fine-grained prototype representation features, respectively, to facilitate efficient knowledge sharing among sites. Brain diseases significantly impact physical and mental health, making the development of models to identify biomarkers for early diagnosis essential. However, building high-quality models typically relies on large-scale datasets, while the privacy-sensitive nature of medical data often restricts its sharing and utilization. Multi-site studies provide a potential solution by integrating data from various sources, yet existing methods frequently neglect site-specific private features, such as demographic information. Therefore, in this paper, we propose a simple yet effective framework based on Tensor Decomposition and Personalized Federated Learning (TDPFL) for multi-site brain disease recognition, while protecting these private features. On the central server, we designed a dual feature aggregation module to facilitate efficient knowledge sharing among sites. On the client side, we introduced a personalized branch to safeguard private information ( i.e. , age, gender, and education) and developed a tensor decomposition module to extract features from subjects’ brain scan data. Furthermore, we developed a dynamic prototype aggregation module to monitor evolving brain features over time. This mechanism enhances the model’s capacity to capture these dynamics, thereby improving classification and prediction accuracy. Experiments on two publicly available rs-fMRI datasets across six sites showed that TDPFL outperformed baseline methods with a 4 % improvement in average classification accuracy. Additionally, we identified site-specific brain disease-related biomarkers, offering novel insights into early diagnosis. Code is available at https://github.com/ChaojunZ/TDPFL.git

Recently, most image segmentation methods exhibit an extreme trade-off between performance and efficiency, resulting in approaches with high performance typically having low computational efficiency, while efficient methods compromise on segmentation accuracy. To address this dual challenge, this study introduces a simple yet efficient segmentation framework based on Multi-scale Prototype matching and visual Sparse Attention mechanisms (MPSA), which is a transformer-based architecture designed to optimize the balance between performance and efficiency. The proposed MPSA integrates a novel lightweight cross-attention mechanism and prototype selection and filtering strategy to accurately correlate category queries with corresponding visual objects with a multi-scale Feature Pyramid Network (FPN). Within the pixel decoder, our Axial Convolution Enhanced (ACE) module mitigates lost global context by combining depth-wise separable convolutions with deformable convolutions, thereby recovering global semantics while preserving fine-grained spatial details. Through this innovative design, MPSA demonstrates outstanding performance in both semantic and panoptic segmentation tasks across multiple datasets. Remarkably, MPSA achieves surprising 83.9% mIoU with only 114M parameters on the Cityscapes dataset while compared to some state-of-the-art architectures, highlighting its ability to deliver exceptional results with significantly reduced resource consumption. Our code is released at https://github.com/zxqing01/MPSA.

Nuclei segmentation is a critical step in the automated analysis of digitized microscopic images, which facilitates analysis of pathological images. The current state-of-the-art (SOTA) methods for nuclei segmentation require significant time and resources to provide pixel-level annotations for training. To reduce the labor-intensive annotation cost, we propose CCBox, a high-quality nuclei segmentation network that only requires bounding box annotations. We first generate hard pseudo labels for each nuclei within the bounding boxes using the traditional methods and then train a nuclei segmentation network with these hard pseudo labels. The major challenge lies in the presence of significant noise in the boundary regions of the nuclei due to the susceptibility of traditional methods to complex texture information in pathological images, impacting the model’s segmentation performance at the nucleus boundaries. To address this challenge, we propose the consistency constraint for similarity maps (CSM) strategy, which aggregates pixel features of the same semantics and enhances the discriminability of foreground and background features at the nucleus boundaries. Furthermore, to mitigate the overfitting of the model to noisy samples in the hard pseudo labels, we employ the hard-soft joint supervision strategy to supervise the student network. Extensive experiment results demonstrate that our CCBox significantly narrows the gap between box-supervised and fully-supervised nuclei segmentation methods.

Query compilation and hardware acceleration are important technologies for optimizing the performance of data processing engines. There have been many works on the exploration and adoption of these techniques in recent years. However, a number of engines still refrain from adopting them because of some reasons. One of the common reasons claims that the intricacies of these techniques make engines too complex to maintain. Another major barrier is the lack of widely accepted architectures and libraries of these techniques, which leads to the adoption often starting from scratch with lots of effort. In this paper, we propose Intel Big Data Analytic Toolkit (BDTK), an open-source C++ acceleration toolkit library for analytical data processing engines. BDTK provides lightweight, easy-to-connect, reusable components with interoperable interfaces to support query compilation and hardware accelerators. The query compilation in BDTK leverages vectorized execution and data-centric code generation to achieve high performance. BDTK could be integrated into different engines and helps them to adapt query compilation and hardware accelerators to optimize performance bottlenecks with less engineering effort.