iLOVEJohnny的博客

一天搞懂深度学习，是李宏毅教授的讲义PPT，对于初学深度学习的人来说，是很好的入门文档。希望对大家有帮助。

Discovering and segmenting objects in videos is a challenging task due to large variations of objects in appearances, deformed shapes and cluttered backgrounds. In this paper, we propose to segment objects and understand their visual semantics from a collection of videos that link to each other, which we refer to as semantic co-segmentation. Without any prior knowledge on videos, we rst extract semantic objects and utilize a tracking-based approach to generate multiple object-like tracklets across the video. Each tracklet maintains temporally connected segments and is associated with a predicted category. To exploit rich information from other videos, we collect tracklets that are assigned to the same category from all videos, and co-select tracklets that belong to true objects by solving a submodular function. This function accounts for object properties such as appearances, shapes and motions, and hence facilitates the co-segmentation process. Experiments on three video object segmentation datasets show that the proposed algorithm performs favorably against the other state-of-the-art methods.

Most state-of-the-art techniques for multi-class image segmentation and labeling use conditional random fields defined over pixels or image regions. While regionlevel models often feature dense pairwise connectivity, pixel-level models are considerably larger and have only permitted sparse graph structures. In this paper, we consider fully connected CRF models defined on the complete set of pixels in an image. The resulting graphs have billions of edges, making traditional inference algorithms impractical. Our main contribution is a highly efficient approximate inference algorithm for fully connected CRF models in which the pairwise edge potentials are defined by a linear combination of Gaussian kernels. Our experiments demonstrate that dense connectivity at the pixel level substantially improves segmentation and labeling accuracy.

We present an approach to long-range spatio-temporal regularization in semantic video segmentation. Temporal regularization in video is challenging because both the camera and the scene may be in motion. Thus Euclidean distance in the space-time volume is not a good proxy for correspondence. We optimize the mapping of pixels to a Euclidean feature space so as to minimize distances between corresponding points. Structured prediction is performed by a dense CRF that operates on the optimized features. Experimental results demonstrate that the presented approach increases the accuracy and temporal consistency of semantic video segmentation.

最大流/最小割算法的简介，理解常用最大流最小割概念的文献，值得学习。 minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision. The combinatorial optimization literature provides many min-cut/max-flow algorithms with different polynomial time complexity. Their practical efficiency, however, has to date been studied mainly outside the scope of computer vision. The goal of this paper is to provide an experimental comparison of the efficiency of min-cut/max flow algorithms for applications in vision. We compare the running times of several standard algorithms, as well as a new algorithm that we have recently developed. The algorithms we study include both Goldberg-Tarjan style “push-relabel” methods and algorithms based on Ford- Fulkerson style “augmenting paths.” We benchmark these algorithms on a number of typical graphs in the contexts of image restoration, stereo, and segmentation. In many cases, our new algorithm works several times faster than any of the other methods, making near real-time performance possible. An implementation of our max-flow/min-cut algorithm is available upon request for research purposes.

Shai Avidan Mitsubishi Electric Research Labs, SeamCarving for Content-Aware Image Resizing, 2007 源码资料； 图像智能缩放的经典算法； 值得学习。

图像智能缩放（Image Retargeting）方向的优秀文章！值得学习！

传统的等比例缩放技术，直接将图像整体缩放为目标尺寸，这样做通常会破坏图像内容的比例关系，因为会出现目标长宽比与源图像长宽比不一的情况，图像内容因此会受到损失，另一方面如果目标尺寸较小而源图像的重要信息区域占整幅图像比例不大的情况下进行等比例缩放的结果是，图像信息同样会损失严重。图像智能缩放算法不同于传统的缩放技术，该算法根据图像内容的分析得出图像重要信息的分布情况，然后尽可能保留重要信息的同时，对图像进行连续且单调的像素路径的移除或插入操作，最后在保证图像矩形格式不变的前提下，缩放生成满足目标图像尺寸。

任务 为了帮助萧邦顺利通过跨省冒险，助华尔兹反败为胜，大家要去捡尽可能多的粮草，你可以 上下左右 四种方式行走，找到粮食便可以捡起，最后上报你能拿到的粮食的最大数量。由于阿尔塞斯的粮仓诡异莫测，你会被传送到粮仓的任意一个地方。 输入 阿尔塞斯有多个粮仓，所以输入数据有多组，每一组数据先输入两个数字，分别代表粮仓的长x和宽y（没有greedisgood指令，所以资源有限，x和y<=2000）然后输入相应大小的粮仓构造，由y行x列组成。当x和y都为0的时候输入结束。 其中：“.”代表是粮食，“#”代表是防护网（意味着你不可以跨越），“@”代表你被传送的位置（传送到的位置上面有粮食） 公开的第一个用例即是格式。可以自行理解。 输出 在你被传送到的位置上，可以捡到的最大粮食数量。

实验要求：用堆排序算法按关键字递减的顺序排序。 程序输入：待排序记录数（整数）和待排序记录（整数序列）； 程序输出：建堆结果和建堆后第一、第二次筛选结果。（注：待排序记录数大于等于3）