Italy

Graph Convolutional Network (GCN) is adopted to tackle the problem of convolution operation in non-Euclidean space. Previous works on GCN have made some progress, however, one of their limitations is that the design of Adjacency Matrix (AM) as GCN input requires domain knowledge and such process is cumbersome, tedious and error-prone. In addition, entries of a fixed Adjacency Matrix are generally designed as binary values (i.e., ones and zeros) which can not reflect the real relationship between nodes. Meanwhile, many applications require a weighted and dynamic Adjacency Matrix instead of an unweighted and fixed AM, and there are few works focusing on designing a more flexible Adjacency Matrix. To that end, we propose an end-to-end algorithm to improve the GCN performance by focusing on the Adjacency Matrix. We first provide a calculation method called node information entropy to update the matrix. Then, we perform the search strategy in a continuous space and introduce the Deep Deterministic Policy Gradient (DDPG) method to overcome the drawback of the discrete space search. Finally, we integrate the GCN and reinforcement learning into an end-to-end framework. Our method can automatically define the Adjacency Matrix without prior knowledge. At the same time, the proposed approach can deal with any size of the matrix and provide a better AM for network. Four popular datasets are selected to evaluate the capability of our algorithm. The method in this paper achieves the state-of-the-art performance on Cora and Pubmed datasets, with the accuracy of 84.6% and 81.6% respectively.

ICPR 2020

AOAM: Automatic Optimization of Adjacency Matrix for Graph Convolutional Network

end-to-end.

adjacency matrix

graph convolutional network

ICPR 2020 is the premier international conference on Pattern Recognition, gathering leading researchers from around the world to present their latest achievements in Pattern Analysis and Recognition, applied Artificial Intelligence and Machine Learning. The topic of the year is " Putting Artificial intelligence to work on Patterns". 
For the first time, ICPR has employed a two-round review process similar to journal submissions, with new papers allowed to be submitted in either the first or second round and papers submitted in the first round and not accepted allowed to be revised and re-submitted for second round review. 

In this edition of the **ICPR 2020** Conference, there are 1407 Oral/Poster presentations organized in five Tracks: 
- Artificial Intelligence, Machine Learning for Pattern Analysis; 
- Biometrics, Human Analysis and Behavior Understanding; Computer Vision, Robotics and Intelligent Systems; 
- Document and Media Analysis; and 
- Image and Signal Processing. 

The **ICPR 2020** Main Conference program also includes 7 Keynotes from prominent world-renowned scientists, 8 Tutorials, 28 Demos, 8 Challenges, 2 Panels, as well as an Industry/Sponsor Exhibition. In addition, 41 Workshops on a range of important current and emerging research topics complete the ICPR 2020 program. 


poster

Monocular depth estimation is a challenging problem in computer vision and is crucial for understanding 3D scene geometry. Recently, deep convolutional neural networks (DCNNs) based methods have improved the estimation accuracy significantly. However, existing methods fail to consider complex textures and geometries in scenes, thereby resulting in loss of local details, distorted object boundaries, and blurry reconstruction. In this paper, we proposed an end-to-end multi-scale residual pyramid attention network (MRPAN) to mitigate these problems. First, we propose a multi-scale attention context aggregation (MACA) module, which consists of spatial attention module (SAM) and global attention module (GAM). By considering the position and scale correlation of pixels from spatial and global perspectives, the proposed module can adaptively learn the similarity between pixels so as to obtain more global context information of the image and recover complex structures in the scene. Then we proposed an improved residual refinement module (RRM) to further refine the scene structure, giving
rise to deeper semantic information and retain more local details. Experimental results show that our method achieves more promising performance in object boundaries and local details compared with other state-of-the-art methods.

Multi-scale Residual Pyramid Attention Network for Monocular Depth Estimation

A simple but effective deep clustering method.

(Not Too) Deep Clustering via Clustering the Local Manifold of an Autoencoded Embedding


One important and particularly challenging step in the optical character recognition of historical documents with complex layouts, such as newspapers, is the separation of text from non-text content (e.g. page borders or illustrations). This step is commonly referred to as page segmentation. While various rule-based algorithms have been proposed, the applicability of Deep Neural Networks for this task recently has gained a lot of attention. In this paper, we perform a systematic evaluation of 11 different published backbone architectures and 9 different tiling and scaling configurations for separating text, tables or table column lines. We also show the influence of the number of labels and the number of training pages on the segmentation quality, which we measure using the Matthews Correlation Coefficient. Our results show that (depending on the task) Inception-ResNet- v2 and EfficientNet backbones work best, vertical tiling is generally preferable to other tiling approaches, and training data that comprises 30 to 40 pages will be sufficient most of the time.

An Evaluation of DNN Architectures for Page Segmentation of Historical Newspapers

Current 3D object detection methods adopt an analogous box prediction structure with the 2D methods, which predict center and size of the object simultaneously in a box regression procedure, leading to the poor performance of 3D detector to a great extent. In this work, we propose S-VoteNet, which converts the prediction of 3D bounding box into two parts: center prediction and size prediction. By introducing a novel spherical proposal, S-VoteNet uses vote groups to predict the center and radius of object rather than all parameters of 3D bounding box. The prediction of radius is used to constrain the object size, and the radius-based spherical center loss is applied to measure the geometric distance between the proposal and ground-truth. To make better use of the geometric information provided by point cloud, S-VoteNet gathers seed points whose corresponding votes are within the vote groups for seed group generation. Seed groups are then consumed for box size regression and orientation estimation. By decoupling the localization and size estimation, our method effectively reduces the regression pressure of the 3D detector. Experimental results on SUN RGB-D 3D detection benchmark demonstrate that our S-VoteNet achieves state-of-the-art performance by using only point cloud as input.

