|
|||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||
| SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||
java.lang.Object
|
+--java.lang.Thread
|
+--HitMiss
HitMiss is an algorithm to 'hit and miss' a binary image using a 3x3 kernel.
| Fields inherited from class java.lang.Thread |
MAX_PRIORITY,
MIN_PRIORITY,
NORM_PRIORITY |
| Constructor Summary | |
HitMiss()
Default no-args constructor. |
|
| Method Summary | |
static BinaryFast |
hitmiss_image(BinaryFast b,
int[] kernel)
Takes a BinaryFast image representation and a kernel and applies the hitmiss algorithm to the image. |
static java.util.HashSet |
HitMissHashSet(BinaryFast b,
java.util.HashSet input,
int[] kernel)
Applies the hitmiss operation to a set of pixels stored in a hash table. |
static boolean |
kernelAll0s(int[] kernel)
Returns true if the 3x3 kernel consists of 9 0s. |
static boolean |
kernelAll1s(int[] kernel)
Returns true if the 3x3 kernel consists of 9 1s. |
static boolean |
kernelMatch(java.awt.Point p,
int[][] pixels,
int w,
int h,
int[] kernel)
Returns true if the 8 neighbours of p match the kernel 0 is background 1 is foreground 2 is don't care. |
static boolean |
kernelNo0s(int[] kernel)
Returns true if the 3x3 kernel has no 0s. |
static boolean |
kernelNo1s(int[] kernel)
Returns true if the 3x3 kernel has no 1s. |
| Methods inherited from class java.lang.Thread |
activeCount,
checkAccess,
countStackFrames,
currentThread,
destroy,
dumpStack,
enumerate,
getContextClassLoader,
getName,
getPriority,
getThreadGroup,
interrupt,
interrupted,
isAlive,
isDaemon,
isInterrupted,
join,
join,
join,
resume,
run,
setContextClassLoader,
setDaemon,
setName,
setPriority,
sleep,
sleep,
start,
stop,
stop,
suspend,
toString,
yield |
| Methods inherited from class java.lang.Object |
clone,
equals,
finalize,
getClass,
hashCode,
notify,
notifyAll,
wait,
wait,
wait |
| Constructor Detail |
public HitMiss()
| Method Detail |
public static boolean kernelMatch(java.awt.Point p,
int[][] pixels,
int w,
int h,
int[] kernel)
p - the point at the centre of the
9 pixel neighbourhoodpixels - the 2D array of the imagew - the width of the imageh - the height of the imagekernel - the array of the kernel values
public static java.util.HashSet HitMissHashSet(BinaryFast b,
java.util.HashSet input,
int[] kernel)
b - the BinaryFast input imageinput - the set of pixels requiring matchingkernel - the kernel to match them withpublic static boolean kernelAll1s(int[] kernel)
kernel - the array storing the 9 valuespublic static boolean kernelAll0s(int[] kernel)
kernel - the array storing the 9 valuespublic static boolean kernelNo0s(int[] kernel)
kernel - the array storing the 9 valuespublic static boolean kernelNo1s(int[] kernel)
kernel - the array storing the 9 values
public static BinaryFast hitmiss_image(BinaryFast b,
int[] kernel)
b - the image in BinaryFast representationkernel - the kernel in 1D array form
|
|||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||
| SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||