No description available.

In this paper we focus on the problem of estimating a bounded density using a finite combination of densities from a given class. We consider the Maximum Likelihood Procedure (MLE) and the greedy procedure described by Li and Barron. Approximation and estimation bounds are given for the above methods. We extend and improve upon the estimation results of Li and Barron, and in particular prove an $O(\\frac{1}{\\sqrt{n}})$ bound on the estimation error which does not depend on the number of densities in the estimated combination.

PET (positron emission tomography) scans are still in the experimental phase, as one of the newest breast cancer diagnostic techniques. It is becoming the new standard in neurology, oncology and cardiology. PET, like other nuclear medicine diagnostic and treatment techniques, involves the use of radiation. Because of the negative impact of radioactivity to our bodies the radiation doses in PET should be small. The existing computing algorithms for calculating PET images can be divided into two broad categories: analytical and iterative methods. In the analytical approach the relation between the picture and its projections is expressed by a set of integral equations which are then solved analytically. The Fourier backprojection (FBP) algorithm is a numerical approximation of this analytical solution. Iterative approaches use deterministic (ART = Algebraic Reconstructed Technique) or stochastic (EM = Expectation Maximization) algorithms. My proposed kernel density estimation (KDE) algorithm also falls also into the category of iterative methods. However, in this approach each coincidence event is considered individually. The estimate location of the annihilation event that caused each coincidence event is based on the previously assigned location of events processed earlier. To accomplish this, we construct a probability distribution along each coincidence line. This is generated from previous annihilation points by density estimation. It is shown that this density estimation approach to PET can reconstruct an image of an existing tumor using significantly less data than the standard CT algorithms, such as FBP. Therefore, it might be very promising technique allowing reduced radiation dose for patients, while retaining or improving image quality. / October 2007

PET (positron emission tomography) scans are still in the experimental phase, as one of the newest breast cancer diagnostic techniques. It is becoming the new standard in neurology, oncology and cardiology. PET, like other nuclear medicine diagnostic and treatment techniques, involves the use of radiation. Because of the negative impact of radioactivity to our bodies the radiation doses in PET should be small. The existing computing algorithms for calculating PET images can be divided into two broad categories: analytical and iterative methods. In the analytical approach the relation between the picture and its projections is expressed by a set of integral equations which are then solved analytically. The Fourier backprojection (FBP) algorithm is a numerical approximation of this analytical solution. Iterative approaches use deterministic (ART = Algebraic Reconstructed Technique) or stochastic (EM = Expectation Maximization) algorithms. My proposed kernel density estimation (KDE) algorithm also falls also into the category of iterative methods. However, in this approach each coincidence event is considered individually. The estimate location of the annihilation event that caused each coincidence event is based on the previously assigned location of events processed earlier. To accomplish this, we construct a probability distribution along each coincidence line. This is generated from previous annihilation points by density estimation. It is shown that this density estimation approach to PET can reconstruct an image of an existing tumor using significantly less data than the standard CT algorithms, such as FBP. Therefore, it might be very promising technique allowing reduced radiation dose for patients, while retaining or improving image quality.

PET (positron emission tomography) scans are still in the experimental phase, as one of the newest breast cancer diagnostic techniques. It is becoming the new standard in neurology, oncology and cardiology. PET, like other nuclear medicine diagnostic and treatment techniques, involves the use of radiation. Because of the negative impact of radioactivity to our bodies the radiation doses in PET should be small. The existing computing algorithms for calculating PET images can be divided into two broad categories: analytical and iterative methods. In the analytical approach the relation between the picture and its projections is expressed by a set of integral equations which are then solved analytically. The Fourier backprojection (FBP) algorithm is a numerical approximation of this analytical solution. Iterative approaches use deterministic (ART = Algebraic Reconstructed Technique) or stochastic (EM = Expectation Maximization) algorithms. My proposed kernel density estimation (KDE) algorithm also falls also into the category of iterative methods. However, in this approach each coincidence event is considered individually. The estimate location of the annihilation event that caused each coincidence event is based on the previously assigned location of events processed earlier. To accomplish this, we construct a probability distribution along each coincidence line. This is generated from previous annihilation points by density estimation. It is shown that this density estimation approach to PET can reconstruct an image of an existing tumor using significantly less data than the standard CT algorithms, such as FBP. Therefore, it might be very promising technique allowing reduced radiation dose for patients, while retaining or improving image quality.

In this paper we focus on the problem of estimating a boundeddensity using a finite combination of densities from a givenclass. We consider the Maximum Likelihood Procedure (MLE) and the greedy procedure described by Li and Barron. Approximation and estimation bounds are given for the above methods. We extend and improve upon the estimation results of Li and Barron, and in particular prove an $O(\frac{1}{\sqrt{n}})$ bound on the estimation error which does not depend on the number of densities in the estimated combination.

The thesis aims at showing some important methods, theories and applications about non-parametric density estimation via regularization in univariate setting. It gives a brief introduction to non-parametric density estimation, and discuss several well-known methods, for example, histogram and kernel methods. Regularized methods with penalization and shape constraints are the focus of the thesis. Maximum entropy density estimation is introduced and the relationship between taut string and maximum entropy density estimation is explored. Furthermore, the dual and primal theories are discussed and some theoretical proofs corresponding to quasi-concave density estimation are presented. Different the numerical methods of non-parametric density estimation with regularization are classified and compared. Finally, a real data experiment will also be discussed in the last part of the thesis. / Statistics

No description available.

The study showed that density estimation of Eurasian lynx corresponds to 1.3 and 1.2 independent individuals per 100 km2 in the Jvorniky study area for the two time periods and 0.8 independent individuals per 100 km2 for Beskydy study area. The study failed to identify other large carnivores such a wolf (Canis lupus) and bear (Ursus arctos) from both Beskydy and Javorniky study areas. The estimated density of Lynx is low and their numbers should increase in future. There is enough prey base to support the existing population in the two study areas. The main factors effecting Lynx distribution are habitat fragmentation, poaching by humans, depleting the prey base by over hunting leading to starvation, vehicle collisions. Strict measures should be implemented to protect the species and long term study programmes must be started to get a comprehensive knowledge about the biology of species. Reintroductions must be carried over where there are suitable habitat for the survival and propagation of Lynx. The reason for not detecting wolf or bear might be due to the fact that the study areas are wide and the few migrating wolf or bear might be present outside my study area. Also there is lot of possibility to reintroduce wolf in my study area and I hope this will be done in future to ensure better biodiversity and to ensure wildlife conservation.

No description available.