The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We develop a general notion of rearrangement for certain metric groups, and prove a Hardy-Littlewood type inequality. Combining this with a characterization of the extreme points of the set of probability measures with bounded densities with respect to a reference measure, we establish a general min-entropy inequality for convolutions. Special attention is paid to the integers where a min-entropy...
An optimal ∞-Rényi entropy power inequality is derived for d-dimensional random vectors. In fact, the authors establish a matrix ∞-EPI analogous to the generalization of the classical EPI established by Zamir and Feder. The result is achieved by demonstrating uniform distributions as extremizers of a certain class of ∞-Rényi entropy inequalities, and then putting forth a new rearrangement inequality...
Superpixels are perceptually meaningful atomic regions that can effectively capture image features. We propose a novel scale adaptive supervoxel segmentation algorithm for RGB-D images, i.e., small supervoxels in content-dense regions (e.g., with high intensity or color variation) and large supervoxels in content-sparse regions. Among various methods for computing uniform superpixels, simple linear...
We describe the norm of Fourier operator from Lp(T) to lq(ℤ), and from lp(ℤ) to Lq(T) for all p, q ≥ 1, motivated by the problem of finding sharp uncertainty principles expressed in terms of Rényi entropies.
The wavelet entropy is a novel way to measure the signal regularity, and its calculation is based on the energy distribution in wavelet sub-bands. However, wavelet entropy will be largely influenced by the noise usually existed in signals, especially in physiological signals. With aim to get more stable entropy calculation, a windowed wavelet entropy approach is proposed. In this paper, we systemically...
Sensor nodes carry limited, generally irreplaceable, power sources. Therefore, sensor network must focus on power conservation. It is possible to extend the lifetime of a network by controlling its topology through clustering. Overlapping Clustering find its wide applications such as inter-cluster routing, topology discovery, node localization, and recovery from cluster head failure and so on. Topology...
Target tracking in wireless sensor networks with limited recourses is a challenging problem. Thus, deployment of sensor nodes must focus on power conservation. It is possible to extend the lifetime of a network by controlling its topology through clustering. Topology control target tracking-oriented in wireless sensor network is proposed in this paper. When a target move to the sensing filed, cluster...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.