@TechReport{Bujnak-TR-2007-22,
  IS = { zkontrolovano 18 Jan 2008 },
  UPDATE  = { 2008-01-18 },
  author =      {Buj{\v n}{\'a}k, Martin},
  title =       {Randomized and Deterministic Approaches to The Sparse
		 Correspondence Problem},
  institution = {Center for Machine Perception, 
                 K13133 FEE Czech Technical University},
  address =     {Prague, Czech Republic},
  year =        {2007},
  month =       {August},
  type =        {Research Report},
  number =      {CTU-CMP-2007-22},
  issn =        {1213-2365},
  pages =       {36},
  figures =     {13},
  authorship =  {100},
  psurl =       {[PDF, 2488 KB]},
  project =     {MRTN-CT-2004-005439},
  supervisor =  {Dr. Radim {\v S}{\'a}ra},
  annote = {We summarize recent progress in the image
    features correspondence problem and we present a robust solution
    based on a radically different notion than a standard
    optimization or robust statistics methods. Even if the method
    represents measurement uncertainty explicitly, the existence of a
    unique solution is guaranteed. We formulate the correspondence
    problem as a graph theory problem of a finding stable independent
    vertex set (strict sub-kernel) in an oriented graph. The vertices
    of the graph are all possible correspondences, the edges capture
    the structure of the constraints and edge orientation represents
    pairwise comparison 'is better' based on correspondence quality,
    including the uncertainty of this comparison. Our method allows
    encoding both non-parametric and parametric constraints with
    unknown parameters to the graph.},
  keywords =    {Structure from Motion, City Modeling, 
                 Omnidirectional Vision},
  comment =     {PhD Thesis Proposal},
}