نتایج جستجو برای: distortion bounds and convolution
تعداد نتایج: 16843437 فیلتر نتایج به سال:
We investigate the joint source-channel coding (JSCC) excess distortion exponent EJ (the exponent of the probability of exceeding a prescribed distortion level) for memoryless communication systems with continuous alphabets. We first establish upper and lower bounds for EJ for systems consisting of a memoryless Gaussian source under the squared-error distortion fidelity criterion and a memoryle...
Making use of the familiar convolution structure of analytic functions, in this paper we introduce and investigate two new subclasses of multivalently analytic functions of complex order. Among the various results obtained here for each of these function classes, we derive the coefficient bounds and coefficient inequalities, and inclusion and neighborhood properties, involving multivalently ana...
In this paper, an advanced computational technique has been presented to compute the error bounds and subdivision depth of quaternary schemes. First, estimation is computed bound between limit curves/surfaces their polygons after kth-level by using l0 order convolution. Secondly, bounds, schemes computed. Moreover, needs fewer iterations (subdivision depth) get optimal as compared existing tech...
Quantization index modulation (QIM) is a powerful hostinterference rejecting method for data hiding. This paper applies QIM to one-bit watermarking and proposes a simple but powerful watermark detector. We derive lower bounds on the error exponents for the detector under a quadratic distortion constraint for the watermarker and additive white Gaussian noise attacks. These bounds are independent...
The paper studies the exponential and non–exponential convergence rate to zero of solutions of scalar linear convolution Itô-Volterra equations in which the noise intensity depends linearly on the current state. By exploiting the positivity of the solution, various upper and lower bounds in first mean and almost sure sense are obtained, including Liapunov exponents .
Performance prediction is a crucial step for transforming the eld of object recognition from an art to a science. In this paper, we address this problem in the context of a vote-based approach for object recognition using 2-D point features. A method is presented for predicting tight lower and upper bounds on fundamental performance of the selected recognition approach. Performance bounds are p...
In the present paper, we investigate some basic properties of a subclass of harmonic functions defined by multiplier transformations. Such as, coefficient inequalities, distortion bounds and extreme points.
We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f(x1, . . . , xn) = (y1, . . . , ym) is an algebraic problem, we consider serving on-line requests of the form “change input xi to value v” or “what is the value of output yi?”. We present techniques for showing lower bounds on ...
The aim of this paper is to establish the coefficient bounds for certain classes of analytic functions associated with q-difference operator. Certain applications of these results for the functions defined through convolution are also obtained. 2010 Mathematics Subject Classifications: Primary 30C45; Secondary 30C50
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید