[go: up one dir, main page]

Soares et al., 2015 - Google Patents

Simple and fast convex relaxation method for cooperative localization in sensor networks using range measurements

Soares et al., 2015

View PDF
Document ID
6667818921131155905
Author
Soares C
Xavier J
Gomes J
Publication year
Publication venue
IEEE Transactions on Signal Processing

External Links

Snippet

We address the sensor network localization problem given noisy range measurements between pairs of nodes. We approach the nonconvex maximum-likelihood formulation via a known simple convex relaxation. We exploit its favorable optimization properties to the full to …
Continue reading at arxiv.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/58—Random or pseudo-random number generators
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy

Similar Documents

Publication Publication Date Title
Soares et al. Simple and fast convex relaxation method for cooperative localization in sensor networks using range measurements
Voorman et al. Graph estimation with joint additive models
Biswas et al. Semidefinite programming for ad hoc wireless sensor network localization
Fang et al. Pattern-coupled sparse Bayesian learning for recovery of block-sparse signals
Gower et al. Stochastic dual ascent for solving linear systems
Bandeira et al. Phase retrieval from power spectra of masked signals
Freris et al. Fast distributed smoothing of relative measurements
Necoara et al. A random coordinate descent method on large-scale optimization problems with linear constraints
Oreshkin et al. Asynchronous distributed particle filter via decentralized evaluation of Gaussian products
Su et al. Convergence analysis of the variance in Gaussian belief propagation
Li A posteriori error estimates for the weak Galerkin finite element methods on polytopal meshes
Sun et al. Decomposition methods for sparse matrix nearness problems
Dai et al. A novel fast method for L∞ problems in multiview geometry
Angrisani et al. Quantum local differential privacy and quantum statistical query model
Zhang et al. An efficient and fast quantum state estimator with sparse disturbance
Ramakrishnan et al. Gossip-based algorithm for joint signature estimation and node calibration in sensor networks
Galetsky et al. Comparison of Quantum PUF models
Hook et al. Performance analysis of asynchronous parallel Jacobi
Doan et al. Distributed stochastic approximation for solving network optimization problems under random quantization
Wan et al. Fundamental limits and optimization of multiband sensing
Dette et al. Reproducing kernel Hilbert spaces, polynomials, and the classical moment problem
Jin et al. Exploiting sparsity for robust sensor network localization in mixed LOS/NLOS environments
Noor et al. SparseNCA: Sparse network component analysis for recovering transcription factor activities with incomplete prior information
Schuster Parameter estimation for the Cauchy distribution
Shoja et al. Asymptotic converse bound for secret key capacity in hidden Markov model