Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Piotr Semberecki

dblp:180/4918 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Generative modeling · 33% Representation and self-supervised learning · 33% 3D vision · 33%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › local feature descriptor
binary descriptor
0.312018
BinGAN: Learning Compact Binary Descriptors with a Regularized GAN · NeurIPS 2018
Machine learning › Generative modeling
generative adversarial network
0.312018
BinGAN: Learning Compact Binary Descriptors with a Regularized GAN · NeurIPS 2018
Machine learning › Representation and self-supervised learning › visual representation › image representation
image descriptor
0.312018
BinGAN: Learning Compact Binary Descriptors with a Regularized GAN · NeurIPS 2018
Information retrieval
image retrieval
0.312018
BinGAN: Learning Compact Binary Descriptors with a Regularized GAN · NeurIPS 2018

Methods — techniques the papers use, named apart from their topics

regularization · 0.7entropy maximization · 0.7
YearPublicationVenuePosition
2020 Plugin Networks for Inference under Partial Evidence
abstract
In this paper, we propose a novel method to incorporate partial evidence in the inference of deep convolutional neural networks. Contrary to the existing, top-performing methods, which either iteratively modify the input of the network or exploit external label taxonomy to take the partial evidence into account, we add separate network modules ("Plugin Networks") to the intermediate layers of a pretrained convolutional network. The goal of these modules is to incorporate additional signal, i.e. information about known labels, into the inference procedure, and adjust the predicted output accordingly. Since the attached plugins have a simple structure, consisting of only fully connected layers, we drastically reduced the computational cost of training and inference. Also, the proposed architecture allows propagating information about known labels directly to the intermediate layers to improve the final representation. Extensive evaluation of the proposed method confirms that our Plugin Networks outperform the state-of-the-art in a variety of tasks, including scene categorization, multilabel image annotation, and semantic segmentation.
Michal Koperski, Tomasz K. Konopczynski, Rafal Nowak, Piotr Semberecki, Tomasz Trzcinski
WACV4
2018 BinGAN: Learning Compact Binary Descriptors with a Regularized GAN
abstract
In this paper, we propose a novel regularization method for Generative Adversarial Networks that allows the model to learn discriminative yet compact binary representations of image patches (image descriptors). We exploit the dimensionality reduction that takes place in the intermediate layers of the discriminator network and train the binarized penultimate layer's low-dimensional representation to mimic the distribution of the higher-dimensional preceding layers. To achieve this, we introduce two loss terms that aim at: (i) reducing the correlation between the dimensions of the binarized penultimate layer's low-dimensional representation (i.e. maximizing joint entropy) and (ii) propagating the relations between the dimensions in the high-dimensional space to the low-dimensional space. We evaluate the resulting binary image descriptors on two challenging applications, image matching and retrieval, where they achieve state-of-the-art results.
Maciej Zieba, Piotr Semberecki, Tarek El-Gaaly, Tomasz Trzcinski
NeurIPS2
2017 Deep Learning methods for Subject Text Classification of Articles
abstract
This work presents a method of classification of text documents using deep neural network with LSTM (long shortterm memory) units.We have tested different approaches to build feature vectors, which represent documents to be classified: we used feature vectors constructed as sequences of words included in the documents, or, alternatively, we first converted words into vector representations using word2vec tool and used sequences of these vector representations as features of documents.We evaluated feasibility of this approach for the task of subject classification of documents using a collection of Wikipedia articles representing 7 subject categories.Our experiments show that the approach based on an LSTM network with documents represented as sequences of words coded into word2vec vectors outperformed a standard, bag-of-word approach with documents represented as frequency-of-words feature vectors.
Piotr Semberecki, Henryk Maciejewski
FedCSIS1