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

Jae-Yung Lee

dblp:120/9154 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · unresolved

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

Software engineering, systems software and programming languages · 1Graphics, computer vision, multimedia, augmented reality and games · 1

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
Image and video processing · 100%

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

TopicWeightPapersLastEvidence papers
Image and video processing › video frame interpolation › interpolation › image interpolation
cubic convolution interpolation
0.212015
Cubic Convolution Scaler Optimized for Local Property of Image Data · IEEE Trans. Image Process. 2015
Image and video processing › video frame interpolation › interpolation
image interpolation
0.212015
Cubic Convolution Scaler Optimized for Local Property of Image Data · IEEE Trans. Image Process. 2015
Image and video processing › image resampling
image rescaling
0.212015
Cubic Convolution Scaler Optimized for Local Property of Image Data · IEEE Trans. Image Process. 2015
YearPublicationVenuePosition
2018 UnThemida: Commercial obfuscation technique analysis with a fully obfuscated program
abstract
Summary The main goal of code obfuscation is to make software more difficult to reverse engineer. These techniques modify data structures and control flow while retaining the functionality of the original program. Although obfuscation is a useful method for protecting programs, it can also be used to protect malware. This raises concerns that malware could use code obfuscation to avoid detection by antivirus software. It is very difficult to analyze the functionality of obfuscated malware before it has been deobfuscated. Furthermore, commercial obfuscation tools allow malware authors to apply multiple obfuscation options simultaneously, and current deobfuscation techniques cannot handle this situation. In this study, we analyzed a well‐known commercial obfuscation tool called Themida. We applied its many obfuscation options to a program and implemented a tool to recover the original code and data. We extracted features from obfuscated programs and analyzed their control flow. Our tool is based on these features and the control flow patterns and can identify whether Themida has been applied to the program and which obfuscation options have been used. Finally, we suggested a method for recovering the import address table of programs by using dynamic binary instrumentation. The proposed rules and algorithms can almost completely recover the APIs of programs even though they are hidden by obfuscation options provided by Themida.
Jae Hyuk Suk, Jae-Yung Lee, Hongjoo Jin, In Seok Kim, Dong Hoon Lee 0001
Softw. Pract. Exp.2
2015 Cubic Convolution Scaler Optimized for Local Property of Image Data
abstract
A scaler is one of the most important modules in various video applications, such as ultra-high definition TV and scalable video systems. A variety of scaling techniques have been used to increase the video quality when the resolution of the source image has to be up- and down-scaled. Some conventional schemes exploit the property of local block data. Others consider the edge information of the data to be scaled. In this paper, we formulate a scaling problem to minimize the information loss resulting from the resizing process. The loss is considered in both the spatial and the frequency domains, and then it is minimized to optimize the kernel of the scaler. The simulation results show that the proposed algorithm reduces the information loss more than conventional schemes. When compared with the conventional algorithms, the proposed method outperforms those with similar complexity.
Jin-Kee Chae, Jae-Yung Lee, Min-Ho Lee, Jong-Ki Han, Truong Q. Nguyen, Woon-Young Yeo
IEEE Trans. Image Process.2