# 「Single Image Haze Removal Using Dark Channel Prior」Python Implementation with OpenCV

### A Brief Review

Single Image Haze Removal Using Dark Channel Prior」是 2009 年 CVPR 最佳论文，何凯明博士在这篇论文中提出了暗通道先验的图像去雾算法。

It is based on a key observation most local patches in haze-free outdoor images contain some pixels which have very low intensities in at least one color channel.

Last, the haze removal can produce depth information and benefit many vision algorithms and advanced image editing. Haze or fog can be a useful depth clue for scene understanding. The bad haze image can be put to good use.

$$\mathbf{I}(\mathbf{x})=\mathbf{J}(\mathbf{x})t(\mathbf{x})+\mathbf{A}(1-t(\mathbf{x}))\tag{1}$$


# There is only one problem to solve——$2^k\times 2^k$棋盘覆盖问题

$2^k\times 2^k$棋盘覆盖问题描述如下，给出$k$的值，得到一块$2^k\times 2^k$大小的棋盘，棋盘上有一格是特殊方格。随后给出如下4种L型的骨牌，要求使用这四种L型的骨牌覆盖给定棋盘上的，除特殊方格以外的所有格子，并且任何两个L型骨牌不得重叠覆盖。

# Linear Vector Combination Problem

Linear Vector Combination Problem，即线性向量组合问题。写这个其实是由前一篇 post 而来（从百鸡问题到数学思维）。

# 从百鸡问题到数学思维

——张丘建《算经》

It is impossible to know things of this world unless you know mathematics.

——Roger Bacon《Opus Majus》

——人月神话

# Congested network笔记(3)

\left\{\begin{align}\frac{\partial\mathcal{Z(F)}}{\partial\underline{\mathcal{F}}}\cdot(\mathcal{F}-\underline{\mathcal{F}})&\ge 0&\forall \mathcal{F}\in S&\text{ 最优解}\\ \mathcal{C}(\mathcal{F}^*)\cdot(\mathcal{F}-\mathcal{F}^*)&\ge 0&\forall \mathcal{F}\in S&\text{ 均衡解}\end{align}\right.


# Congested network笔记(1)

——A BEAUTIFUL MATH
John Nash, Game Theory
AND THE MODERN QUEST FOR A CODE OF NATURE

# What is the limit of...

$$\prod\limits_{n\ge2}\left(1+\frac{1}{n^2}\right)$$