Diffusion-based technologies have made significant strides, particularly in personalized and customized facial generation. However, existing methods struggle to achieve high-fidelity and detailed identity (ID) consistency. This is mainly due to two challenges: insufficient fine-grained control over specific facial areas and the absence of a comprehensive strategy for ID preservation that accounts for both intricate facial details and the overall facial structure. To address these limitations, we introduce ConsistentID, an innovative method crafted for diverse identity-preserving portrait generation under fine-grained multimodal facial prompts, utilizing only a single reference image. ConsistentID comprises two core components: a multimodal facial prompt generator and an ID-preservation network. The facial prompt generator combines localized facial features, facial feature descriptions, and overall facial descriptions to enhance the precision of facial detail reconstruction. The ID-preservation network, optimized with a facial attention localization strategy, ensures consistent identity preservation across facial regions. Together, these components leverage fine-grained multimodal identity information to improve identity preservation accuracy significantly. To drive ConsistentID's training, we propose a fine-grained portrait dataset, FGID, with over 500,000 facial images, offering greater diversity and comprehensiveness than existing public facial datasets. Experimental results substantiate that our ConsistentID achieves exceptional precision and diversity in personalized facial generation, surpassing existing methods in the MyStyle dataset. In addition, although ConsistentID introduces more multimodal ID information, it still maintains rapid inference speed during the generation process.
By synergizing graph topology with the global expressive power of the attention mechanism, Graph Transformers (GTs) have emerged as a dominant architecture for node classification. However, existing models primarily focus on diverse topology injection mechanisms, specifically score-level and representation-level designs, yet lack a unified theoretical foundation to characterize how these mechanisms shape the representation propagation. To bridge this research gap, this paper unifies these designs under a common Graph Signal Denoising framework, revealing that denoising efficacy (\textit{i.e.}, representation quality) is fundamentally dictated by the block-diagonal structure of the propagation operator. To instantiate this prior efficiently, this paper introduces a novel Block-Diagonal GT architecture, named \textsc{BDFormer}, which enforces a block-diagonal constraint via spectral-regularized cross-attention on latent anchors. Specifically, by routing global interactions through these anchors, \textsc{BDFormer} imposes the spectral block-constraint directly on the anchor-level affinity. Crucially, the learned global affinity guides the pruning of local heterophilous edges, ensuring that both scales synergistically adhere to the target distribution. Extensive evaluations on benchmark datasets demonstrate the scalability and robustness of \textsc{BDFormer}.
Brain network classification is pivotal for diagnosing neurological disorders, yet clinical interpretability and the identification of discriminative biomarkers fundamentally rely on precise functional parcellation. However, existing graph learning models for brain network analysis typically suffer from a critical limitation termed spectral unreachability. This stems from the widely used coupled encoder-pooling architecture, where the inherent representation smoothing property of graph encoders (including Graph Neural Networks and Graph Transformers) inevitably corrupts the high-frequency topological signals essential for delineating sharp functional boundaries. To solve this issue, the Hierarchical Spectral Parcellation Network (HiSP-Net) is proposed. Adopting a philosophy, HiSP-Net structurally decouples partition learning from representation smoothing. Specifically, this model is constructed as a hierarchy of Spectral Parcellation blocks. Within each block, node (or module) representations are mapped directly via a topology-agnostic projection into a partition space to preserve high-frequency details, while a Topology-Aware Alignment mechanism enforces spatial coherence using a joint structural objective. Extensive evaluations on real-world datasets show the capability of HiSP-Net in achieving superior classification performance and extracting interpretable functional biomarkers. The source code is publicly available at https://anonymous.4open.science/r/HiSP-Net-demo-0F62/
Understanding high-resolution images remains a significant challenge for multimodal large language models (MLLMs). Recent study address this issue by dividing the image into smaller crops and computing the semantic similarity between each crop and a query using a pretrained retrieval-augmented generation (RAG) model. The most relevant crops are then selected to localize the target object and suppress irrelevant information. However, such crop-based processing can fragment complete objects across multiple crops, thereby disrupting the computation of semantic similarity. In our experiments, we find that image crops of objects with different sizes are better handled at different resolutions. Based on this observation, we propose \textbf{\textit{Multi-resolution Retrieval-Detection (MRD)}}, a training-free framework for high-resolution image understanding. To address the issue of semantic similarity bias caused by objects being split across different image crops, we propose a multi-resolution semantic fusion method, which integrates semantic similarity maps obtained at different resolutions to produce more accurate semantic information and preserve the integrity of target objects. Furthermore, to achieve direct localization of target objects at a global scale, we introduce an open-vocalbulary object detection (OVD) model that identifies object regions using a sliding-window approach.Experiments on high-resolution image understanding benchmarks using different MLLMs demonstrate the effectiveness of our approach.
Drone (or unmanned aerial vehicle) has been extensively applied in many modern artificial intelligence systems in the past decade. In this work, we propose a novel deep hashing framework that can detect objects from drone-captured pictures extremely fast. Our method can intrinsically and flexibly encode various topological structures from each target object, based on which multiscale objects can be discovered in a view- and altitude-invariant way. Moreover, by leveraging $l_{F}$ and $l_{1}$ norms collaboratively, the calculated hash codes are robust to low-quality drone pictures and possibly contaminated semantic labels. More specifically, for each drone picture, we extract visually/semantically salient object parts inside it. To characterize their topological structure, we construct a graphlet by linking the spatially adjacent object patches into a small graph. Subsequently, a binary matrix factorization (MF) is designed to hierarchically exploit the semantics of these graphlets, wherein three attributes: 1) deep binary hash codes learning; 2) contaminated pictures/labels denoising; and 3) adaptive data graph updating are seamlessly incorporated. Accordingly, a manifold-regularized feature selector is adopted to further obtain more discriminative deep hash codes. Finally, the selected hash codes corresponding to graphlets within each drone photograph are utilized for ranking-based object discovery. Comprehensive experiments on the DAC-SDC, MOHR, and our self-compiled dataset have demonstrated the competitive speed and accuracy of our method.
