Dynamic graph cuts for efficient inference in Markov random fields

In this paper, we present a fast new fully dynamic algorithm for the st-mincut/max-flow problem. We show how this algorithm can be used to efficiently compute MAP solutions for certain dynamically changing MRF models in computer vision such as image segmentation. Specifically, given the solution of the max-flow problem on a graph, the dynamic algorithm efficiently computes the maximum flow in a modified version of the graph. The time taken by it is roughly proportional to the total amount of change in the edge weights of the graph. Our experiments show that, when the number of changes in the graph is small, the dynamic algorithm is significantly faster than the best known static graph cut algorithm. We test the performance of our algorithm on one particular problem: the object-background segmentation problem for video. It should be noted that the application of our algorithm is not limited to the above problem, the algorithm is generic and can be used to yield similar improvements in many other cases that involve dynamic change

P3 & beyond: move making algorithms for solving higher order functions

In this paper, we extend the class of energy functions for which the optimal \alpha-expansion and \alpha \beta-swap moves can be computed in polynomial time. Specifically, we introduce a novel family of higher order clique potentials, and show that the expansion and swap moves for any energy function composed of these potentials can be found by minimizing a submodular function. We also show that for a subset of these potentials, the optimal move can be found by solving an st-mincut problem. We refer to this subset as the {\cal P}^n Potts model. Our results enable the use of powerful \alpha-expansion and \alpha \beta-swap move making algorithms for minimization of energy functions involving higher order cliques. Such functions have the capability of modeling the rich statistics of natural scenes and can be used for many applications in Computer Vision. We demonstrate their use in one such application, i.e., the texture-based image or video-segmentation problem

Associative hierarchical random fields

This paper makes two contributions: the first is the proposal of a new model—The associative hierarchical random field (AHRF), and a novel algorithm for its optimization; the second is the application of this model to the problem of semantic segmentation. Most methods for semantic segmentation are formulated as a labeling problem for variables that might correspond to either pixels or segments such as super-pixels. It is well known that the generation of super pixel segmentations is not unique. This has motivated many researchers to use multiple super pixel segmentations for problems such as semantic segmentation or single view reconstruction. These super-pixels have not yet been combined in a principled manner, this is a difficult problem, as they may overlap, or be nested in such a way that the segmentations form a segmentation tree. Our new hierarchical random field model allows information from all of the multiple segmentations to contribute to a global energy. MAP inference in this model can be performed efficiently using powerful graph cut based move making algorithms. Our framework generalizes much of the previous work based on pixels or segments, and the resulting labelings can be viewed both as a detailed segmentation at the pixel level, or at the other extreme, as a segment selector that pieces together a solution like a jigsaw, selecting the best segments from different segmentations as pieces. We evaluate its performance on some of the most challenging data sets for object class segmentation, and show that this ability to perform inference using multiple overlapping segmentations leads to state-of-the-art results

Simultaneous segmentation and pose estimation of humans using dynamic graph cuts

This paper presents a novel algorithm for performing integrated segmentation and 3D pose estimation of a human body from multiple views. Unlike other state of the art methods which focus on either segmentation or pose estimation individually, our approach tackles these two tasks together. Our method works by optimizing a cost function based on a Conditional Random Field (CRF). This has the advantage that all information in the image (edges, background and foreground appearances), as well as the prior information on the shape and pose of the subject can be combined and used in a Bayesian framework. Optimizing such a cost function would have been computationally infeasible. However, our recent research in dynamic graph cuts allows this to be done much more efficiently than before. We demonstrate the efficacy of our approach on challenging motion sequences. Although we target the human pose inference problem in the paper, our method is completely generic and can be used to segment and infer the pose of any rigid, deformable or articulated object

Mucormycosis (zygomycosis) of renal allograft

Fungal infection is relatively common among renal transplant recipients from developing countries. Mucormycosis, also known as zygomycosis, is one of the most serious fungal infections in these patients. The most common of presentation is rhino-cerebral. Isolated involvement of a renal allograft is very rare. A thorough search of literature and our medical records yielded a total of 24 cases with mucormycosis of the transplanted kidney. There was an association with cytomegalovirus (CMV) infection and anti-rejection treatment in these patients and most of these transplants were performed in the developing countries from unrelated donors. The outcome was very poor with an early mortality in 13 (54.5%) patients. Renal allograft mucormycosis is a relatively rare and potentially fatal complication following renal transplantation. Early diagnosis, graft nephrectomy and appropriate antifungal therapy may result in an improved prognosis for these patients

What is the real impact of acute kidney injury?

Background: Acute kidney injury (AKI) is a common clinical problem. Studies have documented the incidence of AKI in a variety of populations but to date we do not believe the real incidence of AKI has been accurately documented in a district general hospital setting. The aim here was to describe the detected incidence of AKI in a typical general hospital setting in an unselected population, and describe associated short and long-term outcomes. Methods: A retrospective observational database study from secondary care in East Kent (adult catchment population of 582,300). All adult patients (18 years or over) admitted between 1st February 2009 and 31st July 2009, were included. Patients receiving chronic renal replacement therapy (RRT), maternity and day case admissions were excluded. AKI was defined by the acute kidney injury network (AKIN) criteria. A time dependent risk analysis with logistic regression and Cox regression was used for the analysis of in-hospital mortality and survival. Results: The incidence of AKI in the 6 month period was 15,325 pmp/yr (adults) (69% AKIN1, 18% AKIN2 and 13% AKIN3). In-hospital mortality, length of stay and ITU utilisation all increased with severity of AKI. Patients with AKI had an increase in care on discharge and an increase in hospital readmission within 30 days. Conclusions: This data comes closer to the real incidence and outcomes of AKI managed in-hospital than any study published in the literature to date. Fifteen percent of all admissions sustained an episode of AKI with increased subsequent short and long term morbidity and mortality, even in those with AKIN1. This confers an increased burden and cost to the healthcare economy, which can now be quantified. These results will furnish a baseline for quality improvement projects aimed at early identification, improved management, and where possible prevention, of AKI

Rituximab in adult minimal change disease and focal segmental glomerulosclerosis - What is known and what is still unknown?

Primary forms of minimal change disease and focal segmental glomerulosclerosis are rare podocytopathies and clinically characterized by nephrotic syndrome. Glucocorticoids are the cornerstone of the initial immunosuppressive treatment in these two entities. Especially among adults with minimal change disease or focal segmental glomerulosclerosis, relapses, steroid dependence or resistance are common and necessitate re-initiation of steroids and other immunosuppressants. Effective steroid-sparing therapies and introduction of less toxic immunosuppressive agents are urgently needed to reduce undesirable side effects, in particular for patients whose disease course is complex. Rituximab, a B cell depleting monoclonal antibody, is increasingly used off-label in these circumstances, despite a low level of evidence for adult patients. Hence, critical questions concerning drug-safety, long-term efficacy and the optimal regimen for rituximab-treatment remain unanswered. Evidence in the form of large, multicenter studies and randomized controlled trials are urgently needed to overcome these limitations

Limits on WWZ and WW\gamma couplings from p\bar{p}\to e\nu jj X events at \sqrt{s} = 1.8 TeV

We present limits on anomalous WWZ and WW-gamma couplings from a search for WW and WZ production in p-bar p collisions at sqrt(s)=1.8 TeV. We use p-bar p -> e-nu jjX events recorded with the D0 detector at the Fermilab Tevatron Collider during the 1992-1995 run. The data sample corresponds to an integrated luminosity of 96.0+-5.1 pb^(-1). Assuming identical WWZ and WW-gamma coupling parameters, the 95% CL limits on the CP-conserving couplings are -0.33<lambda<0.36 (Delta-kappa=0) and -0.43<Delta-kappa<0.59 (lambda=0), for a form factor scale Lambda = 2.0 TeV. Limits based on other assumptions are also presented.Comment: 11 pages, 2 figures, 2 table

Search for New Physics in e mu X Data at D0 Using Sleuth: A Quasi-Model-Independent Search Strategy for New Physics

We present a quasi-model-independent search for the physics responsible for electroweak symmetry breaking. We define final states to be studied, and construct a rule that identifies a set of relevant variables for any particular final state. A new algorithm ("Sleuth") searches for regions of excess in those variables and quantifies the significance of any detected excess. After demonstrating the sensitivity of the method, we apply it to the semi-inclusive channel e mu X collected in 108 pb^-1 of ppbar collisions at sqrt(s) = 1.8 TeV at the D0 experiment during 1992-1996 at the Fermilab Tevatron. We find no evidence of new high p_T physics in this sample.Comment: 23 pages, 12 figures. Submitted to Physical Review

Search For Heavy Pointlike Dirac Monopoles

We have searched for central production of a pair of photons with high transverse energies in $p\bar p$ collisions at $\sqrt{s} = 1.8$ TeV using $70 pb^{-1}$ of data collected with the D\O detector at the Fermilab Tevatron in 1994--1996. If they exist, virtual heavy pointlike Dirac monopoles could rescatter pairs of nearly real photons into this final state via a box diagram. We observe no excess of events above background, and set lower 95% C.L. limits of $610, 870, or 1580 GeV/c^2$ on the mass of a spin 0, 1/2, or 1 Dirac monopole.Comment: 12 pages, 4 figure