scholarly journals On the range of the attenuated Radon transform in strictly convex sets

2014 ◽  
Vol 367 (8) ◽  
pp. 5375-5398 ◽  
Author(s):  
Kamran Sadiq ◽  
Alexandru Tamasan
2009 ◽  
Vol 61 (2) ◽  
pp. 299-314 ◽  
Author(s):  
Robert J. MacG. Dawson and ◽  
Maria Moszyńska

Abstract. A set in a metric space is called a Čebyšev set if it has a unique “nearest neighbour” to each point of the space. In this paper we generalize this notion, defining a set to be Čebyšev relative to another set if every point in the second set has a unique “nearest neighbour” in the first. We are interested in Čebyšev sets in some hyperspaces over Rn, endowed with the Hausdorff metric, mainly the hyperspaces of compact sets, compact convex sets, and strictly convex compact sets. We present some new classes of Čebyšev and relatively Čebyšev sets in various hyperspaces. In particular, we show that certain nested families of sets are Čebyšev. As these families are characterized purely in terms of containment,without reference to the semi-linear structure of the underlyingmetric space, their properties differ markedly from those of known Čebyšev sets.


2018 ◽  
Vol 10 (04) ◽  
pp. 817-851
Author(s):  
Andrew M. Zimmer

An open convex set in real projective space is called divisible if there exists a discrete group of projective automorphisms which acts cocompactly. There are many examples of such sets and a theorem of Benoist implies that many of these examples are strictly convex, have [Formula: see text] boundary, and have word hyperbolic dividing group. In this paper we study a notion of convexity in complex projective space and show that the only divisible complex convex sets with [Formula: see text] boundary are the projective balls.


Optimization ◽  
2018 ◽  
Vol 68 (7) ◽  
pp. 1321-1335 ◽  
Author(s):  
Truong Xuan Duc Ha ◽  
Johannes Jahn

2006 ◽  
Vol 81 (1) ◽  
pp. 49-62 ◽  
Author(s):  
Leoni Dalla ◽  
Telemachos Hatziafratis

AbstractWe compare the geometric concept of strict convexity of open subsets of Rn with the analytic concept of 2-strict convexity, which is based on the defining functions of the set, and we do this by introducing the class of 2N-strictly convex sets. We also describe an exhaustion process of convex sets by a sequence of 2-strictly convex sets.


Author(s):  
Neng-Yu Zhang ◽  
Bruce F. McEwen ◽  
Joachim Frank

Reconstructions of asymmetric objects computed by electron tomography are distorted due to the absence of information, usually in an angular range from 60 to 90°, which produces a “missing wedge” in Fourier space. These distortions often interfere with the interpretation of results and thus limit biological ultrastructural information which can be obtained. We have attempted to use the Method of Projections Onto Convex Sets (POCS) for restoring the missing information. In POCS, use is made of the fact that known constraints such as positivity, spatial boundedness or an upper energy bound define convex sets in function space. Enforcement of such constraints takes place by iterating a sequence of function-space projections, starting from the original reconstruction, onto the convex sets, until a function in the intersection of all sets is found. First applications of this technique in the field of electron microscopy have been promising.To test POCS on experimental data, we have artificially reduced the range of an existing projection set of a selectively stained Golgi apparatus from ±60° to ±50°, and computed the reconstruction from the reduced set (51 projections). The specimen was prepared from a bull frog spinal ganglion as described by Lindsey and Ellisman and imaged in the high-voltage electron microscope.


Sign in / Sign up

Export Citation Format

Share Document