Sökning: "sampling algorithms"
Visar resultat 1 - 5 av 150 avhandlingar innehållade orden sampling algorithms.
1. Techniques to Calculate Exact Inclusion Probabilities for Conditional Poisson Sampling and Pareto .pi.ps Sampling Designs
Sammanfattning : This thesis consists of five papers and treats two finite population sampling methods, viz. the Conditional Poisson and the Pareto .pi.ps sampling schemes. LÄS MER
2. Essays on Sample Surveys : Design and Estimation
Sammanfattning : Sampling is a core stage in every survey. A sampling design carefully elaborated may imply not only a more accurate estimation of the parameters of interest, but also a reduction in the required sample size in a study. In this thesis we consider two particular but connected subjects. LÄS MER
3. Cooperative Compressive Sampling
Sammanfattning : Compressed Sampling (CS) is a promising technique capable of acquiring and processing data of large sizes efficiently. The CS technique exploits the inherent sparsity present in most real-world signals to achieve this feat. Most real-world signals, for example, sound, image, physical phenomenon etc., are compressible or sparse in nature. LÄS MER
4. Non-Uniform Sampling in Statistical Signal Processing
Sammanfattning : Non-uniform sampling comes natural in many applications, due to for example imperfect sensors, mismatched clocks or event-triggered phenomena. Examples can be found in automotive industry and data communication as well as medicine and astronomy. LÄS MER
5. Compressed Sensing : Algorithms and Applications
Sammanfattning : The theoretical problem of finding the solution to an underdeterminedset of linear equations has for several years attracted considerable attentionin the literature. This problem has many practical applications.One example of such an application is compressed sensing (cs), whichhas the potential to revolutionize how we acquire and process signals. LÄS MER