000			02111nam a2200313Ia 4500
001			77038
003			ft6141
005			20251105173422.0
008			190314n 000 0 eng d
040			_erda
041			_aengtag
050			_aQA76.9 S25 2012
082			_a.
100			_aNicole Ann B. Salaysay and Mike Lhester M. Timonera.
245		0	_aMini-Saic Algorithm: an enhancment of Tim-Ger's Photo Mosaic Algorithm
264			_a. _b. _cc2012
300			_bUndergraduate Thesis: (BSCS major in Computer Science) - Pamantasan ng Lungsod ng Maynila, 2012.
336			_b. _atext _2rdacontent
337			_30 _b. _aunmediated _2rdamedia
338			_30 _b. _avolume _2rdacarrier
347			_a0
385			_a2
505			_aABSTRACT: 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.
506			_a5
526			_aF
540			_a5
655			_a.
942			_alcc _cMS _2lcc
999			_c25401 _d25401