arXiv subjects

Yan Kong

Publications and source records attributed to Yan Kong.

11 recordsLinked to original sources

arXiv2026

4$\pi$ Planning for the Reduction of Predicted Hematologic Toxicity Risk in Cervical Cancer Radiotherapy

Purpose: In conventional coplanar radiotherapy for cervical cancer, nearby pelvic bones receive high radiation doses, increasing the risk of acute hematologic toxicity (HT). This study aims to estimate the HT risk reduction achievable with non-coplanar (4$\pi$) radiotherapy. Methods: We retrospectively analyzed 114 cervical cancer patients treated with coplanar volumetric modulated arc therapy (VMAT) between 2021 and 2023. Radiomic features from planning CTs were extracted and combined with clinical and dosimetric data to train predictive machine learning models. Patients were then replanned using integrated non-coplanar beam orientation and fluence map optimization (4$\pi$ planning). The top performing model was applied to these new plans to evaluate potential HT reduction. Results: Models combined radiomics, clinical, and dosimetric features achieved the highest predictive performance (AUC = 0.79). Feature importance analysis highlighted CT radiomic and dosimetric variables as the strongest predictors. Compared to VMAT, 4$\pi$ non-coplanar planning significantly reduced doses to the bone marrow (V10Gy, V20Gy, V30Gy, and V40Gy by 28%, 52%, 47%, and 33%, respectively) while significantly reducing dose to other pelvic organs at risk (OAR). When evaluated by the model, this improved dosimetry translated into a 23% reduction in predicted HT risk (risk ratio: 0.77; 95% CI: 0.75-0.79 and odds ratio: 0.68; 95% CI:0.65-0.71). Conclusions: Non-coplanar 4$\pi$ radiotherapy significantly lowers radiation doses to major pelvic bones during cervical cancer treatment without compromising target coverage or sparing of other OARs. Based on our predictive model, this superior dosimetry should translate to a marked reduction in acute hematologic toxicity.

physics.med-ph↗

arXiv2026

Dynamic Spectral Filtering for Temporal Graph Learning: Learning Evolving Propagation Operators

Temporal graph learning is commonly organized around the evolution of node states or the encoding of interaction histories. We study an underexplored, operator-centric question: should the graph propagation mechanism itself evolve over time? We introduce Dynamic Spectral Filtering (DSF), which represents propagation at snapshot t by a Chebyshev polynomial filter with vector-valued, time-dependent coefficients. DSF explicitly treats these compact multi-order coefficients as recurrent temporal states. A recurrent branch proposes updates, while multiplicative global and order-specific gates regulate their magnitude. The temporal state is independent of the number of nodes. On MOOC, Wikipedia, and Reddit temporal link-prediction benchmarks, converged DSF runs attain AP scores of 0.7851, 0.9088, and 0.9860, respectively, with 93K to 133K trainable parameters, 68 to 182 MB peak GPU memory, and 1.6 to 2.1 seconds of training per epoch. Against the closely related DEFT baseline, DSF is better on MOOC, within 0.001 AP on Reddit, and modestly lower on Wikipedia, while using 8.3 to 8.6 times fewer parameters, 25 to 33 times less GPU memory, and 5 to 19 times less time per epoch. Relative to all measured alternatives, it uses 3.3 to 38.6 times less GPU memory. These results support direct spectral-response evolution as a useful temporal inductive bias when computational efficiency is a first-class requirement.

cs.AI↗

arXiv2026

Prediction of Radiotherapy-Induced Hematologic Toxicity in Cervical Cancer with Cohort-Aware Framework

Hematologic toxicity (HT) is a major dose-limiting complication of pelvic radiotherapy for cervical cancer. Although radiomic and dosiomic features improve HT prediction beyond dosimetric metrics, their performance is highly sensitive to contour variability, limiting generalizability. We developed a cohort-aware representation-learning framework to address this challenge. We retrospectively analyzed 152 cervical cancer patients treated with pelvic radiotherapy without concurrent chemotherapy. Patients were divided into two cohorts based on the operators performing pelvic bone segmentation. HT prediction models were developed using cohort-specific training, pooled training, statistical harmonization, and a cohort-aware neural network (CANN) that learns shared and cohort-specific representations with contrastive regularization. Performance was evaluated using cross-validation and an independent test set. Cohort-specific models achieved test AUCs of 0.77 and 0.71, outperforming a dosimetry-only model (AUC=0.58). Directly pooling cohorts reduced performance (test AUC=0.64). Statistical harmonization provided limited benefit, while adversarial and correlation-based alignment further degraded performance. CANN achieved the best balance between robustness and generalizability (test AUC=0.72), with ablation studies confirming the importance of cohort-specific representations and contrastive alignment. These results demonstrate that cohort-aware representation learning effectively mitigates contour variability and improves the generalizability of radiomic and dosiomic models for HT prediction.

