1,750 research outputs found
Morphological operators for very low bit rate video coding
This paper deals with the use of some morphological tools for video coding at very low bit rates. Rather than describing a complete coding algorithm, the purpose of this paper is to focus on morphological connected operators and segmentation tools that have proved to be attractive for compression.Peer ReviewedPostprint (published version
Event detection in field sports video using audio-visual features and a support vector machine
In this paper, we propose a novel audio-visual feature-based framework for event detection in broadcast video of multiple different field sports. Features indicating significant events are selected and robust detectors built. These features are rooted in characteristics common to all genres of field sports. The evidence gathered by the feature detectors is combined by means of a support vector machine, which infers the occurrence of an event based on a model generated during a training phase. The system is tested generically across multiple genres of field sports including soccer, rugby, hockey, and Gaelic football and the results suggest that high event retrieval and content rejection statistics are achievable
Phase Retrieval for Sparse Signals: Uniqueness Conditions
In a variety of fields, in particular those involving imaging and optics, we
often measure signals whose phase is missing or has been irremediably
distorted. Phase retrieval attempts the recovery of the phase information of a
signal from the magnitude of its Fourier transform to enable the reconstruction
of the original signal. A fundamental question then is: "Under which conditions
can we uniquely recover the signal of interest from its measured magnitudes?"
In this paper, we assume the measured signal to be sparse. This is a natural
assumption in many applications, such as X-ray crystallography, speckle imaging
and blind channel estimation. In this work, we derive a sufficient condition
for the uniqueness of the solution of the phase retrieval (PR) problem for both
discrete and continuous domains, and for one and multi-dimensional domains.
More precisely, we show that there is a strong connection between PR and the
turnpike problem, a classic combinatorial problem. We also prove that the
existence of collisions in the autocorrelation function of the signal may
preclude the uniqueness of the solution of PR. Then, assuming the absence of
collisions, we prove that the solution is almost surely unique on 1-dimensional
domains. Finally, we extend this result to multi-dimensional signals by solving
a set of 1-dimensional problems. We show that the solution of the
multi-dimensional problem is unique when the autocorrelation function has no
collisions, significantly improving upon a previously known result.Comment: submitted to IEEE TI
Isotropic inverse-problem approach for two-dimensional phase unwrapping
In this paper, we propose a new technique for two-dimensional phase
unwrapping. The unwrapped phase is found as the solution of an inverse problem
that consists in the minimization of an energy functional. The latter includes
a weighted data-fidelity term that favors sparsity in the error between the
true and wrapped phase differences, as well as a regularizer based on
higher-order total-variation. One desirable feature of our method is its
rotation invariance, which allows it to unwrap a much larger class of images
compared to the state of the art. We demonstrate the effectiveness of our
method through several experiments on simulated and real data obtained through
the tomographic phase microscope. The proposed method can enhance the
applicability and outreach of techniques that rely on quantitative phase
evaluation
Graph Signal Processing: Overview, Challenges and Applications
Research in Graph Signal Processing (GSP) aims to develop tools for
processing data defined on irregular graph domains. In this paper we first
provide an overview of core ideas in GSP and their connection to conventional
digital signal processing. We then summarize recent developments in developing
basic GSP tools, including methods for sampling, filtering or graph learning.
Next, we review progress in several application areas using GSP, including
processing and analysis of sensor network data, biological data, and
applications to image processing and machine learning. We finish by providing a
brief historical perspective to highlight how concepts recently developed in
GSP build on top of prior research in other areas.Comment: To appear, Proceedings of the IEE
Bound and Conquer: Improving Triangulation by Enforcing Consistency
We study the accuracy of triangulation in multi-camera systems with respect
to the number of cameras. We show that, under certain conditions, the optimal
achievable reconstruction error decays quadratically as more cameras are added
to the system. Furthermore, we analyse the error decay-rate of major
state-of-the-art algorithms with respect to the number of cameras. To this end,
we introduce the notion of consistency for triangulation, and show that
consistent reconstruction algorithms achieve the optimal quadratic decay, which
is asymptotically faster than some other methods. Finally, we present
simulations results supporting our findings. Our simulations have been
implemented in MATLAB and the resulting code is available in the supplementary
material.Comment: 8 pages, 4 figures, Submitted to IEEE Transactions on Pattern
Analysis and Machine Intelligenc
- âŠ