Translator Disclaimer
1 October 2010 Transcript synchronization using local dynamic programming
Author Affiliations +
A local text alignment algorithm is introduced in this work for synchronizing transcripts. The proposed algorithm can be used for any transcript alignment process where high computational complexity is a concern. Dynamic programming is typically used to align a set of transcripts: however, the computational complexity of dynamic programming is high. To reduce the computational complexity, a local dynamic programming algorithm is introduced that aligns subsections of the transcripts. Aligning subsections of the transcripts greatly reduces the information needed for accurate synchronization. The information is reduced because it is not necessary to compare all words between the two transcripts. For example, words at the beginning of one transcript would not be compared to the words at the end of the other transcript. The subsection size is dependent on the total number of alignment errors between the transcripts. It is shown that the computational complexity of the proposed local dynamic programming algorithm is greatly reduced while preserving alignment accuracy.
©(2010) Society of Photo-Optical Instrumentation Engineers (SPIE)
Anthony F. Martone and Edward J. Delp III "Transcript synchronization using local dynamic programming," Journal of Electronic Imaging 19(4), 043011 (1 October 2010).
Published: 1 October 2010


MPEG audio-video synchronization
Proceedings of SPIE (January 17 1997)
MPEG-2 to H.263 transcoder
Proceedings of SPIE (November 22 1999)
Evaluating the effectiveness of automatic PVR management
Proceedings of SPIE (December 18 2003)
Improved H.264/AVC video broadcast/multicast
Proceedings of SPIE (June 24 2005)
Summarization of video programs based on closed captions
Proceedings of SPIE (January 01 2001)
Automated closed-captioning using text alignment
Proceedings of SPIE (December 18 2003)
A video quality assessment model based on the MPEG 7...
Proceedings of SPIE (January 24 2011)

Back to Top