physics.med-ph↗

arXiv2026

Center-Aware Detection with Swin-based Co-DETR Framework for Cervical Cytology

Automated analysis of Pap smear images is critical for cervical cancer screening but remains challenging due to dense cell distribution and complex morphology. In this paper, we present our winning solution for the RIVA Cervical Cytology Challenge, achieving 1st place in Track B and 2nd place in Track A. Our approach leverages a powerful baseline, integrating the Co-DINO framework with a Swin-Large backbone for robust multi-scale feature extraction. To address the dataset's unique fixed-size bounding box annotations, we formulate the detection task as a center-point prediction problem. Tailoring our approach to this formulation, we introduce a center-preserving data augmentation strategy and an analytical geometric box optimization to effectively absorb localization jitter. Finally, we apply track-specific loss tuning to adapt the loss weights for each task. Experiments demonstrate that our targeted optimizations improve detection performance, providing an effective pipeline for cytology image analysis. Our code is available at https://github.com/YanKong0408/Center-DETR.

cs.CV↗

arXiv2026

VisGuardian: A Lightweight Group-based Privacy Control Technique For Front Camera Data From AR Glasses in Home Environments

Always-on sensing of AI applications on AR glasses makes traditional permission techniques ill-suited for context-dependent visual data, especially within home environments. The home presents a highly challenging privacy context due to the high density of sensitive objects, and the frequent presence of non-consenting family members, and the intimate nature of daily routines, making it a critical focus area for scalable privacy control mechanisms. Existing fine-grained controls, while offering nuanced choices, are inefficient for managing multiple private objects. We propose VisGuardian, a fine-grained content-based visual permission technique for AR glasses. VisGuardian features a group-based control mechanism that enables users to efficiently manage permissions for multiple private objects. VisGuardian detects objects using YOLO and adopts a pre-classified schema to group them. By selecting a single object, users can efficiently obscure groups of related objects based on criteria including privacy sensitivity, object category, or spatial proximity. A technical evaluation shows VisGuardian achieves mAP50 of 0.6704 with only 14.0 ms latency and a 1.7% increase in battery consumption per hour. Furthermore, a user study (N=24) comparing VisGuardian to slider-based and object-based baselines found it to be significantly faster for setting permissions and was preferred by users for its efficiency, effectiveness, and ease of use.

cs.HC↗

arXiv2026

"Privacy across the boundary": Examining Perceived Privacy Risk Across Data Transmission and Sharing Ranges of Smart Home Personal Assistants

