Created by the British Broadcasting Corporation.
00001 /* ***** BEGIN LICENSE BLOCK ***** 00002 * 00003 * $Id: pixel_match.h,v 1.11 2008/08/27 00:20:52 asuraparaju Exp $ $Name: Dirac_1_0_2 $ 00004 * 00005 * Version: MPL 1.1/GPL 2.0/LGPL 2.1 00006 * 00007 * The contents of this file are subject to the Mozilla Public License 00008 * Version 1.1 (the "License"); you may not use this file except in compliance 00009 * with the License. You may obtain a copy of the License at 00010 * http://www.mozilla.org/MPL/ 00011 * 00012 * Software distributed under the License is distributed on an "AS IS" basis, 00013 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License for 00014 * the specific language governing rights and limitations under the License. 00015 * 00016 * The Original Code is BBC Research and Development code. 00017 * 00018 * The Initial Developer of the Original Code is the British Broadcasting 00019 * Corporation. 00020 * Portions created by the Initial Developer are Copyright (C) 2004. 00021 * All Rights Reserved. 00022 * 00023 * Contributor(s): Thomas Davies (Original Author) 00024 * 00025 * Alternatively, the contents of this file may be used under the terms of 00026 * the GNU General Public License Version 2 (the "GPL"), or the GNU Lesser 00027 * Public License Version 2.1 (the "LGPL"), in which case the provisions of 00028 * the GPL or the LGPL are applicable instead of those above. If you wish to 00029 * allow use of your version of this file only under the terms of the either 00030 * the GPL or LGPL and not to allow others to use your version of this file 00031 * under the MPL, indicate your decision by deleting the provisions above 00032 * and replace them with the notice and other provisions required by the GPL 00033 * or LGPL. If you do not delete the provisions above, a recipient may use 00034 * your version of this file under the terms of any one of the MPL, the GPL 00035 * or the LGPL. 00036 * ***** END LICENSE BLOCK ***** */ 00037 00038 #ifndef _PIXEL_MATCH_H_ 00039 #define _PIXEL_MATCH_H_ 00040 00041 /* ************************************************************************* 00042 * 00043 * Class for getting motion vectors to pixel-accuracy 00044 * 00045 * The class could be implemented in any number of ways. The approach taken 00046 * has been to do hierarchical matching, which means doing block matching 00047 * on smaller, downcoverted versions of the pictures in order to get a wider 00048 * effective search range. At each level of searching the vectors discovered 00049 * can be used as guides to the next level of searching, and in this way 00050 * large motions can be detected easily. The danger is that the motions of 00051 * small objects can be overlooked. 00052 * 00053 * *************************************************************************/ 00054 00055 #include <libdirac_common/common.h> 00056 #include <libdirac_common/motion.h> 00057 #include <libdirac_motionest/block_match.h> 00058 namespace dirac 00059 { 00060 class EncQueue; 00061 class MvData; 00062 class EncoderParams; 00063 class PicArray; 00064 00065 00066 class PixelMatcher 00067 { 00068 public: 00069 00071 PixelMatcher( const EncoderParams& encp); 00072 00074 /* Do the searching. 00075 00076 \param my_buffer the buffer of pictures from which pictures are taken 00077 \param pic_num the number of the picture for which motion is to be estimated 00078 \param mv_data class in which the measured motion vectors are stored, together with costs 00079 00080 */ 00081 void DoSearch( EncQueue& my_buffer, int pic_num ); 00082 00083 private: 00084 00085 // Member variables 00086 00088 const EncoderParams& m_encparams; 00089 00091 const PicturePredParams* m_predparams; 00092 00093 // the depth of the hierarchical match 00094 int m_depth; 00095 00096 // the level we're at (from 0 to depth) 00097 int m_level; 00098 00099 // the search-range sizes for the hierarchical match 00100 int m_xr, m_yr; 00101 00102 // the search-range sizes for when hierarchical match fails 00103 int m_big_xr, m_big_yr; 00104 00105 // the temporal distances to the reference pictures 00106 int m_tdiff[2]; 00107 00108 // the picture sort - I, L1 or L2 00109 PictureSort m_psort; 00110 00111 // list of candidate vectors for checking 00112 CandidateList m_cand_list; 00113 00114 // Prediction used for each block. This is derived from neighbouring blocks 00115 // and is used to control the variation in the motion vector field. 00116 MVector m_mv_prediction; 00117 00118 // The value used in computing block cost means with a simple recursive filter 00119 double m_rho; 00120 00121 // The mean of the block cost 00122 double m_cost_mean; 00123 00124 // The mean of the square of the block cost 00125 double m_cost_mean_sq; 00126 00127 private: 00128 00129 // Functions 00130 00132 void MakePicHierarchy(const PicArray& data, OneDArray< PicArray* >& down_data); 00133 00135 void MakeMEDataHierarchy(const OneDArray< PicArray*>& down_data, 00136 OneDArray< MEData* >& me_data_set ); 00137 00139 void TidyPics( OneDArray< PicArray*>& down_data ); 00140 00142 void TidyMEData( OneDArray< MEData*>& me_data_set ); 00143 00145 void MatchPic(const PicArray& ref_data , const PicArray& pic_data , MEData& me_data , 00146 const MvData& guide_data, const int ref_id); 00147 00149 void DoBlock(const int xpos, const int ypos , 00150 const MvArray& guide_array, 00151 BlockMatcher& block_match); 00152 00153 }; 00154 00155 } // namespace dirac 00156 00157 #endif
© 2004 British Broadcasting Corporation.
Dirac code licensed under the Mozilla Public License (MPL) Version 1.1.
HTML documentation generated by Dimitri van Heesch's
excellent Doxygen tool.