arXiv subjects

Jonathan Mason

Publications and source records attributed to Jonathan Mason.

5 recordsLinked to original sources

arXiv2017

Can Planning Images Reduce Scatter in Follow-Up Cone-Beam CT?

Due to its wide field of view, cone-beam computed tomography (CBCT) is plagued by large amounts of scatter, where attenuated photons hit the detector, and corrupt the linear models used for reconstruction. Given that one can generate a good estimate of scatter however, then image accuracy can be retained. In the context of adaptive radiotherapy, one usually has a low-scatter planning CT image of the same patient at an earlier time. Correcting for scatter in the subsequent CBCT scan can either be self consistent with the new measurements or exploit the prior image, and there are several recent methods that report high accuracy with the latter. In this study, we will look at the accuracy of various scatter estimation methods, how they can be effectively incorporated into a statistical reconstruction algorithm, along with introducing a method for matching off-line Monte-Carlo (MC) prior estimates to the new measurements. Conclusions we draw from testing on a neck cancer patient are: statistical reconstruction that incorporates the scatter estimate significantly outperforms analytic and iterative methods with pre-correction; and although the most accurate scatter estimates can be made from the MC on planning image, they only offer a slight advantage over the measurement based scatter kernel superposition (SKS) in reconstruction error.

physics.med-ph↗

arXiv2015

Quasi-Conscious Multivariate Systems

Conscious experience is awash with underlying relationships. Moreover, for various brain regions such as the visual cortex, the system is biased toward some states. Representing this bias using a probability distribution shows that the system can define expected quantities. The mathematical theory in the present paper links these facts by using expected float entropy (efe), which is a measure of the expected amount of information needed, to specify the state of the system, beyond what is already known about the system from relationships that appear as parameters. Under the requirement that the relationship parameters minimise efe, the brain defines relationships. It is proposed that when a brain state is interpreted in the context of these relationships the brain state acquires meaning in the form of the relational content of the associated experience. For a given set, the theory represents relationships using weighted relations which assign continuous weights, from 0 to 1, to the elements of the Cartesian product of that set. The relationship parameters include weighted relations on the nodes of the system and on their set of states. Examples obtained using Monte-Carlo methods (where relationship parameters are chosen uniformly at random) suggest that efe distributions with long left tails are most important.

q-bio.NC↗

arXiv2010

A survey of non-complex analogs of uniform algebras

We survey commutative and non-commutative analogs of uniform algebras in the Archimedean settings and also offer some non-Archimedean examples. Constraints on the development of non-complex uniform algebras are also discussed.

math.FA↗

arXiv2010

An inductive proof of the Feinstein-Heath Swiss cheese "classicalisation" theorem

A theory of allocation maps has been developed by J. F. Feinstein and M. J. Heath in order to prove a theorem, using Zorn's lemma, concerning the compact plane sets known as Swiss cheese sets. These sets are important since, as domains, they provide a good source of examples in the theory of uniform algebras and rational approximation. In this paper we take a more direct approach when proving their theorem by using transfinite induction and cardinality. An explicit reference to a theory of allocation maps is no longer required. Instead we find that the repeated application of a single operation developed from the final step of the proof by Feinstein and Heath is enough.

math.FA↗

arXiv2008

Some consequences of Schanuel's Conjecture

During the Arizona Winter School 2008 (held in Tucson, AZ) we worked on the following problems: a) (Expanding a remark by S. Lang). Define $E_0 = \overline{\mathbb{Q}}$ Inductively, for $n \geq 1$, define $E_n$ as the algebraic closure of the field generated over $E_{n-1}$ by the numbers $\exp(x)=e^x$, where $x$ ranges over $E_{n-1}$. Let $E$ be the union of $E_n$, $n \geq 0$. Show that Schanuel's Conjecture implies that the numbers $π, \log π, \log \log π, \log \log \log π, \ldots $ are algebraically independent over $E$. b) Try to get a (conjectural) generalization involving the field $L$ defined as follows. Define $L_0 = \overline{\mathbb{Q}}$. Inductively, for $n \geq 1$, define $L_n$ as the algebraic closure of the field generated over $L_{n-1}$ by the numbers $y$, where $y$ ranges over the set of complex numbers such that $e^y\in L_{n-1}$. Let $L$ be the union of $L_n$, $n \geq 0$. We were able to prove that Schanuel's Conjecture implies $E$ and $L$ are linearly disjoint over $\overline{\mathbb{Q}}$.

math.NT↗