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

Michal J. Tyszkiewicz

dblp:268/5953 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
2since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 3 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021

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
3 papers
3D vision · 73% Generative modeling · 27%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › 3d generation › point cloud generation
conditional point cloud generation
0.712023
GECCO: Geometrically-Conditioned Point Diffusion Models · ICCV 2023
Machine learning › Generative modeling
diffusion model
0.712023
GECCO: Geometrically-Conditioned Point Diffusion Models · ICCV 2023
Machine learning › Generative modeling › diffusion model › 3d diffusion models
point cloud diffusion
0.712023
GECCO: Geometrically-Conditioned Point Diffusion Models · ICCV 2023
Computer vision › 3D vision › 3d generation
point cloud generation
0.712023
GECCO: Geometrically-Conditioned Point Diffusion Models · ICCV 2023
Computer vision › 3D vision
human mesh recovery
0.612022
RayTran: 3D Pose Estimation and Shape Reconstruction of Multiple Objects from Videos with Ray-Traced Transformers · ECCV (10) 2022
Computer vision › 3D vision › local feature descriptor
local descriptor learning
0.412020
DISK: Learning local features with policy gradient · NeurIPS 2020
Computer vision › 3D vision › feature matching
local feature detection and description
0.412020
DISK: Learning local features with policy gradient · NeurIPS 2020
Computer vision › 3D vision › feature matching
local feature matching
0.412020
DISK: Learning local features with policy gradient · NeurIPS 2020
Computer vision › 3D vision
3d scene understanding
0.212023
GECCO: Geometrically-Conditioned Point Diffusion Models · ICCV 2023

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

geometric conditioning · 0.7continuous-time diffusion · 0.7transformer · 0.6ray tracing · 0.6reinforcement learning · 0.4policy gradient · 0.4
YearPublicationVenuePosition
2023 GECCO: Geometrically-Conditioned Point Diffusion Models
abstract
Diffusion models generating images conditionally on text, such as Dall-E 2 [51] and Stable Diffusion [53], have recently made a splash far beyond the computer vision community. Here, we tackle the related problem of generating point clouds, both unconditionally, and conditionally with images. For the latter, we introduce a novel geometrically-motivated conditioning scheme based on projecting sparse image features into the point cloud and attaching them to each individual point, at every step in the denoising process. This approach improves geometric consistency and yields greater fidelity than current methods relying on unstructured, global latent codes. Additionally, we show how to apply recent continuous-time diffusion schemes [59], [21]. Our method performs on par or above the state of art on conditional and unconditional experiments on synthetic data, while being faster, lighter, and delivering tractable likelihoods. We show it can also scale to diverse indoors scenes.
Michal J. Tyszkiewicz, Pascal Fua, Eduard Trulls
ICCV1
2022 RayTran: 3D Pose Estimation and Shape Reconstruction of Multiple Objects from Videos with Ray-Traced Transformers
Michal J. Tyszkiewicz, Kevis-Kokitsi Maninis, Stefan Popov, Vittorio Ferrari
ECCV (10)1
2020 DISK: Learning local features with policy gradient
abstract
Local feature frameworks are difficult to learn in an end-to-end fashion due to the discreteness inherent to the selection and matching of sparse keypoints. We introduce DISK (DIScrete Keypoints), a novel method that overcomes these obstacles by leveraging principles from Reinforcement Learning (RL), optimizing end-to-end for a high number of correct feature matches. Our simple yet expressive probabilistic model lets us keep the training and inference regimes close, while maintaining good enough convergence properties to reliably train from scratch. Our features can be extracted very densely while remaining discriminative, challenging commonly held assumptions about what constitutes a good keypoint, as showcased in Fig. 1, and deliver state-of-the-art results on three public benchmarks.
Michal J. Tyszkiewicz, Pascal Fua, Eduard Trulls
NeurIPS1