SearcharxivSearch

arXiv subjects

Conghui Li

Publications and source records attributed to Conghui Li.

17 recordsLinked to original sources

Neural Architecture Distributions: A New Paradigm for Stochastic Segmentation

Stochastic segmentation seeks to represent multiple plausible masks for a single image, which is essential in safety- and quality-critical applications such as medical imaging or building defect inspection. Most existing methods introduce stochasticity by injecting continuous latent variables or by iterative denoising trajectories, whose stochastic sources are difficult to search or audit directly. We propose architecture distributions as a new stochastic source for segmentation: instead of sampling a latent variable or noise, we sample a discrete architecture from a learned distribution over operator choices at multiple searchable positions in a segmentation backbone. Each sampled architecture yields one mask through the selected active path, so inference depends on the executed subnet rather than the complete candidate bank. This approach also supports architectural provenance, since each output corresponds to a specific architecture configuration. To reduce collapse toward averaged masks, we train with set-level supervision by matching a set of architecture-sampled predictions to the annotation set using an IoU-based energy-distance surrogate. We further construct the candidate bank with evolutionary search, making the support of the stochastic source optimizable before distribution learning. The proposed method achieves state-of-the-art distribution matching and hypothesis coverage on LIDC-IDRI, and remains effective on two extension tasks. To the best of our knowledge, this is the first work to formulate stochastic segmentation as learning an architecture distribution and realizing output diversity through architecture sampling.

cs.CV

UnGAP: Uncertainty-Guided Affine Prompting for Real-Time Crack Segmentation

Real-time crack segmentation is vital for structural health monitoring but is plagued by aleatoric uncertainties arising from varying lighting, blur, and texture ambiguity. Current uncertainty-aware approaches typically treat uncertainty estimation as a passive endpoint for post-hoc analysis, failing to close the loop by feeding this information back to refine feature representations. We contend that independent pixel-wise heteroscedastic modeling is uniquely suited for crack segmentation, as cracks are defined by fine-grained local gradients rather than the global semantic coherence relied upon in general object segmentation. However, this approach suffers from a structural optimization pathology: high predicted variance attenuates loss gradients, effectively causing the model to ignore difficult samples and under-fit complex boundaries. To address these challenges, we propose UnGAP, a novel framework that establishes a closed-loop mechanism between uncertainty estimation and feature learning. Central to our approach is the Uncertainty-Prompted Feature Modulator (UPFM), which treats aleatoric uncertainty as an active visual prompt rather than a mere output. UPFM dynamically calibrates feature distributions through pixel-wise affine transformations. Crucially, this mechanism mitigates the heteroscedastic pathology by transforming high variance, which would otherwise indicate gradient suppression, into a constructive signal for stronger feature rectification in ambiguous regions. Additionally, a boundary-aware detection head is introduced to further constrain prediction precision. Extensive experiments demonstrate that UnGAP balances superior segmentation accuracy with real-time inference speed, effectively validating the benefit of transforming uncertainty from a passive metric into an active calibration tool.

cs.CV

Construction $\pi_A$ over Multiquadratic Fields for Compound Block-Fading Wiretap Channels

We construct multilevel lattice codes from multiquadratic number fields for the compound block-fading wiretap channel. More precisely, we specialize Construction $\pi_A$ over the ring of integers $\mathcal{O}_K$ and exploit rational primes that split completely in $K$ to obtain a Chinese Remainder Theorem (CRT) decomposition into small residue alphabets, notably binary, which enables multistage decoding. The resulting nested lattices fit into the algebraic Construction A framework and, when combined with discrete Gaussian shaping and flatness-factor bounds, provide universal reliability for the legitimate receiver and strong secrecy uniformly over the eavesdropper compound set.

cs.IT

Stable equivalence of Morita type and quotient fusion system

In this note, we prove that stable equivalences of Morita type between blocks of finite groups induce identification of certain quotient fusion systems under sone assumption. We also collect some related results for separable equivalences.

math.RT

A complete classification of solvable factors of almost simple groups

We give an explicit characterization of solvable factors in factorizations of finite classical groups of Lie type. This completes the classification of solvable factors in factorizations of almost simple groups, finishing the program initiated in [Memoirs of the AMS, 279 (2022), no.~1375] and [Advances in Mathematics, 377 (2021), 107499]. In particular, it resolves the final remaining case in the long-standing problem of determining exact factorizations of almost simple groups. As a byproduct, we obtain a new characterization of one-dimensional transitive groups, offering further insights into their group structures. We also apply our classification to describe quasiprimitive permutation groups with a solvable transitive subgroup, leading to an interesting result that these subgroups are ``small''.

math.GR

A First Step Towards Detecting Values-violating Defects in Android APIs

Human values are an important aspect of life and should be supported in ubiquitous technologies such as mobile applications (apps). There has been a lot of focus on fixing certain kinds of violation of human values, especially privacy, accessibility, and security while other values such as pleasure, tradition, and humility have received little focus. In this paper, we investigate the relationship between human values and Android API services and developed algorithms to detect potential violation of these values. We evaluated our algorithms with a manually curated ground truthset resulting in a high performance, and applied the algorithms to 10,000 apps. Our results show a correlation between violation of values and the presence of viruses. Our results also show that apps with the lowest number of installations contain more violation of values and the frequency of the violation of values was highest in social apps.

