Italy

Knowledge distillation, which aims to train model under the supervision from another large model (teacher model) to the original model (student model), has achieved remarkable results in supervised learning. However, there are two major
problems with existing knowledge distillation methods. One is the teacher’s supervision is sometimes misleading, and the other is the student’s prediction is not accurate enough. To address the first issue, instead of learning a combination of
both teachers and ground truth, we apply knowledge adjustment to correct teachers’ supervision using ground truth. For the second problem, we use the selective classification framework to train the student model. In particular, the deep gambler loss is adopted to predict with reservation by explicitly introducing
the (m + 1)-th class. We consider two settings of knowledge distillation: (1) distillation across different network structures (AlexNet, ResNet), and (2) distillation across networks with different depths (ResNet18, ResNet50) to evaluate the effectiveness of our method. The experimental results on benchmark datasets
(i.e., Fashion-MNIST, SVHN, CIFAR10, CIFAR100) are reported with higher prediction accuracies and lower coverage errors.

ICPR 2020

Knowledge Distillation with a Precise Teacher and Prediction with Abstention

selective classification

supervised learning

knowledge distillation

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


A breif introduction of the proposed method for diagnosis of COVID-19 on ct images

Unsupervised Detection of Pulmonary Opacities for Computer-Aided Diagnosis of COVID-19 on CT Images

Distributed Gaussian processes (DGPs) are prominent
local approximation methods to scale Gaussian processes
(GPs) to large datasets. Instead of a global estimation, they
train local experts by dividing the training set into subsets,
thus reducing the time complexity. This strategy is based on the
conditional independence assumption, which basically means that
there is a perfect diversity between the local experts. In practice,
however, this assumption is often violated, and the aggregation
of experts leads to sub-optimal and inconsistent solutions. In
this paper, we propose a novel approach for aggregating the
Gaussian experts by detecting strong violations of conditional
independence. The dependency between experts is determined
by using a Gaussian graphical model, which yields the precision
matrix. The precision matrix encodes conditional dependencies
between experts and is used to detect strongly dependent experts
and construct an improved aggregation. Using both synthetic
and real datasets, our experimental evaluations illustrate that
our new method outperforms other state-of-the-art (SOTA) DGP
approaches while being substantially more time-efficient than
SOTA approaches, which build on independent experts.

Aggregating Dependent Gaussian Experts in Local Approximation

We develop a novel multiple instance SVM based on maximizing the minimum witness rate (WR) among positive bags. We solve this nonlinear integer programming problem by the multiple instance SVM formulation with a convex loss function, where unknown integer labels of instances in positive bags are relaxed to real numbers between -1 and 1 using the tanh(.) to estimate WR of a positive bag. The results of WR-SVM outperform the state-of-the-art for MIL-based video classification models.


A New Convex Loss Function For Multiple Instance Support Vector Machines


Situation in Image compression:  Although existing methods based on a fully convolutional network have greatly improved the performance, the reconstructed results still do not show satisfactory on the structural similarity and statistical distribution similarity of the whole image.
CNN's Shortcoming: Overdownsampling thus losing details
Proposal: In this work, we propose an GAN based dense Auto-encoder (GDAE) and Semantic-perceptual residual compensation method (SPRC) to improve the coarse results generated by front CNN and compensate the details of reconstructed image.

Adaptive Image Compression Method Using GAN based Semantic-Perceptual Residual Compensation

In this paper we propose a novel method for location recognition and prediction in smart homes based on semi-supervised learning. We use data collected from low-resolution depth video cameras installed in four apartments with older adults over 70 years of age, and collected during a period of one to seven weeks. The location of the person in the depth images is detected by a person detection algorithm adapted from YOLO (You Only Look Once). The locations extracted from the videos are then clustered using K-means clustering. Sequence prediction algorithms are used to predict the next cluster (location) based on the previous clusters (locations). The accuracy of predicting the next location is up to 91\%, a significant improvement compared to the case where binary sensors are placed in the apartment based on human intuition. The paper presents an analysis on the effect of the memory length (i.e. the number of previous clusters used to predict the next one), and on the amount of recorded data required to converge.

Location Prediction in Real Homes of Older Adults based on K-Means in Low-Resolution Depth Videos

