158,602 research outputs found
Spatial Whitening Framework for Distributed Estimation
Designing resource allocation strategies for power constrained sensor network
in the presence of correlated data often gives rise to intractable problem
formulations. In such situations, applying well-known strategies derived from
conditional-independence assumption may turn out to be fairly suboptimal. In
this paper, we address this issue by proposing an adjacency-based spatial
whitening scheme, where each sensor exchanges its observation with their
neighbors prior to encoding their own private information and transmitting it
to the fusion center. We comment on the computational limitations for obtaining
the optimal whitening transformation, and propose an iterative optimization
scheme to achieve the same for large networks. We demonstrate the efficacy of
the whitening framework by considering the example of bit-allocation for
distributed estimation.Comment: 4 pages, 2 figures, this paper has been presented at CAMSAP 2011;
Proc. 4th Intl. Workshop on Computational Advances in Multi-Sensor Adaptive
Processing (CAMSAP 2011), San Juan, Puerto Rico, Dec 13-16, 201
Symmetry-guided nonrigid registration: the case for distortion correction in multidimensional photoemission spectroscopy
Image symmetrization is an effective strategy to correct symmetry distortion
in experimental data for which symmetry is essential in the subsequent
analysis. In the process, a coordinate transform, the symmetrization transform,
is required to undo the distortion. The transform may be determined by image
registration (i.e. alignment) with symmetry constraints imposed in the
registration target and in the iterative parameter tuning, which we call
symmetry-guided registration. An example use case of image symmetrization is
found in electronic band structure mapping by multidimensional photoemission
spectroscopy, which employs a 3D time-of-flight detector to measure electrons
sorted into the momentum (, ) and energy () coordinates. In
reality, imperfect instrument design, sample geometry and experimental settings
cause distortion of the photoelectron trajectories and, therefore, the symmetry
in the measured band structure, which hinders the full understanding and use of
the volumetric datasets. We demonstrate that symmetry-guided registration can
correct the symmetry distortion in the momentum-resolved photoemission
patterns. Using proposed symmetry metrics, we show quantitatively that the
iterative approach to symmetrization outperforms its non-iterative counterpart
in the restored symmetry of the outcome while preserving the average shape of
the photoemission pattern. Our approach is generalizable to distortion
corrections in different types of symmetries and should also find applications
in other experimental methods that produce images with similar features
Superiorization and Perturbation Resilience of Algorithms: A Continuously Updated Bibliography
This document presents a, (mostly) chronologically ordered, bibliography of
scientific publications on the superiorization methodology and perturbation
resilience of algorithms which is compiled and continuously updated by us at:
http://math.haifa.ac.il/yair/bib-superiorization-censor.html. Since the
beginings of this topic we try to trace the work that has been published about
it since its inception. To the best of our knowledge this bibliography
represents all available publications on this topic to date, and while the URL
is continuously updated we will revise this document and bring it up to date on
arXiv approximately once a year. Abstracts of the cited works, and some links
and downloadable files of preprints or reprints are available on the above
mentioned Internet page. If you know of a related scientific work in any form
that should be included here kindly write to me on: [email protected] with
full bibliographic details, a DOI if available, and a PDF copy of the work if
possible. The Internet page was initiated on March 7, 2015, and has been last
updated on March 12, 2020.Comment: Original report: June 13, 2015 contained 41 items. First revision:
March 9, 2017 contained 64 items. Second revision: March 8, 2018 contained 76
items. Third revision: March 11, 2019 contains 90 items. Fourth revision:
March 16, 2020 contains 112 item
Joint Communication and Sensing Design in Coal Mine Safety Monitoring: 3D Phase Beamforming for RIS-Assisted Wireless Networks
This paper investigates the resource allocation of a reconfigurable intelligent surface (RIS)-aided joint communication and sensing (JCAS) system in a coal mine scenario. In the JCAS system, an RIS is implemented at the corner of the zigzag tunnels to improve the complicated wireless environment, where ground obstacles frequently block direct links. In addition, a wireless backhaul base station with a limited energy budget is deployed in the depth of the mine to sense the target area and provide internet of things (IoT) services and communication services for users. Furthermore, a data center is placed on the ground to analyze the obtained data and route the communication data. Under this deployment, a joint optimization problem of RIS phase shift matrix, RIS element switches, and area sensing time is proposed. We aim to maximize the successful sensed bits under total completion time, and maximum transmit power constraints. In order to solve this problem, an iterative algorithm is proposed. The successive convex approximation (SCA) based algorithm is used for the RIS phase shift matrix optimization subproblem. For the sensing time optimization subproblem, the quadratic approximation method is proposed to optimize the number of area perceptions. The coordinate descent method is utilized to optimize the RIS element switches. Simulation results show that the energy efficiency is improved by up to 38%, and 7% increases the specific data size compared with the benchmark solutions
A simple algorithm for optimization and model fitting: AGA (asexual genetic algorithm)
Context. Mathematical optimization can be used as a computational tool to
obtain the optimal solution to a given problem in a systematic and efficient
way. For example, in twice-differentiable functions and problems with no
constraints, the optimization consists of finding the points where the gradient
of the objective function is zero and using the Hessian matrix to classify the
type of each point. Sometimes, however it is impossible to compute these
derivatives and other type of techniques must be employed such as the steepest
descent/ascent method and more sophisticated methods such as those based on the
evolutionary algorithms. Aims. We present a simple algorithm based on the idea
of genetic algorithms (GA) for optimization. We refer to this algorithm as AGA
(Asexual Genetic Algorithm) and apply it to two kinds of problems: the
maximization of a function where classical methods fail and model fitting in
astronomy. For the latter case, we minimize the chi-square function to estimate
the parameters in two examples: the orbits of exoplanets by taking a set of
radial velocity data, and the spectral energy distribution (SED) observed
towards a YSO (Young Stellar Object). Methods. The algorithm AGA may also be
called genetic, although it differs from standard genetic algorithms in two
main aspects: a) the initial population is not encoded, and b) the new
generations are constructed by asexual reproduction. Results. Applying our
algorithm in optimizing some complicated functions, we find the global maxima
within a few iterations. For model fitting to the orbits of exoplanets and the
SED of a YSO, we estimate the parameters and their associated errors.Comment: 10 pages, 8 figures, Astronomy and Astrophysics (in press
- …