用于使用Google Coral EdgeTPU相机模块捕获视频的命令行工具。阿金到树莓派的树皮。，
Command line tool for capturing video with the Google Coral EdgeTPU camera module. Akin to raspivid for the Raspberry Pi., (2020-02-04, C++, 0KB, 下载0次)
红外 可见光 双视频显示(其中包含了 avi录像,ffmpeg转码,opencv算法)
Infrared visible dual video display (including avi video recording, ffmpeg transcoding, opencv algorithm) (2020-07-17, C++, 58099KB, 下载0次)
opengl的双缓冲pbo视频流的裸骨示例
Bare bone example of double buffered pbo video streaming for opengl (2018-05-30, C++, 3980KB, 下载0次)
双鱼眼全景拼接播放器, 支持图片和视频实时拼接和播放, 支持rtmp, rtsp, hls等流媒体, 支持实时保存拼接后的结果
The two fish eye panoramic splicing player supports real-time splicing and playing of pictures and videos, supports streaming media such as rtmp, rtsp, hls, and supports real-time saving of spliced results (2023-03-07, C++, 126582KB, 下载0次)
“用于多功能视频编码的基于注意力的双尺度CNN环路滤波器”论文库
Repository of the paper "Attention-based Dual-scale CNN In-Loop Filter for Versatile Video Coding" (2020-04-02, C++, 25263KB, 下载0次)
解决汉诺塔移动的问题，问题的提出：传说婆罗门庙里有一个塔台，台上有3根标号为A,B,C的用钻石做成的柱子，在A柱子上放着64个金盘，每一个都比下面的略小一些。把A柱子上的金盘子全部移到C柱上的那一天就是世界末日。移到的条件是：一次只能移到一个金盘，移到过程中大金盘不能放在小金盘上面。庙里的僧人一直在移个不停。因为全部的移动是264－1次，如果每秒移动一次的话需要500亿年
Tower of Hanoi to resolve the issue of moving, the problem: Once a Brahmin temple tower, the platform for the three grade A, B, C s use of diamonds made of columns, placed in the A pillar 64 gold , each slightly smaller than some of the following. A column on the gold plate all to C column is the day the end of the world. Moved to the condition that: one can only move to a gold disk, move the process can not be placed on disk Daikin xiaojinensis plate above. The temple s monks have been moved away. Because all the movement is 264-1 times that if the second mobile once every 500 million years (2008-12-27, C++, 8KB, 下载1次)