Longitudinal time code decoding algorithm Matlab script

SPONSORED LINKS

    Specification

  • Version:
  • File size: 0 KB
  • File name: smpte_decode.tar
  • Last update:
  • Platform: Windows / Linux / Mac OS / BSD / Solaris
  • Language: Matlab
  • Price:Freeware
  • Company: Malcolm A. MacIver (View more)

Longitudinal time code decoding algorithm script description:




Publisher review:
Longitudinal time code decoding algorithm - Sampled time code to HHMMSSFF SMPTE 12M time code is the industry standard for synchronization of multiple media sources, such as video and sound. I and colleagues use it to synchronize video recordings of events with measurements (for example, fluoro scope images of people swallowing with physiological measurments of swallowing muscle activity).To use these programs, record the SMPTE code at 20 kHz, export the (time, value) pairs into a data format that MATLAB can read, and call the program 'smpte' with the name of this two column matrix. To test, try included SMPTE time sample by doingload('smpte_code.txt')smpte(smpte_code)Also included are a number of m-files for doing arithmetic with HHMMSSFF numbers and conversion to decimal frame number. Requirements: ยท MATLAB Release: R10
Longitudinal time code decoding algorithm is a Matlab script for Scientific/Engineering scripts design by Malcolm A. MacIver. It runs on following operating system: Windows / Linux / Mac OS / BSD / Solaris.
Longitudinal time code decoding algorithm - Sampled time code to HHMMSSFF

Operating system:
Windows / Linux / Mac OS / BSD / Solaris

Latest script and internet news

222

222

22

Posted on: 18 Jul 2023 22:27 by A. Brown

111

111

111

Posted on: 18 Jul 2023 22:24 by A. Brown

The permanently active Push system offered by the new Google Chrome 42

The permanently active Push system offered by the new Google Chrome 42

Hacked By !Sc-sT

Posted on: 17 Mar 2015 07:57 by A. Brown

SPREAD THE WORD

User Rating


Rating: 2.2 out of 5
Based on 13 ratings. 13 user reviews.

  • Currently 2.15 out of 5
  • 1
  • 2
  • 3
  • 4
  • 5