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 "fast deep stereo with 2d convolutional processing of cost signatures"):
  Abstract: Modern neural network-based algorithms are able to produce highly accurate depth estimates from stereo image pairs, nearly matching the reliability of measurements from more expensive depth sensors. However, this accuracy comes with a higher computational cost since these methods use network architectures designed to compute and process matching scores across all candidate matches at all locations, with floating point computations repeated across a match volume with dimensions corresponding to both space and disparity. This leads to longer running times to process each image pair, making them impractical for real-time use in robots and autonomous vehicles. We propose a new stereo algorithm that employs a significantly more efficient network architecture. Our method builds an initial match cost volume using traditional matching costs that are fast to compute, and trains a network to estimate disparity from this volume. Crucially, our network only employs per-pixel and two-dimensional convolution operations: to summarize the match information at each location as a low-dimensional feature vector, and to spatially process these `cost-signature' features to produce a dense disparity map. Experimental results on the KITTI benchmark show that our method delivers competitive accuracy at significantly higher speeds---running at 48 frames per second on a modern GPU.

Includes members:
  Member "practical deep stereo pds toward applications friendly deep stereo matching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "belief propagation reloaded learning bp layers for labeling problems")
  Member "segstereo exploiting semantic information for disparity estimation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dsgn deep stereo geometry network for 3d object detection")
  Member "edgestereo a context integrated residual pyramid network for stereo matching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dsgn deep stereo geometry network for 3d object detection")
  Member "pyramid stereo matching network":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "dsgn deep stereo geometry network for 3d object detection")
  Member "sparse to dense depth prediction from sparse depth samples and a single image":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "depth estimation by learning triangulation and densification of sparse points for multi view stereo")
  Member "learning for disparity estimation through feature constancy":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "dsgn deep stereo geometry network for 3d object detection")
  Member "end to end learning of cost volume aggregation for real time dense stereo":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "real time highly accurate dense depth on a power budget using an fpga cpu hybrid soc")
  Member "computing the stereo matching cost with a convolutional neural network":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a tvsnet aggregated two view stereo network for multi view stereo depth estimation")

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)