Search results
Enter terms
1039 results found.
Section: Publications & Resources
Publication: IEEE Transactions on Multimedia
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.
Section: Publications & Resources
Publication: IEEE Transactions on Multimedia
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.
Section: Publications & Resources
Publication: IEEE Transactions on Multimedia
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.
Section: Publications & Resources
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.
Section: Publications & Resources
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.
Section: Publications & Resources
Publication: IEEE Transactions on Signal Processing
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.
Section: Publications & Resources
Publication: IEEE Transactions on Signal Processing
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.
Section: Publications & Resources
Publication: IEEE Signal Processing Magazine
The articles in this special section focus on nonconvex optimization for signal processing and machine learning. Optimization is now widely recognized as an indispensable tool in signal processing (SP) and machine learning (ML). Indeed, many of the advances in these fields rely crucially on the formulation of suitable optimization models and deployment of efficient numerical optimization algorithms. In the early 2000s, there was a heavy focus on the use of convex optimization techniques to tackle SP and ML applications.
Section: Publications & Resources
Publication: IEEE Signal Processing Magazine
Many contemporary applications in signal processing and machine learning give rise to structured nonconvex nonsmooth optimization problems that can often be tackled by simple iterative methods quite effectively. One of the keys to understanding such a phenomenon-and, in fact, a very difficult conundrum even for experts-lies in the study of "stationary points" of the problem in question. Unlike smooth optimization, for which the definition of a stationary point is rather standard, there are myriad definitions of stationarity in nonsmooth optimization.
Section: Publications & Resources
Publication: IEEE Signal Processing Magazine
Optimization lies at the heart of machine learning (ML) and signal processing (SP). Contemporary approaches based on the stochastic gradient (SG) method are nonadaptive in the sense that their implementation employs prescribed parameter values that need to be tuned for each application. This article summarizes recent research and motivates future work on adaptive stochastic optimization methods, which have the potential to offer significant computational savings when training largescale systems.
