Objectness is usually represented as a value which reflects how likely an image window covers an object of any category. Algorithms belonging to this category, avoid making decisions early on, by proposing a small number of category-independent proposals, that are expected to cover all objects in an image. Being able to perceive objects before identifying them is closely related to bottom up visual attention (saliency)
Presently, the Binarized normed gradients algorithm [BING] has been implemented.
[BING] | Cheng, Ming-Ming, et al. “BING: Binarized normed gradients for objectness estimation at 300fps.” IEEE CVPR. 2014. |
Implementation of BING from Objectness:
class CV_EXPORTS ObjectnessBING : public Objectness
{
public:
ObjectnessBING();
~ObjectnessBING();
void read();
void write() const;
vector<float> getobjectnessValues();
void setTrainingPath( string trainingPath );
void setBBResDir( string resultsDir );
protected:
bool computeSaliencyImpl( const InputArray src, OutputArray dst );
};
Return the list of the rectangles’ objectness value, in the same order as the vector<Vec4i> objectnessBoundingBox returned by the algorithm (in computeSaliencyImpl function). The bigger value these scores are, it is more likely to be an object window.
This is a utility function that allows to set the correct path from which the algorithm will load the trained model.
Parameters: |
|
---|
This is a utility function that allows to set an arbitrary path in which the algorithm will save the optional results (ie writing on file the total number and the list of rectangles returned by objectess, one for each row).
Parameters: |
|
---|
Performs all the operations and calls all internal functions necessary for the accomplishment of the Binarized normed gradients algorithm.
Parameters: |
|
---|