مشخصات مقاله | |
انتشار | مقاله سال 2018 |
تعداد صفحات مقاله انگلیسی | 30 صفحه |
هزینه | دانلود مقاله انگلیسی رایگان میباشد. |
منتشر شده در | نشریه اسپرینگر |
نوع مقاله | ISI |
عنوان انگلیسی مقاله | Interactive mosaic building and its application to marketing strategies using NFC |
ترجمه عنوان مقاله | ساخت موزاییک عکس تعاملی و کاربرد آن در استراتژی های بازاریابی با استفاده از NFC |
فرمت مقاله انگلیسی | |
رشته های مرتبط | مدیریت، مهندسی کامپیوتر |
گرایش های مرتبط | بازاریابی، الگوریتم ها و محاسبات |
مجله | ابزارهای چندرسانه ای و برنامه های کاربردی – Multimedia Tools and Applications |
دانشگاه | University of Córdoba – Campus de Rabanales – Spain |
کلمات کلیدی | عکس موزاییک، الگوریتم تطبیق، بازاریابی، NFC |
کلمات کلیدی انگلیسی | Photo mosaic, Matching algorithm, Marketing, NFC |
شناسه دیجیتال – doi |
https://doi.org/10.1007/s11042-017-5115-x |
کد محصول | E8368 |
وضعیت ترجمه مقاله | ترجمه آماده این مقاله موجود نمیباشد. میتوانید از طریق دکمه پایین سفارش دهید. |
دانلود رایگان مقاله | دانلود رایگان مقاله انگلیسی |
سفارش ترجمه این مقاله | سفارش ترجمه این مقاله |
بخشی از متن مقاله: |
1 Introduction
The building of digital mosaics is an area of research of image treatment in which different techniques of NPR (non-photorealistic rendering) have been studied in order to improve the visualisation of large or complex images, or simply for artistic purposes [23]. From a general perspective, independent of its application, a digital mosaic is a collection of small images called tiles that, grouped together, reproduce an illustration or base image (background image) simulating a mosaic. Depending on the set of tiles and the rules or constraints placed on their assembly, it is possible to build a wide variety of types of mosaics that have captured the attention of researchers in recent years [3, 7, 8, 34, 47, 65, 72]. According to Battiato et al., [9] the building of a digital mosaic entails resolving a problem of optimisation that may be defined in the following way: “Given a rectangular region I2 in the plane R2 , a tile dataset and a set of constraints, find N sites Pi(xi, yi) in I2 and place N tiles, one at each Pi, such that all tiles are disjoint, the area they cover is maximized and the constraints are verified as much as possible”. Thus, depending on the type of constraints placed on the building process of the mosaic, many different types can be created for specific purposes of problem-solving in computer graphics (examples of different mosaic types can be observed in Fig. 1): – Ancient or Classic Mosaic: in which the constraints require tiles to be placed according to a direction vector Ψ(x, y), there is no overlapping of tiles, all of which follow the same direction and are the same colour as the space of the base image. – Puzzle Mosaic: in which the tiles are disjoint, of irregular shape, as is the space that they occupy in the base image, and their position must be that which is Bmost like^ the tile. – Photo Mosaic: in which the tiles have a regular shape, generally square or rectangular, are disjoint and their position must be that which is Bmost like^ the tile. |