Search

Context. A large fraction of Asymptotic Giant Branch (AGB) stars develop carbon-rich atmospheres during their evolution. Based on their color and luminosity, these carbon stars can be easily distinguished from many other kinds of stars. However, a large number of G, K, and M giants are also distributed in the same region as carbon stars on the HR diagram. Their spectra have differences,especially in the prominent CN molecular bands. Aims. We aim to distinguish carbon stars from other kinds of stars using Gaia's XP spectra, while providing attribution explanations of key features necessary for identification, and even discovering additional new spectral key features. Methods. We proposed a classification model named `GaiaNet', an improved one-dimensional convolutional neural network specifically designed for handling Gaia's XP spectra. We utilized the SHAP interpretability model to calculate the SHAP value for each feature point in a spectrum, enabling us to explain the output of the `GaiaNet' model and provide further meaningful analysis Results. Compared to four traditional machine-learning methods, the `GaiaNet' model exhibits an average classification accuracy improvement of approximately 0.3% on the validation set, with the highest accuracy even reaching 100%. Utilizing the SHAP algorithm, we present a clear spectroscopic heatmap highlighting molecular band absorption features primarily distributed mainly around CN773.3 and CN895.0, and summarize five crucial feature regions for carbon star identification. Upon applying the trained classification model to the CSTAR sample with Gaia `xp_sampled_mean' spectra, we obtained 451 new candidate carbon stars as a by-product., Comment: 23 pages, 22 figures

The challenge in fine-grained visual categorization lies in how to explore the subtle differences between different subclasses and achieve accurate discrimination. Previous research has relied on large-scale annotated data and pre-trained deep models to achieve the objective. However, when only a limited amount of samples is available, similar methods may become less effective. Diffusion models have been widely adopted in data augmentation due to their outstanding diversity in data generation. However, the high level of detail required for fine-grained images makes it challenging for existing methods to be directly employed. To address this issue, we propose a novel approach termed the detail reinforcement diffusion model~(DRDM), which leverages the rich knowledge of large models for fine-grained data augmentation and comprises two key components including discriminative semantic recombination (DSR) and spatial knowledge reference~(SKR). Specifically, DSR is designed to extract implicit similarity relationships from the labels and reconstruct the semantic mapping between labels and instances, which enables better discrimination of subtle differences between different subclasses. Furthermore, we introduce the SKR module, which incorporates the distributions of different datasets as references in the feature space. This allows the SKR to aggregate the high-dimensional distribution of subclass features in few-shot FGVC tasks, thus expanding the decision boundary. Through these two critical components, we effectively utilize the knowledge from large models to address the issue of data scarcity, resulting in improved performance for fine-grained visual recognition tasks. Extensive experiments demonstrate the consistent performance gain offered by our DRDM., Comment: Accepted by TETCI

