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

József Németh

dblp:20/8105 · also József Gabor Németh · DBLP profile ↗
← Back
9ranked-venue papers
7as first author
2since 2021 · last 2021
0000-0002-7157-1682ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 6 · 6 first-authorArtificial intelligence and machine learning · 3 · 2 first-authorComputer networks · 1 · 1 first-author · 1 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
1 paper
Representation and self-supervised learning · 100%
Computer graphics and multimedia
2 papers
Geometric modeling and processing · 54% Image and video processing · 28% Computational photography and imaging · 18%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › disentangled representation learning
disentanglement
0.412020
Adversarial Disentanglement with Grouped Observations · AAAI 2020
Image and video processing › image registration
diffeomorphic registration
0.112012
Nonlinear Shape Registration without Correspondences · IEEE Trans. Pattern Anal. Mach. Intell. 2012
Geometric modeling and processing
shape registration
0.112012
Nonlinear Shape Registration without Correspondences · IEEE Trans. Pattern Anal. Mach. Intell. 2012
Geometric modeling and processing
shape alignment
0.112009
Recovering planar homographies between 2D shapes · ICCV 2009

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

adversarial training · 0.4nonlinear equation solving · 0.2
YearPublicationVenuePosition
2021 Soft-ACK Feedback Based Link Adaptation for Latency Critical Applications in 5G/B5G
abstract
Link adaptation plays an essential role in optimizing the performance of wireless communications systems. With the emerging services, link adaptation needs to operate with stringent reliability and latency requirements. This paper introduces soft-ACKINACK based link adaptation, which is an adaptation of conventional OLLA to the high reliability and low latency requirements by a range of emerging 5G/6G NR applications, such as URLLC/IIoT, AV/AR, cloud gaming or V2X. We study the limitations of conventional OLLA for these scenarios, and introduce an enhanced OLLA algorithm using soft-ACK/NACK feedback from the UE. We analyse the possible methods to derive soft-ACK/NACK reports, and propose using flipped bit counts based on accuracy and feasibility. The performance gains of soft-OLLA are assessed in performance simulations.
József Németh, Mohammed Al-Imari, Waseem Ozan
GLOBECOM1
2021 Dynamic Cross-Carrier Enhancement for 5G and B5G
abstract
5G NR Rel-15 and Rel-16 delivered good latency and reliability features to enable URLLC and pave the way to more stringent 5G applications like AR/VR and Cloud gaming. However, further enhancement is required to improve the system capacity to support these high data rate demanding applications while meeting the latency and reliability requirements. Carrier aggregation is primarily designed to accommodate higher data rate. However its operation could be further optimized for better latency and hence better capacity particularly on TDD bands.
Abdellatif Salah, Cheng Hsun Li, Mohammed Al-Imari, József Németh, Weide Wu
VTC Spring4
2020 Adversarial Disentanglement with Grouped Observations
József Németh
AAAI1
2013 Restoration of Blurred Binary Images Using Discrete Tomography
József Németh
ACIVS1
2012 Recovering Projective Transformations between Binary Shapes
József Németh
ACIVS1
2012 Nonlinear Shape Registration without Correspondences
abstract
In this paper, we propose a novel framework to estimate the parameters of a diffeomorphism that aligns a known shape and its distorted observation. Classical registration methods first establish correspondences between the shapes and then compute the transformation parameters from these landmarks. Herein, we trace back the problem to the solution of a system of nonlinear equations which directly gives the parameters of the aligning transformation. The proposed method provides a generic framework to recover any diffeomorphic deformation without established correspondences. It is easy to implement, not sensitive to the strength of the deformation, and robust against segmentation errors. The method has been applied to several commonly used transformation models. The performance of the proposed framework has been demonstrated on large synthetic data sets as well as in the context of various applications.
Csaba Domokos, József Németh, Zoltan Kato
IEEE Trans. Pattern Anal. Mach. Intell.2
2011 A Multi-Layer 'Gas of Circles' Markov Random Field Model for the Extraction of Overlapping Near-Circular Objects
József Németh, Zoltan Kato, Ian H. Jermyn
ACIVS1
2009 Recovering planar homographies between 2D shapes
abstract
Images taken from different views of a planar object are related by planar homography. Recovering the parameters of such transformations is a fundamental problem in computer vision with various applications. This paper proposes a novel method to estimate the parameters of a homography that aligns two binary images. It is obtained by solving a system of nonlinear equations generated by integrating linearly independent functions over the domains determined by the shapes. The advantage of the proposed solution is that it is easy to implement, less sensitive to the strength of the deformation, works without established correspondences and robust against segmentation errors. The method has been tested on synthetic as well as on real images and its efficiency has been demonstrated in the context of two different applications: alignment of hip prosthesis X-ray images and matching of traffic signs.
József Németh, Csaba Domokos, Zoltan Kato
ICCV1
2009 Nonlinear registration of binary shapes
abstract
A novel approach is proposed to estimate the parameters of a diffeomorphism that aligns two binary images. Classical approaches usually define a cost function based on a similarity metric and then find the solution via optimization. Herein, we trace back the problem to the solution of a system of nonlinear equations which directly provides the parameters of the aligning transformation. The proposed method works without any time consuming optimization step or established correspondences. The advantage of our algorithm is that it is easy to implement, less sensitive to the strength of the deformation, and robust against segmentation errors. The efficiency of the proposed approach has been demonstrated on a large synthetic dataset as well as in the context of an industrial application.
József Németh, Csaba Domokos, Zoltan Kato
ICIP1