S. Inati, J-Y. Lee, L. Fleysher, R. Fleysher, L. Greengard Center for Neural Science and Department of Psychology, New York University, New York, NY, United States, Center for Brain Imaging, New York University, New York, NY, United States, Department of Mathematics, New York University, New York, NY, United States, Department of Mathematics, Ewha Womans University, Seoul, Korea, Republic of, C...

A software for processing sets of full-color images of biological tissue histological sections is developed. We used histological sections obtained by the method of high-precision layer-by-layer grinding of frozen biological tissues. The software allows restoring the image of the tissue for an arbitrary cross-section of the tissue sample. Thus, our method is designed to create a full-color 3D r...

Bibliografische Information der Deutschen Bibliothek Die Deutsche Bibliothek verzeichnet diese Publikation in der Deutschen Nationalbibliografie; detaillierte bibliografische Daten sind im Internetüber Das Werk einschließlich aller seiner Teile ist urheberrechtlich geschützt. Jede Verwertung außerhalb der engen Grenzen des Urheberrechtsgesetzes in Deutschland ist ohne Zustimmung des Verlages un...

Increasing concerns about radiation dose have led CT manufacturers to further develop radiation dose reduction tools in the latest generation of CT scanners. These tools include automated tube current modulation, automated tube potential selection, and iterative reconstruction. This review details the principles underlying each of these 3 dose reduction utilities and their different permutation...

A new type of decomposition of graphs – the operator decomposition connected with the classical notion of homogeneous set (or module) is introduced. The properties of this decomposition are described. Using this decomposition we prove the following. Let P and Q be two hereditary graph classes such that P is closed with respect to the operation of join and Q is closed with respect to the operati...

A modified k-deck of a graph G is obtained by removing k edges of G in all possible ways, and adding k (not necessarily new) edges in all possible ways. Krasikov and Roditty asked if it was possible to construct the usual k-edge deck of a graph from its modified k-deck. Earlier I solved this problem for the case when k = 1. In this paper, the problem is completely solved for arbitrary k. The pr...

In recent years the Vision community has shown interest in processing images and video for use by the entertainment industries. Typical applications include 3D reconstruction of models, and rendering graphics models into video. This paper broadly aligns with that trend, but differs in that we process video to emphasise motion in Cartoon-like styles, in which moving objects deform in defiance of...

A modified k-deck of a graph is obtained by removing k edges in all possible ways and adding k (not necessarily new) edges in all possible ways. Krasikov and Roditty used these decks to give an independent proof of Müller’s result on the edge reconstructibility of graphs. They asked if a k-edge deck could be constructed from its modified k-deck. In this paper, we solve the problem when k = 1. W...