Optical Flow in Mostly Rigid Scenes

The optical flow of natural scenes is a combination of the motion of the observer and the independent motion of objects. Existing algorithms typically focus on either recovering motion and structure under the assumption of a purely static world or optical flow for general unconstrained scenes. We combine these approaches in an optical flow algorithm that estimates an explicit segmentation of moving objects from appearance and physical constraints. In static regions we take advantage of strong constraints to jointly estimate the camera motion and the 3D structure of the scene over multiple frames. This allows us to also regularize the structure instead of the motion. Our formulation uses a Plane+Parallax framework, which works even under small baselines, and reduces the motion estimation to a one-dimensional search problem, resulting in more accurate estimation. In moving regions the flow is treated as unconstrained, and computed with an existing optical flow method. The resulting Mostly-Rigid Flow (MR-Flow) method achieves state-of-the-art results on both the MPI-Sintel and KITTI-2015 benchmarks.Comment: 15 pages, 10 figures; accepted for publication at CVPR 201

Representations for Cognitive Vision : a Review of Appearance-Based, Spatio-Temporal, and Graph-Based Approaches

The emerging discipline of cognitive vision requires a proper representation of visual information including spatial and temporal relationships, scenes, events, semantics and context. This review article summarizes existing representational schemes in computer vision which might be useful for cognitive vision, a and discusses promising future research directions. The various approaches are categorized according to appearance-based, spatio-temporal, and graph-based representations for cognitive vision. While the representation of objects has been covered extensively in computer vision research, both from a reconstruction as well as from a recognition point of view, cognitive vision will also require new ideas how to represent scenes. We introduce new concepts for scene representations and discuss how these might be efficiently implemented in future cognitive vision systems

Algorithms for Image Analysis in Traffic Surveillance Systems

Import 23/07/2015The presence of various surveillance systems in many areas of the modern society is indisputable and the most perceptible are the video surveillance systems. This thesis mainly describes novel algorithm for vision-based estimation of the parking lot occupancy and the closely related topics of pre-processing of images captured under harsh conditions. The developed algorithms have their practical application in the parking guidance systems which are still more popular. One part of this work also tries to contribute to the specific area of computer graphics denoted as direct volume rendering (DVR).Přítomnost nejrůznějších dohledových systémů v mnoha oblastech soudobé společnosti je nesporná a systémy pro monitorování dopravy jsou těmi nejviditelnějšími. Hlavní část této práce se věnuje popisu nového algoritmu pro detekci obsazenosti parkovacích míst pomocí analýzy obrazu získaného z kamerového systému. Práce se také zabývá tématy úzce souvisejícími s předzpracováním obrazu získaného za ztížených podmínek. Vyvinuté algoritmy mají své praktické uplatnění zejména v oblasti pomocných parkovacích systémů, které se stávají čím dál tím více populárními. Jedna část této práce se snaží přispět do oblasti počítačové grafiky označované jako přímá vizualizace objemových dat.Prezenční460 - Katedra informatikyvyhově

Estimation of Camera Locations in Highly Corrupted Scenarios: All About that Base, No Shape Trouble

We propose a strategy for improving camera location estimation in structure from motion. Our setting assumes highly corrupted pairwise directions (i.e., normalized relative location vectors), so there is a clear room for improving current state-of-the-art solutions for this problem. Our strategy identifies severely corrupted pairwise directions by using a geometric consistency condition. It then selects a cleaner set of pairwise directions as a preprocessing step for common solvers. We theoretically guarantee the successful performance of a basic version of our strategy under a synthetic corruption model. Numerical results on artificial and real data demonstrate the significant improvement obtained by our strategy.Comment: To appear in the CVPR 2018 proceeding

The Performance of LBP and NSVC Combination Applied to Face Classification

The growing demand in the field of security led to the development of interesting approaches in face classification. These works are interested since their beginning in extracting the invariant features of the face to build a single model easily identifiable by classification algorithms. Our goal in this article is to develop more efficient practical methods for face detection. We present a new fast and accurate approach based on local binary patterns (LBP) for the extraction of the features that is combined with the new classifier Neighboring Support Vector Classifier (NSVC) for classification. The experimental results on different natural images show that the proposed method can get very good results at a very short detection time. The best precision obtained by LBP-NSVC exceeds 99%