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 propose a method for multisensor-multitarget tracking with excellent scalability in the number of targets (which is assumed known), the number of sensors, and the number of measurements per sensor. Our method employs belief propagation based on a “detailed” factor graph that involves both target-related and measurement-related association variables. Using this approach, an increase in the number...
In this paper, we discuss the evaluation of the probabilistic extraction as introduced in [1], by considering three different datasets introduced in [1] -- [3]. the results show the potential of the approach, as well as its reliability and efficiency when analyzing datasets with different properties and structures. This is part of ongoing research aiming to provide a tool to extract, assess and visualize...
In this paper, we presented a Path Planning Algorithm (PPA) for Manipulators based on an improved Backtracking Search Algorithm (BSA). PPA calculates paths by searching grid points in Euclidean space directly instead of Configuration space(C-space). PPA generate copies of point for efficient Path Planning Algorithm and its reduce the complexity of BSA. The algorithm is back track free and resolution...
We consider the problem of planning trajectories for a group of N vehicles, each aiming to reach its own target set while avoiding danger zones of other vehicles. The analysis of problems like this is extremely important practically, especially given the growing interest in utilizing unmanned aircraft systems for civil purposes. The direct solution of this problem by solving a single-obstacle Hamilton-Jacobi-Isaacs...
We revisit A.C. Yao's classic problem of secure function computation by interactive communication, in an information theoretic setting. Our approach, based on examining the underlying common randomness, provides a new proof of the characterization of a securely computable function by deterministic protocols. This approach also yields a characterization of the minimum communication needed for secure...
We consider the problem of erasure/list decoding using certain classes of simplified decoders. Specifically, we assume a class of erasure/list decoders, such that a codeword is in the list if its likelihood is larger than a threshold. This class of decoders both approximates the optimal decoder of Forney, and also includes the following simplified subclasses of decoding rules: The first is a function...
Simulatability condition is a fundamental concept in studying key generation over a non-authenticated public channel, in which Eve is active and can intercept, modify and falsify messages exchanged over the non-authenticated public channel. Using this condition, Maurer and Wolf showed a remarkable “all or nothing” result: if the simulatability condition does not hold, the key capacity over the non-authenticated...
This paper presents the approach and algorithm of joint detection decoding with turbo codes for MIMO wireless communication systems. To the best of the authors' knowledge, this is the first proposed approach that can perform MIMO detection and decoding of turbo codes in a single stage. The detailed introduction of the proposed method and outline of the algorithm are given, while extensive simulations...
Bilinear inverse problems (BIPs), the resolution of two vectors given their image under a bilinear mapping, arise in many applications, such as blind deconvolution and dictionary learning. However, there are few results on the uniqueness of solutions to BIPs. For example, blind gain and phase calibration (BGPC) is a structured bilinear inverse problem, which arises in inverse rendering in computational...
Intertrack interference (ITI) is one of the most severe impairments in shingled magnetic recording (SMR). The use of Multihead Multitrack (MHMT) detection can best handle this impairment, but increases complexity. Consider a symmetric two-head two-track (2H2T) system given by ra(D)=x-a(D)h(D)+εxb(D)h(D)+na(D) and rb(D)=εxa(D)h(D)+xb(D)h(D)+nb(D), where xa(D), xb(D) and ra(D), r (D) are the input sequences...
This paper presents an effective method for planning and optimizing robot motions in joint space using via-points. The via-point formulation allows for a sparse movement representation which is inherently smooth according to a minimum jerk criterion. In this research we focus on two aspects. First, we present an initialization method to find a feasible number of via-points and their distribution in...
In this paper we introduce a novel low dimensional method to perform topic detection and classification in Twitter. The proposed method first employs Joint Complexity to perform topic detection. Then, based on the nature of the data, we apply the theory of Compressive Sensing to perform topic classification by recovering an indicator vector, while reducing significantly the amount of information from...
This paper introduces a new PARAFAC algorithm for a class of third-order tensors. Particularly, the proposed algorithm is based on subspace estimation and solving a non-symmetrical joint diagonalization problem. To deal with large scale problem, a procedure for overcoming scale and permutation ambiguities is proposed in a parallel computing scheme leading to a significant cost reduction of our method...
Two different approaches providing a joint optimization of source and channel decoding are compared for the decoding of variable length codes. The first one is based on a source-controlled channel decoding principle while the second one applies the turbo principle between the channel and source decoders. Different variants of these two approaches are included in this comparison using computational...
This paper studies the problem of joint allocation of transmission power and bandwidth in cooperative networks. The goal is to minimize transmission energy consumption in a network with M coordinated transmission points (CTPs) under respective data rate constraints of N mobile terminals (MTs). We propose a joint power and bandwidth allocation scheme for downlink data transmission based on mathematical...
Pictorial structures provide a powerful framework for human pose estimation, in particular in the domain of 2D data. However, solving pictorial structures directly in 3D drastically increases its complexity and it quickly exceeds tractable dimensions. In this paper, we propose a discretization-by-segmentation approach by applying super voxels to 3D pictorial structures which significantly reduces...
We propose a joint independent component analysis (ICA) based equalization and carrier frequency offset (CFO) estimation scheme for orthogonal frequency division multiple access (OFDMA) systems, which requires only a single pilot, resulting in a very low spectral overhead. On the one hand, a low-complexity ambiguity elimination method is proposed in the ICA equalized signals. By designing and exploring...
Switching behavior among different swimming modes of fish is a normal phenomenon in nature. We find that there is the joints' vibration fact for robotic fish in the process of switching. It is believed that the difference might be caused by discontinuous driven signal. This paper analyzes the discontinuous signal's the effect on the robotic fish joints and fin surface. Furthermore, this paper proposes...
With the rise in the population of the world's cities, understanding the dynamics of commuters' transportation patterns has become crucial in the planning and management of urban facilities and services. In this study, we analyze how commuter patterns change during different time instances such as between weekdays and weekends. To this end, we propose two data mining techniques, namely Common Orthogonal...
In this paper, we investigate efficient multi-cell cooperation based on CoMP-joint processing and transmission (CoMP-JPT) with orthogonal beamforming. Through the use of a combinatorial optimization algorithm, the optimal user scheduling for joint transmission using multiple transmitters is accomplished. The throughput of the CoMP-JPT can be significantly improved while maintaining fairness among...
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.