PointNet: Deep Learning on Point Sets ... - CVF Open Access

PointNet: Deep Learning on Point Sets for 3D Classification and Segmentation Charles R. Qi* Hao Su* Kaichun Mo Leonidas J. Guibas Stanford University

  Open, Learning, Points, Deep, Sets, Pointnet, Deep learning on point sets

Finding Tiny Faces in the Wild With Generative Adversarial ...

faces, which are unfriendly for the face classifier. Toward-s this end, we design a refinement sub-network to recover some detailed information. In the discriminator network, the basic GAN [17, 12, 8] is trained to distinguish the real and fake high resolution images. To classify faces or non-

  Faces

Class-Balanced Loss Based on Effective Number of Samples

and large-scale datasets including ImageNet and iNatural-ist. Our results show that when trained with the proposed class-balanced loss, the network is able to achieve signifi-cant performance gains on long-tailed datasets. 1. Introduction The recent success of deep Convolutional Neural Net-works (CNNs) for visual recognition [26, 37, 38, 16] owes

  Scale, Visual, Recognition, Visual recognition

What Have We Learned From Deep Representations for …

what these powerful models actually have learned. In this paper we shed light on deep spatiotemporal net-works by visualizing what excites the learned models us-ing activation maximization by backpropagating on the in-put. We are the first to visualize the hierarchical features

  What, Have, Learned, What we have learned, Have learned

Squeeze-and-Excitation Networks - openaccess.thecvf.com

Squeeze-and-Excitation Networks Jie Hu1∗ Li Shen2∗ Gang Sun1 hujie@momenta.ai lishen@robots.ox.ac.uk sungang@momenta.ai 1 Momenta 2 Department of Engineering Science, University of Oxford Abstract Convolutional neural networks are built upon the con-

  Network, Excitation, Squeeze and excitation networks, Squeeze

RegularFace: Deep Face Recognition via Exclusive ...

RegularFace: Deep Face Recognition via Exclusive Regularization Kai Zhao Jingyi Xu Ming-Ming Cheng ∗ TKLNDST, CS, Nankai University kaiz.xyz@gmail.com cmm@nankai.edu.cn

  Zhao

Protecting World Leaders Against Deep Fakes

Protecting World Leaders Against Deep Fakes Shruti Agarwal and Hany Farid University of California, Berkeley Berkeley CA, USA {shrutiagarwal, hfarid}@berkeley.edu

Auto-DeepLab: Hierarchical Neural Architecture Search for ...

Auto-DeepLab: Hierarchical Neural Architecture Search for Semantic Image Segmentation Chenxi Liu1∗, Liang-Chieh Chen 2, Florian Schroff2, Hartwig Adam2, Wei Hua2, Alan Yuille1, Li Fei-Fei3 1Johns Hopkins University 2Google 3Stanford University Abstract Recently, NeuralArchitectureSearch(NAS)hassuccess-

Frustum PointNets for 3D Object Detection From RGB-D Data

Frustum PointNets for 3D Object Detection from RGB-D Data Charles R. Qi1∗ Wei Liu2 Chenxia Wu2 Hao Su3 Leonidas J. Guibas1 1Stanford University 2Nuro, Inc. 3UC San Diego Abstract In this work, we study 3D object detection from RGB-D data in both indoor and outdoor scenes.

ESRGAN: Enhanced Super-Resolution Generative Adversarial ...

ESRGAN: EnhancedSuper-Resolution Generative Adversarial Networks Xintao Wang 1, Ke Yu , Shixiang Wu2, Jinjin Gu3, Yihao Liu4, Chao Dong 2, Yu Qiao , and Chen Change Loy5 1 CUHK-SenseTime Joint Lab, The Chinese University of Hong Kong 2 Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences 3 The Chinese University of Hong Kong, …

  Network, Adversarial, Generative, Generative adversarial, Generative adversarial networks

CS224W: Machine Learning with Graphs Jure Leskovec, http ...

Machine Learning Algorithms and graph theory Probability and statistics Programming: You should be able to write non-trivial programs (in Python) Familiarity with PyTorch is a plus 9/22/2021 Jure Leskovec, Stanford CS224W: Machine Learning with Graphs 15

  Learning, Graph

HOW POWERFUL ARE GRAPH NEURAL NETWORKS

Learning with graph structured data, such as molecules, social, biological, and financial networks, requires effective representation of their graph structure (Hamilton et al., 2017b). Recently, there has been a surge of interest in Graph Neural Network (GNN) approaches for representation learning

  With, Learning, Graph, Learning with graph

Representation Learning on Graphs: Methods and Applications

learning approaches treat this problem as machine learning task itself, using a data-driven approach to learn embeddings that encode graph structure. Here we provide an overview of recent advancements in representation learning on graphs, reviewing tech-niques for representing both nodes and entire subgraphs.

  Learning, Graph

Pietro Lio` arXiv:1710.10903v3 [stat.ML] 4 Feb 2018

Montreal Institute for Learning Algorithms´ yoshua.umontreal@gmail.com ABSTRACT We present graph attention networks (GATs), novel neural network architectures that operate on graph-structured data, leveraging masked self-attentional layers to address the shortcomings of prior methods based on graph convolutions or their approximations.

  Network, Learning, Attention, Graph, Graph attention networks

Spatio-Temporal Graph Convolutional Networks: A Deep ...

graph convolutional networks, for trafÞc forecasting tasks. This architecture comprises several spatio-temporal convolu-tional blocks, which are a combination of graph convolutional layers[Defferrardet al., 2016] and convolutional sequence learning layers, to model spatial and temporal dependencies.

  Network, Learning, Graph, Convolutional, Temporal, Positas, Spatio temporal graph convolutional networks

Graph Representation Learning - McGill University School ...

on graph representation learning, including techniques for deep graph embeddings, generalizations of convolutional neural networks to graph-structured data, and neural message-passing approaches inspired by belief propagation. These advances in graph representation learning have led to new state-of-the-art results in numerous domains,

  Learning, Graph

Diffusion on a Graph - Florida State University

Diffusion on a Graph What if the diffusing substance moves along edges of a graph from node to node? In this case, the domain is discrete, not a continuum. Let c be the diffusion rate across the edge, then the amount of substance that moves from node j to node iover a time period dt is c",−". /#and from node ito node j is c".−", /#. So

  Graph