SearcharxivSearch

arXiv subjects

Qing Zeng

Publications and source records attributed to Qing Zeng.

5 recordsLinked to original sources

Simple is what you need for efficient and accurate medical image segmentation

While modern segmentation models often prioritize performance over practicality, we advocate a design philosophy prioritizing simplicity and efficiency, and attempted high performance segmentation model design. This paper presents SimpleUNet, a scalable ultra-lightweight medical image segmentation model with three key innovations: (1) A partial feature selection mechanism in skip connections for redundancy reduction while enhancing segmentation performance; (2) A fixed-width architecture that prevents exponential parameter growth across network stages; (3) An adaptive feature fusion module achieving enhanced representation with minimal computational overhead. With a record-breaking 16 KB parameter configuration, SimpleUNet outperforms LBUNet and other lightweight benchmarks across multiple public datasets. The 0.67 MB variant achieves superior efficiency (8.60 GFLOPs) and accuracy, attaining a mean DSC/IoU of 85.76%/75.60% on multi-center breast lesion datasets, surpassing both U-Net and TransUNet. Evaluations on skin lesion datasets (ISIC 2017/2018: mDice 84.86%/88.77%) and endoscopic polyp segmentation (KVASIR-SEG: 86.46%/76.48% mDice/mIoU) confirm consistent dominance over state-of-the-art models. This work demonstrates that extreme model compression need not compromise performance, providing new insights for efficient and accurate medical image segmentation. Codes can be found at https://github.com/Frankyu5666666/SimpleUNet.

eess.IV

Weakly distance-regular digraphs whose underlying graphs are distance-regular,II

Weakly distance-regular digraphs are a natural directed version of distance-regular graphs. In [16], we classified all commutative weakly distance-regular digraphs whose underlying graphs are Hamming graphs, folded n-cubes, or Doob graphs. In this paper, we classify all commutative weakly distance-regular digraphs whose underlying graphs are Johnson graphs or folded Johnson graphs.

math.CO

Weakly distance-regular digraphs whose underlying graphs are distance-regular, I

Weakly distance-regular digraphs are a natural directed version of distance-regular graphs. In [8], the third author and Suzuki proposed a question when an orientation of a distance-regular graph defines a weakly distance-regular digraph. In this paper, we initiate this project, and classify all commutative weakly distance-regular digraphs whose underlying graphs are Hamming graphs, folded n-cubes and Doob graphs, respectively.

math.CO

Perfect codes in quintic Cayley graphs on abelian groups

A subset $C$ of the vertex set of a graph $\Gamma$ is called a perfect code of $\Gamma$ if every vertex of $\Gamma$ is at distance no more than one to exactly one vertex in $C$. In this paper, we classify all connected quintic Cayley graphs on abelian groups that admit a perfect code, and determine completely all perfect codes of such graphs.

math.CO