Dissertations / Theses on the topic 'Social and multimedia data'
To see the other types of publications on this topic, follow the link: Social and multimedia data.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Social and multimedia data.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Wong, León Kevin, and Valdivia Diego Eduardo Antonio Rodríguez. "Distributed Social Media System - Multimedia Data Linkage." Bachelor's thesis, Universidad Peruana de Ciencias Aplicadas (UPC), 2014. http://hdl.handle.net/10757/324525.
Full textAbstract:
Actualmente, las redes sociales en línea son uno de los principales medios donde se intercambia gran cantidad de información. En estas, los usuarios intentan reflejar su actividad diaria en forma de publicaciones en sus muros o de otros usuarios. Asimismo, las imágenes representan gran parte de la información sobre la actividad del usuario, por ejemplo, una foto en donde esté etiquetado. Estas interacciones del usuario en las redes ayudan a generar su identidad digital. La información revelada por la metadata de las imágenes enriquece este perfil y contribuye a mejorar los resultados en procesos como minería de datos, marketing, etc. El objetivo de este proyecto es generar un perfil digital en base a la información y actividad que contribuye un usuario a una red social, recopilando y mostrando explícitamente varios hechos que se revelan aprovechando la metadata de las imágenes y el factor temporal de la actividad en línea. Esto incluye el proceso de extracción, enriquecimiento y encapsulación de data en un modelo ontológico propuesto. Los resultados de los experimentos muestran que la información en el perfil, luego del enriquecimiento, es aproximadamente cuatro veces la información inicial, y la precisión de la nueva información está por encima del 75%. Trabajos futuros se inclinan hacia la detección del tipo de relación que existe entre una persona y uno de sus contactos. Asimismo, otro tema relevante a explorar incluye la extracción de un mayor rango de entidades, tales como eventos o temas de interés de un individuo, con el fin de mejorar el perfil digital del usuario. Finalmente, la minería de datos en el proceso de extracción de información ayudaría a enfocar mejor el marketing a los usuarios de redes sociales ya que dicha publicidad podría hacerse más personalizada. Palabras clave Linked data, información multimedia, perfil digital, redes sociales, metadataTesis
2
Bracamonte, Nole Teresa Jacqueline. "Improving web multimedia information retrieval using social data." Tesis, Universidad de Chile, 2018. http://repositorio.uchile.cl/handle/2250/168681.
Full textAbstract:
Tesis para optar al grado de Doctora en Ciencias, Mención ComputaciónBuscar contenido multimedia es una de las tareas más comunes que los usuarios realizan en la Web. Actualmente, los motores de búsqueda en la Web han mejorado la precisión de sus búsquedas de contenido multimedia y ahora brindan una mejor experiencia de usuarios. Sin embargo, estos motores aún no logran obtener resultados precisos para consultas que no son comunes, y consultas que se refieren a conceptos abstractos. En ambos escenarios, la razón principal es la falta de información preliminar. Esta tesis se enfoca en mejorar la recuperación de información multimedia en la Web usando datos generados a partir de la interacción entre usuarios y recursos multimedia. Para eso, se propone mejorar la recuperación de información multimedia desde dos perspectivas: (1) extrayendo conceptos relevantes a los recursos multimedia, y (2) mejorando las descripciones multimedia con datos generados por el usuario. En ambos casos, proponemos sistemas que funcionan independientemente del tipo de multimedia, y del idioma de los datos de entrada. En cuanto a la identificación de conceptos relacionados a objetos multimedia, desarrollamos un sistema que va desde los resultados de búsqueda específicos de la consulta hasta los conceptos detectados para dicha consulta. Nuestro enfoque demuestra que podemos aprovechar la vista parcial de una gran colección de documentos multimedia para detectar conceptos relevantes para una consulta determinada. Además, diseñamos una evaluación basada en usuarios que demuestra que nuestro algoritmo de detección de conceptos es más sólido que otros enfoques similares basados en detección de comunidades. Para mejorar la descripción multimedia, desarrollamos un sistema que combina contenido audio-visual de documentos multimedia con información de su contexto para mejorar y generar nuevas anotaciones para los documentos multimedia. Específicamente, extraemos datos de clicks de los registros de consultas y usamos las consultas como sustitutos para las anotaciones manuales. Tras una primera inspección, demostramos que las consultas proporcionan una descripción concisa de los documentos multimedia. El objetivo principal de esta tesis es demostrar la relevancia del contexto asociado a documentos multimedia para mejorar el proceso de recuperación de documentos multimedia en la Web. Además, mostramos que los grafos proporcionan una forma natural de modelar problemas multimedia.
Fondef D09I-1185, CONICYT-PCHA/Doctorado Nacional/2013-63130260, Apoyo a estadías corta de la Escuela de Postgrado de la U. de Chile, y el Núcleo Milenio CIWS
3
Li, John Zhong. "Modeling and querying multimedia data." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp02/NQ29063.pdf.
Full text
4
Amornraksa, Thumrongrat. "Data security for multimedia communications." Thesis, University of Surrey, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.298091.
Full text
5
Portnoy, Michael, and Hsueh-Szu Yang. "NETWORK DATA ACQUISITION AND PLAYBACK OF MULTIMEDIA DATA." International Foundation for Telemetering, 2006. http://hdl.handle.net/10150/604246.
Full textAbstract:
ITC/USA 2006 Conference Proceedings / The Forty-Second Annual International Telemetering Conference and Technical Exhibition / October 23-26, 2006 / Town and Country Resort & Convention Center, San Diego, CaliforniaTraditional data acquisition systems have relied on physical connections between data sources and data receivers to handle the routing of acquired data streams. However, these systems grow exponentially in complexity as the number of data sources and receivers increases. New techniques are needed to address the ever increasing complexity of data acquisition. Furthermore, more advanced mechanisms are needed that move past the limitations of traditional data models that connect each data source to exactly one data receiver. This paper presents a software framework for the playback of multiplexed data acquired from a network acquisition system. This framework uses multicast technologies to connect data sources with multiple data receivers. The network acquisition system is briefly introduced before the software framework is discussed. Both the challenges and advantages involved with creating such a system are presented. Finally, this framework is applied to an aviation telemetry example.
6
CARABALLO, ALEXANDER ARTURO MERA. "PUBLISHING ANNOTATED MULTIMEDIA DEEP WEB DATA." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2012. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=23714@1.
Full textAbstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIROCOORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
PROGRAMA DE EXCELENCIA ACADEMICA
Nos últimos anos, temos assistido um enorme crescimento de dados multimídia na Web. Novas tecnologias de menor custo e maior largura de banda têm permitido que a Web evolua para um formato multimídia. No entanto, a falta de ferramentas que podem tornar o formato multimídia disponível na Web nos levou a um conjunto de dados não-pesquisável e não indexável da Web, também conhecido como Deep Web. Desta forma, esta dissertação aborda o problema de como publicar conteúdo de áudio e vídeo na Web. Apresentamos uma ferramenta e uma nova abordagem que facilita a indexação e recuperação dos objetos com a ajuda das maquinas de busca tradicionais. A ferramenta gera automaticamente páginas Web estáticas que descrevem o conteúdo dos objetos e organizar esse conteúdo para facilitar a localização de segmentos do áudio ou vídeo que correspondem às descrições. As páginas Web estáticas podem ser traduzidos para outras línguas para atingir outras populações de usuários. Um processo de anotação também é realizado para incorporar dados legíveis pelas máquinas nas páginas Web. A dissertação também apresenta um experimento completo, publicando objetos de aprendizagem baseados em áudio e vídeo para avaliar a eficácia da abordagem.
In recent years, we witnessed a huge growth of multimedia data on the Web. New lower-cost technologies and greater bandwidth allowed the Web to evolve into a multimedia format. However, the lack of tools that can make multimedia format easily accessible on the Web led us to a non-searchable and non-indexable data of the Web, also known as Deep Web. In line with these observations, this dissertation addresses the problem of how to publish audio and video content on the Web. We present a tool and a novel approach that facilitates the indexing and retrieval of the objects with the help of traditional search engines. The tool automatically generates static Web pages that describe the content of the objects and organize this content to facilitate locating segments of the audio or video which correspond to the descriptions. The static Web pages can be translated to others languages to reach other user populations. An annotation process is also performed to embed machine-readable data into the Web pages. The dissertation also presents an in-depth experiment, publishing learning objects based on audio and video, to assess the efficacy of the technique.
7
Klaghstan, Merza. "Multimedia data dissemination in opportunistic systems." Thesis, Lyon, 2016. http://www.theses.fr/2016LYSEI125/document.
Full textAbstract:
Les réseaux opportunistes sont des réseaux mobiles qui se forment spontanément et de manière dynamique grâce à un ensemble d'utilisateurs itinérants dont le nombre et le déplacement ne sont pas prévisibles. En conséquence, la topologie et la densité de tels réseaux évoluent sans cesse. La diffusion de bout-en-bout d'informations, dans ce contexte, est incertaine du fait de la forte instabilité des liens réseaux point à point entre les utilisateurs. Les travaux qui en ont envisagé l'usage visent pour la plupart des applications impliquant l'envoi de message de petite taille. Cependant, la transmission de données volumineuses telles que les vidéos représente une alternative très pertinente aux réseaux d'infrastructure, en cas d'absence de réseau, de coût important ou pour éviter la censure d'un contenu. La diffusion des informations de grande taille en général et de vidéos en particulier dans des réseaux oppnets constitue un challenge important. En effet, permettre, dans un contexte réseau très incertain et instable, au destinataire d’une vidéo de prendre connaissance au plus vite du contenu de celle-ci, avec la meilleure qualité de lecture possible et en encombrant le moins possible le réseau reste un problème encore très largement ouvert. Dans cette thèse, nous proposons un nouveau mécanisme de diffusion de vidéos dans un réseau opportuniste de faible densité, visant à améliorer le temps d'acheminement de la vidéo tout en réduisant le délai de lecture à destination. La solution proposée se base sur le choix d'encoder la vidéo en utilisant l'encodage SVC, grâce auquel la vidéo se décline en un ensemble de couches interdépendantes (layers), chacune améliorant la précédente soit en terme de résolution, soit en terme de densité, soit en terme de perception visuelle. Notre solution se décline en trois contributions. La première consiste à proposer une adaptation du mécanisme de diffusion Spray-and-Wait, avec comme unités de diffusion, les couches produites par SVC. Les couches sont ainsi diffusées avec un niveau de redondance propre à chacune, adapté à leur degré d'importance dans la diffusion de la vidéo. Notre seconde contribution consiste à améliorer le mécanisme précédent en prenant en compte une granularité plus fine et adaptative en fonction de l'évolution de la topologie du réseau. Cette amélioration a la particularité de ne pas engendrer de coût de partitionnement, les couches vidéos dans l'encodage SVC étant naturellement déclinées en petites unités (NALU) à base desquelles l'unité de transfert sera calculée. Enfin, la troisième contribution de cette thèse consiste à proposer un mécanisme hybride de complétion des couches vidéos arrivées incomplètes à destination. Cette méthode se caractérise par le fait d'être initiée par le destinataire. Elle combine un protocole de demande des parties manquantes aux usagers proches dans le réseau et des techniques de complétion de vidéo à base d’opérations sur les frames constituant la vidéoOpportunistic networks are human-centric mobile ad-hoc networks, in which neither the topology nor the participating nodes are known in advance. Routing is dynamically planned following the store-carry-and-forward paradigm, which takes advantage of people mobility. This widens the range of communication and supports indirect end-to-end data delivery. But due to individuals’ mobility, OppNets are characterized by frequent communication disruptions and uncertain data delivery. Hence, these networks are mostly used for exchanging small messages like disaster alarms or traffic notifications. Other scenarios that require the exchange of larger data are still challenging due to the characteristics of this kind of networks. However, there are still multimedia sharing scenarios where a user might need switching to an ad-hoc alternative. Examples are the cases of 1) absence of infrastructural networks in far rural areas, 2) high costs due limited data volumes or 3) undesirable censorship by third parties while exchanging sensitive content. Consequently, we target in this thesis a video dissemination scheme in OppNets. For the video delivery problem in the sparse opportunistic networks, we propose a solution that encloses three contributions. The first one is given by granulating the videos at the source node into smaller parts, and associating them with unequal redundancy degrees. This is technically based on using the Scalable Video Coding (SVC), which encodes a video into several layers of unequal importance for viewing the content at different quality levels. Layers are routed using the Spray-and-Wait routing protocol, with different redundancy factors for the different layers depending on their importance degree. In this context as well, a video viewing QoE metric is proposed, which takes the values of the perceived video quality, delivery delay and network overhead into consideration, and on a scalable basis. Second, we take advantage of the small units of the Network Abstraction Layer (NAL), which compose SVC layers. NAL units are packetized together under specific size constraints to optimize granularity. Packets sizes are tuned in an adaptive way, with regard to the dynamic network conditions. Each node is enabled to record a history of environmental information regarding the contacts and forwarding opportunities, and use this history to predict future opportunities and optimize the sizes accordingly. Lastly, the receiver node is pushed into action by reacting to missing data parts in a composite backward loss concealment mechanism. So, the receiver asks first for the missing data from other nodes in the network in the form of request-response. Then, since the transmission is concerned with video content, video frame loss error concealment techniques are also exploited at the receiver side. Consequently, we propose to combine the two techniques in the loss concealment mechanism, which is enabled then to react to missing data parts
8
Lin, Lin. "Multimedia Data Mining and Retrieval for Multimedia Databases Using Associations and Correlations." Scholarly Repository, 2010. http://scholarlyrepository.miami.edu/oa_dissertations/434.
Full textAbstract:
With the explosion in the complexity and amount of pervasive multimedia data, there are high demands of multimedia services and applications in various areas for people to easily access and distribute multimedia data. Facing with abundance multimedia resources but inefficient and rather old-fashioned keyword-based information retrieval approaches, a content-based multimedia information retrieval (CBMIR) system is required to (i) reduce the dimension space for storage saving and computation reduction; (ii) advance multimedia learning methods to accurately identify target semantics for bridging the semantics between low-level/mid-level features and high-level semantics; and (iii) effectively search media content for dynamical media delivery and enable the extensive applications to be media-type driven. This research mainly focuses on multimedia data mining and retrieval system for multimedia databases by addressing some main challenges, such as data imbalance, data quality, semantic gap, user subjectivity and searching issues. Therefore, a novel CBMIR system is proposed in this dissertation. The proposed system utilizes both association rule mining (ARM) technique and multiple correspondence analysis (MCA) technique by taking into account both pattern discovery and statistical analysis. First, media content is represented by the global and local low-level and mid-level features and stored in the multimedia database. Second, a data filtering component is proposed in the system to improve the data quality and reduce the data imbalance. To be specific, the proposed filtering step is able to vertically select features and horizontally prune instances in multimedia databases. Third, a new learning and classification method mining weighted association rules is proposed in the retrieval system. The MCA-based correlation is used to generate and select the weighted N-feature-value pair rules, where the N varies from one to many. Forth, a ranking method independent of classifiers is proposed in the system to sort the retrieved results and put the most interesting ones on the top of the browsing list. Finally, a user interface is implemented in CBMIR system that allows the user to choose his/her interested concept, searches media based on the target concept, ranks the retrieved segments using the proposed ranking algorithm, and then displays the top-ranked segments to the user. The system is experimented with various high-level semantics from TRECVID benchmark data sets. TRECVID sound and vision data is a large data set, includes various types of videos, and has very rich semantics. Overall, the proposed system achieves promising results in comparison with the other well-known methods. Moreover, experiments that compare each component with some other famous algorithms are conducted. The experimental results show that all proposed components improve the functionalities of the CBMIR system, and the proposed system reaches effectiveness, robustness and efficiency for a high-dimensional multimedia database.
9
Gibbons, Paul C. "Telecommunications services for multimedia data exchange support." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1993. http://handle.dtic.mil/100.2/ADA271704.
Full text
10
Fu, Haohuan. "Efficient multimedia data transmission over heterogeneous networks /." access full-text access abstract and table of contents, 2005. http://libweb.cityu.edu.hk/cgi-bin/ezdb/thesis.pl?mphil-cs-b19887218a.pdf.
Full textAbstract:
Thesis (M. Phil.)--City University of Hong Kong, 2005."Submitted to Department of Computer Science in partial fulfillment of the requirements for the degree of Master of Philosophy." Includes bibliographical references (leaves 105-108).
11
Wu, Min. "Multimedia data transmission for mobile wireless applications." Diss., Columbia, Mo. : University of Missouri-Columbia, 2005. http://hdl.handle.net/10355/4132.
Full textAbstract:
Thesis (Ph. D.)--University of Missouri-Columbia, 2005.The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file viewed on (November 14, 2006) Vita. Includes bibliographical references.
12
Abdulaziz, Nidhal Kadhim 1958. "Digital watermarking and data hiding in multimedia." Monash University, Dept. of Electrical and Computer Systems Engineering, 2001. http://arrow.monash.edu.au/hdl/1959.1/8047.
Full text
13
Banks, Mitchakima D. "Maintaining Multimedia Data in a Geospatial Database." Thesis, Monterey, California. Naval Postgraduate School, 2012. http://hdl.handle.net/10945/17318.
Full textAbstract:
Approved for public release; distribution is unlimitedThe maintenance and organization of data in any profession, government or commercial, is becoming increasingly more challenging. Adding components, whether those components are two- or three dimensional, further increases the complexity of databases. It is harder to determine which database software to choose to meet the needs of the organization. This thesis evaluates the performance of two databases as spatial functions are executed on columns containing spatial data using benchmark testing. Evaluating the performance of spatial databases makes it possible to identify performance issues with spatial queries. The process of conducting a performance evaluation of multiple databases, in this thesis, focuses on the measurement of each elapsed time within each database. The work already implemented in evaluating the performance of spatial databases did not explore a databases performance as it returned large and small result sets. The overhead of returning large or small result sets was not considered. Therefore, a custom test was developed to engage the aspects of prior work found beneficial. Using a database the researchers built with well over one million records, the elapsed time in adding records was measured. The elapsed time of the spatial functions queries was measured next. The results showed areas where each database excelled given multiple conditions. A different look at PostgreSQL and MySQL as spatial databases was offered. Given their results, as each database produced result sets from zero to 100,000, it was learned that the performance of each database could differ depending on the volume of information it is expected to return.
14
Cho, Hansang. "Classification of functional brain data for multimedia retrieval /." Thesis, Connect to this title online; UW restricted, 2005. http://hdl.handle.net/1773/5892.
Full text
15
Itakura, Fumitada, Kazuya Takeda, Shigeki Matsubara, and Nobuo Kawaguchi. "Multimedia Data Collection of In-Car Speech Communication." ISCA(International Speech Communication Association), 2001. http://hdl.handle.net/2237/15451.
Full text
16
Birkes, Angela Yvette. "Multimedia data definition and requirements for construction applications." Diss., Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/20930.
Full text
17
Zarimpas, Vasileios. "Multimedia data transmission over multiple wireless communication channels." Thesis, Lancaster University, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.497216.
Full textAbstract:
Modern mobile applications demand a communications network that is universally accessible at any time and able to adapt to the application needs. Meeting these requirements can present a considerable challenge. In order to access information ubiquitously, hardware manufacturers started to integrate many network access technologies in single small, light and low-power portable device. The main objective of this thesis is to exploit the availability of multiple wired and wireless communication channels for multimedia data transmission and location based services.
18
尹翰卿 and Hon-hing Wan. "Efficient real-time scheduling for multimedia data transmission." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B31227910.
Full text
19
TRYTI, JO, and JOHAN CARLSSON. "Similarity search in multimedia databases : Performance evaluation for similarity calculations in multimedia databases." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-157527.
Full text
20
Nadeem, Ashraf Muhammad. "Forensic Multimedia File Carving." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-119998.
Full textAbstract:
Distribution of video contents over the Internet has increased drastically over the past few years. With technological advancements and emergence of social media services, video content sharing has grown exponentially. An increased number of cyber crimes today belong to possession or distribution of illegal video contents over the Internet. Therefore, it is crucial for forensic examiners to have the capability of recovering and analyzing illegal video contents from seized storage devices. File carving is an advanced forensic technique used to recover deleted contents from a storage device even when there is no file system present. After recovering a deleted video file, its contents have to be analyzed manually in order to classify them. This is not only very stressful but also takes a large amount of time. In this thesis we propose a carving approach for streaming multimedia formats that allows forensic examiners to recover individual frames of a video file as images. The contents of these images then can be classified using existing techniques for forensic analysis of image sets. A carving tool based on this approach is developed for MPEG-1 video files. A number of experiments are conducted to evaluate performance of the tool. For each experiment an MPEG-1 file with different encoding parameters is used. Moreover, each experiment contains 18 runs and with each run chunk size of the input MPEG-1 file is varied in order to create different amount of disk fragmentation For video only MPEG-1 files, 87.802 % frames are fully recovered when the chunk size is equal to 124 KB. Where as in the case of MPEG-1 files containing both audio and video data 90.55 % frames are fully recovered when the chunk size is 132 KB.
21
Mane, Pravin D. "WAIT, selective loss recovery for multimedia multicast." Link to electronic version, 2000. http://www.wpi.edu/Pubs/ETD/Available/etd-0731100-160650/.
Full text
22
Littlejohn, Paul Stephen. "Adaptive flow management of multimedia data with a variable quality of service." Thesis, Rhodes University, 1999. http://hdl.handle.net/10962/d1004863.
Full textAbstract:
Much of the current research involving the delivery of multimedia data focuses on the need to maintain a constant Quality of Service (QoS) throughout the lifetime of the connection. Delivery of a constant QoS requires that a guaranteed bandwidth is available for the entire connection. Techniques, such as resource reservation, are able to provide for this. These approaches work well across networks that are fairly homogeneous, and which have sufficient resources to sustain the guarantees, but are not currently viable over either heterogeneous or unreliable networks. To cater for the great number of networks (including the Internet) which do not conform to the ideal conditions required by constant Quality of Service mechanisms, this thesis proposes a different approach, that of dynamically adjusting the QoS in response to changing network conditions. Instead of optimizing the Quality of Service, the approach used in this thesis seeks to ensure the delivery of the information, at the best possible quality, as determined by the carrying ability of the poorest segment in the network link. To illustrate and examine this model, a service-adaptive system is described, which allows for the streaming of multimedia audio data across a network using the RealTime Transport Protocol. This application continually adjusts its service requests in response to the current network conditions. A client/server model is outlined whereby the server attempts to provide scalable media content, in this case audio data, to a client at the highest possible Quality of Service. The thesis presents and evaluates a number of renegotiation methods for adjusting the Quality of Service between the client and server. An A djusted QoS renegotiation method algorithm is suggested, which delivers the best possible quality, within an acceptable loss boundary.
23
Vila, Duran Marius. "Information theory techniques for multimedia data classification and retrieval." Doctoral thesis, Universitat de Girona, 2015. http://hdl.handle.net/10803/302664.
Full textAbstract:
We are in the information age where most data is stored in digital format. Thus, the management of digital documents and videos requires the development of efficient techniques for automatic analysis. Among them, capturing the similarity or dissimilarity between different document images or video frames are extremely important.
In this thesis, we first analyze for several image resolutions the behavior of three different families of image-based similarity measures applied to invoice classification. In these three set of measures, the computation of the similarity between two images is based, respectively, on intensity differences, mutual information, and normalized compression distance. As the best results are obtained with mutual information-based measures, we proceed to investigate the application of three different Tsallis-based generalizations of mutual information for different entropic indexes. These three generalizations derive respectively from the Kullback-Leibler distance, the difference between entropy and conditional entropy, and the Jensen-Shannon divergence.
In relation to digital video processing, we propose two different information-theoretic approaches based, respectively, on Tsallis mutual information and Jensen-Tsallis divergence to detect the abrupt shot boundaries of a video sequence and to select the most representative keyframe of each shot.
Finally, Shannon entropy has been commonly used to quantify the image informativeness. The main drawback of this measure is that it does not take into account the spatial distribution of pixels. In this thesis, we analyze four information-theoretic measures that overcome this limitation. Three of them (entropy rate, excess entropy, and erasure entropy) consider the image as a stationary stochastic process, while the fourth (partitional information) is based on an information channel between image regions and histogram binsEns trobem a l’era de la informació on la majoria de les dades s’emmagatzemen en format digital. Per tant, la gestió de documents i vídeos digitals requereix el desenvolupament de tècniques eficients per a l’anàlisi automàtic. Entre elles, la captura de la similitud o dissimilitud entre diferents imatges de documents o fotogrames de vídeo és extremadament important. En aquesta tesi, analitzem, a diverses resolucions d’imatge, el comportament de tres famílies diferents de mesures basades en similitud d’imatges i aplicades a la classificació de factures. En aquests tres conjunt de mesures, el càlcul de la similitud entre dues imatges es basa, respectivament, en les diferències d’intensitat, en la informació mútua, i en la distància de compressió normalitzada. Degut a que els millors resultats s’obtenen amb les mesures basades en la informació mútua, es procedeix a investigar l’aplicació de tres generalitzacions de la informació mútua basades en Tsallis en diferents índexs entròpics. Aquestes tres generalitzacions es deriven respectivament de la distància de Kullback-Leibler, la diferència entre l’entropia i entropia condicional, i la divergència de Jensen-Shannon. En relació al processament de vídeo digital, proposem dos enfocaments diferents de teoria de la informació basats respectivament en la informació mútua de Tsallis i en la divergència de Jensen-Tsallis, per detectar els límits d’un pla cinematogràfic en una seqüència de vídeo i per seleccionar el fotograma clau més representatiu de cada pla. Finalment, l’entropia de Shannon s’ha utilitzat habitualment per quantificar la informativitat d’una imatge. El principal inconvenient d’aquesta mesura és que no té en compte la distribució espacial dels píxels. En aquesta tesi, s’analitzen quatre mesures de teoria de la informació que superen aquesta limitació. Tres d’elles (entropy rate, excess entropy i erasure entropy) consideren la imatge com un procés estocàstic estacionari, mentre que la quarta (partitional information) es basa en un canal d’informació entre les regions d’una imatge i els intervals de l’histograma
24
Sezer, Osman Gokhan. "Data-driven transform optimization for next generation multimedia applications." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42765.
Full textAbstract:
The objective of this thesis is to formulate a generic dictionary learning method with the guiding principle that states: Efficient representations lead to efficient estimations. The fundamental idea behind using transforms or dictionaries for signal representation is to exploit the regularity within data samples such that the redundancy of the representation is minimized subject to a level of fidelity. This observation translates to rate-distortion cost in compression literature, where a transform that has the lowest rate-distortion cost provides a more efficient representation than the others.
In our work, rather than using as an analysis tool, the rate-distortion cost is utilized to improve the efficiency of transforms. For this, an iterative optimization method is proposed, which seeks an orthonormal transform that reduces the expected value of rate-distortion cost of an ensemble of data. Due to the generic nature of the new optimization method, one can design a set of orthonormal transforms either in the original signal domain or on the top of a transform-domain representation. To test this claim, several image codecs are designed, which use block-, lapped- and wavelet-transform structures. Significant increases in compression performances are observed compared to original methods. An extension of the proposed optimization method for video coding gave us state-of-the-art compression results with separable transforms. Also using the robust statistics, an explanation to the superiority of new design over other learning-based methods such as Karhunen-Loeve transform is provided. Finally, the new optimization method and the minimization of the "oracle" risk of diagonal estimators in signal estimation is shown to be equal. With the design of new diagonal estimators and the risk-minimization-based adaptation, a new image denoising algorithm is proposed. While these diagonal estimators denoise local image patches, by formulation the optimal fusion of overlapping local denoised estimates, the new denoising algorithm is scaled to operate on large images. In our experiments, the state-of-the-art results for transform-domain denoising are achieved.
25
Tsui, Carleton 1970. "Multimedia data integration and retrieval in planning support systems." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/70303.
Full text
26
Damoni, Arben. "Multimodal segmentation for data mining applications in multimedia engineering." Thesis, London South Bank University, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.631732.
Full textAbstract:
This project describes a novel approach to the development of a multimodal video segmentation system for the analysis of multimedia data. The current practices of multimedia data analysis rely either solely on one of the video and audio components or on the presence of both together. The proposed approach makes use of both the video and audio inputs in parallel, complementing each other during the video processing stage, towards optimising both the accuracy and speed of the method. Unlike in the other commonly established methods, the video analysis here is carried out using both the luminance and the chrominance values of the colour images, instead of relying on either of them. The approach considered in the proposed method of video cut detection primarily uses a modified luminance based histogram analysis algorithm, supported by the additional sub-sampling and median filtering options. They improve the efficiency of the method through enhancing its speed and the accuracy of detection respectively. The algorithm mentioned above uses a progressively varying threshold for indicating a significant variation in the measurement of successive histograms for a window length of 2 image frames. The method worked successfully for the videos with varying rates and sizes of the frames that have been under investigation. Because of the degrading effect of chrominance histogram analysis on the processing speed its use is kept to a minimum. This is restricted only to verify the existence of possible cuts, failed to be identified by the luminance analysis. The indication of such cuts could be obtained through audio classification analysis.
27
Coimbra, Danilo Barbosa. "Multidimensional projections for the visual exploration of multimedia data." Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-11112016-184130/.
Full textAbstract:
The continuously advent of new technologies have made a rich and growing type of information sources available to analyses and investigation. In this context, multidimensional data analysis is considerably important when dealing with such large and complex datasets. Among the possibilities when analyzing such kind of data, applying visualization techniques can help the user find and understand patters, trends and establish new goals. Some applications examples of visualization of multidimensional data analysis goes from image classification, semantic word clouds, cluster analysis of document collection to exploration of multimedia content. This thesis presents several visualization methods to interactively explore multidimensional datasets aimed from specialized to casual users, by making use of both static and dynamic representations created by multidimensional projections. Firstly, we present a multidimen- sional projection technique which faithfully preserves distance and can handle any type of high-dimensional data, demonstrating applications scenarios in both multimedia and text docu- ments collections. Next, we address the task of interpreting projections in 2D, by calculating neighborhood errors. Hereafter, we present a set of interactive visualizations that aim to help users with these tasks by revealing the quality of a projection in 3D, applied in different high dimensional scenarios. In the final part, we address two different approaches to get insight into multimedia data, in special soccer sport videos. While the first make use of multidimensional projections, the second uses efficient visual metaphor to help non-specialist users in browsing and getting insights in soccer matches.O advento contínuo de novas tecnologias tem criado um tipo rico e crescente de fontes de informação disponíveis para análise e investigação. Neste contexto, a análise de dados multidi- mensional é consideravelmente importante quando se lida com grandes e complexos conjuntos de dados. Dentre as possibilidades ao analisar esses tipos de dados, a aplicação de técnicas de visualização pode auxiliar o usuário a encontrar e entender os padrões, tendências e estabelecer novas metas. Alguns exemplos de aplicações de visualização de análise de dados multidimen- sionais vão de classificação de imagens, nuvens semântica de palavras, e análise de grupos de coleção de documentos, à exploração de conteúdo multimídia. Esta tese apresenta vários métodos de visualização para explorar de forma interativa conjuntos de dados multidimensionais que visam de usuários especializados aos casuais, fazendo uso de ambas representações estáticas e dinâmicas criadas por projeções multidimensionais. Primeiramente, apresentamos uma técnica de projeção multidimensional que preserva fielmente distância e que pode lidar com qualquer tipo de dados com alta-dimensionalidade, demonstrando cenários de aplicações em ambos os casos de multimídia e coleções de documentos de texto. Em seguida, abordamos a tarefa de interpretar as projeções em 2D, calculando erros de vizinhança. Posteriormente, apresentamos um conjunto de visualizações interativas que visam ajudar os usuários com essas tarefas, revelando a qualidade de uma projeção em 3D, aplicadas em diferentes cenários de alta dimensionalidade. Na parte final, discutimos duas abordagens diferentes para obter percepções sobre dados multimídia, em particular vídeos de futebol. Enquanto a primeira abordagem utiliza projeções multidimensionais, a segunda faz uso de uma eficiente metáfora visual para auxiliar usuários não especialistas em navegar e obter conhecimento em partidas de futebol.
28
Chan, Wing Sze. "Semantic search of multimedia data objects through collaborative intelligence." HKBU Institutional Repository, 2010. http://repository.hkbu.edu.hk/etd_ra/1171.
Full text
29
Vilsmaier, Christian. "Contextualized access to distributed and heterogeneous multimedia data sources." Thesis, Lyon, INSA, 2014. http://www.theses.fr/2014ISAL0094/document.
Full textAbstract:
Rendre les données multimédias disponibles en ligne devient moins cher et plus pratique sur une base quotidienne, par exemple par les utilisateurs eux-mêmes. Des phénomènes du Web comme Facebook, Twitter et Flickr bénéficient de cette évolution. Ces phénomènes et leur acceptation accrue conduisent à une multiplication du nombre d’images disponibles en ligne. La taille cumulée de ces images souvent publiques et donc consultables, est de l’ordre de plusieurs zettaoctets. L’exécution d’une requête de similarité sur de tels volumes est un défi que la communauté scientifique commence à cibler. Une approche envisagée pour faire face à ce problème propose d’utiliser un système distribué et hétérogène de recherche d’images basé sur leur contenu (CBIRs). De nombreux problèmes émergent d’un tel scénario. Un exemple est l’utilisation de formats de métadonnées distincts pour décrire le contenu des images; un autre exemple est l’information technique et structurelle inégale. Les métriques individuelles qui sont utilisées par les CBIRs pour calculer la similarité entre les images constituent un autre exemple. Le calcul de bons résultats dans ce contexte s’avère ainsi une tàche très laborieuse qui n’est pas encore scientifiquement résolue. Le problème principalement abordé dans cette thèse est la recherche de photos de CBIRs similaires à une image donnée comme réponse à une requête multimédia distribuée. La contribution principale de cette thèse est la construction d’un réseau de CBIRs sensible à la sémantique des contenus (CBIRn). Ce CBIRn sémantique est capable de collecter et fusionner les résultats issus de sources externes spécialisées. Afin d’être en mesure d’intégrer de telles sources extérieures, prêtes à rejoindre le réseau, mais pas à divulguer leur configuration, un algorithme a été développé capable d’estimer la configuration d’un CBIRS. En classant les CBIRs et en analysant les requêtes entrantes, les requêtes d’image sont exclusivement transmises aux CBIRs les plus appropriés. De cette fac ̧on, les images sans intérêt pour l’utilisateur peuvent être omises à l’avance. Les images retournées cells sont considérées comme similaires par rapport à l’image donnée pour la requête. La faisabilité de l’approche et l’amélioration obtenue par le processus de recherche sont démontrées par un développement prototypique et son évaluation utilisant des images d’ImageNet. Le nombre d’images pertinentes renvoyées par l’approche de cette thèse en réponse à une requête image est supérieur d’un facteur 4.75 par rapport au résultat obtenu par un réseau de CBIRs predéfiniMaking multimedia data available online becomes less expensive and more convenient on a daily basis. This development promotes web phenomenons such as Facebook, Twitter, and Flickr. These phenomena and their increased acceptance in society in turn leads to a multiplication of the amount of available images online. This vast amount of, frequently public and therefore searchable, images already exceeds the zettabyte bound. Executing a similarity search on the magnitude of images that are publicly available and receiving a top quality result is a challenge that the scientific community has recently attempted to rise to. One approach to cope with this problem assumes the use of distributed heterogeneous Content Based Image Retrieval system (CBIRs). Following from this anticipation, the problems that emerge from a distributed query scenario must be dealt with. For example the involved CBIRs’ usage of distinct metadata formats for describing their content, as well as their unequal technical and structural information. An addition issue is the individual metrics that are used by the CBIRs to calculate the similarity between pictures, as well as their specific way of being combined. Overall, receiving good results in this environment is a very labor intensive task which has been scientifically but not yet comprehensively explored. The problem primarily addressed in this work is the collection of pictures from CBIRs, that are similar to a given picture, as a response to a distributed multimedia query. The main contribution of this thesis is the construction of a network of Content Based Image Retrieval systems that are able to extract and exploit the information about an input image’s semantic concept. This so called semantic CBIRn is mainly composed of CBIRs that are configured by the semantic CBIRn itself. Complementarily, there is a possibility that allows the integration of specialized external sources. The semantic CBIRn is able to collect and merge results of all of these attached CBIRs. In order to be able to integrate external sources that are willing to join the network, but are not willing to disclose their configuration, an algorithm was developed that approximates these configurations. By categorizing existing as well as external CBIRs and analyzing incoming queries, image queries are exclusively forwarded to the most suitable CBIRs. In this way, images that are not of any use for the user can be omitted beforehand. The hereafter returned images are rendered comparable in order to be able to merge them to one single result list of images, that are similar to the input image. The feasibility of the approach and the hereby obtained improvement of the search process is demonstrated by a prototypical implementation. Using this prototypical implementation an augmentation of the number of returned images that are of the same semantic concept as the input images is achieved by a factor of 4.75 with respect to a predefined non-semantic CBIRn
30
Magnusson, Åsa, and Ricarda Ödbratt. "Multimedia i förskolan." Thesis, Malmö högskola, Lärarutbildningen (LUT), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-35704.
Full textAbstract:
AbstractÖdbratt, Ricarda & Magnusson, Åsa (2013). Multimedia i förskolan Möjlighet eller utmaning. Malmö: Lärarutbildningen Malmö HögskolaSyftet med denna undersökning är att belysa multimedias roll som pedagogisk redskap i förskolans verksamhet. Vår erfarenhet säger att vissa pedagoger blir stressade av att använda multimedia i verksamheten. De säger ofta att utbildningen på multimediatekniken är minimal, samt att multimedia, ska får för stort utrymme i verksamheten och att andra aktiviteter då blir åtsidosatta.Trots att EU redan 2007 manar att utrusta sina medborgare i tidig ålder med digitalkompetens, så har det inte hänt mycket på den fronten. Vår undersökning bekräftar att det fortfarande finns en oro bland pedagoger att lämna pedagogstyrd verksamhet till förmån för multimediaanvändning. Vi belyser även att pedagogernas förhållningsätt till den interaktiva miljön har stor betydelse för multimediaanvändandet.Vi utgår bland annat från forskarna Ljung-Djärf och Hildèn som lyfter utbildningsproblemet för pedagogerna, som en viktig kompetens för multimediaanvändningen.
31
Guo, Liwei. "Restoration and modeling for multimedia compression /." View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?ECED%202008%20GUOL.
Full text
32
Handel, Peter. "Multimedia delivery in a wireless environment." [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE0000542.
Full text
33
Collins, Michael Christopher. "Multimedia data capture with multicast dissemination for online distance learning." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2001. http://handle.dtic.mil/100.2/ADA401308.
Full textAbstract:
Thesis (M.S. in Modeling, Virtual Environments and Simulation (MOVES)--Naval Postgraduate School, December 2001.Thesis Advisor(s): Brutzman, Don. "December 2001." Includes bibliographical references (p. 175-177). Also available in print.
34
Chen, Min. "Knowledge assisted data management and retrieval in multimedia database sistems." FIU Digital Commons, 2007. http://digitalcommons.fiu.edu/etd/2139.
Full textAbstract:
With the proliferation of multimedia data and ever-growing requests for multimedia applications, there is an increasing need for efficient and effective indexing, storage and retrieval of multimedia data, such as graphics, images, animation, video, audio and text. Due to the special characteristics of the multimedia data, the Multimedia Database management Systems (MMDBMSs) have emerged and attracted great research attention in recent years. Though much research effort has been devoted to this area, it is still far from maturity and there exist many open issues. In this dissertation, with the focus of addressing three of the essential challenges in developing the MMDBMS, namely, semantic gap, perception subjectivity and data organization, a systematic and integrated framework is proposed with video database and image database serving as the testbed. In particular, the framework addresses these challenges separately yet coherently from three main aspects of a MMDBMS: multimedia data representation, indexing and retrieval. In terms of multimedia data representation, the key to address the semantic gap issue is to intelligently and automatically model the mid-level representation and/or semi-semantic descriptors besides the extraction of the low-level media features. The data organization challenge is mainly addressed by the aspect of media indexing where various levels of indexing are required to support the diverse query requirements. In particular, the focus of this study is to facilitate the high-level video indexing by proposing a multimodal event mining framework associated with temporal knowledge discovery approaches. With respect to the perception subjectivity issue, advanced techniques are proposed to support users’ interaction and to effectively model users’ perception from the feedback at both the image-level and object-level.
35
Wang, Ruihong. "Design of a storage and retrieval model for multimedia data." Thesis, University of Ottawa (Canada), 1995. http://hdl.handle.net/10393/10053.
Full textAbstract:
One of the most important and challenging aspects in multimedia technology is the design of a storage and retrieval system that will support the recording and the playback of multimedia data from a secondary storage device. This multimedia storage and retrieval system must be capable of handling discrete media (i.e. text, images and graphics) and continuous media (i.e. audio, video and animation). It should also provide facilities to handle the synchronization information between two or more data objects in a multimedia application. In this thesis, multimedia technology and its applications are first introduced followed by a review of multimedia requirements. An overview of the current storage and retrieval techniques for multimedia information is then given. Following, our storage model for multimedia data is presented. This model can support the storage of both discrete media and continuous media on a hard disk, it also offers methods to store the synchronization information of data objects on the disk. Unlike conventional data placement techniques, a special storage pattern is used in the model for the storage of continuous media streams. By using the storage pattern, real-time constraint can be guaranteed during the retrieval of a continuous media stream. A control scheme for simultaneous retrieval of multiple streams is then discussed in a single disk head system. The control scheme can guarantee the continuous retrieval of multiple streams simultaneously. By combining this control scheme with buffering techniques, a dynamic access control algorithm is developed to control the acceptance of the new retrieval request. Computer simulation is used to help the analysis of the storage model and the simultaneous retrieval control scheme. The results show that the storage and retrieval model can provide a good storage efficiency, and can guarantee the continuous retrieval of delay sensitive media streams.
36
Tykhonova, Olena. "Multimedia QoS aware data transfer over the packet based network." Thesis, ВНТУ, 2014. http://ir.lib.vntu.edu.ua/handle/123456789/4533.
Full textAbstract:
В роботі запропоновано вдосконалений метод передачі даних реального часу по віртуальним каналам пакетної мережі за допомогою кадрів Ethernet. Даний метод спрямований на вирішення питань конвергенції телекомунікаційних технологій та покращення ефективності використання пропускної здатності каналу зв’язку.An enhanced method introduced for real time data transfer over the virtual channel of packet based serial trunk with the use of Ethernet frames. This method addresses the issues of telecommunication technologies convergence and bandwidth utilization improvement.
37
Margaritidis, Margaritis. "Enhancing the quality of multimedia data transmission over wireless links /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2003. http://wwwlib.umi.com/cr/ucsd/fullcit?p3094625.
Full text
38
Baptista, Claudio. "Steplib : a digital library for spatio-temporal and multimedia data." Thesis, University of Kent, 2000. https://kar.kent.ac.uk/21961/.
Full text
39
Davis, Hugh. "Data integrity problems in an open hypermedia link service." Thesis, University of Southampton, 1995. https://eprints.soton.ac.uk/256597/.
Full textAbstract:
A hypermedia link service is system which stores the information describing hypertext links in a database which is separate from the data content over which the links are intended to operate. One of the first open hypermedia link services was Microcosm, which takes this philosophy to the extreme, storing not only the links in a separate database, but also the information about the endpoints of the links. The most important advantage of such an organisation is that the system remains open so that hypertext functionality may be extended to third party applications. The first part of this thesis describes the background to open hypermedia link services and describes the Microcosm system, which was developed by the Multimedia Research Group at the University of Southampton. The major problem with storing all the information about links separately from the content is that such a scheme introduces many opportunities for the introduction of inconsistencies and the loss of integrity of the hypermedia data model. The second part of this thesis examines these problems, and proposes a number of solutions. It concludes that no one solution can resolve all the problems, and that in order to ensure integrity it is necessary to impose some conditions which limit the degree of openness.
40
Gupta, Gaurav. "Robust digital watermarking of multimedia objects." Phd thesis, Australia : Macquarie University, 2008. http://hdl.handle.net/1959.14/28597.
Full textAbstract:
Thesis (PhD)--Macquarie University, Division of Information and Communication Sciences, Department of Computing, 2008.Bibliography: p. 144-153.
Introduction -- Background -- Overview of watermarking -- Natural language watermarking -- Software watermarking -- Semi-blind and reversible database watermarking -- Blind and reversible database watermarking -- Conclusion and future research -- Bibliography.
Digital watermarking has generated significant research and commercial interest in the past decade. The primary factors contributing to this surge are widespread use of the Internet with improved bandwidth and speed, regional copyright loopholes in terms of legislation; and seamless distribution of multimedia content due to peer-to-peer file-sharing applications. -- Digital watermarking addresses the issue of establishing ownership over mul-timedia content through embedding a watermark inside the object. Ideally, this watermark should be detectable and/or extractable, survive attacks such as digital reproduction and content-specific manipulations such as re-sizing in the case of images, and be invisible to the end-user so that the quality of the content is not degraded significantly. During detection or extraction, the only requirements should be the secret key and the watermarked multimedia object, and not the original un-marked object or the watermark inserted. Watermarking scheme that facilitate this requirement are categorized as blind. In recent times, reversibility of watermark has also become an important criterion. This is due to the fact that reversible watermarking schemes can provided security against secondary watermarking attacks by using backtracking algorithms to identify the rightful owner. A watermarking scheme is said to be reversible if the original unmarked object can be regenerated from the watermarked copy and the secret key.
This research covers three multimedia content types: natural language documents, software, and databases; and discusses the current watermarking scenario, challenges, and our contribution to the field. We have designed and implemented a natural language watermarking scheme that uses the redundancies in natural languages. As a result, it is robust against general attacks against text watermarks. It offers additional strength to the scheme by localizing the attack to the modified section and using error correction codes to detect the watermark. Our first contribution in software watermarking is identification and exploitation of weaknesses in branch-based software watermarking scheme proposed in [71] and the software watermarking algorithm we present is an improvised version of the existing watermarking schemes from [71]. Our scheme survives automated debugging attacks against which the current schemes are vulnerable, and is also secure against other software-specific attacks. We have proposed two database watermarking schemes that are both reversible and therefore resilient against secondary watermarking attacks. The first of these database watermarking schemes is semi-blind and requires the bits modified during the insertion algorithm to detect the watermark. The second scheme is an upgraded version that is blind and therefore does not require anything except a secret key and the watermarked relation. The watermark has a 89% probability of survival even when almost half of the data is manipulated. The watermarked data in this case is extremely useful from the users' perspective, since query results are preserved (i.e., the watermarked data gives the same results for a query as the nmarked data). -- The watermarking models we have proposed provide greater security against sophisticated attacks in different domains while providing sufficient watermark-carrying capacity at the same time. The false-positives are extremely low in all the models, thereby making accidental detection of watermark in a random object almost negligible. Reversibility has been facilitated in the later watermarking algorithms and is a solution to the secondary watermarking attacks. We shall address reversibility as a key issue in our future research, along with robustness, low false-positives and high capacity.
Mode of access: World Wide Web.
xxiv, 156 p. ill. (some col.)
41
Bäuml, Martin [Verfasser], and R. [Akademischer Betreuer] Stiefelhagen. "Contextual Person Identification in Multimedia Data / Martin Bäuml. Betreuer: R. Stiefelhagen." Karlsruhe : KIT-Bibliothek, 2014. http://d-nb.info/107189398X/34.
Full text
42
Vukotic, Verdran. "Deep Neural Architectures for Automatic Representation Learning from Multimedia Multimodal Data." Thesis, Rennes, INSA, 2017. http://www.theses.fr/2017ISAR0015/document.
Full textAbstract:
La thèse porte sur le développement d'architectures neuronales profondes permettant d'analyser des contenus textuels ou visuels, ou la combinaison des deux. De manière générale, le travail tire parti de la capacité des réseaux de neurones à apprendre des représentations abstraites. Les principales contributions de la thèse sont les suivantes: 1) Réseaux récurrents pour la compréhension de la parole: différentes architectures de réseaux sont comparées pour cette tâche sur leurs facultés à modéliser les observations ainsi que les dépendances sur les étiquettes à prédire. 2) Prédiction d’image et de mouvement : nous proposons une architecture permettant d'apprendre une représentation d'une image représentant une action humaine afin de prédire l'évolution du mouvement dans une vidéo ; l'originalité du modèle proposé réside dans sa capacité à prédire des images à une distance arbitraire dans une vidéo. 3) Encodeurs bidirectionnels multimodaux : le résultat majeur de la thèse concerne la proposition d'un réseau bidirectionnel permettant de traduire une modalité en une autre, offrant ainsi la possibilité de représenter conjointement plusieurs modalités. L'approche été étudiée principalement en structuration de collections de vidéos, dons le cadre d'évaluations internationales où l'approche proposée s'est imposée comme l'état de l'art. 4) Réseaux adverses pour la fusion multimodale: la thèse propose d'utiliser les architectures génératives adverses pour apprendre des représentations multimodales en offrant la possibilité de visualiser les représentations dans l'espace des imagesIn this dissertation, the thesis that deep neural networks are suited for analysis of visual, textual and fused visual and textual content is discussed. This work evaluates the ability of deep neural networks to learn automatic multimodal representations in either unsupervised or supervised manners and brings the following main contributions:1) Recurrent neural networks for spoken language understanding (slot filling): different architectures are compared for this task with the aim of modeling both the input context and output label dependencies.2) Action prediction from single images: we propose an architecture that allow us to predict human actions from a single image. The architecture is evaluated on videos, by utilizing solely one frame as input.3) Bidirectional multimodal encoders: the main contribution of this thesis consists of neural architecture that translates from one modality to the other and conversely and offers and improved multimodal representation space where the initially disjoint representations can translated and fused. This enables for improved multimodal fusion of multiple modalities. The architecture was extensively studied an evaluated in international benchmarks within the task of video hyperlinking where it defined the state of the art today.4) Generative adversarial networks for multimodal fusion: continuing on the topic of multimodal fusion, we evaluate the possibility of using conditional generative adversarial networks to lean multimodal representations in addition to providing multimodal representations, generative adversarial networks permit to visualize the learned model directly in the image domain
43
Rahman, Tasnim. "Optimization of Cross-Layer Network Data based on Multimedia Application Requirements." Digital WPI, 2019. https://digitalcommons.wpi.edu/etd-theses/1348.
Full textAbstract:
This thesis proposes a convex network utility maximization (NUM) problem that can be solved to optimize a cross-layer network based on user and system defined requirements for quality and link capacity of multimedia applications. The problem can also be converged to a distributed solution using dual decomposition. Current techniques do not address the changing system's requirements for the network in addition to the user's requirements for an application when optimizing a cross-layer network, but rather focus on optimizing a dynamic network to conform to a real-time application or for a specific performance. Optimizing the cross-layer network for the changing system and user requirements allows a more accurate optimization of the overall cross-layer network of any given multi-node, ad-hoc wireless application for data transmission quality and link capacity to meet overall mission demands.
44
Szolgay, Daniel. "Video event detection and visual data pro cessing for multimedia applications." Thesis, Bordeaux 1, 2011. http://www.theses.fr/2011BOR14313/document.
Full textAbstract:
Cette thèse (i) décrit une procédure automatique pour estimer la condition d'arrêt des méthodes de déconvolution itératives basées sur un critère d'orthogonalité du signal estimé et de son gradient à une itération donnée; (ii) présente une méthode qui décompose l'image en une partie géométrique (ou "cartoon") et une partie "texture" en utilisation une estimation de paramètre et une condition d'arrêt basées sur la diffusion anisotropique avec orthogonalité, en utilisant le fait que ces deux composantes. "cartoon" et "texture", doivent être indépendantes; (iii) décrit une méthode pour extraire d'une séquence vidéo obtenue à partir de caméra portable les objets de premier plan en mouvement. Cette méthode augmente la compensation de mouvement de la caméra par une nouvelle estimation basée noyau de la fonction de probabilité de densité des pixels d'arrière-plan. Les méthodes présentées ont été testées et comparées aux algorithmes de l'état de l'artThis dissertation (i) describes an automatic procedure for estimating the stopping condition of non-regularized iterative deconvolution methods based on an orthogonality criterion of the estimated signal and its gradient at a given iteration; (ii) presents a decomposition method that splits the image into geometric (or cartoon) and texture parts using anisotropic diffusion with orthogonality based parameter estimation and stopping condition, utilizing the theory that the cartoon and the texture components of an image should be independent of each other; (iii) describes a method for moving foreground object extraction in sequences taken by wearable camera, with strong motion, where the camera motion compensated frame differencing is enhanced with a novel kernel-based estimation of the probability density function of the background pixels. The presented methods have been thoroughly tested and compared to other similar algorithms from the state-of-the-art
45
Alzamzami, Fatimah. "Towards Multimedia-Based Storytelling in Online Social Networks." Thesis, Université d'Ottawa / University of Ottawa, 2015. http://hdl.handle.net/10393/32521.
Full textAbstract:
Human activities can now be captured in real-time using sensor technology. The growth in sensor applications and smart mobile phones that come equipped with built-in sensors has led to the integration of sensors with social networks. These days, people are heavily dependent on online social networks (OSNs); they migrate their real-life activities online through various types of multimedia such as photos, videos, text, etc., which turns OSNs into a soft-sensory resource about users' events. The users use these forms of multimedia to tell their friends about their daily lives. This social network data can be crawled to build personal context-aware stories about individuals. However, the number of social users and the quantity of multimedia that is produced on social media are both growing exponentially, which leads to the challenge of information overload on OSNs. The information needed for stories, such as events and their locations, is not fully available on user's own profile. It is true that part of the information can be retrieved from the user's timeline, but a large number of events and related multimedia information is only available on friends' profiles. In this thesis, we focus on identifying a subset of close friends in order to enrich the content of the story. The amount of time people spend together has been proven to play a key role in determining close ties between people. We propose a DST (Days Spent Together) algorithm to find a user's closest friends based on the days they spent together interacting face-to-face. With the closest friends information, we are able to find additional information to complement what was found on the user's own profile, as well as to personalize the stories to ensure that they are only about the users and their closest friends. Due to the possibility of multimedia (photos in this thesis) overload for events, we propose to use the duration of events measured by DST, to determine the number of representative photos for each event. Our experiments show that the proposed approach could recognize the close friends of users and rank them from the strongest to the weakest. The results also show that with the proposed method we get days-spent-together values that are close to the corresponding true values provided by users.
46
Ворона, Дмитро, and Dmytro Vorona. "Поняття про мультимедійні дані." фізико-математичний факультет СумДПУ імені А. С. Макаренка, 2018. http://repository.sspu.sumy.ua/handle/123456789/6186.
Full text
47
Asres, Kidanu Salomon, Yudith Cardinales, Richard Chbeir, Ponte Víctor De, Alejandro Figueroa, Figueroa Rodríguez, and Ibañez Carlos Arturo Raymundo. "MMDES: Multimedia Digital Ecosystem." Computational Science and Engineering, 2016. http://hdl.handle.net/10757/620995.
Full textAbstract:
19th IEEE International Conference on Computational Science and Engineering (CSE 2016), is the event, in a series of highly successful International Conferences on Computational Science and Engineering, held mainly as the International Workshop on High Performance Scientific and Engineering Computing for 11 editions. August 24-26, 2016 - Paris, FranceCurrently multimedia contents dominate the information exchanged in Internet, particularly through social networks. Each actor on the Internet becomes producer and consumer of contents. Nevertheless, social network and other traditional collaborative environments present limitations regarding content selection, categorization, aggregation, linking and interoperability, and usage control and privacy. In [1], we proposed the architecture (based on a peer-to-peer infrastructure and Semantic Web) of a MultiMedia Digital EcoSystem (MMDES), as a new environment for collaboration and sharing of multimedia resources, multimedia processings, as well as for computing and storage capabilities. In this paper, we describe MMDES framework and functionalities related to managing the collective knowledge and equilibrium in MMDES. We also describe the implementation of MMDES using a mobile platform in order to provide resources’ sharing for the Archivo Nacional de Arte Rupestre (ANAR) in Venezuela
48
Zhou, Jiantao. "Multimedia lightweight encryption via randomized entropy coding /." View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?ECED%202009%20ZHOU.
Full text
49
Venkatachari, Badrinath. "Better admission control and disk scheduling for multimedia applications." Link to electronic thesis, 2002. http://www.wpi.edu/Pubs/ETD/Available/etd-0501102-153840.
Full text
50
Hethener, Eric. "The design of a multimedia workstation (image/voice/data) for radiological applications." Thesis, University of Ottawa (Canada), 1986. http://hdl.handle.net/10393/4813.
Full text