95 resultados para decision fusion
Resumo:
For compressed sensing (CS), we develop a new scheme inspired by data fusion principles. In the proposed fusion based scheme, several CS reconstruction algorithms participate and they are executed in parallel, independently. The final estimate of the underlying sparse signal is derived by fusing the estimates obtained from the participating algorithms. We theoretically analyze this fusion based scheme and derive sufficient conditions for achieving a better reconstruction performance than any participating algorithm. Through simulations, we show that the proposed scheme has two specific advantages: 1) it provides good performance in a low dimensional measurement regime, and 2) it can deal with different statistical natures of the underlying sparse signals. The experimental results on real ECG signals shows that the proposed scheme demands fewer CS measurements for an approximate sparse signal reconstruction.
Resumo:
Determining the spin and the parity quantum numbers of the recently discovered Higgs-like boson at the LHC is a matter of great importance. In this Letter, we consider the possibility of using the kinematics of the tagging jets in Higgs production via the vector boson fusion (VBF) process to test the tensor structure of the Higgs-vector boson (HVV) interaction and to determine the spin and CP properties of the observed resonance. We show that an anomalous HVV vertex, in particular its explicit momentum dependence, drastically affects the rapidity between the two scattered quarks and their transverse momenta and, hence, the acceptance of the kinematical cuts that allow to select the VBF topology. The sensitivity of these observables to different spin-parity assignments, including the dependence on the LHC center of mass energy, are evaluated. In addition, we show that in associated Higgs production with a vector boson some kinematical variables, such as the invariant mass of the system and the transverse momenta of the two bosons and their separation in rapidity, are also sensitive to the spin-parity assignments of the Higgs-like boson.
Resumo:
This paper considers antenna selection (AS) at a receiver equipped with multiple antenna elements but only a single radio frequency chain for packet reception. As information about the channel state is acquired using training symbols (pilots), the receiver makes its AS decisions based on noisy channel estimates. Additional information that can be exploited for AS includes the time-correlation of the wireless channel and the results of the link-layer error checks upon receiving the data packets. In this scenario, the task of the receiver is to sequentially select (a) the pilot symbol allocation, i.e., how to distribute the available pilot symbols among the antenna elements, for channel estimation on each of the receive antennas; and (b) the antenna to be used for data packet reception. The goal is to maximize the expected throughput, based on the past history of allocation and selection decisions, and the corresponding noisy channel estimates and error check results. Since the channel state is only partially observed through the noisy pilots and the error checks, the joint problem of pilot allocation and AS is modeled as a partially observed Markov decision process (POMDP). The solution to the POMDP yields the policy that maximizes the long-term expected throughput. Using the Finite State Markov Chain (FSMC) model for the wireless channel, the performance of the POMDP solution is compared with that of other existing schemes, and it is illustrated through numerical evaluation that the POMDP solution significantly outperforms them.
Resumo:
Mechanisms involved in establishing the organization and numbers of fibres in a muscle are not completely understood. During Drosophila indirect flight muscle (IFM) formation, muscle growth is achieved by both incorporating hundreds of nuclei, and hypertrophy. As a result, IFMs provide a good model with which to understand the mechanisms that govern overall muscle organization and growth. We present a detailed analysis of the organization of dorsal longitudinal muscles (DLMs), a subset of the IFMs. We show that each DLM is similar to a vertebrate fascicle and consists of multiple muscle fibres. However, increased fascicle size does not necessarily change the number of constituent fibres, but does increase the number of myofibrils packed within the fibres. We also find that altering the number of myoblasts available for fusion changes DLM fascicle size and fibres are loosely packed with myofibrils. Additionally, we show that knock down of genes required for mitochondrial fusion causes a severe reduction in the size of DLM fascicles and fibres. Our results establish the organization levels of DLMs and highlight the importance of the appropriate number of nuclei and mitochondrial fusion in determining the overall organization, growth and size of DLMs. (C) 2013 Elsevier Inc. All rights reserved.
Resumo:
This paper addresses the problem of finding optimal power control policies for wireless energy harvesting sensor (EHS) nodes with automatic repeat request (ARQ)-based packet transmissions. The EHS harvests energy from the environment according to a Bernoulli process; and it is required to operate within the constraint of energy neutrality. The EHS obtains partial channel state information (CSI) at the transmitter through the link-layer ARQ protocol, via the ACK/NACK feedback messages, and uses it to adapt the transmission power for the packet (re)transmission attempts. The underlying wireless fading channel is modeled as a finite state Markov chain with known transition probabilities. Thus, the goal of the power management policy is to determine the best power setting for the current packet transmission attempt, so as to maximize a long-run expected reward such as the expected outage probability. The problem is addressed in a decision-theoretic framework by casting it as a partially observable Markov decision process (POMDP). Due to the large size of the state-space, the exact solution to the POMDP is computationally expensive. Hence, two popular approximate solutions are considered, which yield good power management policies for the transmission attempts. Monte Carlo simulation results illustrate the efficacy of the approach and show that the approximate solutions significantly outperform conventional approaches.
Resumo:
Tight fusion frames which form optimal packings in Grassmannian manifolds are of interest in signal processing and communication applications. In this paper, we study optimal packings and fusion frames having a specific structure for use in block sparse recovery problems. The paper starts with a sufficient condition for a set of subspaces to be an optimal packing. Further, a method of using optimal Grassmannian frames to construct tight fusion frames which form optimal packings is given. Then, we derive a lower bound on the block coherence of dictionaries used in block sparse recovery. From this result, we conclude that the Grassmannian fusion frames considered in this paper are optimal from the block coherence point of view. (C) 2013 Elsevier B.V. All rights reserved.
Resumo:
Mitochondrial biogenesis and morphological changes are associated with tissue-specific functional demand, but the factors and pathways that regulate these processes have not been completely identified. A lack of mitochondrial fusion has been implicated in various developmental and pathological defects. The spatiotemporal regulation of mitochondrial fusion in a tissue such as muscle is not well understood. Here, we show in Drosophila indirect flight muscles (IFMs) that the nuclear-encoded mitochondrial inner membrane fusion gene, Opa1-like, is regulated in a spatiotemporal fashion by the transcription factor/co-activator Erect wing (Ewg). In IFMs null for Ewg, mitochondria undergo mitophagy and/or autophagy accompanied by reduced mitochondrial functioning and muscle degeneration. By following the dynamics of mitochondrial growth and shape in IFMs, we found that mitochondria grow extensively and fuse during late pupal development to form the large tubular mitochondria. Our evidence shows that Ewg expression during early IFM development is sufficient to upregulate Opa1-like, which itself is a requisite for both late pupal mitochondrial fusion and muscle maintenance. Concomitantly, by knocking down Opa1-like during early muscle development, we show that it is important for mitochondrial fusion, muscle differentiation and muscle organization. However, knocking down Opa1-like, after the expression window of Ewg did not cause mitochondrial or muscle defects. This study identifies a mechanism by which mitochondrial fusion is regulated spatiotemporally by Ewg through Opa1-like during IFM differentiation and growth.
Resumo:
Numerous algorithms have been proposed recently for sparse signal recovery in Compressed Sensing (CS). In practice, the number of measurements can be very limited due to the nature of the problem and/or the underlying statistical distribution of the non-zero elements of the sparse signal may not be known a priori. It has been observed that the performance of any sparse signal recovery algorithm depends on these factors, which makes the selection of a suitable sparse recovery algorithm difficult. To take advantage in such situations, we propose to use a fusion framework using which we employ multiple sparse signal recovery algorithms and fuse their estimates to get a better estimate. Theoretical results justifying the performance improvement are shown. The efficacy of the proposed scheme is demonstrated by Monte Carlo simulations using synthetic sparse signals and ECG signals selected from MIT-BIH database.
Resumo:
Recently, it has been shown that fusion of the estimates of a set of sparse recovery algorithms result in an estimate better than the best estimate in the set, especially when the number of measurements is very limited. Though these schemes provide better sparse signal recovery performance, the higher computational requirement makes it less attractive for low latency applications. To alleviate this drawback, in this paper, we develop a progressive fusion based scheme for low latency applications in compressed sensing. In progressive fusion, the estimates of the participating algorithms are fused progressively according to the availability of estimates. The availability of estimates depends on computational complexity of the participating algorithms, in turn on their latency requirement. Unlike the other fusion algorithms, the proposed progressive fusion algorithm provides quick interim results and successive refinements during the fusion process, which is highly desirable in low latency applications. We analyse the developed scheme by providing sufficient conditions for improvement of CS reconstruction quality and show the practical efficacy by numerical experiments using synthetic and real-world data. (C) 2013 Elsevier B.V. All rights reserved.
Resumo:
H. 264/advanced video coding surveillance video encoders use the Skip mode specified by the standard to reduce bandwidth. They also use multiple frames as reference for motion-compensated prediction. In this paper, we propose two techniques to reduce the bandwidth and computational cost of static camera surveillance video encoders without affecting detection and recognition performance. A spatial sampler is proposed to sample pixels that are segmented using a Gaussian mixture model. Modified weight updates are derived for the parameters of the mixture model to reduce floating point computations. A storage pattern of the parameters in memory is also modified to improve cache performance. Skip selection is performed using the segmentation results of the sampled pixels. The second contribution is a low computational cost algorithm to choose the reference frames. The proposed reference frame selection algorithm reduces the cost of coding uncovered background regions. We also study the number of reference frames required to achieve good coding efficiency. Distortion over foreground pixels is measured to quantify the performance of the proposed techniques. Experimental results show bit rate savings of up to 94.5% over methods proposed in literature on video surveillance data sets. The proposed techniques also provide up to 74.5% reduction in compression complexity without increasing the distortion over the foreground regions in the video sequence.
Resumo:
This article highlights different synthetic strategies for the preparation of colloidal heterostructured nanocrystals, where at least one component of the constituent nanostructure is a semiconductor. Growth of shell material on a core nanocrystal acting as a seed for heterogeneous nucleation of the shell has been discussed. This seeded-growth technique, being one of the most heavily explored mechanisms, has already been discussed in many other excellent review articles. However, here our discussion has been focused differently based on composition (semiconductor@semiconductor, magnet@semiconductor, metal@semiconductor and vice versa), shape anisotropy of the shell growth, and synthetic methodology such as one-step vs. multi-step. The relatively less explored strategy of preparing heterostructures via colloidal sintering of different nanostructures, known as nanocrystal-fusion, has been reviewed here. The ion-exchange strategy, which has recently attracted huge research interest, where compositional tuning of nanocrystals can be achieved by exchanging either the cation or anion of a nanocrystal, has also been discussed. Specifically, controlled partial ion exchange has been critically reviewed as a viable synthetic strategy for the fabrication of heterostructures. Notably, we have also included the very recent methodology of utilizing inorganic ligands for the fabrication of heterostructured colloidal nanocrystals. This unique strategy of inorganic ligands has appeared as a new frontier for the synthesis of heterostructures and is reviewed in detail here for the first time. In all these cases, recent developments have been discussed with greater detail to add upon the existing reviews on this broad topic of semiconductor-based colloidal heterostructured nanocrystals.
Resumo:
Cryosorption pump is the only possible device to pump helium, hydrogen and its isotopes in fusion environment, such as high magnetic field and high plasma temperatures. Activated carbons are known to be the most suitable adsorbent in the development of cryosorption pumps. For this purpose, the data of adsorption characteristics of activated carbons in the temperature range 4.5 K to 77 K are needed, but are not available in the literature. For obtaining the above data, a commercial micro pore analyzer operating at 77 K has been integrated with a two stage GM cryocooler, which enables the cooling of the sample temperature down to 4.5 K. A heat switch mounted between the second stage cold head and the sample chamber helps to raise the sample chamber temperature to 77 K without affecting the performance of the cryocooler. The detailed description of this system is presented elsewhere. This paper presents the results of experimental studies of adsorption isotherms measured on different types of activated carbons in the form of granules, globules, flake knitted and non-woven types in the temperature range 4.5 K to 10 K using Helium gas as the adsorbate. The above results are analyzed to obtain the pore size distributions and surface areas of the activated carbons. The effect of adhesive used for bonding the activated carbons to the panels is also studied. These results will be useful to arrive at the right choice of activated carbon to be used for the development of cryosorption pumps.
Resumo:
This paper considers cooperative spectrum sensing algorithms for Cognitive Radios which focus on reducing the number of samples to make a reliable detection. We propose algorithms based on decentralized sequential hypothesis testing in which the Cognitive Radios sequentially collect the observations, make local decisions and send them to the fusion center for further processing to make a final decision on spectrum usage. The reporting channel between the Cognitive Radios and the fusion center is assumed more realistically as a Multiple Access Channel (MAC) with receiver noise. Furthermore the communication for reporting is limited, thereby reducing the communication cost. We start with an algorithm where the fusion center uses an SPRT-like (Sequential Probability Ratio Test) procedure and theoretically analyze its performance. Asymptotically, its performance is close to the optimal centralized test without fusion center noise. We further modify this algorithm to improve its performance at practical operating points. Later we generalize these algorithms to handle uncertainties in SNR and fading. (C) 2014 Elsevier B.V. All rights reserved.
Resumo:
This paper proposes an optical flow algorithm by adapting Approximate Nearest Neighbor Fields (ANNF) to obtain a pixel level optical flow between image sequence. Patch similarity based coherency is performed to refine the ANNF maps. Further improvement in mapping between the two images are obtained by fusing bidirectional ANNF maps between pair of images. Thus a highly accurate pixel level flow is obtained between the pair of images. Using pyramidal cost optimization, the pixel level optical flow is further optimized to a sub-pixel level. The proposed approach is evaluated on the middlebury dataset and the performance obtained is comparable with the state of the art approaches. Furthermore, the proposed approach can be used to compute large displacement optical flow as evaluated using MPI Sintel dataset.