SearcharxivSearch

arXiv subjects

Beiyan Liu

Publications and source records attributed to Beiyan Liu.

2 recordsLinked to original sources

Dual-View Alignment Learning with Hierarchical-Prompt for Class-Imbalance Multi-Label Classification

Real-world datasets often exhibit class imbalance across multiple categories, manifesting as long-tailed distributions and few-shot scenarios. This is especially challenging in Class-Imbalanced Multi-Label Image Classification (CI-MLIC) tasks, where data imbalance and multi-object recognition present significant obstacles. To address these challenges, we propose a novel method termed Dual-View Alignment Learning with Hierarchical Prompt (HP-DVAL), which leverages multi-modal knowledge from vision-language pretrained (VLP) models to mitigate the class-imbalance problem in multi-label settings. Specifically, HP-DVAL employs dual-view alignment learning to transfer the powerful feature representation capabilities from VLP models by extracting complementary features for accurate image-text alignment. To better adapt VLP models for CI-MLIC tasks, we introduce a hierarchical prompt-tuning strategy that utilizes global and local prompts to learn task-specific and context-related prior knowledge. Additionally, we design a semantic consistency loss during prompt tuning to prevent learned prompts from deviating from general knowledge embedded in VLP models. The effectiveness of our approach is validated on two CI-MLIC benchmarks: MS-COCO and VOC2007. Extensive experimental results demonstrate the superiority of our method over SOTA approaches, achieving mAP improvements of 10.0\% and 5.2\% on the long-tailed multi-label image classification task, and 6.8\% and 2.9\% on the multi-label few-shot image classification task.

cs.CV

Connected signed graphs with given inertia indices and given girth

Suppose that $\Gamma=(G, \sigma)$ is a connected signed graph with at least one cycle. The number of positive, negative and zero eigenvalues of the adjacency matrix of $\Gamma$ are called positive inertia index, negative inertia index and nullity of $\Gamma$, which are denoted by $i_+(\Gamma)$, $i_-(\Gamma)$ and $\eta(\Gamma)$, respectively. Denoted by $g$ the girth, which is the length of the shortest cycle of $\Gamma$. We study relationships between the girth and the negative inertia index of $\Gamma$ in this article. We prove $i_{-}(\Gamma)\geq \lceil\frac{g}{2}\rceil-1$ and extremal signed graphs corresponding to the lower bound are characterized. Furthermore, the signed graph $\Gamma$ with $i_{-}(\Gamma)=\lceil\frac{g}{2}\rceil$ for $g\geq 4$ are given. As a by-product, the connected signed graphs with given positive inertia index, nullity and given girth are also determined, respectively.

math.SP