Class containing the methods needed for Quasi Dense Stereo computation. [詳解]

#include <quasi_dense_stereo.hpp>

公開メンバ関数
virtual CV_WRAP	~QuasiDenseStereo ()=0
	destructor Method to free all the memory allocated by matrices and vectors in this class.

virtual CV_WRAP int	loadParameters (cv::String filepath)=0
	Load a file containing the configuration parameters of the class. [詳解]

virtual CV_WRAP int	saveParameters (cv::String filepath)=0
	Save a file containing all the configuration parameters the class is currently set to. [詳解]

virtual CV_WRAP void	getSparseMatches (CV_OUT std::vector< MatchQuasiDense > &sMatches)=0
	Get The sparse corresponding points. [詳解]

virtual CV_WRAP void	getDenseMatches (CV_OUT std::vector< MatchQuasiDense > &denseMatches)=0
	Get The dense corresponding points. [詳解]

virtual CV_WRAP void	process (const cv::Mat &imgLeft, const cv::Mat &imgRight)=0
	Main process of the algorithm. This method computes the sparse seeds and then densifies them. [詳解]

virtual CV_WRAP cv::Point2f	getMatch (const int x, const int y)=0
	Specify pixel coordinates in the left image and get its corresponding location in the right image. [詳解]

virtual CV_WRAP cv::Mat	getDisparity ()=0
	Compute and return the disparity map based on the correspondences found in the "process" method. [詳解]

静的公開メンバ関数
static CV_WRAP cv::Ptr< QuasiDenseStereo >	create (cv::Size monoImgSize, cv::String paramFilepath=cv::String())

公開変数類
CV_PROP_RW PropagationParameters	Param

詳解

Class containing the methods needed for Quasi Dense Stereo computation.

This module contains the code to perform quasi dense stereo matching. The method initially starts with a sparse 3D reconstruction based on feature matching across a stereo image pair and subsequently propagates the structure into neighboring image regions. To obtain initial seed correspondences, the algorithm locates Shi and Tomashi features in the left image of the stereo pair and then tracks them using pyramidal Lucas-Kanade in the right image. To densify the sparse correspondences, the algorithm computes the zero-mean normalized cross-correlation (ZNCC) in small patches around every seed pair and uses it as a quality metric for each match. In this code, we introduce a custom structure to store the location and ZNCC value of correspondences called "Match". Seed Matches are stored in a priority queue sorted according to their ZNCC value, allowing for the best quality Match to be readily available. The algorithm pops Matches and uses them to extract new matches around them. This is done by considering a small neighboring area around each Seed and retrieving correspondences above a certain texture threshold that are not previously computed. New matches are stored in the seed priority queue and used as seeds. The propagation process ends when no additional matches can be retrieved.

参照: This code represents the work presented in [Stoyanov2010]. If this code is useful for your work please cite [Stoyanov2010].

Also the original growing scheme idea is described in [Lhuillier2000]

このクラス詳解は次のファイルから抽出されました:

quasi_dense_stereo.hpp

公開メンバ関数

静的公開メンバ関数

公開変数類

詳解