LearnPatternAdvancedRotationOptions
Describes how the algorithm learns during rotation-invariant matching.
Elements
| Name | Type | Description |
|---|---|---|
| searchStrategySupport | SearchStrategy | Specifies the aggressiveness of the rotation search strategy available during the matching phase. IMAQ_VERY_AGGRESSIVE is not currently supported. |
| initialStepSize | int | The largest number of image pixels to shift the sample across the inspection image during the initial phase of matching. The default values are 5 for the IMAQ_BALANCED search strategy and 3 for the IMAQ_CONSERVATIVE search strategy. If the step size is not an odd integer, the algorithm coerces it to the next smaller odd integer. Note that the IMAQ_AGGRESSIVE search strategy does not support the initialStepSize field. |
| initialSampleSize | int | Specifies the number of template pixels that you want to include in a sample for the initial phase of rotation-invariant matching. The default is 0, which allows the algorithm to compute initialSampleSize. For optimal speed, the function coerces sizes that are less than 240 to an integer multiple of 12 and coerces sizes greater than 240 to an integer multiple of 60. |
| initialSampleSizeFactor | double | Specifies the size of the sample for the initial phase of rotation-invariant matching as a percent of the template size, in pixels. The default is 0, which causes the algorithm to use initialSampleSize. If you provide values for both initialSampleSizeFactor and initialSampleSize, the algorithm uses initialSampleSize. For optimal speed, the algorithm coerces sizes that are less than 240 to an integer multiple of 12 and coerces sizes greater than 240 to an integer multiple of 60. |
| initialAngularAccuracy | int | Sets the angle accuracy, in degrees, to use during the initial phase of rotation-invariant matching. The default is 6 degrees. The algorithm coerces the angle to the largest integer smaller than initialAngularAccuracy that evenly divides 360. This option is not used in conjunction with the IMAQ_AGGRESSIVE search strategy. |
| finalSampleSize | int | Specifies the number of template pixels you want to add to initialSampleSize for the final phase of rotation-invariant matching. These additional points include edge points. The default is 0, which allows the algorithm to compute finalSampleSize. For optimal speed, the algorithm coerces sizes that are less than 240 to an integer multiple of 12 and coerces sizes greater than 240 to an integer multiple of 60. |
| finalSampleSizeFactor | double | Specifies the size of the sample for the final phase of rotation-invariant matching as a percent of the edge points in the template, in pixels. The default is 0, which causes the algorithm to use finalSampleSize. If you provide values for both finalSampleSizeFactor and finalSampleSize, the algorithm uses finalSampleSize. For optimal speed, the algorithm coerces sizes that are less than 240 to an integer multiple of 12 and coerces sizes greater than 240 to an integer multiple of 60. |
| finalAngularAccuracy | int | Sets the angle accuracy, in degrees, to use during the final phase of the rotation-invariant matching. The default is 1 degree. Use subpixel accuracy to achieve angle accuracy less than the default. This value must be no greater than the value for initialAngularAccuracy. The algorithm coerces the angle to the largest integer smaller than it that evenly divides 360. This option is not used in conjunction with the IMAQ_AGGRESSIVE search strategy. |
| subpixelSampleSize | int | Specifies the number of template pixels that you want to include in a sample for the subpixel phase of rotation-invariant matching. The default is 0, which allows the algorithm to compute subpixelSampleSize. For optimal speed, the algorithm coerces sizes that are less than 240 to an integer multiple of 12 and coerces sizes greater than 240 to an integer multiple of 60. |
| subpixelSampleSizeFactor | double | Specifies the size of the sample for the subpixel phase of rotation-invariant matching as a percent of the template size, in pixels. The default is 0, which causes the algorithm to use subpixelSampleSize. For optimal speed, the algorithm coerces sizes that are less than 240 to an integer multiple of 12 and coerces sizes greater than 240 to an integer multiple of 60. |