In this paper, we construct the bilinear identities for the wave functions of an extended B-type Kadomtsev-Petviashvili (BKP) hierarchy, which contains two types of (2+1)-dimensional Sawada-Kotera equation with a self-consistent source (2d-SKwS-I and 2d-SKwS-II). By introducing an auxiliary variable corresponding to the extended flow for the BKP hierarchy, we find the tau-function and the bilinear identities for this extended BKP hierarchy. The bilinear identities can generate all the Hirota's bilinear equations for the zero-curvature forms of this extended BKP hierarchy. As examples, the Hirota's bilinear equations for the two types of 2d-SKwS (both 2d-SKwS-I and 2d-SKwS-II) will be given explicitly.

No abstract uploaded!

We propose a framework for global registration of building scans. The first contribution of our work is to detect and use portals (e.g. doors and windows) to improve the local registration between two scans. Our second contribution is an optimization based on a linear integer programming formulation. We abstract each scan as a block and model the block registration as an optimization problem that aims at maximizing the overall matching score of the entire scene. We propose an efficient solution to this optimization problem by iteratively detecting and adding local constraints. We demonstrate the effectiveness of the proposed method on buildings of various styles and we show that our approach is superior to the current state of the art.

Manhattan-world urban scenes are common in the real world. We propose a fully automatic approach for reconstructing such scenes from 3D point samples. Our key idea is to represent the geometry of the buildings in the scene using a set of well-aligned boxes. We first extract plane hypothesis from the points followed by an iterative refinement step. Then, candidate boxes are obtained by partitioning the space of the point cloud into a non-uniform grid. After that, we choose an optimal subset of the candidate boxes to approximate the geometry of the buildings. The contribution of our work is that we transform scene reconstruction into a labeling problem that is solved based on a novel Markov Random Field formulation. Unlike previous methods designed for particular types of input point clouds, our method can obtain faithful reconstructions from a variety of data sources. Experiments demonstrate that our method is superior to state-of-the-art methods.

Object proposals are currently used for increasing the computational efficiency of object detection. We propose a novel adaptive pipeline for interleaving object proposals with object classification and use it as a formulation for asset detection. We first preprocess the images using a novel and efficient rectification technique. We then employ a particle filter approach to keep track of three priors, which guide proposed samples and get updated using classifier output. Tests performed on over 1000 urban images demonstrate that our rectification method is faster than existing methods without loss in quality, and that our interleaved proposal method outperforms current state-of-the-art. We further demonstrate that other methods can be improved by incorporating our interleaved proposals.