In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothness term must only involve pairs of pixels. We propose two algorithms that use graph cuts to compute a local minimum even when very large moves are allowed. The first move we consider is an /spl alpha/-/spl beta/-swap: for a pair of labels /spl alpha/,/spl beta/, this move exchanges the labels between an arbitrary set of pixels labeled a and another arbitrary set labeled /spl beta/. Our first algorithm generates a labeling such that there is no swap move that decreases the energy. The second move we consider is an /spl alpha/-expansion: for a label a, this move assigns an arbitrary set of pixels the label /spl alpha/. Our second algorithm, which requires the smoothness term to be a metric, generates a labeling such that there is no expansion move that decreases the energy. Moreover, this solution is within a known factor of the global minimum. We experimentally demonstrate the effectiveness of our approach on image restoration, stereo and motion.

/pdf/fast-approximate-energy-minimization-via-graph-cuts-5cbspd4tux.pdf

Fast approximate energy minimization via graph cuts

https://utw10193.utweb.utexas.edu/Archive/RuoffsPDFs/181.pdf

Chemical analysis of graphene oxide films after heat and chemical treatments by X-ray photoelectron and Micro-Raman spectroscopy

The mechanistic target of rapamycin (mTOR) coordinates eukaryotic cell growth and metabolism with environmental inputs, including nutrients and growth factors. Extensive research over the past two decades has established a central role for mTOR in regulating many fundamental cell processes, from protein synthesis to autophagy, and deregulated mTOR signaling is implicated in the progression of cancer and diabetes, as well as the aging process. Here, we review recent advances in our understanding of mTOR function, regulation, and importance in mammalian physiology. We also highlight how the mTOR signaling network contributes to human disease and discuss the current and future prospects for therapeutically targeting mTOR in the clinic.

mTOR Signaling in Growth, Metabolism, and Disease

A surface science perspective on TiO2 photocatalysis

The study group.

Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems

Scalar aggregation in inconsistent databases

Photocatalytic mechanism of TiO2–CeO2 films prepared by magnetron sputtering under UV and visible light

We consider the problem of coding planar graphs by binary strings. Depending on whether O(1)-time queries for adjacency and degree are supported, we present three sets of coding schemes which all take linear time for encoding and decoding. The encoding lengths are significantly shorter than the previously known results in each case.

/pdf/compact-encodings-of-planar-graphs-via-canonical-orderings-fl153gsr5l.pdf

Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses

This paper presents a new linear-time algorithm for finding rectangular duals of planar triangular graphs. The algorithm is conceptually simpler than the previously known algorithm. The coordinates of the rectangular dual constructed by the new algorithm are integers and carry clear combinatorial meaning.

Xin He

Papers

Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems

Scalar aggregation in inconsistent databases

Photocatalytic mechanism of TiO2–CeO2 films prepared by magnetron sputtering under UV and visible light

Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses

On finding the rectangular duals of planar triangular graphs