cs.SE

Inductive blockwise Alperin weight condition for type B and odd primes

By the reduction theorems of Navarro--Tiep and Sp\"ath, a way to prove the Alperin weight conjecture and its blockwise version is to verify the co-called inductive Alperin weight condition and inductive blockwise Alperin weight condition for all finie simple groups respectively. In this paper, we establish the inductive blockwise Alperin weight condition for simple groups of type $\mathsf B$ and odd primes, using a criterion given by Brough and Sp\"ath recently.

math.RT

On the inductive blockwise Alperin weight condition for type $\mathsf A$

In this paper we prove the blockwise Alperin weight conjecture for finite special linear and unitary groups, for finite groups with abelian Sylow $3$-subgroups, and verify the inductive blockwise Alperin weight condition for certain cases of groups of type $\mathsf A$. We also give a classification for the 2-blocks of special linear and unitary groups.

math.RT

An equivariant bijection between irreducible Brauer characters and weights for Sp(2n, q)

The longstanding Alperin weight conjecture and its blockwise version have been reduced to simple groups recently by Navarro, Tiep, Spaeth and Koshitani. Thus, to prove this conjecture, it suffices to verify the corresponding inductive condition for all finite simple groups. The first is to establish an equivariant bijection between irreducible Brauer characters and weights for the universal covering groups of simple groups. Assume q is a power of some odd prime p. We first prove the blockwise Alperin weight conjecture for Sp2n(q) and odd non-defining characteristics. If the decomposition matrix of Sp2n(q) is unitriangular with respect to an Aut(Sp2n(q))-stable basic set (this assumption holds for linear primes), we can establish an equivariant bijection between the irreducible Brauer characters and weights.

math.RT

Saliency Supervision: An Intuitive and Effective Approach for Pain Intensity Regression

Getting pain intensity from face images is an important problem in autonomous nursing systems. However, due to the limitation in data sources and the subjectiveness in pain intensity values, it is hard to adopt modern deep neural networks for this problem without domain-specific auxiliary design. Inspired by human vision priori, we propose a novel approach called saliency supervision, where we directly regularize deep networks to focus on facial area that is discriminative for pain regression. Through alternative training between saliency supervision and global loss, our method can learn sparse and robust features, which is proved helpful for pain intensity regression. We verified saliency supervision with face-verification network backbone on the widely-used dataset, and achieved state-of-art performance without bells and whistles. Our saliency supervision is intuitive in spirit, yet effective in performance. We believe such saliency supervision is essential in dealing with ill-posed datasets, and has potential in a wide range of vision tasks.

cs.CV

Coprime Sensing via Chinese Remaindering over Quadratic Fields, Part II: Generalizations and Applications

The practical application of a new class of coprime arrays based on the Chinese remainder theorem (CRT) over quadratic fields is presented in this paper. The proposed CRT arrays are constructed by ideal lattices embedded from coprime quadratic integers. The geometrical constructions and theoretical foundations were discussed in the accompanying paper in great detail, while this paper focuses on aspects of the application of the proposed arrays in two-dimensional (2D) remote sensing. A generalization of CRT arrays based on two or more pairwise coprime ideal lattices is proposed with closed-form expressions on sensor locations, the total number of sensors and the achievable DOF. The issues pertaining to the coprimality of any two quadratic integers are also addressed to explore all possible ideal lattices. Exploiting the symmetry of lattices, sensor reduction methods are discussed with the coarray remaining intact for economic maximization. In order to extend conventional angle estimation techniques based on uniformly distributed arrays to the method that can exploit any coarray configurations based on lattices, this paper introduces a hexagon-to-rectangular transformation to 2D spatial smoothing, providing the possibility of finding more compact sensor arrays. Examples are provided to verify the feasibility of the proposed methods.

eess.SP

Coprime Sensing via Chinese Remaindering over Quadratic Fields, Part I: Array Designs

A coprime antenna array consists of two or more sparse subarrays featuring enhanced degrees of freedom (DOF) and reduced mutual coupling. This paper introduces a new class of planar coprime arrays, based on the theory of ideal lattices. In quadratic number fields, a splitting prime $p$ can be decomposed into the product of two distinct prime ideals, which give rise to the two sparse subarrays. Their virtual difference coarray enjoys a quadratic gain in DOF, thanks to the generalized Chinese Remainder Theorem (CRT). To enlarge the contiguous aperture of the coarray, we present hole-free symmetric CRT arrays with simple closed-form expressions. The ring of Gaussian integers and the ring of Eisenstein integers are considered as examples to demonstrate the procedure of designing coprime arrays. With Eisenstein integers, our design yields a difference coarray that is a subset of the hexagonal lattice, offering a significant gain in DOF over the rectangular lattice, given the same physical areas.

eess.SP