dothingyo Goto Github PK

200-rhinoceros

3ddfa

The pytorch improved re-implementation of TPAMI 2017 paper: Face Alignment in Full Pose Range: A 3D Total Solution.

3dfasterrcnn_lungnoduledetector

3dunetcnn

Keras 3D U-Net Convolution Neural Network (CNN) designed for medical image segmentation

4dface

Real-time 3D face tracking and reconstruction from 2D video

action

A new C++ Library

advanceddatastructures

大学时期学习数据结构的C++源码，包含AVL树、Treap、多个有序链表合并、二叉查找树、二项堆、红黑树、伸展树、跳表、栈与队列相互模拟以及最小(大)值求解、主席树的C++版实现，欢迎指出错误和提交贡献。

algo

数据结构和算法必知必会的50个代码实现

algo-practice

算法实践(JavaScript & Java)，排序，查找、树、两指针、动态规划等

articles

Article Publish in Wechat & Toutiao

awesome-python-cn

Python资源大全中文版，包括：Web框架、网络爬虫、模板引擎、数据库、数据可视化、图片处理等，由伯乐在线持续更新。

awesome-semantic-segmentation

:metal: awesome-semantic-segmentation

balancetree

二叉查找树、AVL树、红黑树、B-树

binpacking

A Golang 3D Bin Packing Implementation

binpackingjs

2D, 3D, 4D Bin Packing

bp3d

Golang package for 3d bin packing problem

cifar-vgg

VGG16 models for CIFAR-10 and CIFAR-100 using Keras

compiler

A c language compiler

computer-networking-a-top-down-approach-notes

《计算机网络－自顶向下方法(原书第6版)》编程作业，Wireshark实验文档的翻译和解答。

cvpr2019

cvpr2019 papers，极市团队整理

cyclic-learning-rate

Cyclic learning rate TensorFlow implementation.

dataset_loaders

A collection of dataset loaders

deconv

Deblurring through deconvolution in OpenCV

deeplearning-500-questions

深度学习500问，以问答形式对常用的概率知识、线性代数、机器学习、深度学习、计算机视觉等热点问题进行阐述，以帮助自己及有需要的读者。 全书分为18个章节，50余万字。由于水平有限，书中不妥之处恳请广大读者批评指正。 未完待续............ 如有意合作，联系[email protected] 版权所有，违权必究 Tan 2018.06

densepose

A real-time approach for mapping all human pixels of 2D RGB images to a 3D surface-based model of the body

densereg

3D hand pose estimation via dense regression

depth-image-quality-enhancement

dothingyo.github.io

drl_binpacking

3D bin packing is a classical and challenging combinatorial optimization problem in logistics and production systems. An effective bin packing algorithm means the reduction of total packing cost and increase in utilization of resources. Because the cost of packing materials, which is mainly determined by their surface area, occupies the most part of packing cost, and in many real business scenarios there is no bin with fixed size, so AI Department of Cainiao proposed a new type of 3D bin packing problem. The objective of this new type of 3D bin packing problem is to pack all items into a bin with minimized surface area. And a DRL method based on the sequence-to-sequence model is proposed to solve the problem. This is the research paper link: https://arxiv.org/abs/1708.05930. Source code of this method can be found in the project.

dualgorithm

My personal code collection of algorithms, data structures, and design patterns in C++ and Python.