Commit ae66ce9d authored by askourik's avatar askourik

Add treelookups for nonintel

parent 8b554d3c
...@@ -424,6 +424,9 @@ circle around this pixel. ...@@ -424,6 +424,9 @@ circle around this pixel.
AgastFeatureDetector::AGAST_5_8, AgastFeatureDetector::AGAST_7_12d, AgastFeatureDetector::AGAST_5_8, AgastFeatureDetector::AGAST_7_12d,
AgastFeatureDetector::AGAST_7_12s, AgastFeatureDetector::OAST_9_16 AgastFeatureDetector::AGAST_7_12s, AgastFeatureDetector::OAST_9_16
For non-Intel platforms, there is a tree optimised variant of AGAST with same numerical results.
The 32-bit binary tree tables were generated automatically from original code using perl script.
The perl script and examples of tree generation are placed in features2d/doc folder.
Detects corners using the AGAST algorithm by @cite mair2010_agast . Detects corners using the AGAST algorithm by @cite mair2010_agast .
*/ */
......
This source diff could not be displayed because it is too large. You can view the blob instead.
This diff is collapsed.
...@@ -52,11 +52,17 @@ The references are: ...@@ -52,11 +52,17 @@ The references are:
namespace cv namespace cv
{ {
#if !(defined __i386__ || defined(_M_IX86) || defined __x86_64__ || defined(_M_X64))
int agast_tree_search(const unsigned long table_struct32[], int pixel_[], const unsigned char* const ptr, int threshold);
#endif //!(defined __i386__ || defined(_M_IX86) || defined __x86_64__ || defined(_M_X64))
void makeAgastOffsets(int pixel[16], int row_stride, int type); void makeAgastOffsets(int pixel[16], int row_stride, int type);
template<int type> template<int type>
int agast_cornerScore(const uchar* ptr, const int pixel[], int threshold); int agast_cornerScore(const uchar* ptr, const int pixel[], int threshold);
} }
#endif #endif
#endif #endif
/* Redistribution and use in source and binary forms, with or /* Redistribution and use in source and binary forms, with or
* without modification, are permitted provided that the following * without modification, are permitted provided that the following
* conditions are met: * conditions are met:
* Redistributions of source code must retain the above * Redistributions of source code must retain the above
* copyright notice, this list of conditions and the following * copyright notice, this list of conditions and the following
* disclaimer. * disclaimer.
* Redistributions in binary form must reproduce the above * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following * copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials * disclaimer in the documentation and/or other materials
* provided with the distribution. * provided with the distribution.
* The name of Contributor may not be used to endorse or * The name of Contributor may not be used to endorse or
* promote products derived from this software without * promote products derived from this software without
* specific prior written permission. * specific prior written permission.
* *
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
* CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment