Binary Adaptive Semi-Global Matching Based on Image Edges

Image-based modeling and rendering is currently one of the most challenging topics in Computer Vision and Photogrammetry. The key issue here is building a set of dense correspondence points between two images, namely dense matching or stereo matching. Among all dense matching algorithms, Semi-Global Matching (SGM) is arguably one of the most promising algorithms for real-time stereo vision. Compared with global matching algorithms, SGM aggregates matching cost from several (eight or sixteen) directions rather than only the epipolar line using Dynamic Programming (DP). Thus, SGM eliminates the classical “streaking problem” and greatly improves its accuracy and efficiency. In this paper, we aim at further improvement of SGM accuracy without increasing the computational cost. We propose setting the penalty parameters adaptively according to image edges extracted by edge detectors. We have carried out experiments on the standard Middlebury stereo dataset and evaluated the performance of our modified method with the ground truth. The results have shown a noticeable accuracy improvement compared with the results using fixed penalty parameters while the runtime computational cost was not increased

On the Validity and Applicability of Models of Negative Capacitance and Implications for MOS Applications

The observation of room temperature sub-60 mV/dec subthreshold slope (SS) in MOSFETs with ferroelectric (FE) layers in the gate stacks or in series with the gate has attracted much attention. Recently, we modeled this effect in the framework of a FE polarization switching model. However, there is a large amount of literature attributing this effect to a stabilization of quasi-static (QS) negative capacitance (NC) in the FE. The technological implications of a stabilized non-switching (NS) QSNC model vs a FE switching model are vastly different; the latter precluding applications to sub-60 mV/dec SS scaled CMOS due to speed limitations and power dissipated in switching. In this letter, we provide a thorough analysis assessing the foundations of models of QSNC, identifying which specific assumptions (ansatz) may be unlikely or unphysical, and analyzing their applicability. We show that it is not reasonable to expect QSNC for two separate capacitors connected in series (with a metal plate between dielectric (DE) and FE layers). We propose a model clarifying under which conditions a QS "apparent NC" for a FE layer in a FE-DE bi-layer stack may be observed, quantifying the requirements of strong interface polarization coupling in addition to capacitance matching. In this regime, our model suggests the FE layer does not behave as a NC layer, simply, the coupling leads to both the DE and FE behaving as high-k DE with similar permittivities. This may be useful for scaled EOT devices but does not lead to sub-60 mV/dec SS.Comment: Version published in Appl. Phys. Let

Schrijver graphs and projective quadrangulations

In a recent paper [J. Combin. Theory Ser. B}, 113 (2015), pp. 1-17], the authors have extended the concept of quadrangulation of a surface to higher dimension, and showed that every quadrangulation of the $n$-dimensional projective space $P^n$ is at least $(n+2)$-chromatic, unless it is bipartite. They conjectured that for any integers $k\geq 1$ and $n\geq 2k+1$, the Schrijver graph $SG(n,k)$ contains a spanning subgraph which is a quadrangulation of $P^{n-2k}$. The purpose of this paper is to prove the conjecture

Quantum statistics on graphs

Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph, concentrating on the simplest case of abelian statistics for two particles. In spite of the fact that graphs are locally one-dimensional, anyon statistics emerge in a generalized form. A given graph may support a family of independent anyon phases associated with topologically inequivalent exchange processes. In addition, for sufficiently complex graphs, there appear new discrete-valued phases. Our analysis is simplified by considering combinatorial rather than metric graphs -- equivalently, a many-particle tight-binding model. The results demonstrate that graphs provide an arena in which to study new manifestations of quantum statistics. Possible applications include topological quantum computing, topological insulators, the fractional quantum Hall effect, superconductivity and molecular physics.Comment: 21 pages, 6 figure

On globally non-trivial almost-commutative manifolds

Within the framework of Connes' noncommutative geometry, we define and study globally non-trivial (or topologically non-trivial) almost-commutative manifolds. In particular, we focus on those almost-commutative manifolds that lead to a description of a (classical) gauge theory on the underlying base manifold. Such an almost-commutative manifold is described in terms of a 'principal module', which we build from a principal fibre bundle and a finite spectral triple. We also define the purely algebraic notion of 'gauge modules', and show that this yields a proper subclass of the principal modules. We describe how a principal module leads to the description of a gauge theory, and we provide two basic yet illustrative examples.Comment: 34 pages, minor revision

A planning program and the design for a single enterprise community in the Subarctic

Thesis (M.C.P.) Massachusetts Institute of Technology. Dept. of Architecture, 1956.ACCOMPANYING drawings held by MIT Museum.Includes bibliographies.by James Arthur Hatcher and David Dunsmore Wallace.M.C.P

More Torsion in the Homology of the Matching Complex

A matching on a set $X$ is a collection of pairwise disjoint subsets of $X$ of size two. Using computers, we analyze the integral homology of the matching complex $M_n$, which is the simplicial complex of matchings on the set $\{1, >..., n\}$. The main result is the detection of elements of order $p$ in the homology for $p \in \{5,7,11,13\}$. Specifically, we show that there are elements of order 5 in the homology of $M_n$ for $n \ge 18$ and for $n \in {14,16}$. The only previously known value was $n = 14$, and in this particular case we have a new computer-free proof. Moreover, we show that there are elements of order 7 in the homology of $M_n$ for all odd $n$ between 23 and 41 and for $n=30$. In addition, there are elements of order 11 in the homology of $M_{47}$ and elements of order 13 in the homology of $M_{62}$. Finally, we compute the ranks of the Sylow 3- and 5-subgroups of the torsion part of $H_d(M_n;Z)$ for $13 \le n \le 16$; a complete description of the homology already exists for $n \le 12$. To prove the results, we use a representation-theoretic approach, examining subcomplexes of the chain complex of $M_n$ obtained by letting certain groups act on the chain complex.Comment: 35 pages, 10 figure

Compactness for Holomorphic Supercurves

We study the compactness problem for moduli spaces of holomorphic supercurves which, being motivated by supergeometry, are perturbed such as to allow for transversality. We give an explicit construction of limiting objects for sequences of holomorphic supercurves and prove that, in important cases, every such sequence has a convergent subsequence provided that a suitable extension of the classical energy is uniformly bounded. This is a version of Gromov compactness. Finally, we introduce a topology on the moduli spaces enlarged by the limiting objects which makes these spaces compact and metrisable.Comment: 38 page

On the Expansions in Spin Foam Cosmology

We discuss the expansions used in spin foam cosmology. We point out that already at the one vertex level arbitrarily complicated amplitudes contribute, and discuss the geometric asymptotics of the five simplest ones. We discuss what type of consistency conditions would be required to control the expansion. We show that the factorisation of the amplitude originally considered is best interpreted in topological terms. We then consider the next higher term in the graph expansion. We demonstrate the tension between the truncation to small graphs and going to the homogeneous sector, and conclude that it is necessary to truncate the dynamics as well.Comment: 17 pages, 4 figures, published versio

Differences in client and therapist views of the working alliance in drug treatment

Background - There is growing evidence that the therapeutic alliance is one of the most consistent predictors of retention and outcomes in drug treatment. Recent psychotherapy research has indicated that there is a lack of agreement between client, therapist and observer ratings of the therapeutic alliance; however, the clinical implications of this lack of consensus have not been explored. Aims - The aims of the study are to (1) explore the extent to which, in drug treatment, clients and counsellors agree in their perceptions of their alliance, and (2) investigate whether the degree of disagreement between clients and counsellors is related to retention in treatment. Methods - The study recruited 187 clients starting residential rehabilitation treatment for drug misuse in three UK services. Client and counsellor ratings of the therapeutic alliance (using the WAI-S) were obtained during weeks 1-12. Retention was in this study defined as remaining in treatment for at least 12 weeks. Results - Client and counsellor ratings of the alliance were only weakly related (correlations ranging from r = 0.07 to 0.42) and tended to become more dissimilar over the first 12 weeks in treatment. However, whether or not clients and counsellors agreed on the quality of their relationship did not influence whether clients were retained in treatment. Conclusions - The low consensus between client and counsellor views of the alliance found in this and other studies highlights the need for drug counsellors to attend closely to their clients' perceptions of the alliance and to seek regular feedback from clients regarding their feelings about their therapeutic relationship