zhoutingztzt Goto Github PK

android_controller_pull_to_refresh

androidswipelayout

The Most Powerful Swipe Layout!

awesome-object-proposals

A curated list of object proposals resources for object detection

benchmark_results

visual tracker benchmark results

chinesecodinginterviewappendix

The source code for the appendix part of the Chinese version of the book Coding Interviews

cjson

cJson源码和源码分析

computervision

Various projects using Open CV

coopcuts_cvpr2013

code supporting our CVPR 2013 paper

ctagsx

VSCode ctags implementation that actually works

figtree-android

Android port of figtree

graph-cut

Graph-cut Image Segmentation ---------------------------- Implements Boykov/Kolmogorov’s Max-Flow/Min-Cut algorithm for computer vision problems. Two gray-scale images have been used to test the system for image segmentation (foreground/background segmentation) problem. Steps: 1. defined the graph structure and unary and pairwise terms. For graph structure, i have used available packages/libraries such as PyMaxflow. 2. likelihood function for background and foreground has been generated. 3. General energy function consisting of unary and pairwise energy functionals have been written. 4. Likelihood maps (intensity map ranging from 0 to 1) for foreground and background have been displayed. 5. Use Boykov/Kolmogorov maxflow / mincut approach for solving the energy minimization problem. 6. Final segmentation have been displayed. Created an image for which the background pixels are red, and the foreground pixels have the color of the input image. Relevant paper can be found here: http://www.csd.uwo.ca/~yuri/Papers/pami04.pdf

high-order-energies-for-stereo-segmentation-

High-order energies for stereo segmentation

higher-order-energies-for-image-segmentation-

Higher-Order Energies for Image Segmentation

igniter

A trojan client for Android (UNDER CONSTRUCTION).

iresnet

java-interview

👨‍🎓 Java related : basic, concurrent, algorithm

lazy-random-walks-for-superpixel-segmentation

Lazy random walks for superpixel segmentation (IEEE TIP14)

leetcode

LeetCode Problems' Solutions

mdp_tracking

Learning to Track: Online Multi-Object Tracking by Decision Making

mrflow

Code for the paper "Optical Flow in Mostly Rigid Scenes" by Jonas Wulff, Laura Sevilla-Lara, Michael Black, CVPR 2017

mytinystl

Achieve a tiny STL in C++11

netdef_models

Repository for different network models related to flow/disparity (ECCV 18)

nginx

An official read-only mirror of http://hg.nginx.org/nginx/ which is updated hourly. Pull requests on GitHub cannot be accepted and will be automatically closed. The proper way to submit changes to nginx is via the nginx development mailing list, see http://nginx.org/en/docs/contributing_changes.html

oatpp

🌱Light, high-performance web framework. Create bleedingly-fast web-services. Organic. Pure C++

psmnet

Pyramid Stereo Matching Network (CVPR2018)

redis

Redis is an in-memory database that persists on disk. The data model is key-value, but many different kind of values are supported: Strings, Lists, Sets, Sorted Sets, Hashes, HyperLogLogs, Bitmaps.

tbcf

Tracking Benchmark for Correlation Filters

tinyhttpd

tinyhttpd的详细注释版，十分适合入门者学习的一个项目

tinyhttpd-1

Tinyhttpd 是J. David Blackstone在1999年写的一个不到 500 行的超轻量型 Http Server，用来学习非常不错，可以帮助我们真正理解服务器程序的本质。官网:http://tinyhttpd.sourceforge.net

tkeed

🌎 High Performance HTTP WebServer