human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "non local low rank cube based tensor factorization for spectral ct reconstruction"):
  Abstract: Spectral computed tomography (CT) reconstructs material-dependent attenuation images from the projections of multiple narrow energy windows, which is meaningful for material identification and decomposition. Unfortunately, the multi-energy projection datasets usually have lower signal-noise ratios (SNR). Very recently, a spatial-spectral cube matching frame (SSCMF) was proposed to explore the non-local spatial-spectral similarities for spectral CT. This method constructs a group by clustering up a series of non-local spatial-spectral cubes. The small size of spatial patches for such a group makes the SSCMF fail to fully encode the sparsity and low-rank properties. The hard-thresholding and collaboration filtering in the SSCMF also cause difficulty in recovering the image features and spatial edges. While all the steps are operated on 4-D group, the huge computational cost and memory load might not be affordable in practice. To avoid the above limitations and further improve the image quality, we first formulate a non-local cube-based tensor instead of group to encode the sparsity and low-rank properties. Then, as a new regularizer, the Kronecker-basis-representation tensor factorization is employed into a basic spectral CT reconstruction model to enhance the capability of image feature extraction and spatial edge preservation, generating a non-local low-rank cube-based tensor factorization (NLCTF) method. Finally, the split-Bregman method is adopted to solve the NLCTF model. Both numerical simulations and preclinical mouse studies are performed to validate and evaluate the NLCTF algorithm. The results show that the NLCTF method outperforms the other state-of-the-art competing algorithms.

Includes members:
  Member "weighted low rank tensor recovery for hyperspectral image restoration":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "3d quasi recurrent neural network for hyperspectral image denoising")
  Member "generalized singular value thresholding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a benchmark for sparse coding when group sparsity meets rank minimization")
  Member "tensor based formulation and nuclear norm regularization for multienergy computed tomography":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi dimensional imaging data recovery via minimizing the partial sum of tubal nuclear norm")
  Member "a general iterative shrinkage and thresholding algorithm for non convex regularized optimization problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "binary matrix completion with nonconvex regularizers")
  Member "robust principal component analysis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.CV(Computer Vision and Pattern Recognition)