IEEE TSIPN Article

You are here

Top Reasons to Join SPS Today!

1. IEEE Signal Processing Magazine
2. Signal Processing Digital Library*
3. Inside Signal Processing Newsletter
4. SPS Resource Center
5. Career advancement & recognition
6. Discounts on conferences and publications
7. Professional networking
8. Communities for students, young professionals, and women
9. Volunteer opportunities
10. Coming soon! PDH/CEU credits
Click here to learn more.

IEEE TSIPN Article

In this paper, we investigate the resource allocation problem for a full-duplex (FD) massive multiple-input-multiple-output (mMIMO) multi-carrier (MC) decode and forward (DF) relay system which serves multiple MC single-antenna half-duplex (HD) nodes. In addition to the prior studies focusing on maximizing the sum-rate and energy efficiency, we focus on minimizing the overall delivery time for a given set of communication tasks to the user terminals.

The problem of graph learning concerns the construction of an explicit topological structure revealing the relationship between nodes representing data entities, which plays an increasingly important role in the success of many graph-based representations and algorithms in the field of machine learning and graph signal processing.

As a fundamental algorithm for collaborative processing over multi-agent systems, distributed consensus algorithm has been studied for optimizing its convergence rate. Due to the close analogy between the diffusion problem and the consensus algorithm, the previous trend in the literature is to transform the diffusion system from the spatially continuous domain into the spatially discrete one. 

Graph neural networks have emerged as a popular and powerful tool for learning hierarchical representation of graph data. In complement to graph convolution operators, graph pooling is crucial for extracting hierarchical representation of data in graph neural networks. However, most recent graph pooling methods still fail to efficiently exploit the geometry of graph data. In this paper, we propose a novel graph pooling strategy that leverages node affinity to improve the hierarchical representation learning of graph data. 

Decentralized detection is one of the key tasks that a wireless sensor network (WSN) is faced to accomplish. Among several decision criteria, the Rao test is able to cope with an unknown (but parametrically-specified) sensing model, while keeping computational simplicity. To this end, the Rao test is employed in this paper to fuse multivariate data measured by a set of sensor nodes, each observing the target (or the desired) event via a nonlinear mapping function. 

Combining diffusion strategies with complementary properties enables enhanced performance when they can be run simultaneously. In this article, we first propose two schemes for the convex combination of two diffusion strategies, namely, the power-normalized scheme and the sign-regressor scheme. Then, we conduct theoretical analysis for one of the schemes, i.e., the power-normalized one.

Graph distance (or similarity) scores are used in several graph mining tasks, including anomaly detection, nearest neighbor and similarity search, pattern recognition, transfer learning, and clustering. Graph distances that are metrics and, in particular, satisfy the triangle inequality, have theoretical and empirical advantages. 

Control over noisy communication-channels” invented by Sahai-Mitter-and-Tatikonda is a prominent topic. In this context, the latency-and-reliability trade-off is considered by responding to the following: How much fast? How much secure? For a stochastic-mean-field-game (S-MFG), we assign the source-codes as the agents. Additionally, the total-Reward is the Volume of the maximum secure lossy source-coding-rate achievable between a set of Sensors, and the Fusion-Centre (FC) set – including intercepting-Byzantines.

The localizability analysis for wireless sensor network is of great significance to network localization, and topology control. In this paper, the localizability problem for the bearing-based localization is investigated. An identification method for bearing rigid component is presented, and the localizability is studied for the determined bearing rigid component. In the identification process for bearing rigid component, the center node is introduced, and an approach for identifying the bearing rigid component is proposed based on the characteristic of the bearing rigid graph by using the center nodes.

In this article, an interval estimation problem is investigated for a class of discrete-time nonlinear networked systems under stealthy attacks. An improved event-triggered protocol with the time-varying threshold is adopted to govern the received signals of interval observer so as to reduce unnecessary data communication burden.

Pages

SPS on Twitter

  • The 2021 IEEE International Symposium on Biomedical Imaging virtual platform is live, featuring pre-recorded talks… https://t.co/JfRAvO5hqr
  • CALL FOR PAPERS: The IEEE Journal of Selected Topics in Signal Processing is now accepting papers for a Special Iss… https://t.co/fQ25UHWidg
  • DEADLINE EXTENDED: The IEEE Journal of Selected Topics in Signal Processing is now accepting submissions for a Spec… https://t.co/AuMC67sUKd
  • The SPACE Webinar Series continues Tuesday, 6 April at 10:00 AM EDT when Dr. Ivan Dokmanić presents "Learning the G… https://t.co/4coVRWm0lc
  • NEW SPS WEBINAR: Join us on Wednesday, 28 April at 1:00 PM EDT when Dr. Fernando Gama presents "Graph Neural Networ… https://t.co/UI6Oi2PYYi

SPS Videos


Signal Processing in Home Assistants

 


Multimedia Forensics


Careers in Signal Processing             

 


Under the Radar