| US 7,567,714 B2 | ||
| System, method and apparatus for clustering features | ||
| Marlin L. Gendron, Pass Christian, Miss. (US); Geary J. Layne, Slidell, La. (US); and Maura C. Lohrenz, Pearl River, La. (US) | ||
| Assigned to The United States of America as represented by the Secretary of the Navy, Washington, D.C. (US) | ||
| Filed on Nov. 23, 2004, as Appl. No. 10/997,091. | ||
| Claims priority of provisional application 60/585790, filed on Jul. 07, 2004. | ||
| Claims priority of provisional application 60/585789, filed on Jul. 07, 2004. | ||
| Prior Publication US 2006/0009955 A1, Jan. 12, 2006 | ||
| Int. Cl. G06K 9/62 (2006.01); G06K 9/48 (2006.01); G06K 9/40 (2006.01); G06K 9/46 (2006.01); G06K 9/66 (2006.01) | ||
| U.S. Cl. 382—225 [382/241; 382/242; 382/266; 382/190] | 43 Claims |

| 1. A computer-implemented method for identifying a boundary of a cluster in a bitmap, the bitmap having at least one initially set bit, the method comprising: applying an expansion shape to each of the initially set bits in the bitmap on a computer; identifying vertex bits on the boundary of the cluster, the cluster including at least one expansion shape on the computer; for a current boundary bit with a first, second, and a third adjacent bit, evaluating at least two diagonally opposite adjacent bits if at least two of the first, the second, and the third adjacent bits are set on the computer; wherein one of the diagonally opposite adjacent bits is between the first and second adjacent bits; and assigning the adjacent set bit that was evaluated first as the new current bit on the computer if both of the two diagonally adjacent bits are clear. |