The objective of this project is to be able to segment mahjong tiles from photos, and identify them. To find regions of interest that contain a mahjong tile, we use a series of bounding boxes, and to identify the tile in a regions of interests, we use a method involving homographies.
Because of the way our algorithm is implemented, the shadows of the tiles in the pictures augment the size of the bounding boxes around the tiles. This will cause some tiles to be accidentally merged together.
Pictures of larger tiles are not differentiated by pictures of smaller tiles. Hence, our segmentation algorithm only works for tiles of a fixed size in the picture.
It's still buggy. Distances are not symmetric; we might have the case when dist(box1, box2) > dist(box2, box1)
That being said, the smaller distance is usually correct anyways, and since we go about calculating every distance combination anyways, it doesn't affect the output of the program.
Because of the way our algorithm is implemented, the shadows of the tiles in the pictures augment the size of the bounding boxes around the tiles. This will cause some tiles to be accidentally merged together.