Mini-Saic Algorithm: an enhancment of Tim-Ger's Photo Mosaic Algorithm

By: Nicole Ann B. Salaysay and Mike Lhester M. Timonera
Language: English . . c2012Description: Undergraduate Thesis: (BSCS major in Computer Science) - Pamantasan ng Lungsod ng Maynila, 2012Content type: text Media type: unmediated Carrier type: volumeGenre/Form: .DDC classification: . LOC classification: QA76.9 S25 2012
Contents:
ABSTRACT: Photomosaic is a technique which transforms an input into a rectangular grid of thumbnail images preserving the overall appearance. The typical photomosaic algorithm searches from a large database of images one picture that approximates a block of pixels in the main image. These problems were seen and experienced in the Tim-Ger’s Photo Mosaic Algorithm and the application itself: (1) Traversing and allocation of best match image starts from the top left corner of the image (2) Has “unnecessary” loops within loops (3) Searching and traverses through an unsorted database with N entries. However, the proponents solved these problems by (1) Providing an option for the user where to start traversing and allocating of best match images (2) Remove, if not, limit the use of loops within loops (3) Design an index/Primary key in the database that contains the sum of the R, G, and B values for way searching of best source images to be patched in the target image. Lastly, speed of photo mosaic generation still depends on the computer’s capacity and on the images provided. The speed may vary from the specifications of the computer being used, thus, it is not within the ability of the software to speed up if the computer’s capacity is limited.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)

ABSTRACT: Photomosaic is a technique which transforms an input into a rectangular grid of thumbnail images preserving the overall appearance. The typical photomosaic algorithm searches from a large database of images one picture that approximates a block of pixels in the main image. These problems were seen and experienced in the Tim-Ger’s Photo Mosaic Algorithm and the application itself: (1) Traversing and allocation of best match image starts from the top left corner of the image (2) Has “unnecessary” loops within loops (3) Searching and traverses through an unsorted database with N entries. However, the proponents solved these problems by (1) Providing an option for the user where to start traversing and allocating of best match images (2) Remove, if not, limit the use of loops within loops (3) Design an index/Primary key in the database that contains the sum of the R, G, and B values for way searching of best source images to be patched in the target image. Lastly, speed of photo mosaic generation still depends on the computer’s capacity and on the images provided. The speed may vary from the specifications of the computer being used, thus, it is not within the ability of the software to speed up if the computer’s capacity is limited.

5

Filipiniana

5

There are no comments for this item.

to post a comment.

© Copyright 2024 Phoenix Library Management System - Pinnacle Technologies, Inc. All Rights Reserved.