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 "algorithm induced prior for image restoration"):
  Abstract: This paper studies a type of image priors that are constructed implicitly through the alternating direction method of multiplier (ADMM) algorithm, called the algorithm-induced prior. Different from classical image priors which are defined before running the reconstruction algorithm, algorithm-induced priors are defined by the denoising procedure used to replace one of the two modules in the ADMM algorithm. Since such prior is not explicitly defined, analyzing the performance has been difficult in the past. #R##N#Focusing on the class of symmetric smoothing filters, this paper presents an explicit expression of the prior induced by the ADMM algorithm. The new prior is reminiscent to the conventional graph Laplacian but with stronger reconstruction performance. It can also be shown that the overall reconstruction has an efficient closed-form implementation if the associated symmetric smoothing filter is low rank. The results are validated with experiments on image inpainting.

Includes members:
  Member "plug and play priors for bright field electron tomography and sparse interpolation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "plug and play methods provably converge with properly trained denoisers")
  Member "postprocessing of compressed images via sequential denoising":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "near lossless ell_ infty constrained image decompression via deep neural network")
  Member "approximate message passing with universal denoising":
    also connected through other hyperedges:
      (none)
  Member "demystifying symmetric smoothing filters":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "adaptive image denoising by mixture adaptation")
  Member "from denoising to compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a novel learnable gradient descent type algorithm for non convex non smooth inverse problems")
  Member "monte carlo non local means random sampling for large scale image filtering":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "external patch based image restoration using importance sampling")
  Member "the emerging field of signal processing on graphs extending high dimensional data analysis to networks and other irregular domains":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "approximating spectral clustering via sampling a review")

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)