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

Min-Fong Hong

dblp:234/8633 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 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
2 papers
Reinforcement learning · 50% Generative modeling · 25% 3D vision · 25%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
implicit neural representation
0.712023
Cascaded Local Implicit Transformer for Arbitrary-Scale Super-Resolution · CVPR 2023
Machine learning › Generative modeling › image reconstruction
super-resolution
0.712023
Cascaded Local Implicit Transformer for Arbitrary-Scale Super-Resolution · CVPR 2023
Machine learning › Reinforcement learning › exploration › intrinsic motivation
curiosity-driven exploration
0.412020
Flow-based Intrinsic Curiosity Module · IJCAI 2020
Machine learning › Reinforcement learning
exploration
0.412020
Flow-based Intrinsic Curiosity Module · IJCAI 2020
Machine learning › Reinforcement learning › exploration
intrinsic motivation
0.412020
Flow-based Intrinsic Curiosity Module · IJCAI 2020

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

transformer · 0.7frequency encoding · 0.7attention · 0.7optical flow estimation · 0.4deep reinforcement learning · 0.4
YearPublicationVenuePosition
2023 Cascaded Local Implicit Transformer for Arbitrary-Scale Super-Resolution
abstract
Implicit neural representation has recently shown a promising ability in representing images with arbitrary resolutions. In this paper, we present a Local Implicit Transformer (LIT), which integrates the attention mechanism and frequency encoding technique into a local implicit image function. We design a cross-scale local attention block to effectively aggregate local features and a local frequency encoding block to combine positional encoding with Fourier domain information for constructing high-resolution images. To further improve representative power, we propose a Cascaded LIT (CLIT) that exploits multi-scale features, along with a cumulative training strategy that gradually increases the upsampling scales during training. We have conducted extensive experiments to validate the effectiveness of these components and analyze various training strategies. The qualitative and quantitative results demonstrate that LIT and CLIT achieve favorable results and outperform the prior works in arbitrary super-resolution tasks.
Hao-Wei Chen, Yu-Syuan Xu, Min-Fong Hong, Yi-Min Tsai, Hsien-Kai Kuo, Chun-Yi Lee
CVPR3
2020 Flow-based Intrinsic Curiosity Module
abstract
In this paper, we focus on a prediction-based novelty estimation strategy upon the deep reinforcement learning (DRL) framework, and present a flow-based intrinsic curiosity module (FICM) to exploit the prediction errors from optical flow estimation as exploration bonuses. We propose the concept of leveraging motion features captured between consecutive observations to evaluate the novelty of observations in an environment. FICM encourages a DRL agent to explore observations with unfamiliar motion features, and requires only two consecutive frames to obtain sufficient information when estimating the novelty. We evaluate our method and compare it with a number of existing methods on multiple benchmark environments, including Atari games, Super Mario Bros., and ViZDoom. We demonstrate that FICM is favorable to tasks or environments featuring moving objects, which allow FICM to utilize the motion features between consecutive observations. We further ablatively analyze the encoding efficiency of FICM, and discuss its applicable domains comprehensively. See here for our codes and demo videos.
Hsuan-Kung Yang, Po-Han Chiang, Min-Fong Hong, Chun-Yi Lee
IJCAI3