By Topic

Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), 2009 3rd IEEE International Workshop on

Date 13-16 Dec. 2009

Filter Results

Displaying Results 1 - 25 of 108
  • [Front matter]

    Publication Year: 2009, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (52 KB)
    Freely Available from IEEE
  • Welcome from the general chairs

    Publication Year: 2009, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (334 KB) | HTML iconHTML
    Freely Available from IEEE
  • Welcome from the program co-chairs

    Publication Year: 2009, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (308 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2009, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (204 KB)
    Freely Available from IEEE
  • Technical program

    Publication Year: 2009, Page(s):1 - 8
    Request permission for commercial reuse | PDF file iconPDF (671 KB)
    Freely Available from IEEE
  • Network formation games for wireless multi-hop networks in the presence of eavesdroppers

    Publication Year: 2009, Page(s):1 - 4
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (217 KB) | HTML iconHTML

    Physical layer security has recently attracted an increasing attention in wireless networks. While existing work on physical layer security focuses on the information theoretic aspects, this paper studies the impact of the presence of eavesdroppers on the topology and dynamics of wireless multi-hop networks. In this context, we investigate the problem of the distributed formation of a hierarchical... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pareto-optimal beamforming for the MISO interference channel with partial CSI

    Publication Year: 2009, Page(s):5 - 8
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (235 KB) | HTML iconHTML

    We consider the problem of finding Pareto-optimal (PO) operating points for the multiple-input single-output (MISO) interference channel when the transmitters have statistical (covariance) channel knowledge. We devise a computationally efficient algorithm, based on semidefinite relaxation, to compute the PO rates and the enabling beamforming vectors. We illustrate the effectiveness of our algorith... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Alternative bargaining solutions for the interference channel

    Publication Year: 2009, Page(s):9 - 12
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (230 KB) | HTML iconHTML

    In this paper we extend our previous work on the Nash bargaining solution for the interference channel. We consider two alternative technqiues using generalized Nash bargaining and the Kalai Smorodinsky solution. These solutions are relevant for allocating spectrum to users with non-symmetric requirements. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On proportional power sharing mechanisms for secondary spectrum markets

    Publication Year: 2009, Page(s):13 - 16
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (229 KB) | HTML iconHTML

    We consider a proportional sharing mechanism for allocating spectrum to secondary users. Each user bids for a portion of the received power at a measurement point and receives a share that is proportional to its bid while paying a charge equal to the bid. The users then transmit over a common band treating all interference as noise. Under this mechanism, we model the secondary users as players is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • K-player Bayesian waterfilling game for fading multiple access channels

    Publication Year: 2009, Page(s):17 - 20
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB) | HTML iconHTML

    We present a Bayesian game-theoretic approach for the distributed resource allocation problem in the context of K-user fading multiple access channels (MAC). We assume that users have incomplete information about the channel state information (CSI), i.e., each user knows his own channel state, but does not know the states of other users. All users (transmitters) are considered to be rational, self... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pricing, competition, and routing in multi-hop networks

    Publication Year: 2009, Page(s):21 - 24
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (255 KB) | HTML iconHTML

    We study multi-hop relay networks where pricing is used to provide incentives for forwarding traffic. In these networks, nodes price their services strategically to maximize its profit from forwarding traffic, and allocate their received traffic to service providers to minimize the amount paid. In the resulting pricing game, we show that the socially optimal network routing can always be induced b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A theoretical framework for problems requiring robust behavior

    Publication Year: 2009, Page(s):25 - 28
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (239 KB) | HTML iconHTML

    This paper develops a generalized Cauchy density (GCD) based theoretical approach that allows the formulation of challenging problems in a robust fashion. The proposed framework subsumes the generalized Gaussian distribution (GGD) family based developments, thereby guaranteeing performance improvements over traditional problem formulation techniques. This robust framework can be adapted to a varie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Measuring the robustness of sequential methods

    Publication Year: 2009, Page(s):29 - 32
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (307 KB) | HTML iconHTML

    Whenever we apply methods for processing data, we make a number of model assumptions. In reality, these assumptions are not always correct. Robust methods can withstand model inaccuracies, that is, despite some incorrect assumptions they can still produce good results. We often want to know how robust employed methods are. To that end we need to have a yardstick for measuring robustness. In this p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Outlier elimination for robust ellipse and ellipsoid fitting

    Publication Year: 2009, Page(s):33 - 36
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (233 KB) | HTML iconHTML

    In this paper, an outlier elimination algorithm for ellipse/ellipsoid fitting is proposed. This two-stage algorithm employs a proximity-based outlier detection algorithm (using the graph Laplacian), followed by a model-based outlier detection algorithm similar to random sample consensus (RANSAC). These two stages compensate for each other so that outliers of various types can be eliminated with re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Accuracy of source localization based on squared-range least squares (SR-LS) criterion

    Publication Year: 2009, Page(s):37 - 40
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB) | HTML iconHTML

    An estimator for source localization from range measurements was recently proposed by Beck, Stoica, and Li. The method is based on minimizing a least squares criterion for the squared-ranges (SR-LS), and a key advantage is that the global minimum of the SR-LS criterion can be computed efficiently. If the range measurements are modeled with additive, Gaussian noise, then the maximum likelihood (ML)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust semiparametric amplitude estimation of sinusoidal signals: The multi-sensor case

    Publication Year: 2009, Page(s):41 - 44
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (262 KB) | HTML iconHTML

    The problem of robust estimation of the complex amplitudes of sinusoidal signals using multiple sensors, in an unknown heavy-tailed, spatially and temporally i.i.d. noise environement is considered. A semiparametric approach for this case is presented, where non-parametric estimation of the noise density is succeeded by maximum likelihood estimation incorporating the estimated density. The suggest... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust short-term load forecasting using projection statistics

    Publication Year: 2009, Page(s):45 - 48
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (239 KB) | HTML iconHTML

    It has been observed that the French electric load series possesses outliers and breaks. Outliers are deviant data points while breaks are lasting abrupt changes in the stochastic pattern of the series. It turns out that outliers and breaks significantly degrade the reliability and accuracy of conventional day-ahead estimation and forecasting methods. Robust methods are needed for this application... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-organization in bird flight formations using diffusion adaptation

    Publication Year: 2009, Page(s):49 - 52
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (633 KB) | HTML iconHTML

    Flocks of birds self-organize into V-formations when they need to travel long distances. It has been shown that this formation allows the birds to save energy, by taking advantage of the upwash generated by the neighboring birds. In this work we use a simple model for the upwash generated by a flying bird, and show that a flock of birds can self-organize into a V-formation if every bird were to em... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Directed gossiping for distributed data aggregation

    Publication Year: 2009, Page(s):53 - 56
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (235 KB) | HTML iconHTML

    In this paper, we are studying a class of distributed data aggregation problems where a set of nodes in a network is interested in a function of data that is stored in another set of nodes. Assuming the function of interest is separable, we propose an algorithm based on gossiping schemes. Gossiping protocols are iterative methods based on near neighbor communications, and they are known to be effi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gossip and consensus in mobile networks

    Publication Year: 2009, Page(s):57 - 60
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (263 KB) | HTML iconHTML

    We analyze the effect of node mobility on the convergence time of pairwise gossip algorithms. We use a simple mobility model and illustrate how to transform a gossip with mobile agents into gossip in a static network with a nonuniform distribution on selecting neighbors. We describe two methods for analyzing Markov chain convergence that can be used to derive upper and lower bounds on the converge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Selective Gossip

    Publication Year: 2009, Page(s):61 - 64
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB) | HTML iconHTML

    Motivated by applications in compression and distributed transform coding, we propose a new gossip algorithm called selective gossip to efficiently compute sparse approximations of network data. We consider running parallel gossip algorithms on the elements of a vector of transform coefficients. Unlike classical randomized gossip, communication between adjacent nodes is data driven and only perfor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed sensor localization using barycentric coordinates

    Publication Year: 2009, Page(s):65 - 68
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (377 KB) | HTML iconHTML

    In this paper, we review our work on distributed sensor localization using barycentric coordinates. We present an algorithm for localization in m-dimensional Euclidean spaces. The algorithm is distributed and requires at least m + 1 anchors. Anchors are the nodes that know their exact locations. We require that the nonanchor nodes (all the network nodes that do not know their locations) lie in the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quadratic Gaussian gossiping

    Publication Year: 2009, Page(s):69 - 72
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (242 KB) | HTML iconHTML

    This paper presents an information theoretic source coding formulation of distributed averaging. We assume a network with m nodes each observing an i.i.d. Gaussian source; the nodes communicate and perform local processing with the goal of computing the average of the sources to within a prescribed mean squared error distortion. A general cutset lower bound on the network rate distortion function ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Methods for factorization and approximation of Tensors by partial Fiber Sampling

    Publication Year: 2009, Page(s):73 - 76
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (766 KB) | HTML iconHTML

    In this paper we present, discuss and compare new methods for the reconstruction of tensors by partial sampling, i.e. based on the information contained only in a subset of their entries. As a generalization of the CUR matrix decomposition, which approximates a matrix from a subset of its rows and columns, we present two methods called Tree-CUR and FSTD (Fiber Sampling Tensor Decomposition) for es... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analytical performance evaluation for HOSVD-based parameter estimation schemes

    Publication Year: 2009, Page(s):77 - 80
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB) | HTML iconHTML

    Subspace-based high-resolution parameter estimation schemes are used in a variety of signal processing applications including radar, sonar, communications, medical imaging, and the estimation of the parameters of the dominant multipath components from MIMO channel sounder measurements. It is of great theoretical and practical interest to predict the performance of these schemes analytically. Since... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.