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.

Yong Han Kim

dblp:14/6909 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
1since 2021 · last 2024
0000-0001-9470-6060ORCID · reported

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

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

Computer graphics and multimedia
4 papers
Image and video processing · 90% Image and video coding · 10%
Computer networks
1 paper
Network performance modeling · 100%

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

TopicWeightPapersLastEvidence papers
Image and video processing
video frame interpolation
0.812024
IAM-VFI : Interpolate Any Motion for Video Frame Interpolation with Motion Complexity Map · ECCV (15) 2024
Network performance modeling › point process
markov modulated arrival processes
0.012002
An application of Markovian arrival process (MAP) to modeling superposed ATM cell streams · IEEE Trans. Commun. 2002
Network performance modeling
traffic modeling
0.012002
An application of Markovian arrival process (MAP) to modeling superposed ATM cell streams · IEEE Trans. Commun. 2002
Image and video coding › transform coding
subband coding
0.021993
Adaptive entropy-coded subband coding of image sequences · IEEE Trans. Commun. 1993
Adaptive entropy coded subband coding of images · IEEE Trans. Image Process. 1992
Image and video coding › quantization
vector quantization
0.021993
Adaptive entropy-coded pruned tree-structured predictive vector quantization of images · IEEE Trans. Commun. 1993
Adaptive entropy coded subband coding of images · IEEE Trans. Image Process. 1992
Network performance modeling › packet loss
cell loss probability
0.012002
An application of Markovian arrival process (MAP) to modeling superposed ATM cell streams · IEEE Trans. Commun. 2002
Image and video coding › quantization
entropy-constrained quantization
0.011993
Adaptive entropy-coded pruned tree-structured predictive vector quantization of images · IEEE Trans. Commun. 1993
Image and video coding › quantization › vector quantization
predictive vector quantization
0.011993
Adaptive entropy-coded pruned tree-structured predictive vector quantization of images · IEEE Trans. Commun. 1993
Image and video coding
video compression
0.011993
Adaptive entropy-coded subband coding of image sequences · IEEE Trans. Commun. 1993
Image and video coding › quantization › vector quantization
entropy-constrained vector quantization
0.011992
Adaptive entropy coded subband coding of images · IEEE Trans. Image Process. 1992
Image and video coding
variable-rate coding
0.011992
Adaptive entropy coded subband coding of images · IEEE Trans. Image Process. 1992

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

motion complexity map · 0.8moment matching · 0.0MMPP · 0.0MAP · 0.0arithmetic coding · 0.0entropy-constrained design · 0.0adaptive quantization · 0.0huffman coding · 0.0
YearPublicationVenuePosition
2024 IAM-VFI : Interpolate Any Motion for Video Frame Interpolation with Motion Complexity Map
Kihwan Yoon, Yong Han Kim, Sungjei Kim
ECCV (15)2
2002 An application of Markovian arrival process (MAP) to modeling superposed ATM cell streams
abstract
First, we propose a new modeling method for superposed ATM traffic by the MMPP(2), which is a special case of the MAP(2). In this new method, we measure the mean and autocorrelation of cell interarrival times, and the histogram of the number of arrivals during measurement windows of fixed size. The MMPP(2) has interarrival times with a second-order hyper-exponential distribution with coefficient of variation c/sub /spl nu// > 1. However, superposed traffic is often observed to have c/sub /spl nu// < 1. To cover this situation, we extend the MMPP(2) to a MAP(3) by adding a new state with inter-state transition accompanied by an arrival. For the MAP(3) model, we take into account the second moment of the interarrival times. From numerical examples, we observe that both the proposed MMPP(2) and MAP(3) yields very good estimation of the cell loss ratio (CLR) for usual superpositions of voice and/or VBR video sources. However, when we have superpositions from CBR video sources together with other VBR sources, c/sub /spl nu//. is much less than 1, and the MAP(3) outperform the MMPP(2), as expected. The proposed MAP(3) well characterizes the cell scale component as well as the burst scale component of superposed traffic streams.
Sang Hyuk Kang, Yong Han Kim, Dan Keun Sung, Bong Dae Choi
IEEE Trans. Commun.2
2000 Geometry compression of 3-D mesh models using predictive two-stage quantization
abstract
In conventional predictive quantization schemes for 3-D mesh geometry, excessively large residuals or prediction errors, although occasional, lead to visually unacceptable geometric distortion. This is due to the fact that they cannot limit the maximum quantization error within a given bound. In order to completely eliminate the visually unacceptable distortion caused by large residuals, we propose a predictive two-stage quantization scheme. This scheme is very similar to the conventional DPCM, except that the embedded quantizer is replaced by a series of two quantizers. Each quantizer output is further compressed by an arithmetic code. When applied to typical 3-D mesh models, the scheme performs much better than the conventional predictive quantization methods and, depending upon the input models, even than the MPEG-4 compression method for 3-D mesh geometry both in rate distortion sense and in subjective viewing.
Jin Soo Choi, Yong Han Kim, Ho-Jang Lee, In-Sung Park, Myoung Ho Lee, Chieteuk Ahn
IEEE Trans. Circuits Syst. Video Technol.2
1993 Adaptive entropy-coded pruned tree-structured predictive vector quantization of images
abstract
Simpler versions of a previously introduced adaptive entropy-coded predictive vector quantization (PVQ) scheme where the embedded entropy constrained vector quantizer (ECVQ) is replaced by a pruned tree-structured VQ (PTSVQ) are described. The resulting encoding scheme is shown to result in drastically reduced complexity at only a small cost in performance. Coding results for selected real-world images are given.>
Yong Han Kim, James W. Modestino
IEEE Trans. Commun.1
1993 Adaptive entropy-coded subband coding of image sequences
abstract
A new approach to image sequence coding based on variable-rate entropy-constrained subband coding (ECSBC) is described. The corresponding practical implementation of the ECSBC scheme for fixed-rate channels is developed by extending recent adaptive entropy-coded (AEC) quantization techniques. Although the entropy-constrained design of subband coding systems provides improve coding efficiency compared to level-constrained design approaches, the resulting coding system generates variable-rate outputs which must be buffered before fixed-rate transmissions. In this case, the finite buffer, however large, that interfaces the encoder and the channel will eventually overflow or underflow, resulting in a catastrophic loss of encoder-decoder synchronism with an associated large amount of distortion. A buffer-adaptive arithmetic-coded implementation of the ECSBC scheme, called adaptive entropy-coded subband coding (ECSBC/AEC), is described to completely eliminate the associated encoder buffer overflow/underflow problems, even with a very small encoder buffer.>
Yong Han Kim, James W. Modestino
IEEE Trans. Commun.1
1992 Adaptive entropy coded subband coding of images
abstract
The authors describe a design approach, called 2-D entropy-constrained subband coding (ECSBC), based upon recently developed 2-D entropy-constrained vector quantization (ECVQ) schemes. The output indexes of the embedded quantizers are further compressed by use of noiseless entropy coding schemes, such as Huffman or arithmetic codes, resulting in variable-rate outputs. Depending upon the specific configurations of the ECVQ and the ECPVQ over the subbands, many different types of SBC schemes can be derived within the generic 2-D ECSBC framework. Among these, the authors concentrate on three representative types of 2-D ECSBC schemes and provide relative performance evaluations. They also describe an adaptive buffer instrumented version of 2-D ECSBC, called 2-D ECSBC/AEC, for use with fixed-rate channels which completely eliminates buffer overflow/underflow problems. This adaptive scheme achieves performance quite close to the corresponding ideal 2-D ECSBC system.
Yong Han Kim, James W. Modestino
IEEE Trans. Image Process.1