This repository was archived by the owner on Jun 8, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathREADME.txt
More file actions
38 lines (27 loc) · 1.42 KB
/
README.txt
File metadata and controls
38 lines (27 loc) · 1.42 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
TUCS Programming Competition Idea
Given a formatted image the program should output a bounding box for each "Creeper" found in the image.
Image format:
Images are stored as plain text hex encoded RGB triples with a line for each row of pixels,
and a space between each pixel. A blank line indicates the end of the file.
For example a 3x2 red image is:
FF0000 FF0000 FF0000
FF0000 FF0000 FF0000
Output format:
The output is the min and max points of the bounding boxes around each creeper. Formatted as the integers: "x1 x2 y1 y2". One bounding box on each line.
For example, a bounding box from (1, 3) to (5, 8):
1 3 5 8
Scoring:
Scoring is based on the proximity of each bounding box point to the expected point.
The Examples:
Step 1: Compile
javac *.java
Step 2: Create a .creep formatted file from an image to give to the program
java CreepEncodeImage creeper.jpeg
Step 3: Pass the .creep formatted file to the program, it will output the bounding box
java TUCSDevCompExample2012 < creeper.jpeg.creep
Example output:
120 340 240 480
Step 4: The example program can output an image indicating where the bounding box is.
java TUCSDevCompExample2012 --output creeper.jpeg.creep.png < creeper.jpeg.creep
Step 5: The example program can output an image indicating where the input bounding box is, this example uses points (10, 12) and (40, 45).
java TUCSDevCompExample2012 --output creeper.jpeg.creep.png 10 12 40 45 < creeper.jpeg.creep