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

An Dang

dblp:207/5287 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
2since 2021 · last 2025
0009-0000-2518-7180ORCID · corroborated

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

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

Artificial intelligence
1 paper
Deep learning architectures and training · 100%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
convolutional neural network
0.412020
Learning to Remember Beauty Products · ACM Multimedia 2020
Machine learning › Deep learning architectures and training
memory-augmented neural networks
0.412020
Learning to Remember Beauty Products · ACM Multimedia 2020
Machine learning › Deep learning architectures and training
multi-scale feature fusion
0.412020
Learning to Remember Beauty Products · ACM Multimedia 2020
Information retrieval › image retrieval › product image retrieval
beauty product image retrieval
0.412020
Learning to Remember Beauty Products · ACM Multimedia 2020
Information retrieval
image retrieval
0.412020
Learning to Remember Beauty Products · ACM Multimedia 2020

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

distance loss · 0.9data augmentation · 0.9attention mechanism · 0.9
YearPublicationVenuePosition
2025 meSch: Multi-Agent Energy-Aware Scheduling for Task Persistence
abstract
This paper develop a scheduling protocol for a team of autonomous robots that operate on long-term persistent tasks. The proposed framework, called meSch, accounts for the limited battery capacity of the robots and ensures that the robots return to charge their batteries one at a time at the single charging station. The protocol is applicable to general nonlinear robot models under certain assumptions, does not require robots to be deployed at different times, and can handle robots with different discharge rates. We further consider the case when the charging station is mobile and its state information is subject to uncertainty. The feasibility of the algorithm in terms of ensuring persistent charging is given under certain assumptions, while the efficacy of meSch is validated through simulation and hardware experiments. [Code]a[Video]b
Kaleb Ben Naveed, An Dang, Dimitra Panagou
IROS2
2023 EMIX: A Data Augmentation Method for Speech Emotion Recognition
abstract
In the last few years, many deep learning (DL) models have been developed to improve the accuracy of speech emotion recognition (SER). However, as SER datasets are generally small and insufficient due to their difficult and expensive collection, the DL models are prone to overfitting, so their performance is limited. In this paper, we introduce a novel data augmentation (DA) method for the SER problem, namely EMix, which is simple but effective. The method creates new data by mixing pairs of selective samples from the original data. The generated mixtures will be noisier or less ambiguous than their constructive ones. To verify the effectiveness of the proposed DA, we develop a transformer-based network for the SER task, and experiment with the two public datasets including IEMOCAP and Crema-D. The experimental results demonstrate the superiority of EMix over other DA methods. In comparison with state-of-the-art methods, our approach shows competitive performance.
An Dang, Toan H. Vu, Le Dinh Nguyen, Jia-Ching Wang
ICASSP1
2020 Encoder-Recurrent Decoder Network for Single Image Dehazing
abstract
This paper develops a deep learning model, called Encoder-Recurrent Decoder Network (ERDN), which recovers the clear image from a degrade hazy image without using the atmospheric scattering model. The proposed model consists of two key components- an encoder and a decoder. The encoder is constructed by a residual efficient spatial pyramid (rESP) module such that it can effectively process hazy images at any resolution to extract relevant features at multiple contextual levels. The decoder has a recurrent module which sequentially aggregates encoded features from high levels to low levels to generate haze-free images. The network is trained end-to-end given pairs of hazy-clear images. Experimental results on the RESIDE-Standard dataset demonstrate that the proposed model achieves a competitive dehazing performance compared to the state-of-the-art methods in term of PSNR and SSIM.
An Dang, Toan H. Vu, Jia-Ching Wang
ICASSP1
2020 Learning to Remember Beauty Products
abstract
This paper develops a deep learning model for the beauty product image retrieval problem. The proposed model has two main components- an encoder and a memory. The encoder extracts and aggregates features from a deep convolutional neural network at multiple scales to get feature embeddings. With the use of an attention mechanism and a data augmentation method, it learns to focus on foreground objects and neglect background on images, so can it extract more relevant features. The memory consists of representative states of all database images as its stacks, and it can be updated during training process. Based on the memory, we introduce a distance loss to regularize embedding vectors from the encoder to be more discriminative. Our model is fully end-to-end, requires no manual feature aggregation and post-processing. Experimental results on the Perfect-500K dataset demonstrate the effectiveness of the proposed model with a significant retrieval accuracy.
Toan H. Vu, An Dang, Jia-Ching Wang
ACM Multimedia2