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.
This paper studies what is the right relay protocol strategy for a low density parity check (LDPC) cooperative diversity scheme. In this scheme, an improved maximum likelihood detection (MLD) featuring Log-likelihood (LLR) combining technique is also introduced. A basic cooperative diversity scheme of a source node (S), a relay node (R) and a common destination node (D) is considered. This scheme...
In this paper, new discretized models of fractional order differentiator (FOD) (sr) and fractional order integrator (FOI) (s-r) based on first and higher order operators are proposed. Specifically in this work, one-third (s??1/3) and one-fourth (s??1/4) order differentiator and integrator models based on first order Al-Alaoui and Hsue operator, second order Schneider operator and third order Al-Alaoui...
Epilepsy affects 50 million population in the world and the death rate of sudden unexpected death in epilepsy (SUDEP) is the top of death rate of this population. Unfortunately, seizure prediction with a time horizon of minutes to hours remains an open issue and a clinically applicable solution is still not available. In our research, a novel seizure prediction method based on probability density...
This paper presents hardware architecture and FPGA implementation of a parallel genetic algorithm called elitism-based compact genetic algorithm (EC-CGA). EC-CGA uses the probability model migration instead of migrating individuals in the population. The performance of the EC-CGA is enhanced by elitism-based approach. We propose scalable hardware architecture for the EC-CGA. The highly parallelized...
Closed-form expressions for the capacity of dual-selection combining and maximal-ratio combining diversity systems over slowly varying correlated Hoyt fading channels has been presented. Different power and rate adaptation techniques available in the literature has been considered for the capacity analysis. A study on the effects of correlation and fading parameters on the channel capacity of the...
The multi-sensor multi-target localization and data fusion problem is discussed, and a novel data fusion method called grid-based probability density matrix (GBPDM) is proposed. Dividing the common observe space into numerous of small grids, the measurements containing uncertainties can be represented by their sampled probability density functions. By adding probability density of all measurements...
In this paper, we experimental investigate if the current reversible data hiding schemes are detectable. By modeling the distributions of horizontal pixel difference of natural image using generalized Gaussian model, we find that the horizontal difference histogram of watermarked image is significantly altered. Furthermore, the difference between the horizontal and the vertical difference histogram...
This paper presents a new wavelet domain adaptive despeckling technique for contrast enhancement of medical ultrasound (US) images for improving the clinical diagnosis. This method uses the Rayleigh distribution for modeling the speckle wavelet coefficients and the signal wavelet coefficients are approximated using the Gaussian distribution. Combining these as statistical priors, we have developed...
We propose a method to edit RGBNs (images with a color and a normal channel). High resolution RGBNs are easy to obtain using photometric stereo. Free editing will result in normals which do not correspond to any realizable surface. Our normal operators guarantee the integrability of the results. Our method can filter normals with any linear kernel allowing high-pass and edge-enhancement filters. We...
The medial axis, also known as symmetry axis, is a special type of skeleton that has a number of interesting properties. It is a powerful tool in applications involving pattern recognition, image analysis, path planning and mesh generation, to name a few. Since the proposal and definition of the medial axis, in 1967, much effort has been done to develop fast and accurate methods for calculating the...
This paper presents a novel methodology to perform matching between image points described by their respective features. Traditionally, such correspondences are determined by computing the similarity between descriptor vectors associated to each point which are obtained by invariant descriptors. Our methodology first obtains a coarse global registration among images, which constrains the correspondence...
The paper presents a Domain Specific Language (DSL) for a multi-core segmented bus platform, SegBus. The DSL, based on a UML profile, consists of graphical platform elements in the form of stereotypes with the necessary tagged values to depict platform aspects at high level of abstraction. Customizations are applied to each stereotyped element in the form of user-defined rules to restrict relationship...
We describe a scheme for rate-distortion with distributed encoding in which the sources to be compressed contain a common component. We show that this scheme is optimal in some situations and that it strictly improves upon existing schemes, which do not make full use of common components. This resolves in the negative an open question regarding whether independent quantization followed by independent...
Limited lookahead control policies adapt the concept of supervisor synthesis in discrete-event systems (DES) to work for very large and/or dynamic systems. This is accomplished by considering an N-step projection of possible behaviours of the system, instead of dealing directly with the entire system. This paper builds on previous work to produce a limited lookahead algorithm that incorporates probabilistic...
Random key graphs are random graphs induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. For this class of random graphs we show the existence of a zero-one law for the appearance of triangles, and identify the corresponding critical scaling. This is done by applying the method of first and second moments to the number of triangles in the...
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes, with bounded computation and storage capabilities that do not scale with the network size. Our goal is to characterize the class of functions that can be computed within this model. In our main result, we exhibit a class of non-computable functions, and prove that every function outside...
We formulate a new approach to understanding the behavior of the min-sum algorithm by exploiting the properties of graph covers. First, we present a new, natural characterization of scaled diagonally dominant matrices in terms of graph covers; this result motivates our approach because scaled diagonal dominance is a known sufficient condition for the convergence of min-sum in the case of quadratic...
A hard-deadline, opportunistic scheduling problem in which B bits must be transmitted within T time-slots over a time-varying channel is studied: the transmitter must decide how many bits to serve in each slot based on knowledge of the current channel but without knowledge of the channel in future slots, with the objective of minimizing expected transmission energy. In order to focus on the effects...
We analyze the asymptotic variance of distributed consensus algorithms over large-scale switching random networks. Our analysis is focused on consensus algorithms over large, i.i.d., and directed Erdo??s-Re??nyi random graphs. We assume that every agent can communicate with any other agent with some fixed probability c/n, where c is the expected number of neighbors of each agent and n is the size...
In this paper, we investigate the asymptotic capacity of a half-duplex large fading relay network, which consists of one source node, one destination node, and N relay nodes. The relay nodes are assumed to be randomly deployed in a given area and subject to independent random failures (e.g., due to fatal random physical attacks) with probability p. With a total power constraint on all the nodes, we...
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.