This paper focuses on the problem of visual saliency prediction, predicting regions of an image that tend to attract human visual attention, under a constrained computational budget. We modify and test various recent efficient convolutional neural network architectures like EfficientNet and MobileNetV2 and compare them with existing state-of-the-art saliency models such as SalGAN and DeepGaze II both in terms of standard accuracy metrics like Area Under Curve (AUC) and Normalized Scanpath Saliency (NSS), and in terms of the computational complexity and model size. We find that MobileNetV2 makes an excellent backbone for a visual saliency model and can be effective even without a complex decoder. We also show that knowledge transfer from a more computationally expensive model like DeepGaze II can be achieved via pseudo-labelling an unlabelled dataset, and that this approach gives result on-par with many state-of-the-art algorithms with a fraction of the computational cost and model size.

FastSal: a Computationally Efficient Network for Visual Saliency Prediction


In this paper we define a deep multi-stage architec-
ture for automated landmarking of craniomaxillofacial (CMF)
CT images. Our model is composed of three subnetworks that
first localize, on reduced-resolution images, areas where land-
marks may be found and then refine the search, at full-resolution
scale, through a hierarchical structure aiming at increasing the
granularity of the investigated region. The multi-stage pipeline is
designed to deal with full resolution data and does not require any
additional pre-processing step to reduce search space, as opposed
to existing methods that can be only adopted for searching
landmarks located in well-defined anatomical structures (e.g.,
mandibles). The automated landmarking system is tested on
identifying landmarks located in several CMF regions, achieving
an average error of 0.8 mm, significantly lower than expert
readings. The proposed model also outperforms baselines and
is on par with existing models that employ additional upstream
segmentation, on state-of-the-art benchmarks.


Deep Recurrent-convolutional Model for Automated Segmentation of Craniomaxillofacial Ct Scans 


Malware evolves rapidly over time, which makes existing solutions being ineffective in detecting newly released malware. Machine learning models that can learn to capture malicious patterns directly from the data play an increasingly important role in malware analysis. However, traditional machine learning models heavily depend on feature engineering. The extracted static features are vulnerable as hackers could create new malware with different feature values to deceive the machine learning models. In this paper, we propose an end-to-end malware detection framework consisting of convolutional neural network, autoencoder and neural decision trees. It learns the features from multiple domains for malware detection without feature engineering. In addition, since anti-virus products should have a very low false alarm rate to avoid annoying users, we propose a special loss function, which optimizes the recall for a fixed low false positive rate (e.g., less than 0.1%). Experiments show that the proposed framework has achieved a better recall than the baseline models, and the derived loss function also makes a difference.

Malware Detection by Exploiting Deep Learning over Binary Programs

Brief introduction about the motivation, method, experiments of our work

Learning a Dynamic High-Resolution Network for Multi-Scale Pedestrian Detection


In recent years, skin cancer has become one of the most common cancers. Among all types of skin cancers, melanoma is the most fatal one and many people die of this disease every year. Early detection can greatly reduce the death rate and save more lives. Skin lesions are one of the early symptoms of melanoma and other types of skin cancer. So accurately recognizing various skin lesions in early stage is of great significance. There have been lots of existing works based on convolutional neural networks (CNN) to solve skin lesion classification but seldom do they involve the similarity among different lesions. For example, we find that some lesions like melanoma and nevi look similar in appearance which is hard for neural network to distinguish categories of skin lesions. Inspired by fine-grained image classification, we propose a novel network to distinguish each category accurately. In our paper, we design an effective module, distinct region proposal module (DRPM), to extract the distinct regions from each image. Spatial attention and channel-wise attention are both utilized to enrich feature maps and guide the network to focus on the highlighted areas in a weakly-supervised way. In addition, two preprocessing steps are added to ensure the network to get better results. We demonstrate the potential of the proposed method on ISIC 2017 dataset. Experiments show that our approach is effective and efficient.

Premium content

Downloads

Next from ICPR 2020

Unsupervised Detection of Pulmonary Opacities for Computer-Aided Diagnosis of COVID-19 on CT Images

Similar lecture

Is the Meta-Learning Idea Able to Improve the Generalization of Deep Neural Networks on the Standard Supervised Learning?