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.
Postdoc in Computer Engineering formally based at the Department of Electrical Engineering
https://liu.se/en/work-at-liu/vacancies?rmpage=job&rmjob=14602&rmlang=UK
September 27-30, 2021
Location: Note: Location changed to--Virtual Conference
July 5-9, 2021
Location: Shenzhen, China
Signal Processing and Algorithm Engineer
Are you a signal processing and algorithm engineer or data scientist with a broad skillset who loves to create, face difficult problems head on, and has a desire to always learn?
Job Overview
Submission Deadline: January 8, 2021
Call for Proposals Document
Deep learning on graphs, also known as Geometric deep learning (GDL) [1], Graph representation learning (GRL), or relational inductive biases, has recently become one of the hottest topics in machine learning. While early works on graph learning go back at least a decade [2], if not two [3], it is undoubtedly the past few years’ progress that has taken these methods from a niche into the spotlight of the Machine Learning (ML) community.
The Speech Technology Group of Toshiba Europe LTD in Cambridge has opening for an ASR researcher. We are looking for candidates with background in signal processing, machine learning, acoustic modelling or expertise in building state-of-the-art systems for ASR. The candidate should have a PhD in areas of speech technology related to automatic speech recognition, machine learning or a related field (Post-doctoral/industrial experience is beneficial).
Lecture Date: October 20, 2020
Chapter: Kharagpur
Chapter Chair: Sudipta Mukhopadhyay
Topics: Leveraging Old Tricks in A New World: Efficient
Generation of Labeled Data for Deep Learning
March 23-26, 2021
NOTE: Location changed to--Virtual Conference
November 1-4, 2020
Location: NOTE: Location changed to--Virtual Conference
October 12-16, 2020
Location: NOTE: Location changed to--Virtual Conference
We consider identification of linear dynamical systems comprising of high-dimensional signals, where the output noise components exhibit strong serial, and cross-sectional correlations. Although such settings occur in many modern applications, such dependency structure has not been fully incorporated in existing approaches in the literature.
Channel estimation is of paramount importance in most communication systems in order to optimize the data rate/energy consumption tradeoff. In modern systems, the possibly large number of transmit/receive antennas and subcarriers makes this task difficult. Designing pilot sequences of reasonable size yielding good performance is thus critical.
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.
In this paper, we investigate the challenging task of removing haze from a single natural image. The analysis on the haze formation model shows that the atmospheric veil has much less relevance to chrominance than luminance, which motivates us to neglect the haze in the chrominance channel and concentrate on the luminance channel in the dehazing process. Besides, the experimental study illustrates that the YUV color space is most suitable for image dehazing.
Video summarization is an important technique to browse, manage and retrieve a large amount of videos efficiently. The main objective of video summarization is to minimize the information loss when selecting a subset of video frames from the original video, hence the summary video can faithfully represent the overall story of the original video. Recently developed unsupervised video summarization approaches are free of requiring tedious annotation on important frames to train a video summarization model and thus are practically attractive.
With the help of convolutional neural networks (CNNs), video-based human action recognition has made significant progress. CNN features that are spatial and channelwise can provide rich information for powerful image description. However, CNNs lack the ability to process the long-term temporal dependency of an entire video and further cannot well focus on the informative motion regions of actions.