James Hays

James Hays

Auto-generated profile, based on publicly available information

James Hays

Georgia Institute of Technology Atlanta GA USA

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 February 2022 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
JLJohn Lambert
John Lambert
ZLZhuang Liu
Zhuang Liu
OSOzan Sener
Ozan Sener
JHJames Hays
James Hays
VKVladlen Koltun
Vladlen Koltun
We present MSeg, a composite dataset that unifies semantic segmentation datasets from different domains. A naive merge of the constituent datasets yields poor performance due to inconsistent taxonomies and annotation practices. We reconcile the taxonomies and bring the pixel-level annotations into alignment by relabeling more than 220,000 object masks in more than 80,000 images, requiring more than 1.34 years of collective annotator effort. The resulting composite dataset enables training a single semantic segmentation model that functions effectively across domains and generalizes to datasets that were not seen during training. We adopt zero-shot cross-dataset transfer as a benchmark to systematically evaluate a model's robustness and show that MSeg training yields substantially more robust models in comparison to training on individual datasets or naive mixing of datasets without the presented contributions. A model trained on MSeg ranks first on the WildDash-v1 leaderboard for robust semantic segmentation, with no exposure to WildDash data during training. We evaluate our models in the 2020 Robust Vision Challenge (RVC) as an extreme generalization experiment. MSeg training sets include only three of the seven datasets in the RVC; more importantly, the evaluation taxonomy of RVC is different and more detailed. Surprisingly, our model shows competitive performance and ranks second. To evaluate how close we are to the grand aim of robust, efficient, and complete scene understanding, we go beyond semantic segmentation by training instance segmentation and panoptic segmentation models using our dataset. Moreover, we also evaluate various engineering design decisions and metrics, including resolution and computational efficiency. Although our models are far from this grand aim, our comprehensive evaluation is crucial for progress. We share all the models and code with the community.

23 October 2022
Verified
Book Chapter
Closed access
PDF file
PSPatsorn Sangkloy
Patsorn Sangkloy
WJWittawat Jitkrittum
Wittawat Jitkrittum
DYDiyi Yang
Diyi Yang
JHJames Hays
James Hays

11 November 2022
Verified
Book Chapter
Closed access
PDF file
PGPatrick Grady
Patrick Grady
CTChengcheng Tang
Chengcheng Tang
SBSamarth Brahmbhatt
Samarth Brahmbhatt
CTChristopher D. Twigg
Christopher D. Twigg
CWChengde Wan
Chengde Wan
CKCharles C. Kemp
Charles C. Kemp

1 January 2004
Verified
Conference Paper
Open access
PDF file
WLWen-Chieh Lin
Wen-Chieh Lin
JHJames Hays
James Hays
Chenyu WuChenyu Wu
Chenyu Wu
VKVivek Kwatra
Vivek Kwatra
YLYanxi Liu
Yanxi Liu

23 July 2023
Verified
Conference Paper
Open access
CHCusuh Ham
Cusuh Ham
JHJames Hays
James Hays
JLJingwan Lu
Jingwan Lu
KSKrishna Kumar Singh
Krishna Kumar Singh
ZZZhifei Zhang
Zhifei Zhang
THTobias Hinz
Tobias Hinz

19 July 2018 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
KSKilho Son
Kilho Son
JHJames Hays
James Hays
DCDavid B. Cooper
David B. Cooper
We present a novel computational puzzle solver for square-piece image jigsaw puzzles with no prior information such as piece orientation or anchor pieces. By “piece” we mean a square d x d block of pixels, where we investigate pieces as small as 7 x 7 pixels. To reconstruct such challenging puzzles, we propose to find maximum geometric consensus between pieces, specifically hierarchical piece loops. The proposed algorithm seeks out loops of four pieces and aggregates the smaller loops into higher order loops of loops in a bottom-up fashion. In contrast to previous puzzle solvers which aim to maximize compatibility measures between all pairs of pieces and thus depend heavily on the pairwise compatibility measures used, our approach reduces the dependency on the pairwise compatibility measures which become increasingly uninformative for small scales and instead exploits geometric agreement among pieces. Our contribution also includes an improved pairwise compatibility measure which exploits directional derivative information along adjoining boundaries of the pieces. We verify the proposed algorithm as well as its individual components with mathematical analysis and reconstruction experiments.