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

Janghyun Kim

dblp:218/7332 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
3since 2021 · last 2026
0009-0001-3525-062XORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Computer networks · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 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.

Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 100%
Artificial intelligence
1 paper
Vision and language · 100%

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

TopicWeightPapersLastEvidence papers
Multimedia analysis and retrieval
multi-label classification
0.912025
BAC-GCN: Background-Aware CLIP-GCN Framework for Unsupervised Multi-Label Classification · ACM Multimedia 2025
Computer vision › Vision and language › vision-language model
CLIP-based classification
0.312025
BAC-GCN: Background-Aware CLIP-GCN Framework for Unsupervised Multi-Label Classification · ACM Multimedia 2025
Computer vision › Vision and language
vision-language model
0.312025
BAC-GCN: Background-Aware CLIP-GCN Framework for Unsupervised Multi-Label Classification · ACM Multimedia 2025

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

graph convolutional network · 1.7background-aware framework · 1.7
YearPublicationVenuePosition
2026 AT-adapter: Leveraging attribute knowledge of CLIP for few-shot classification
Yonghyeon Jo, Janghyun Kim, Chanill Park, Seonghoon Choi, Jinsun Park
Neurocomputing2
2025 BAC-GCN: Background-Aware CLIP-GCN Framework for Unsupervised Multi-Label Classification
Yonghyeon Jo, Janghyun Kim, Jinsun Park
ACM Multimedia2
2024 Exploiting Cross-Modal Cost Volume for Multi-sensor Depth Estimation
Janghyun Kim, Ukcheol Shin, Seokyong Heo, Jinsun Park
ACCV (9)1
2018 Low Complexity Pilot Allocation Scheme for a Large OFDM Block with Null Subcarriers
abstract
A low complexity pilot allocation scheme is proposed for a large OFDM block with null subcarriers. The proposed scheme allocates pilots to the edge part of the active subcarrier region according to the 2nd order polynomial and to the middle part of the active subcarrier region according to the 1st order polynomial or the comb‐type pilot pattern. To find a parameter of the 2nd order polynomial, the proposed scheme applies exhaustive search of a single parameter by using an integer unit resolution. It is shown by simulation that the proposed scheme is a close‐to‐optimal pilot allocation scheme yielding better symbol error rate (SER) performance than the traditional 3rd and 5th order polynomial‐based schemes although the proposed scheme has lower computation and implementation complexity.
Janghyun Kim, Unil Yun, Duckdong Hwang, Eunchul Yoon
Wirel. Commun. Mob. Comput.1
2018 Blind Selected Mapping with Side Information Estimation Based on the Received Pilot Signal
abstract
Blind selected mapping (BSLM) is a technique to reduce the peak to average power ratio (PAPR) of OFDM by using a set of scrambling sequences. Since the side information (SI) on the scrambling sequence selected by the transmitter is not directly sent to the receiver in BSLM, the SI needs to be estimated by the receiver. In this paper, a BSLM scheme that applies a new SI estimation approach is proposed. The proposed BSLM scheme estimates the SI by selecting the minimum of the candidate metrics that are computed with the received pilot signal, the pilot symbol sequence, and the scrambling sequences. It is shown by simulation that the proposed BSLM scheme yields better SI error rate (SIER) and bit error rate (BER) performance and lower implementation complexity than four traditional BSLM schemes.
Eunchul Yoon, Duckdong Hwang, Chanki Jang, Janghyun Kim, Unil Yun
Wirel. Commun. Mob. Comput.4