Bross, Benjamin, Álvarez-Mesa, Mauricio, George, Valeri et al. · DepositOnce · 2013
The new High Efficiency Video Coding Standard (HEVC) was finalized in January 2013. Compared to its predecessor H.264 / MPEG4-AVC, this new international standard is able to reduce the bitrate by 50% for the same subjective video quality. This paper investigates decoder optimizations that are needed to achieve HEVC real-time software decoding on a mobile processor. It is shown that HEVC real-time decoding up to high definition video is feasible using instruction extensions of the processor while decoding 4K ultra high definition video in real-time requires additional parallel processing. For parallel processing, a picture-level parallel approach has been chosen because it is generic and does not require bitstreams with special indication.
Cited by 0Open access
Thomas W. Elston, Joni D. Wallis · Trends in Cognitive Sciences · 2022
Cited by 5
Gurgen Soghoyan, Roman Khalikov · OSF Preprints (OSF Preprints) · 2025
Project contains supplementary video and data for the preprint of paper "Continuous Real-Time Decoding in Wearable Human-Machine Interfaces: Advancing Neuroprosthetic Controls with Optomyography"
Cited by 0Open access
Aniket D. Kulkarni, Raghunath S. Bhadade, Apurva Naik et al. · 2022
Satellite is a common term these days and a tremendous amount of work is conducted in space and technology. The proposed system briefs about the decoding of live satellite signals with help of a mini ground station using USRPB200 Software Defined Radio (SDR), RTL SDR mini and a self-designed V-shaped Antenna. The objective of the proposed system includes decoding the satellite signals in the Ultra High Frequency(UHF) and Very High Frequency (VHF) bands with their respective implementations in the GNU Radio environment. Signals from International Space Station (ISS), Meteor Satellites, and National Oceanic and Atmospheric Administration (NOAA), are captured during multiple passes to study in detail and explore how communication exactly happens. The proposed system also sheds light on the hardware and software used while decoding the signals, the mini-ground station, the different challenges faced during the process, and the solutions to overcome the same.
Cited by 3
Aurel A. Lazar, E. Simonyi, László Tóth · Zenodo (CERN European Organization for Nuclear Research) · 2006
Publication in the conference proceedings of EUSIPCO, Florence, Italy, 2006
Cited by 7Open access
Aurel A. Lazar, et al. · 2005
Time-encoding is a real-time asynchronous mechanism of mapping the information contained in the amplitude of a bandlimited signal into a time sequence. Time decoding algorithms recover the signal from the time sequence. Under an appropriate Nyquist-type rate condition the signal can be perfectly recovered. The algorithm for perfect recovery calls, however, for the computation of a pseudo-inverse of an infinite dimensional matrix. We present a simple algorithm for local signal recovery and construct a stitching algorithm for real-time signal recovery. We also provide a recursive algorithm for computing the pseudo-inverse of a family of finitedimensional matrices.
Cited by 0
R. G. Robinson · Neurology Today · 2019
Cited by 1
Stephen M. LaConte · NeuroImage · 2010
Cited by 175
Krupa, Martin · Brno University of Technology Digital Library (Brno University of Technology) · 2011
Cílem práce je popsat čárové kódy používané běžně v praxi a vytvořit aplikaci, která bude za pomocí počítačového vidění zvolené kódy detekovat a rozpoznávat v reálnem čase. Nejdříve popisuje klasické, lineární čárové kódy, pak následuje popis dvourozměrných maticových kódů, jejich vznik, použití a struktura. Detailněji je rozebrán princip lokalizace, kódování a dekódování QR Kódu, s kterým se dále v práci pracuje. Taktéž je uveden stručný popis počítačového vidění a knihovny OpenCV. Následuje popis návrhu a implemenace aplikace na lokalizaci a rozpoznávání QR Kódů. Nakonec je popsané testování aplikace a jsou zhrnuty výsledky a možnosti pokračování práce.
Cited by 0
Rouzbeh Razavi · 2014
Luby Transform (LT) codes are shown to perform very well over erasure wireless channels. However, LT codes require the number of input symbols to be sufficiently high or otherwise the coding overhead becomes significant. With large number of input symbols, the packets latency and decoding complexity as well as buffer requirement may increase. Given that Gaussian elimination is computationally intensive, this paper proposes to additionally consider higher order encoded symbols during the decoding procedure. The results show up to 47% overhead reduction when degree-2 symbols are as well contributing in the decoding procedure. The proposed method is very straightforward and requires no change to the encoder and minimal modification of the decoder.
Cited by 0
Megan T. deBettencourt, R. F. Lee, Jonathan D. Cohen et al. · Journal of Vision · 2012
Selective attention is needed to prioritize the subset of sensory information that is most relevant to our goals. Unfortunately, selective attention is prone to lapses, even in situations where sustaining focused attention is crucial (e.g., when driving in traffic). We propose that such lapses occur partly because we lack a subjective sense of when we are or are not attending well, and that with an appropriate feedback signal, attention can be trained and enhanced. We report initial steps in the development of a closed-loop real-time fMRI system where we use multivariate pattern analysis to provide neurofeedback and train attention. During an fMRI session, observers were presented with a continuous stream of composite face/scene images; occasional shift cues were presented indicating which category should be attended and responded to. Data were pulled from the scanner and preprocessed in real-time (with motion correction, masking, smoothing, and temporal filtering). Whole-brain data obtained under each category cue were used to train a classifier to predict observers’ attentional state. Despite the fact that stimuli were identical in the attend-face and attend-scene conditions, we obtained highly reliable classification performance in real-time for individual trials. This successful real-time decoding allows us to provide immediate and time-varying feedback to observers regarding how well they are attending to the cued category (e.g., tinting the screen background more green or red to indicate increasingly correct or incorrect attentional focus, respectively). By staircasing behavioral performance to a fixed level of accuracy before providing feedback (adding phase-scrambled noise), we can also examine whether neurofeedback (vs. sham or no feedback) improves accuracy in the behavioral task. In sum, by applying multivariate pattern analysis in real-time to fMRI data, we can provide observers with a sophisticated and timely readout of attentional focus that may prove useful in training attention. Meeting abstract presented at VSS 2012
Cited by 1Open access
Sankariah, S., Eswaran, Chikkannan · Siti Hasmah Digital Library-MMU Institutiona Repository (Multimedia University) · 2018
Cited by 0
Kostiha, Martin · Brno University of Technology Digital Library (Brno University of Technology) · 2010
Tato práce se zabývá lokalizací a dekódováním lineárního čárového kódu EAN-13 v obraze. Popisuje typy a vlastnosti čárových kódů a představuje možné přístupy k lokalizaci a dekódování. Praktická část se věnuje návrhu a implementaci algoritmu s ohledem na efektivitu pro zpracování v reálném čase. Lokalizace je založena na hledání podobných rysů čárového kódu mezi čtenými řádky obrazu a dekódvání je prováděno nalezením nejvyšší podobnosti vůči referenčním kódovaným číslicím.
Cited by 0
Aurel A. Lazar, Erno ̋ K. Simonyi · 2005
Time-encoding is a real-time asynchronous mechanism of mapping the information contained in the amplitude of a ban-dlimited signal into a time sequence. Time decoding algo-rithms recover the signal from the time sequence. Under an appropriate Nyquist-type rate condition the signal can be per-fectly recovered. The algorithm for perfect recovery calls, however, for the computation of a pseudo-inverse of an infi-nite dimensional matrix. We present a simple algorithm for local signal recovery and construct a stitching algorithm for real-time signal recovery. We also provide a recursive algo-rithm for computing the pseudo-inverse of a family of finite-dimensional matrices. 1.
Cited by 0
Vinay Raghavan, Prachi Patel, Xiaomin He et al. · PubMed Central · 2024
Brain-Computer Interfaces (BCI) facilitate interaction with devices, enhancing the quality of life for individuals with disabilities and offering a more direct method for controlling smart devices. Auditory BCIs commonly utilize event-related potentials (ERPs) necessitating a sequential presentation of choices through auditory stimuli. However, such methods impose constraints on the achievable Information Transfer Rate (ITR) compared to visual BCIs due to extended stimulus presentation times. Here, we introduce an auditory BCI approach in which the selective representation of attended speech in a listener's brain enables the decoding of one target sound source from the background. The simultaneous delivery of options in our proposed method reduces presentation durations by 2.5x compared to previous auditory BCI paradigms. This approach yields an average ITR exceeding 17 bits/min, with the best subject surpassing 33 bits/min. By outdoing current state-of-the-art auditory BCI paradigms, our research represents a significant advancement in the development of practical auditory BCI technologies.
Cited by 1Open access
Angelos Bilas Jason · 1997
The growing demand for high quality compressed video has led to an increasing need for real-time MPEG decoding at greater resolutions and picture sizes. With the widespread availability of small-scale multiprocessors, a parallel software implementation may provide an effective solution to the decoding problem. We present a parallel decoder for the MPEG standard, implemented on a shared memory multiprocessor. Goal of this work is to provide an all-software solution for real-time, high-quality video decoding and to investigate the important properties of this application as they pertain to multiprocessor systems. Both coarse and fine grained implementations are considered for parallelizing the decoder. The coarse-grained approach exploits parallelism at the group of pictures level, while the fine-grained approach parallelizes within pictures, at the slice level. A comparative evaluation of these methods is made, with results presented in terms of speedup, memory requirements, load balance, synchronization time, and temporal and spatial locality. Both methods demonstrate very good speedups and locality properties. Keywords: Image processing, MPEG, parallel computing, video compression, real-time, shared memory. 1
Cited by 0
Diogo Peixoto, Jessica R. Verhein, Roozbeh Kiani et al. · Nature · 2021
Cited by 136
Fernando Pescador, Miguel Chavarrías, M.J. Garrido et al. · 2017
HEVC codecs will replace H.264 ones inside the consumer electronic devices in the near future. In this work, the open source OpenHEVC decoder has been modified in order to support parallel decoding at the slice level using OpenMP instead of pthreads. The advantage of this unthreaded decoder is that it can be used with any architecture, providing it supports OpenMP. Tests have been carried out with three different multicore chips and the performance results are similar to those obtained with the pthreaded OpenHEVC decoder.
Cited by 4
Diogo Peixoto, Jessica R. Verhein, Roozbeh Kiani et al. · bioRxiv (Cold Spring Harbor Laboratory) · 2019
Summary In dynamic environments, subjects often integrate multiple samples of a signal and combine them to reach a categorical judgment. The process of deliberation on the evidence can be described by a time-varying decision variable (DV), decoded from neural activity, that predicts a subject’s decision at the end of a trial. However, within trials, large moment-to-moment fluctuations of the DV are observed. The behavioral significance of these fluctuations and their role in the decision process remain unclear. Here we show that within-trial DV fluctuations decoded in real time from motor cortex are tightly linked to choice behavior, and that robust changes in DV sign have the statistical regularities expected from behavioral studies of changes-of-mind. Furthermore, we find single-trial evidence for absorbing decision bounds. As the DV builds up, heavily favoring one or the other choice, moment-to-moment variability in the DV is reduced, and both neural DV and behavioral decisions become resistant to additional pulses of sensory evidence as predicted by diffusion-to-bound and attractor models of the decision process.
Cited by 17Open access
Paolo Viviani, Ilaria Gesmundo, Elios Ghinato et al. · Lecture notes in computer science · 2023
Cited by 1Open access