| /external/opencv/cv/src/ |
| cvcalibinit.cpp | 104 struct CvCBCorner* neighbors[4]; // Neighbor corners member in struct:CvCBCorner
113 int count; // Number of quad neighbors
116 bool ordered; // true if corners/neighbors are ordered counter-clockwise
118 // neighbors and corners are synced, i.e., neighbor 0 shares corner 0
120 struct CvCBQuad *neighbors[4]; // Pointers of quad neighbors member in struct:CvCBQuad
366 // Find quad's neighbors
597 CvCBQuad *neighbor = q->neighbors[i];
691 { // ok, look at neighbors
707 CvCBQuad *neighbor = quads[i]->neighbors[j]
[all...] |
| cvsnakes.cpp | 82 int neighbors = win.height * win.width; local
162 Econt = (float *) cvAlloc( neighbors * sizeof( float ));
163 Ecurv = (float *) cvAlloc( neighbors * sizeof( float ));
164 Eimg = (float *) cvAlloc( neighbors * sizeof( float ));
165 E = (float *) cvAlloc( neighbors * sizeof( float ));
238 for( k = 0; k < neighbors; k++ )
276 for( k = 0; k < neighbors; k++ )
341 for( k = 0; k < neighbors; k++ )
360 /* Find Minimize point in the neighbors */
361 for( k = 0; k < neighbors; k++
[all...] |
| mycvHaarDetectObjects.cpp | [all...] |
| _cvkdtree.hpp | 301 struct bbf_nn { // info on found neighbors (approx k nearest)
381 // finds (with high probability) the k nearest neighbors of d,
383 // ret_nn_pq is an array containing the (at most) k nearest neighbors
|
| cvhaar.cpp | [all...] |
| /external/tcpdump/ |
| print-dvmrp.c | 45 #define DVMRP_PROBE 1 /* for finding neighbors */
48 /* of this router's neighbors */
59 #define DVMRP_NF_TUNNEL 0x01 /* neighbors reached via tunnel */
111 printf(" Ask-neighbors(old)");
115 printf(" Neighbors(old)");
|
| print-olsr.c | 193 /* print 4 neighbors per line */
|
| /external/opencv/ml/src/ |
| mlknearest.cpp | 44 * K-Nearest Neighbors Classifier *
47 // k Nearest Neighbors
151 float* neighbor_responses, const float** neighbors, float* dist ) const
193 nn = neighbors ? neighbors + (start + i)*k : 0;
354 "The distances from the neighbors (if present) must be floating-point matrix of <num_samples> x <k> size" );
|
| /packages/apps/Camera/jni/feature_mos/src/mosaic/ |
| MosaicTypes.h | 74 BlendRect vcrect; // brect clipped using the voronoi neighbors
|
| Blend.cpp | 808 // project point and then triangulate to neighbors
818 // scan the neighbors to see if this is a valid position
892 // project point and then triangulate to neighbors
[all...] |
| /external/libvpx/vp8/common/ |
| entropy.h | 77 are decoded, e.g., prior to the first token, a zero means that my neighbors
|
| onyxc_int.h | 173 /* keyframe block modes are predicted by their above, left neighbors */
|
| /external/jpeg/ |
| jcsample.c | 43 * eight neighbors. P's weight is 1-8*SF and each neighbor's weight is SF,
315 * eight edge-adjacent neighbors contribute SF to each of two smoothed
355 /* The edge-neighbors count twice as much as corner-neighbors */
357 /* Add in the corner-neighbors */
|
| /external/tremolo/Tremolo/ |
| floor1.c | 172 /* discover our neighbors for decode where we don't use fit flags
173 (that would push the neighbors outward) */
|
| /external/chromium/base/synchronization/ |
| condition_variable_win.cc | 241 // Stitch neighbors together.
271 // Make sure both of our neighbors have links that point back to us.
273 // do a local check to (and returning from) our immediate neighbors.
|
| /external/opencv/cv/include/ |
| cvtypes.h | 378 int neighbors; member in struct:CvAvgComp
|
| /cts/apps/CtsVerifier/lib/colorchecker/ |
| colorchecker.cpp | 420 // Find neighbors for candidate groups. O(n^2), but not many
633 // Draw lines between neighbors
|
| /packages/apps/Settings/src/com/android/settings/widget/ |
| ChartSweepView.java | 154 public void setNeighbors(ChartSweepView... neighbors) {
155 mNeighbors = neighbors;
|
| ChartDataUsageView.java | 123 // mark neighbors for checking touch events against
|
| /external/opencv/ml/include/ |
| ml.h | 274 // k Nearest Neighbors
290 const float** neighbors=0, CvMat* neighbor_responses=0, CvMat* dist=0 ) const;
305 float* neighbor_responses, const float** neighbors, float* dist ) const;
[all...] |
| /external/libvpx/examples/includes/geshi/geshi/ |
| scilab.php | 157 'nansum', 'narsimul', 'NDcost', 'ndgrid', 'ndims', 'nearfloat', 'nehari', 'neighbors', 'netclose', 'netwindow',
|
| /external/libvpx/vp8/encoder/ |
| mcomp.c | 787 MV neighbors[8] = { { -1, -1}, {0, -1}, {1, -1}, { -1, 0}, {1, 0}, { -1, 1}, {0, 1}, {1, 1} } ; local
874 // check 8 1 away neighbors
881 int nr = tr + neighbors[i].row, nc = tc + neighbors[i].col;
[all...] |
| /external/icu4c/tools/genpname/ |
| genpname.cpp | 247 // ***!!!*** we assume we are in an array and look at neighbors ***!!!***
279 // ***!!!*** we assume we are in an array and look at neighbors ***!!!***
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/ |
| reiserfs_fs.h | [all...] |
| /external/llvm/utils/TableGen/ |
| DAGISelMatcherOpt.cpp | 286 // neighbors *do* start with the same matcher, we can factor the matcher out
|
