| Pseudocode |
| Input: |
| Color image Q |
| 1. Find indentation mark |
| Get color channels R, G, B from Q |
| Find channel A with Maximun entropy |
| Binarize A, using the proposed method |
| Fill holes and remove noise using mathematical morphology |
| Label objects |
| Select larger object |
| 2. Indentation corner detection: |
| Using local maximum radius: |
| Find corners
|
| Get Quadrature index
|
| Using indentation perimeter: |
| Find corners
|
| Get Quadrature index
|
| Using Hough transform: |
| Find corners
|
| Get Quadrature index
|
| 3. Find best indentation result: |
| if ( > && > ) { |
| Select local maximum radius solution
} |
| else if ( > && > ) { |
| Select Perimeter solution
} |
| else{ |
| Select Hough solution
} |
| 4. Calculate hardness estimation HV. |
| Output: HV |