General SFM methods give poor results for images captured by constrained motions such as planar motion of concentric mosaics (CM). In this paper, we propose new SFM algorithms for...
Long Quan, Le Lu, Heung-Yeung Shum, Maxime Lhuilli...
This paper addresses the longstanding problem of the recognition limitations of classical LALR(1) parser generators by proposing the usage of noncanonical parsers. To this end, we...
In recent years, sparse representation originating from signal compressed sensing theory has attracted increasing interest in computer vision research community. However, to our b...
Abstract It has been proven that districted matching schemes (e.g., the US presidential election scheme, also called the Electoral College) are more stable than undistricted matchi...
It is common to evaluate scheduling policies based on their mean response times. Another important, but sometimes opposing, performance metric is a scheduling policy’s fairness....