S-VoteNet: Deep Hough Voting with Spherical Proposal for 3D Object Detection

We propose a new hierarchical method to match keypoints by exploiting information across multiple scales. Traditionally, for each keypoint a single scale is detected and the matching process is done in the specific scale. We replace this approach with matching across scale-space. The holistic information from higher scales are used for early rejection of candidates that are far away in the feature space. The more localized and finer details of lower scale are then used to decide between remaining possible points. The proposed multi-scale solution is more consistent with the multi-scale processing that is present in the human visual system and is therefore biologically plausible. We evaluate our method on several datasets and achieve state of the art accuracy, while significantly outperforming others in extraction time.

Multi-Scale Keypoint Matching


In recent years, the advances in Generative Adversarial
Networks (GANs) have shown impressive results for image
generation and translation tasks. In particular, the image-toimage
translation is a method of learning mapping from a source
domain to a target domain and synthesizing an image. Image-toimage
translation can be applied to a variety of tasks, making
it possible to quickly and easily synthesize realistic images from
semantic segmentation masks. However, in the existing image-toimage
translation method, there is a limitation on controlling the
style of the translated image, and it is not easy to synthesize
an image by controlling the style of each mask element in
detail. Therefore, we propose an image synthesis method that
controls the style of each element by improving the existing
image-to-image translation method. In the proposed method, we
implement a mask style encoder that extracts style features for
each mask element. The extracted style features are concatenated
to the semantic mask in the normalization layer, and used
the style-controlled image synthesis of each mask element. In
the experiments, we performed style-controlled images synthesis
using the datasets consisting of semantic segmentation masks
and real images. The results show that the proposed method has
excellent performance for style-controlled images synthesis for
each element.

Mask-based Style-Controlled Image Synthesis Using a Mask Style Encoder

It has recently become a major threat to the public media that fake videos are rapidly spreading over the Internet. The advent of Deepfake, a deep-learning based toolkit, has facilitated a massive abuse of improper synthesized videos, which may influence the media credibility and human rights. A worldwide alert has been set off that finding ways to detect such fake videos is not only crucial but also urgent. This paper reports a novel approach to expose deepfake videos. We found that most fake videos are markedly different from the real ones in the way the eyes move. We are thus motivated to define four features that could well capture such differences. The features are then fed to SVM for classification. It is shown to be a promising approach that without high dimensional features and complicated neural networks, we are able to achieve competitive results on several public datasets.

Exposing Deepfake Videos by Tracking Eye Movements

Video-based person re-identification has received
increasing attention recently, as it plays an important role within
surveillance video analysis. Video-based Re-ID is an expansion
of earlier image-based re-identification methods by learning
features from a video via multiple image frames for each person.
Most contemporary video Re-ID methods utilise complex CNNbased
network architectures using 3D convolution or multibranch
networks to extract spatial-temporal video features.
By contrast, in this paper, we illustrate superior performance
from a simple single stream 2D convolution network leveraging
the ResNet50-IBN architecture to extract frame-level features
followed by temporal attention for clip level features. These clip
level features can be generalised to extract video level features by
averaging without any significant additional cost. Our approach
uses best video Re-ID practice and transfer learning between
datasets to outperform existing state-of-the-art approaches on the
MARS, PRID2011 and iLIDS-VID datasets with 89,62%, 97,75%,
97,33% rank-1 accuracy respectively and with 84:61% mAP for
MARS, without reliance on complex and memory intensive 3D
convolutions or multi-stream networks architectures as found
in other contemporary work. Conversely, our work shows that
global features extracted by the 2D convolution network are a
sufficient representation for robust state of the art video Re-ID.

Not 3D Re-ID: Simple Single Stream 2D Convolution for Robust Video Re-identification

Accurately detecting craters in remotely sensed images is an important task when analysing the properties of planetary bodies. Commonly, only large craters in the range of several kilometres are detected. In this work we provide the first example of automatically detecting tiny craters in the range of several meters with the help of a deep neural network by using only a small set of annotated craters. Additionally, we propose a novel way to group overlapping detections and replace the commonly used non-maximum suppression with a probabilistic treatment. As a result, we receive valuable uncertainty estimates of the detections and the aggregated detections are shown to be vastly superior.

Uncertainty Guided Recognition of Tiny Craters on the Moon


In this paper, we propose to exploit the side-tuning framework for multimodal document classification. Side-tuning is a methodology for network adaptation recently introduced to solve some of the problems related to previous approaches. Thanks to this technique it is actually possible to overcome model rigidity and catastrophic forgetting of transfer learning by fine- tuning. The proposed solution uses off-the-shelf deep learning architectures leveraging the side-tuning framework to combine a base model with a tandem of two side networks. We show that side-tuning can be successfully employed also when different data sources are considered, e.g. text and images in document classification. The experimental results show that this approach pushes further the limit for document classification accuracy with respect to the state of the art.

Premium content

AOAM: Automatic Optimization of Adjacency Matrix for Graph Convolutional Network

Downloads

Next from ICPR 2020

Multi-scale Residual Pyramid Attention Network for Monocular Depth Estimation

Similar lecture

Sketch-SNet: Deeper Subdivision of Temporal Cues for Sketch Recognition