Search Results for author: Hossam Isack

Found 12 papers, 2 papers with code

3D Gaussian Splatting as Markov Chain Monte Carlo

no code implementations15 Apr 2024 Shakiba Kheradmand, Daniel Rebain, Gopal Sharma, Weiwei Sun, Jeff Tseng, Hossam Isack, Abhishek Kar, Andrea Tagliasacchi, Kwang Moo Yi

While 3D Gaussian Splatting has recently become popular for neural rendering, current methods rely on carefully engineered cloning and splitting strategies for placing Gaussians, which does not always generalize and may lead to poor-quality renderings.

Neural Rendering

Accelerating Neural Field Training via Soft Mining

no code implementations29 Nov 2023 Shakiba Kheradmand, Daniel Rebain, Gopal Sharma, Hossam Isack, Abhishek Kar, Andrea Tagliasacchi, Kwang Moo Yi

We present an approach to accelerate Neural Field training by efficiently selecting sampling locations.

Unsupervised Keypoints from Pretrained Diffusion Models

1 code implementation29 Nov 2023 Eric Hedlin, Gopal Sharma, Shweta Mahajan, Xingzhe He, Hossam Isack, Abhishek Kar Helge Rhodin, Andrea Tagliasacchi, Kwang Moo Yi

Unsupervised learning of keypoints and landmarks has seen significant progress with the help of modern neural network architectures, but performance is yet to match the supervised counterpart, making their practicability questionable.

Denoising Unsupervised Human Pose Estimation +1

RePose: Learning Deep Kinematic Priors for Fast Human Pose Estimation

no code implementations10 Feb 2020 Hossam Isack, Christian Haene, Cem Keskin, Sofien Bouaziz, Yuri Boykov, Shahram Izadi, Sameh Khamis

At the coarsest resolution, and in a manner similar to classical part-based approaches, we leverage the kinematic structure of the human body to propagate convolutional feature updates between the keypoints or body parts.

Pose Estimation

K-convexity shape priors for segmentation

no code implementations ECCV 2018 Hossam Isack, Lena Gorelick, Karin Ng, Olga Veksler, Yuri Boykov

As shown in the paper, for many forms of convexity our regularization model is significantly more descriptive for any given k. Our shape prior is useful in practice, e. g. in biomedical applications, and its optimization is robust to local minima.

Descriptive Object +1

Efficient optimization for Hierarchically-structured Interacting Segments (HINTS)

no code implementations CVPR 2017 Hossam Isack, Olga Veksler, Ipek Oguz, Milan Sonka, Yuri Boykov

We propose an effective optimization algorithm for a general hierarchical segmentation model with geometric interactions between segments.

Segmentation

Hedgehog Shape Priors for Multi-Object Segmentation

no code implementations CVPR 2016 Hossam Isack, Olga Veksler, Milan Sonka, Yuri Boykov

In contrast to star-convexity, the tightness of our normal constraint can be changed giving better control over allowed shapes.

Descriptive Object +2

A-expansion for multiple "hedgehog" shapes

no code implementations2 Feb 2016 Hossam Isack, Yuri Boykov, Olga Veksler

A single click and +/-90 degrees normal orientation constraints reduce our hedgehog prior to star-convexity.

Segmentation Semantic Segmentation

Volumetric Bias in Segmentation and Reconstruction: Secrets and Solutions

no code implementations ICCV 2015 Yuri Boykov, Hossam Isack, Carl Olsson, Ismail Ben Ayed

Many standard optimization methods for segmentation and reconstruction compute ML model estimates for appearance or geometry of segments, e. g. Zhu-Yuille 1996, Torr 1998, Chan-Vese 2001, GrabCut 2004, Delong et al. 2012.

Segmentation

Energy Based Multi-model Fitting & Matching for 3D Reconstruction

no code implementations CVPR 2014 Hossam Isack, Yuri Boykov

Standard geometric model fitting methods take as an input a fixed set of feature pairs greedily matched based only on their appearances.

3D Reconstruction valid

Joint optimization of fitting & matching in multi-view reconstruction

no code implementations11 Mar 2013 Hossam Isack, Yuri Boykov

In contrast, we solve feature matching and multi-model fitting problems in a joint optimization framework.

Cannot find the paper you are looking for? You can Submit a new open access paper.