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

Hanxiang Hao

dblp:241/5922 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
3since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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
Efficient and distributed learning · 91% Deep learning architectures and training · 9%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › model compression › pruning › structured pruning
channel pruning
0.712023
UPSCALE: Unconstrained Channel Pruning · ICML 2023
Machine learning › Efficient and distributed learning › inference acceleration
inference latency reduction
0.712023
UPSCALE: Unconstrained Channel Pruning · ICML 2023
Machine learning › Efficient and distributed learning
model compression
0.712023
UPSCALE: Unconstrained Channel Pruning · ICML 2023
Machine learning › Deep learning architectures and training › feedforward neural network
multi-branch network
0.212023
UPSCALE: Unconstrained Channel Pruning · ICML 2023

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

unconstrained pruning · 0.7channel reordering · 0.7
YearPublicationVenuePosition
2023 UPSCALE: Unconstrained Channel Pruning
abstract
As neural networks grow in size and complexity, inference speeds decline. To combat this, one of the most effective compression techniques -- channel pruning -- removes channels from weights. However, for multi-branch segments of a model, channel removal can introduce inference-time memory copies. In turn, these copies increase inference latency -- so much so that the pruned model can be slower than the unpruned model. As a workaround, pruners conventionally constrain certain channels to be pruned together. This fully eliminates memory copies but, as we show, significantly impairs accuracy. We now have a dilemma: Remove constraints but increase latency, or add constraints and impair accuracy. In response, our insight is to reorder channels at export time, (1) reducing latency by reducing memory copies and (2) improving accuracy by removing constraints. Using this insight, we design a generic algorithm UPSCALE to prune models with any pruning pattern. By removing constraints from existing pruners, we improve ImageNet accuracy for post-training pruned models by 2.1 points on average -- benefiting DenseNet (+16.9), EfficientNetV2 (+7.9), and ResNet (+6.2). Furthermore, by reordering channels, UPSCALE improves inference speeds by up to 2x over a baseline export.
Alvin Wan, Hanxiang Hao, Kaushik Patnaik, Yueyang Xu, Omer Hadad, David Guera, Zhile Ren, Qi Shan
ICML2
2021 Improving Building Segmentation Using Uncertainty Modeling and Metadata Injection
abstract
Automatic building segmentation is an important task for satellite imagery analysis and scene understanding. Most existing segmentation methods focus on the case where the images are taken from directly overhead (i.e., low off-nadir/viewing angle). These methods often fail to provide accurate results on satellite images with larger off-nadir angles due to the higher noise level and lower spatial resolution. In this paper, we propose a method that is able to provide accurate building segmentation for satellite imagery captured from a large range of off-nadir angles. Based on Bayesian deep learning, we explicitly design our method to learn the data noise via aleatoric and epistemic uncertainty modeling. Satellite image metadata (e.g., off-nadir angle and ground sample distance) is also used in our model to further improve the result. We show that with uncertainty modeling and metadata injection, our method achieves better performance than the baseline method, especially for noisy images taken from large off-nadir angles1.
Hanxiang Hao, Sriram Baireddy, Kevin J. LaTourette, Latisha Konz, Moses W. Chan, Mary L. Comer, Edward J. Delp
SIGSPATIAL/GIS1
2021 An Attention-Based System for Damage Assessment Using Satellite Imagery
abstract
When a disaster strikes, accurate situational information and a fast, effective response are critical to save lives. High resolution satellite images enable emergency responders to estimate the location, cause, and severity of damage. In this paper, we present a Siam-U-Net-Attn model with an attention mechanism to assess the damage level of buildings given a pair of satellite images showing a scene before and after a disaster. We evaluate the proposed method on xView2, a building damage assessment dataset, and demonstrate that the proposed approach achieves accurate damage scale classification and building segmentation.
Hanxiang Hao, Sriram Baireddy, Emily R. Bartusiak, Latisha Konz, Kevin J. LaTourette, Michael Gribbons, Moses W. Chan, Edward J. Delp, Mary L. Comer
IGARSS1
2020 Robustness Analysis of Face Obscuration
abstract
Face obscuration is needed by law enforcement and mass media outlets to guarantee privacy. Sharing sensitive content where obscuration or redaction techniques have failed to completely remove all identifiable traces can lead to many legal and social issues. Hence, we need to be able to systematically measure the face obscuration performance of a given technique. In this paper we propose to measure the effectiveness of eight obscuration techniques. We do so by attacking the redacted faces in three scenarios: obscured face identification, verification, and reconstruction. Threat modeling is also considered to provide a vulnerability analysis for each studied obscuration technique. Based on our evaluation, we show that the k-same based methods are the most effective.
Hanxiang Hao, David Guera, János Horváth, Amy R. Reibman, Edward J. Delp
FG1