As Smart Home Personal Assistants (SPAs) evolve into social agents, understanding user privacy necessitates interpersonal communication frameworks, such as Privacy Boundary Theory (PBT). To ground our investigation, our three-phase preliminary study (1) identified transmission and sharing ranges as key boundary-related risk factors, (2) categorized relevant SPA functions and data types, and (3) analyzed commercial practices, revealing widespread data sharing and non-transparent safeguards. A subsequent mixed-methods study (N=412 survey, N=40 interviews among the survey participants) assessed users' perceived privacy risks across data types, transmission ranges and sharing ranges. Results demonstrate a significant, non-linear escalation in perceived risk when data crosses two critical boundaries: the `public network' (transmission) and `third parties' (sharing). This boundary effect holds robustly across data types and demographics. Furthermore, risk perception is modulated by data attributes (e.g., social relational data), and contextual privacy calculus. Conversely, anonymization safeguards show limited efficacy especially for third-party sharing, a finding attributed to user distrust. These findings empirically ground PBT in the SPA context and inform design of boundary-aware privacy protection.

cs.HC↗

arXiv2024

Gaze-DETR: Using Expert Gaze to Reduce False Positives in Vulvovaginal Candidiasis Screening

Accurate detection of vulvovaginal candidiasis is critical for women's health, yet its sparse distribution and visually ambiguous characteristics pose significant challenges for accurate identification by pathologists and neural networks alike. Our eye-tracking data reveals that areas garnering sustained attention - yet not marked by experts after deliberation - are often aligned with false positives of neural networks. Leveraging this finding, we introduce Gaze-DETR, a pioneering method that integrates gaze data to enhance neural network precision by diminishing false positives. Gaze-DETR incorporates a universal gaze-guided warm-up protocol applicable across various detection methods and a gaze-guided rectification strategy specifically designed for DETR-based models. Our comprehensive tests confirm that Gaze-DETR surpasses existing leading methods, showcasing remarkable improvements in detection accuracy and generalizability.

cs.CV↗

arXiv2023

Modeling the Trade-off of Privacy Preservation and Activity Recognition on Low-Resolution Images

A computer vision system using low-resolution image sensors can provide intelligent services (e.g., activity recognition) but preserve unnecessary visual privacy information from the hardware level. However, preserving visual privacy and enabling accurate machine recognition have adversarial needs on image resolution. Modeling the trade-off of privacy preservation and machine recognition performance can guide future privacy-preserving computer vision systems using low-resolution image sensors. In this paper, using the at-home activity of daily livings (ADLs) as the scenario, we first obtained the most important visual privacy features through a user survey. Then we quantified and analyzed the effects of image resolution on human and machine recognition performance in activity recognition and privacy awareness tasks. We also investigated how modern image super-resolution techniques influence these effects. Based on the results, we proposed a method for modeling the trade-off of privacy preservation and activity recognition on low-resolution images.

cs.HC↗

arXiv2021

The 4th International Workshop on Smart Simulation and Modelling for Complex Systems

Computer-based modelling and simulation have become useful tools to facilitate humans to understand systems in different domains, such as physics, astrophysics, chemistry, biology, economics, engineering and social science. A complex system is featured with a large number of interacting components (agents, processes, etc.), whose aggregate activities are nonlinear and self-organized. Complex systems are hard to be simulated or modelled by using traditional computational approaches due to complex relationships among system components, distributed features of resources, and dynamics of environments. Meanwhile, smart systems such as multi-agent systems have demonstrated advantages and great potentials in modelling and simulating complex systems.

cs.AI↗

arXiv2020

AGE Challenge: Angle Closure Glaucoma Evaluation in Anterior Segment Optical Coherence Tomography

Angle closure glaucoma (ACG) is a more aggressive disease than open-angle glaucoma, where the abnormal anatomical structures of the anterior chamber angle (ACA) may cause an elevated intraocular pressure and gradually lead to glaucomatous optic neuropathy and eventually to visual impairment and blindness. Anterior Segment Optical Coherence Tomography (AS-OCT) imaging provides a fast and contactless way to discriminate angle closure from open angle. Although many medical image analysis algorithms have been developed for glaucoma diagnosis, only a few studies have focused on AS-OCT imaging. In particular, there is no public AS-OCT dataset available for evaluating the existing methods in a uniform way, which limits progress in the development of automated techniques for angle closure detection and assessment. To address this, we organized the Angle closure Glaucoma Evaluation challenge (AGE), held in conjunction with MICCAI 2019. The AGE challenge consisted of two tasks: scleral spur localization and angle closure classification. For this challenge, we released a large dataset of 4800 annotated AS-OCT images from 199 patients, and also proposed an evaluation framework to benchmark and compare different models. During the AGE challenge, over 200 teams registered online, and more than 1100 results were submitted for online evaluation. Finally, eight teams participated in the onsite challenge. In this paper, we summarize these eight onsite challenge methods and analyze their corresponding results for the two tasks. We further discuss limitations and future directions. In the AGE challenge, the top-performing approach had an average Euclidean Distance of 10 pixels (10um) in scleral spur localization, while in the task of angle closure classification, all the algorithms achieved satisfactory performances, with two best obtaining an accuracy rate of 100%.

cs.CV↗

arXiv2014

Image Retargeting by Content-Aware Synthesis

Real-world images usually contain vivid contents and rich textural details, which will complicate the manipulation on them. In this paper, we design a new framework based on content-aware synthesis to enhance content-aware image retargeting. By detecting the textural regions in an image, the textural image content can be synthesized rather than simply distorted or cropped. This method enables the manipulation of textural & non-textural regions with different strategy since they have different natures. We propose to retarget the textural regions by content-aware synthesis and non-textural regions by fast multi-operators. To achieve practical retargeting applications for general images, we develop an automatic and fast texture detection method that can detect multiple disjoint textural regions. We adjust the saliency of the image according to the features of the textural regions. To validate the proposed method, comparisons with state-of-the-art image targeting techniques and a user study were conducted. Convincing visual results are shown to demonstrate the effectiveness of the proposed method.

cs.GR↗