Deconvolution Under Normalized Autocorrelation Constraints

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Change detection under autocorrelation

Judgmental detection of changes in time series is an ubiquitous task. Previous research has shown that human observers are often relatively poor at detecting change, especially when the series are serially dependent (autocorrelated). We present two experiments in which participants were asked to judge the occurrence of changes in time series with varying levels of autocorrelation. Results show ...

متن کامل

Elementary constraints on autocorrelation function scalings.

Elementary algebraic constraints on the form of an autocorrelation function C(t(w)+tau,t(w)) rule out some two-time scalings found in the literature as possible long-time asymptotic forms. The same argument leads to the realization that two usual definitions of many-time scale relaxation for aging systems are not equivalent.

متن کامل

Fast Deconvolution with Color Constraints on Gradients

In this report, we describe a fast deconvolution approach for color images that combines a sparse regularization cost on the magnitudes of gradients with constraints on their direction in color space. We form these color constraints in a way that allows retaining the computationally-efficient optimization strategy introduced in recent deconvolution methods based on \emph{half-quadratic splittin...

متن کامل

Spatial autocorrelation of genotypes under directional selection.

The spatial distributions of genetic variation under selection-mutation equilibrium within populations that have limited dispersal are investigated. The results show that directional selection with moderate strength rapidly reduces the amount of genetic structure and spatial autocorrelations far below that predicted for selectively neutral loci. For the latter, homozygotes are spatially cluster...

متن کامل

Flexible job shop scheduling under availability constraints

In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SPE Journal

سال: 1997

ISSN: 1086-055X,1930-0220

DOI: 10.2118/28405-pa