text
stringlengths 0
2.2M
|
---|
0,
|
0,
|
4,
|
4,
|
1,
|
};
|
std::vector<float> costs = {
|
0.25, 0.25, // Both boxes are contained in first box
|
};
|
fl::Variable labelArr = {af::array(5, 2, labels.data()), false};
|
fl::Variable predArr = {af::array(5, 2, preds.data()), false};
|
fl::Variable result, uni;
|
std::tie(result, uni) = boxIou(predArr, labelArr);
|
EXPECT_EQ(result(0, 0).array().scalar<float>(), costs[0]);
|
EXPECT_EQ(result(1, 0).array().scalar<float>(), costs[1]);
|
}
|
TEST(BoxUtils, IOUBatched) {
|
std::vector<float> preds = {1, 1, 3, 3, 1, 0, 1, 2, 3, 1};
|
std::vector<float> labels = {
|
0,
|
0,
|
4,
|
4,
|
1,
|
0,
|
0,
|
4,
|
4,
|
1,
|
};
|
std::vector<float> costs = {
|
0.25, 0.25, // Both boxes are contained in first box
|
};
|
fl::Variable labelArr = {af::array(5, 1, 2, labels.data()), false};
|
fl::Variable predArr = {af::array(5, 1, 2, preds.data()), false};
|
fl::Variable result, uni;
|
std::tie(result, uni) = boxIou(predArr, labelArr);
|
EXPECT_EQ(result(0, 0, 0).array().scalar<float>(), costs[0]);
|
EXPECT_EQ(result(0, 0, 1).array().scalar<float>(), costs[1]);
|
}
|
//// Test GIOU
|
//// The first box is further away from the second box and should have a smaller
|
//// score
|
TEST(BoxUtils, GIOU) {
|
std::vector<float> preds = {0, 0, 1, 1, 1, 1, 1, 2, 2, 1};
|
std::vector<float> labels = {2, 2, 3, 3, 1};
|
fl::Variable labelArr = {af::array(5, 1, labels.data()), false};
|
fl::Variable predArr = {af::array(5, 2, preds.data()), false};
|
fl::Variable result = generalizedBoxIou(predArr, labelArr);
|
EXPECT_LT(result(0, 0).array().scalar<float>(), result(1, 0).scalar<float>());
|
}
|
/*
|
* Copyright (c) 2006-2010 Erin Catto http://www.box2d.org
|
*
|
* This software is provided 'as-is', without any express or implied
|
* warranty. In no event will the authors be held liable for any damages
|
* arising from the use of this software.
|
* Permission is granted to anyone to use this software for any purpose,
|
* including commercial applications, and to alter it and redistribute it
|
* freely, subject to the following restrictions:
|
* 1. The origin of this software must not be misrepresented; you must not
|
* claim that you wrote the original software. If you use this software
|
* in a product, an acknowledgment in the product documentation would be
|
* appreciated but is not required.
|
* 2. Altered source versions must be plainly marked as such, and must not be
|
* misrepresented as being the original software.
|
* 3. This notice may not be removed or altered from any source distribution.
|
*/
|
#include "b2EdgeAndPolygonContact.h"
|
#include "../../Common/b2BlockAllocator.h"
|
#include "../b2Fixture.h"
|
#include <new>
|
using namespace std;
|
b2Contact* b2EdgeAndPolygonContact::Create(b2Fixture* fixtureA, int32, b2Fixture* fixtureB, int32, b2BlockAllocator* allocator)
|
{
|
void* mem = allocator->Allocate(sizeof(b2EdgeAndPolygonContact));
|
return new (mem) b2EdgeAndPolygonContact(fixtureA, fixtureB);
|
}
|
void b2EdgeAndPolygonContact::Destroy(b2Contact* contact, b2BlockAllocator* allocator)
|
{
|
((b2EdgeAndPolygonContact*)contact)->~b2EdgeAndPolygonContact();
|
allocator->Free(contact, sizeof(b2EdgeAndPolygonContact));
|
}
|
b2EdgeAndPolygonContact::b2EdgeAndPolygonContact(b2Fixture* fixtureA, b2Fixture* fixtureB)
|
: b2Contact(fixtureA, 0, fixtureB, 0)
|
{
|
b2Assert(m_fixtureA->GetType() == b2Shape::e_edge);
|
b2Assert(m_fixtureB->GetType() == b2Shape::e_polygon);
|
}
|
void b2EdgeAndPolygonContact::Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB)
|
{
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.