activity
20112025
most citedLearning Disentangled Representations with Semi-Supervised Deep Generative Models

140 citations · 526 across the 24 of their papers we have counts for

collaborators
Showing cs.CVShow all

6 papers · 1 filter

cs.CV2022★ 12 cited

Behind Every Domain There is a Shift: Adapting Distortion-aware Vision Transformers for Panoramic Semantic Segmentation

Jiaming Zhang, Kailun Yang, Hao Shi +7

In this paper, we address panoramic semantic segmentation which is under-explored due to two critical challenges: (1) image distortions and object deformations on panoramas; (2) la…

cs.CV2018

Efficient Relaxations for Dense CRFs with Sparse Higher Order Potentials

Thomas Joy, Alban Desmaison, Thalaiyasingam Ajanthan +5

Dense conditional random fields (CRFs) have become a popular framework for modelling several problems in computer vision such as stereo correspondence and multi-class semantic segm…

cs.CV2016

Efficient Linear Programming for Dense CRFs

Thalaiyasingam Ajanthan, Alban Desmaison, Rudy Bunel +3

The fully connected conditional random field (CRF) with Gaussian pairwise potentials has proven popular and effective for multi-class semantic segmentation. While the energy of a d…

cs.CV2016

Efficient Continuous Relaxations for Dense CRF

Alban Desmaison, Rudy Bunel, Pushmeet Kohli +2

Dense conditional random fields (CRF) with Gaussian pairwise potentials have emerged as a popular framework for several computer vision applications such as stereo correspondence a…

cs.CV2014★ 60 cited

Large-scale Binary Quadratic Optimization Using Semidefinite Relaxation and Applications

Peng Wang, Chunhua Shen, Anton van den Hengel +1

In computer vision, many problems such as image segmentation, pixel labelling, and scene parsing can be formulated as binary quadratic programs (BQPs). For submodular problems, cut…

cs.CV2014

Efficient Semidefinite Branch-and-Cut for MAP-MRF Inference

Peng Wang, Chunhua Shen, Anton van den Hengel +1

We propose a Branch-and-Cut (B&C) method for solving general MAP-MRF inference problems. The core of our method is a very efficient bounding procedure, which combines scalable semi…