Fine-grained visual categorization (FGVC) is a challenging task due to similar visual appearances between various species. Previous studies always implicitly assume that the training and test data have the same underlying distributions, and that features extracted by modern backbone architectures remain discriminative and generalize well to unseen test data. However, we empirically justify that these conditions are not always true on benchmark datasets. To this end, we combine the merits of invariant risk minimization (IRM) and information bottleneck (IB) principle to learn invariant and minimum sufficient (IMS) representations for FGVC, such that the overall model can always discover the most succinct and consistent fine-grained features. We apply the matrix-based R{\'e}nyi's $\alpha$-order entropy to simplify and stabilize the training of IB; we also design a ``soft" environment partition scheme to make IRM applicable to FGVC task. To the best of our knowledge, we are the first to address the problem of FGVC from a generalization perspective and develop a new information-theoretic solution accordingly. Extensive experiments demonstrate the consistent performance gain offered by our IMS., Comment: Manuscript accepted by CVIU, code is available at Github

Data is the foundation for the development of computer vision, and the establishment of datasets plays an important role in advancing the techniques of fine-grained visual categorization~(FGVC). In the existing FGVC datasets used in computer vision, it is generally assumed that each collected instance has fixed characteristics and the distribution of different categories is relatively balanced. In contrast, the real world scenario reveals the fact that the characteristics of instances tend to vary with time and exhibit a long-tailed distribution. Hence, the collected datasets may mislead the optimization of the fine-grained classifiers, resulting in unpleasant performance in real applications. Starting from the real-world conditions and to promote the practical progress of fine-grained visual categorization, we present a Concept Drift and Long-Tailed Distribution dataset. Specifically, the dataset is collected by gathering 11195 images of 250 instances in different species for 47 consecutive months in their natural contexts. The collection process involves dozens of crowd workers for photographing and domain experts for labelling. Extensive baseline experiments using the state-of-the-art fine-grained classification models demonstrate the issues of concept drift and long-tailed distribution existed in the dataset, which require the attention of future researches.

Filter pruning has gained widespread adoption for the purpose of compressing and speeding up convolutional neural networks (CNNs). However, existing approaches are still far from practical applications due to biased filter selection and heavy computation cost. This paper introduces a new filter pruning method that selects filters in an interpretable, multi-perspective, and lightweight manner. Specifically, we evaluate the contributions of filters from both individual and overall perspectives. For the amount of information contained in each filter, a new metric called information capacity is proposed. Inspired by the information theory, we utilize the interpretable entropy to measure the information capacity, and develop a feature-guided approximation process. For correlations among filters, another metric called information independence is designed. Since the aforementioned metrics are evaluated in a simple but effective way, we can identify and prune the least important filters with less computation cost. We conduct comprehensive experiments on benchmark datasets employing various widely-used CNN architectures to evaluate the performance of our method. For instance, on ILSVRC-2012, our method outperforms state-of-the-art methods by reducing FLOPs by 77.4% and parameters by 69.3% for ResNet-50 with only a minor decrease in accuracy of 2.64%., Comment: Accepted by IEEE Transactions on Neural Networks and Learning Systems (IEEE TNNLS).The code will be available at https://github.com/txl-hub/ICI

Fine-grained visual categorization (FGVC) aims to discriminate similar subcategories, whose main challenge is the large intraclass diversities and subtle inter-class differences. Existing FGVC methods usually select discriminant regions found by a trained model, which is prone to neglect other potential discriminant information. On the other hand, the massive interactions between the sequence of image patches in ViT make the resulting class-token contain lots of redundant information, which may also impacts FGVC performance. In this paper, we present a novel approach for FGVC, which can simultaneously make use of partial yet sufficient discriminative information in environmental cues and also compress the redundant information in class-token with respect to the target. Specifically, our model calculates the ratio of high-weight regions in a batch, adaptively adjusts the masking threshold and achieves moderate extraction of background information in the input space. Moreover, we also use the Information Bottleneck~(IB) approach to guide our network to learn a minimum sufficient representations in the feature space. Experimental results on three widely-used benchmark datasets verify that our approach can achieve outperforming performance than other state-of-the-art approaches and baseline models.

In this work, we present a catalog of cataclysmic variables (CVs) identified from the Sixth Data Release (DR6) of the Large Sky Area Multi-Object Fiber Spectroscopic Telescope (LAMOST). To single out the CV spectra, we introduce a novel machine-learning algorithm called UMAP to screen out a total of 169,509 H$\alpha$-emission spectra, and obtain a classification accuracy of the algorithm of over 99.6$\%$ from the cross-validation set. We then apply the template matching program PyHammer v2.0 to the LAMOST spectra to obtain the optimal spectral type with metallicity, which helps us identify the chromospherically active stars and potential binary stars from the 169,509 spectra. After visually inspecting all the spectra, we identify 323 CV candidates from the LAMOST database, among them 52 objects are new. We further discuss the new CV candidates in subtypes based on their spectral features, including five DN subtype during outbursts, five NL subtype and four magnetic CVs (three AM Her type and one IP type). We also find two CVs that have been previously identified by photometry, and confirm their previous classification by the LAMOST spectra.

We investigate the mKdV hierarchy with integral type of source (mKdVHWS), which consist of the reduced AKNS eigenvalue problem with $r=q$ and the mKdV hierarchy with extra term of the integration of square eigenfunction. First we propose a method to find the explicit evolution equation for eigenfunction of the auxiliary linear problems of the mKdVHWS. Then we determine the evolution equations of scattering data corresponding to the mKdVHWS which allow us to solve the equation in the mKdVHWS by inverse scattering transformation., Comment: 10 pages, Latex, to be published in Journal of Physics A