In multispectral imaging, Wiener estimation is widely adopted for the reconstruction of spectral reflectance. We propose an improved reflectance reconstruction method by adaptively selecting training samples for the autocorrelation matrix calculation in Wiener estimation, without a prior knowledge of the spectral information of the samples being imaged. The performance of the proposed adaptive ...

wiener index is a topological index based on distance between every pair of vertices in agraph g. it was introduced in 1947 by one of the pioneer of this area e.g, harold wiener. inthe present paper, by using a new method introduced by klavžar we compute the wiener andszeged indices of some nanostar dendrimers.

The aim of this paper is to investigate the effect of noises on performance of speech signal de-noising using the method based on wavelets, wiener filtering and ICA. Determination of voiced and unvoiced speech, low and high pitch, and methods for selecting appropriate wavelets for speech compression are discussed. Discrete wavelet transform (DWT) has been applied for suppression of additive noi...

Noise radiated by rotating and reciprocating machines is often a mixture of multiple complex sources, the successful reduction of which is a field of intensive research. In this paper an advanced source separation approach is presented, based on cyclic Wiener filtering, which takes into account the cyclostationarity property of the signals. The aim of the Wiener filter is the separation of nois...

Let L be the class of limiting laws associated with sequences in the second Wiener chaos. We exhibit a large subset L0 ⊂ L satisfying that, for any F∞ ∈ L0, the convergence of only a finite number of cumulants suffices to imply the convergence in law of any sequence in the second Wiener chaos to F∞. This result is in the spirit of the seminal paper [12], in which Nualart and Peccati discovered ...

The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...

Graphs are used to model chemical compounds and drugs. In the graphs, each vertex represents an atom of molecule and edges between the corresponding vertices are used to represent covalent bounds between atoms. The Wiener polarity index W p (G) of a graph G is the number of unordered pairs of vertices u, v of G such that the distance between u and v is equal to 3. The trees and unicyclic graphs...

—In this paper, we consider a digital radio mondiale (DRM) system using orthogonal frequency division multiplexing (OFDM) with coherent detection at the receiver. The DRM pilots are two-dimensional distribution, linear interpolation and Wiener filter interpolation respectively used in the time and frequency domain as the channel estimation algorithm. We propose a low-complexity improved Wiener...

Fullerene graphs are mathematical models of fullerene molecules. The Wiener (r,s)-complexity a graph G with vertex set V(G) is the number pairwise distinct values (r,s)-transmiss...

The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition...