We characterize the existence of finite tight frames whose frame elements are of predetermined length. In particular, we derive a “fundamental inequality” which completely characterizes those sequences which arise as the lengths of a tight frame’s elements. Furthermore, using concepts from classical physics, we show that this characterization has an intuitive physical interpretation.
We study representations of piecewise-smooth signals on graphs. We first define classes for smooth, piecewise-constant, and piecewise-smooth graph signals, followed by a series of multiresolution local sets to analyze those signals by implementing a multiresolution analysis on graphs. Based on these local sets, we propose local-set-based piecewise-constant and piecewise-smooth dictionaries as graph signal representations that, in spirit, resemble the classical Haar wavelet basis and are naturally localized in both graph vertex and graph Fourier domains. Moreover, they promote sparsity when representing piecewise-smooth graph signals. In the experiments, we show that local-set-based dictionaries outperform graph Fourier domain based representations when approximating both simulated and real-world graph signals.
We present a method for identifying colitis in colon biopsies as an extension of our framework for the automated identification of tissues in histology images. Histology is a critical tool in both clinical and research applications, yet even mundane histological analysis, such as the screening of colon biopsies, must be carried out by highly-trained pathologists at a high cost per hour, indicating a niche for potential automation. To this end, we build upon our previous work by extending the histopathology vocabulary (a set of features based on visual cues used by pathologists) with new features driven by the colitis application. We use the multiple-instance learning framework to allow our pixel-level classifier to learn from image-level training labels. The new system achieves accuracy comparable to state-of-the-art biological image classifiers with fewer and more intuitive features.
1 January 1999 in IEEE Transactions on Signal Processing
We show how to obtain arbitrary tilings of the time-frequency plane using local orthogonal bases. These bases were recently constructed as a generalization of the cosine-modulated filter banks in discrete time, and local sine and cosine bases in continuous time. Due to the fact that they use a single prototype window, these bases also lead to time-varying tilings. Moreover, they have a fast implementation algorithm, and allow for multidimensional irreducible basis functions. As an example, we show how to design a critical-band system for use in audio coding.
The Bio Image and Signal Processing (BISP) Technical Committee (TC) of the IEEE Signal Processing Society (SPS) promotes activities within the broad technical field of biomedical image and signal processing. Areas of interest include medical and biological imaging, digital pathology, molecular imaging, microscopy, and associated computational imaging, image analysis, and image-guided treatment, alongside physiological signal processing, computational biology, and bioinformatics.
In this paper, we study the recovery of the graph topology or structure. We first extend our previous work on graph signal recovery to present a joint graph signal and structure recovery framework. By doing this, we allow the algorithm to learn a graph structure from noisy and incomplete graph signals and recover the graph signals at the same time. In this paper, we particularly focus on the specific subproblem of graph structure learning and develop algorithms towards this problem and analyze them. We briefly study the implications when the underlying true graph structure is irregular or regular. Finally, we validate the proposed methods for both synthetic data and the real-world recovery problem of semi-supervised digit-image classification.