1 /*M///////////////////////////////////////////////////////////////////////////////////////
3 // IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
5 // By downloading, copying, installing or using the software you agree to this license.
6 // If you do not agree to this license, do not download, install,
7 // copy or use the software.
10 // Intel License Agreement
12 // Copyright (C) 2000, Intel Corporation, all rights reserved.
13 // Third party copyrights are property of their respective owners.
15 // Redistribution and use in source and binary forms, with or without modification,
16 // are permitted provided that the following conditions are met:
18 // * Redistribution's of source code must retain the above copyright notice,
19 // this list of conditions and the following disclaimer.
21 // * Redistribution's in binary form must reproduce the above copyright notice,
22 // this list of conditions and the following disclaimer in the documentation
23 // and/or other materials provided with the distribution.
25 // * The name of Intel Corporation may not be used to endorse or promote products
26 // derived from this software without specific prior written permission.
28 // This software is provided by the copyright holders and contributors "as is" and
29 // any express or implied warranties, including, but not limited to, the implied
30 // warranties of merchantability and fitness for a particular purpose are disclaimed.
31 // In no event shall the Intel Corporation or contributors be liable for any direct,
32 // indirect, incidental, special, exemplary, or consequential damages
33 // (including, but not limited to, procurement of substitute goods or services;
34 // loss of use, data, or profits; or business interruption) however caused
35 // and on any theory of liability, whether in contract, strict liability,
36 // or tort (including negligence or otherwise) arising in any way out of
37 // the use of this software, even if advised of the possibility of such damage.
41 #include "precomp.hpp"
43 void cvReleaseBGStatModel( CvBGStatModel** bg_model )
45 if( bg_model && *bg_model && (*bg_model)->release )
46 (*bg_model)->release( bg_model );
49 int cvUpdateBGStatModel( IplImage* current_frame,
50 CvBGStatModel* bg_model,
53 return bg_model && bg_model->update ? bg_model->update( current_frame, bg_model, learningRate ) : 0;
57 // Function cvRefineForegroundMaskBySegm preforms FG post-processing based on segmentation
58 // (all pixels of the segment will be classified as FG if majority of pixels of the region are FG).
60 // segments - pointer to result of segmentation (for example MeanShiftSegmentation)
61 // bg_model - pointer to CvBGStatModel structure
62 CV_IMPL void cvRefineForegroundMaskBySegm( CvSeq* segments, CvBGStatModel* bg_model )
64 IplImage* tmp_image = cvCreateImage(cvSize(bg_model->foreground->width,bg_model->foreground->height),
66 for( ; segments; segments = ((CvSeq*)segments)->h_next )
68 CvSeq seq = *segments;
69 seq.v_next = seq.h_next = NULL;
71 cvDrawContours( tmp_image, &seq, CV_RGB(0, 0, 255), CV_RGB(0, 0, 255), 10, -1);
72 int num1 = cvCountNonZero(tmp_image);
73 cvAnd(tmp_image, bg_model->foreground, tmp_image);
74 int num2 = cvCountNonZero(tmp_image);
76 cvDrawContours( bg_model->foreground, &seq, CV_RGB(0, 0, 255), CV_RGB(0, 0, 255), 10, -1);
78 cvDrawContours( bg_model->foreground, &seq, CV_RGB(0, 0, 0), CV_RGB(0, 0, 0), 10, -1);
80 cvReleaseImage(&tmp_image);
86 cvSegmentFGMask( CvArr* _mask, int poly1Hull0, float perimScale,
87 CvMemStorage* storage, CvPoint offset )
89 CvMat mstub, *mask = cvGetMat( _mask, &mstub );
90 CvMemStorage* tempStorage = storage ? storage : cvCreateMemStorage();
93 CvContourScanner scanner;
96 cvMorphologyEx( mask, mask, 0, 0, CV_MOP_OPEN, 1 );
97 cvMorphologyEx( mask, mask, 0, 0, CV_MOP_CLOSE, 1 );
99 // find contours around only bigger regions
100 scanner = cvStartFindContours( mask, tempStorage,
101 sizeof(CvContour), CV_RETR_EXTERNAL, CV_CHAIN_APPROX_SIMPLE, offset );
103 while( (c = cvFindNextContour( scanner )) != 0 )
105 double len = cvContourPerimeter( c );
106 double q = (mask->rows + mask->cols)/perimScale; // calculate perimeter len threshold
107 if( len < q ) //Get rid of blob if it's perimeter is too small
108 cvSubstituteContour( scanner, 0 );
109 else //Smooth it's edges if it's large enough
112 if( poly1Hull0 ) //Polygonal approximation of the segmentation
113 newC = cvApproxPoly( c, sizeof(CvContour), tempStorage, CV_POLY_APPROX_DP, 2, 0 );
114 else //Convex Hull of the segmentation
115 newC = cvConvexHull2( c, tempStorage, CV_CLOCKWISE, 1 );
116 cvSubstituteContour( scanner, newC );
120 contours = cvEndFindContours( &scanner );
122 // paint the found regions back into the image
124 for( c=contours; c != 0; c = c->h_next )
125 cvDrawContours( mask, c, cvScalarAll(255), cvScalarAll(0), -1, CV_FILLED, 8,
126 cvPoint(-offset.x,-offset.y));
128 if( tempStorage != storage )
130 cvReleaseMemStorage( &tempStorage );