Example program using F&H method to locate matches on a pair of images. More...
#include <vcl_cassert.h>
#include <vul/vul_arg.h>
#include <vimt/vimt_image_2d_of.h>
#include <vimt/vimt_gaussian_pyramid_builder_2d.h>
#include <vimt/vimt_image_pyramid.h>
#include <vil/algo/vil_corners.h>
#include <vil/algo/vil_find_peaks.h>
#include <vil/vil_load.h>
#include <vil/vil_save.h>
#include <vil/vil_fill.h>
#include <vil/vil_crop.h>
#include <vil/vil_math.h>
#include <vil/vil_convert.h>
#include <vgl/vgl_point_2d.h>
#include <vgl/vgl_vector_2d.h>
#include <mbl/mbl_index_sort.h>
#include <fhs/fhs_searcher.h>
#include <vimt/algo/vimt_normalised_correlation_2d.h>
#include <mbl/mbl_minimum_spanning_tree.h>
#include <mbl/mbl_draw_line.h>
Go to the source code of this file.
Functions | |
void | print_usage () |
void | draw_tree (vil_image_view< vxl_byte > &image, const vcl_vector< vgl_point_2d< double > > &pts, const vcl_vector< vcl_pair< int, int > > &pairs) |
Write tree into the image. | |
int | main (int argc, char *argv[]) |
Example program using F&H method to locate matches on a pair of images.
Definition in file find_matches.cxx.
void draw_tree | ( | vil_image_view< vxl_byte > & | image, |
const vcl_vector< vgl_point_2d< double > > & | pts, | ||
const vcl_vector< vcl_pair< int, int > > & | pairs | ||
) |
Write tree into the image.
Draw disks at each point, and lines between linked points
Definition at line 40 of file find_matches.cxx.
int main | ( | int | argc, |
char * | argv[] | ||
) |
Definition at line 58 of file find_matches.cxx.
void print_usage | ( | ) |
Definition at line 27 of file find_matches.cxx.