Le développement fulgurant de réseaux informatiques, a entraîné l'apparition de diverses applications multimédia qui emploient des données 3D dans des multiples contextes. Si la majorité des travaux de recherche sur ces données s'est appuyées sur les modèles statiques, c'est à présent vers Les modèles dynamiques de maillages qu'il faut se tourner. Cependant, le maillage triangulaire est une représentation extrinsèque, sensible face aux différentes transformations affines et isométriques. Par conséquent, il a besoin d'un descripteur structurel intrinsèque. Pour relever ces défis, nous nous concentrons sur la modélisation topologique intrinsèque basée sur les graphes de Reeb. Notre principale contribution consiste à définir une nouvelle fonction continue basée sur les propriétés de diffusion de la chaleur. Ce dernier est calculé comme la distance de diffusion d'un point de la surface aux points localisés aux extrémités du modèle 3D qui représentent l'extremum locales de l'objet . Cette approche de construction de graph de Reeb peut être extrêmement utile comme descripteur de forme locale pour la reconnaissance de forme 3D. Il peut également être introduit dans un système de compression dynamique basée sur la segmentation.Dans une deuxième partie, nous avons proposé d'exploiter la méthode de construction de graphe de Reeb dans un système de reconnaissance de formes 3D non rigides. L'objectif consiste à segmenter le graphe de Reeb en cartes de Reeb définis comme cartes de topologie contrôlée. Chaque carte de Reeb est projetée vers le domaine planaire canonique. Ce dépliage dans le domaine planaire canonique introduit des distorsions d'aire et d'angle. En se basant sur une estimation de distorsion, l'extraction de vecteur caractéristique est effectuée. Nous calculons pour chaque carte un couple de signatures, qui sera utilisé par la suite pour faire l'appariement entre les cartes de Reeb.Dans une troisième partie, nous avons proposé de concevoir une technique de segmentation, des maillages dynamiques 3D. Le processus de segmentation est effectué en fonction des valeurs de la fonction scalaire proposée dans la première partie. Le principe consiste à dériver une segmentation purement topologique qui vise à partitionner le maillage en des régions rigides tout en estimant le mouvement de chaque région au cours du temps. Pour obtenir une bonne répartition des sommets situés sur les frontières des régions, nous avons proposé d'ajouter une étape de raffinement basée sur l'information de la courbure. Chaque limite de région est associée à une valeur de la fonction qui correspond à un point critique. L'objectif visé est de trouver la valeur optimale de cette fonction qui détermine le profil des limites. La technique de segmentation développée est exploitée dans un système de compression sans perte des maillages dynamiques 3D. Il s'agit de partitionner la première trame de la séquence. Chaque région est modélisée par une transformée affine et leurs poids d'animation associés. Le vecteur partition, associant à chaque sommet l'index de la région auquel il appartient, est compressé par un codeur arithmétique. Les deux ensembles des transformées affines et des poids d'animation sont quantifiés uniformément et compressés par un codeur arithmétique. La première trame de la séquence est compressée en appliquant un codeur de maillage statique. L a quantification de l'erreur de prédiction temporelle est optimisée en minimisant l'erreur de reconstruction. Ce processus est effectué sur les données de l'erreur de prédiction, qui est divisé en 3 sous-bandes correspondant aux erreurs de prédiction des 3 coordonnées x, y et z. Le taux de distorsion introduit est déterminé en calculant le pas de quantification, pour chaque sous-bande, afin d'atteindre le débit binaire cible. / In the last decade, the technological progress in telecommunication, hardware design and multimedia, allows access to an ever finer three-dimensional (3-D) modeling of the world. While most researchers have focused on the field of 3D objects, now it is necessary to turn to 3D time domain (3D+t). 3D dynamic meshes are becoming a media of increasing importance. This 3D content is subject to various processing operations such as indexation, segmentation or compression. However, surface mesh is an extrinsic shape representation. Therefore, it suffers from important variability under different sampling strategies and canonical shape-non-altering surface transformations, such as affine or isometric transformations. Consequently it needs an intrinsic structural descriptor before being processed by one of the aforementioned processing operations. The research topic of this thesis work is the topological modeling based on Reeb graphs. Specifically, we focus on 3D shapes represented by triangulated surfaces. Our objective is to propose a new approach, of Reeb graph construction, which exploits the temporal information. The main contribution consists in defining a new continuous function based on the heat diffusion properties. The latter is computed from the discrete representation of the shape to obtain a topological structure.The restriction of the heat kernel to temporal domain makes the proposed function intrinsic and stable against transformation. Due to the presence of neighborhood information in the heat kernel, the proposed Reeb Graph construction approach can be extremely useful as local shape descriptor for non-rigid shape retrieval. It can also be introduced into a segmentation-based dynamic compression scheme in order to infer the functional parts of a 3D shape by decomposing it into parts of uniform motion. In this context, we apply the concept of Reeb graph in two widely used applications which are pattern recognition and compression.Reeb graph has been known as an interesting candidate for 3D shape intrinsic structural representation. we propose a 3D non rigid shape recognition approach. The main contribution consists in defining a new scalar function to construct the Reeb graph. This function is computed based on the diffusion distance. For matching purpose, the constructed Reeb graph is segmented into Reeb charts, which are associated with a couple of geometrical signatures. The matching between two Reeb charts is performed based on the distances between their corresponding signatures. As a result, the global similarity is estimated based on the minimum distance between Reeb chart pairs. Skeletonisation and segmentation tasks are closely related. Mesh segmentation can be formulated as graph clustering. First we propose an implicit segmentation method which consists in partitioning mesh sequences, with constant connectivity, based on the Reeb graph construction method. Regions are separated according to the values of the proposed continuous function while adding a refinement step based on curvature and boundary information.Intrinsic mesh surface segmentation has been studied in the field of computer vision, especially for compression and simplification purposes. Therefore we present a segmentation-based compression scheme for animated sequences of meshes with constant connectivity. The proposed method exploits the temporal coherence of the geometry component by using the heat diffusion properties during the segmentation process. The motion of the resulting regions is accurately described by 3D affine transforms. These transforms are computed at the first frame to match the subsequent ones. In order to improve the performance of our coding scheme, the quantization of temporal prediction errors is optimized by using a bit allocation procedure. The objective aimed at is to control the compression rate while minimizing the reconstruction error.

by Donald Asogu Adjeroh. / Thesis (Ph.D.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (p. 202-216). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web.

Pang Chun Kiu. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (leaves 101-107). / Chapter 1 --- Introduction --- p.2 / Chapter 1.1 --- Chinese Indexing using Noun Phrases --- p.6 / Chapter 1.2 --- Objectives --- p.8 / Chapter 1.3 --- An Overview of the Thesis --- p.8 / Chapter 2 --- Background --- p.10 / Chapter 2.1 --- Technology Influences on Information Retrieval --- p.10 / Chapter 2.2 --- Related Work --- p.13 / Chapter 2.2.1 --- Statistical/Keyword Approaches --- p.13 / Chapter 2.2.2 --- Syntactical approaches --- p.15 / Chapter 2.2.3 --- Semantic approaches --- p.17 / Chapter 2.2.4 --- Noun Phrases Approach --- p.18 / Chapter 2.2.5 --- Chinese Information Retrieval --- p.20 / Chapter 2.3 --- Our Approach --- p.21 / Chapter 3 --- Chinese Noun Phrases --- p.23 / Chapter 3.1 --- Different types of Chinese Noun Phrases --- p.23 / Chapter 3.2 --- Ambiguous noun phrases --- p.27 / Chapter 3.2.1 --- Ambiguous English Noun Phrases --- p.27 / Chapter 3.2.2 --- Ambiguous Chinese Noun Phrases --- p.28 / Chapter 3.2.3 --- Statistical data on the three NPs --- p.33 / Chapter 4 --- Index Extraction from De-de Conj. NP --- p.35 / Chapter 4.1 --- Word Segmentation --- p.36 / Chapter 4.2 --- Part-of-speech tagging --- p.37 / Chapter 4.3 --- Noun Phrase Extraction --- p.37 / Chapter 4.4 --- The Chinese noun phrase partial parser --- p.38 / Chapter 4.5 --- Handling Parsing Ambiguity --- p.40 / Chapter 4.6 --- Index Building Strategy --- p.41 / Chapter 4.7 --- The cross-set generation rules --- p.44 / Chapter 4.8 --- Example 1: Indexing De-de NP --- p.46 / Chapter 4.9 --- Example 2: Indexing Conjunctive NP --- p.48 / Chapter 4.10 --- Experimental results and Discussion --- p.49 / Chapter 5 --- Indexing Compound Nouns --- p.52 / Chapter 5.1 --- Previous Researches on Compound Nouns --- p.53 / Chapter 5.2 --- Indexing two-term Compound Nouns --- p.55 / Chapter 5.2.1 --- About the thesaurus《同義詞詞林》 --- p.56 / Chapter 5.3 --- Indexing Compound Nouns of three or more terms --- p.58 / Chapter 5.4 --- Corpus learning approach --- p.59 / Chapter 5.4.1 --- An Example --- p.60 / Chapter 5.4.2 --- Experimental Setup --- p.63 / Chapter 5.4.3 --- An Experiment using the third level of the Cilin --- p.65 / Chapter 5.4.4 --- An Experiment using the second level of the Cilin --- p.66 / Chapter 5.5 --- Contextual Approach --- p.68 / Chapter 5.5.1 --- The algorithm --- p.69 / Chapter 5.5.2 --- An Illustrative Example --- p.71 / Chapter 5.5.3 --- Experiments on compound nouns --- p.72 / Chapter 5.5.4 --- Experiment I: Word Distance Based Extraction --- p.73 / Chapter 5.5.5 --- Experiment II: Semantic Class Based Extraction --- p.75 / Chapter 5.5.6 --- Experiments III: On different boundaries --- p.76 / Chapter 5.5.7 --- The Final Algorithm --- p.79 / Chapter 5.5.8 --- Experiments on other compounds --- p.82 / Chapter 5.5.9 --- Discussion --- p.83 / Chapter 6 --- Overall Effectiveness --- p.85 / Chapter 6.1 --- Illustrative Example for the Integrated Algorithm --- p.86 / Chapter 6.2 --- Experimental Setup --- p.90 / Chapter 6.3 --- Experimental Results & Discussion --- p.91 / Chapter 7 --- Conclusion --- p.95 / Chapter 7.1 --- Summary --- p.95 / Chapter 7.2 --- Contributions --- p.97 / Chapter 7.3 --- Future Directions --- p.98 / Chapter 7.3.1 --- Word-sense determination --- p.98 / Chapter 7.3.2 --- Hybrid approach for compound noun indexing --- p.99 / Chapter A --- Cross-set Generation Rules --- p.108 / Chapter B --- Tag set by Tsinghua University --- p.110 / Chapter C --- Noun Phrases Test Set --- p.113 / Chapter D --- Compound Nouns Test Set --- p.124 / Chapter D.l --- Three-term Compound Nouns --- p.125 / Chapter D.1.1 --- NVN --- p.125 / Chapter D.1.2 --- Other three-term compound nouns --- p.129 / Chapter D.2 --- Four-term Compound Nouns --- p.133 / Chapter D.3 --- Five-term and six-term Compound Nouns --- p.134

We demonstrate four novel multimodal methods for efficient video summarization and comprehensive cross-cultural news video understanding. First, For video quick browsing, we demonstrate a multimedia event recounting system. Based on nine people-oriented design principles, it summarizes YouTube-like videos into short visual segments (812sec) and textual words (less than 10 terms). In the 2013 Trecvid Multimedia Event Recounting competition, this system placed first in recognition time efficiency, while remaining above average in description accuracy. Secondly, we demonstrate the summarization of large amounts of online international news videos. In order to understand an international event such as Ebola virus, AirAsia Flight 8501 and Zika virus comprehensively, we present a novel and efficient constrained tensor factorization algorithm that first represents a video archive of multimedia news stories concerning a news event as a sparse tensor of order 4. The dimensions correspond to extracted visual memes, verbal tags, time periods, and cultures. The iterative algorithm approximately but accurately extracts coherent quad-clusters, each of which represents a significant summary of an important independent aspect of the news event. We give examples of quad-clusters extracted from tensors with at least 108 entries derived from international news coverage. We show the method is fast, can be tuned to give preferences to any subset of its four dimensions, and exceeds three existing methods in performance. Thirdly, noting that the co-occurrence of visual memes and tags in our summarization result is sparse, we show how to model cross-cultural visual meme influence based on normalized PageRank, which more accurately captures the rates at which visual memes are reposted in a specified time period in a specified culture. Lastly, we establish the correspondences of videos and text descriptions in different cultures by reliable visual cues, detect culture-specific tags for visual memes and then annotate videos in a cultural settings. Starting with any video with less text or no text in one culture (say, US), we select candidate annotations in the text of another culture (say, China) to annotate US video. Through analyzing the similarity of images annotated by those candidates, we can derive a set of proper tags from the viewpoints of another culture (China). We illustrate cultural-based annotation examples by segments of international news. We evaluate the generated tags by cross-cultural tag frequency, tag precision, and user studies.

Orientador: José Augusto Chaves Guimarães / Banca: Mariângela Spotti Lopes Fujita / Banca: Maria de Fátima Gonçalves Moreira Tálamo / Resumo: A representação do conhecimento, enquanto processo, assim como os instrumentos que a permeiam e os produtos que dela decorrem, não são neutros, estando imbuídos de valores morais. Nesse cenário, emergem problemas de biasses na representação, tais como questões de gênero, categorizações dicotômicas e falta de garantia e hospitalidade cultural. No tocante à questão da mulher, amparada apenas por algumas reflexões iniciais de Berman (1993), Olson (1998, 2002), Caro Castro e San Segundo Manuel (1999), Morán Suárez e Rodríguez Bravo (2001), López-Huertas e Barité Roqueta (2002), López-Huertas, Torres e Barité (2004), López-Huertas Pérez e Torres Ramírez (2005), López- Huertas (2006, 2008a), Guimarães (2006b, 2007) e Rodríguez Bravo (2006, 2007), há uma carência de literatura relativa à representação e ao delineamento de seu quadro epistemológico, tornando-se necessário verificar em que medida os termos relativos à questão feminina estão eventualmente inseridos sob bias nos instrumentos da área. Para tanto, verificou-se a presença dos termos: feminilidade; feminina(s); feminino(s); feminismo(s); feminista(s); materna(o); maternal; mulher(es), e os respectivos termos em inglês: female; femininity; feminism; feminist; maternal; motherly; woman(en), nas linguagens documentais brasileiras: Vocabulário Controlado Básico, Vocabulário Controlado USP, Terminologia de Assuntos da Fundação Biblioteca Nacional e Classificação Decimal de Direito. Cada termo identificado nas linguagens documentais alfabéticas teve seu descritor e não-descritores registrados, bem como notas de escopo, remissivas, termos relacionados e relações hierárquicas, enquanto as incidências relativas à linguagem documental hierárquica, foram sistematizadas de acordo com as diretrizes propostas por Olson (1998). Apresentaram-se... (Resumo completo, clicar acesso eletrônico abaixo) / Abstract: Knowlede representation, as a process, as well as the tools that take part in it and the products that emanate from it are not, by any means, neutral, being soaked in moral values. In such landscape, problems of bias in representation may rise, such as gender issues, dicotomical categorizations and lack of warrant/ cultural hospitality. Concerning the women's issue, supported only by a few initial reflexions by Berman (1993), Olson (1998, 2002), Caro Castro and San Segundo Manuel (1999), Morán Suárez and Rodríguez Bravo (2001), López-Huertas and Barité Roqueta (2002), López- Huertas, Torres and Barité (2004), López-Huertas Pérez and Torres Ramírez (2005), López-Huertas (2006, 2008a), Guimarães (2006b, 2007) and Rodríguez Bravo (2006, 2007), there is severe lack of literature related to representation and to the outlining of its epistemological frame, becoming necessary to verify how far the terms connected to the feminine issue are eventually inserted under bias in the tools of area. For such action, it was proposed to verify the presence of the following terms: female; femininity; feminism; feminist; maternal; motherly; woman(en), within the Brazilian indexing languages: Vocabulário Controlado Básico, Vocabulário Controlado USP (University of São Paulo), Terminologia de Assuntos da Fundação Biblioteca Nacional e Classificação Decimal de Direito. Each term identified in the alphabetic indexing languages had its descriptor and nondescriptors recorded, as well as the scope and remissive notes, related terms and hierarchic relations, whereas the incidences related to hierarchic indexing languages were systematized in compliance with the guidelines proposed by Olson (1998). Presented as results signs of biasses, as well as possible aid to attenuate them, as gateways to further discussions. Thus, discussions should continue being realized... (Complete abstract click electronic access below) / Mestre

Les volumes de données multimédia ont fortement crus ces dernières années. Facebook stocke plus de 100 milliards d'images, 200 millions sont ajoutées chaque jour. Cela oblige les systèmes de recherche d'images par le contenu à s'adapter pour fonctionner à ces échelles. Les travaux présentés dans ce manuscrit vont dans cette direction. Deux observations essentielles cadrent nos travaux. Premièrement, la taille des collections d'images est telle, plusieurs téraoctets, qu'il nous faut obligatoirement prendre en compte les contraintes du stockage secondaire. Cet aspect est central. Deuxièmement, tous les processeurs sont maintenant multi-cœurs et les grilles de calcul largement disponibles. Du coup, profiter de parallélisme et de distribution semble naturel pour accélérer tant la construction de la base que le débit des recherches par lots. Cette thèse décrit une technique d'indexation multidimensionnelle s'appelant eCP. Sa conception prend en compte les contraintes issues de l'usage de disques et d'architectures parallèles et distribuées. eCP se fonde sur la technique de quantification vectorielle non structurée et non itérative. eCP s'appuie sur une technique de l'état de l'art qui est toutefois orientée mémoire centrale. Notre première contribution se compose d'extensions destinées à permettre de traiter de très larges collections de données en réduisant fortement le coût de l'indexation et en utilisant les disques au mieux. La seconde contribution tire profit des architectures multi-cœurs et détaille comment paralléliser l'indexation et la recherche. Nous évaluons cet apport sur près de 25 millions d'images, soit près de 8 milliards de descripteurs SIFT. La troisième contribution aborde l'aspect distribué. Nous adaptons eCP au paradigme Map-Reduce et nous utilisons Hadoop pour en évaluer les performances. Là, nous montrons la capacité de eCP à traiter de grandes bases en indexant plus de 100 millions d'images, soit 30 milliards de SIFT. Nous montrons aussi la capacité de eCP à utiliser plusieurs centaines de cœurs. / The scale of multimedia collections has grown very fast over the last few years. Facebook stores more than 100 billion images, 200 million are added every day. In order to cope with this growth, methods for content-based image retrieval must adapt gracefully. The work presented in this thesis goes in this direction. Two observations drove the design of the high-dimensional indexing technique presented here. Firstly, the collections are so huge, typically several terabytes, that they must be kept on secondary storage. Addressing disk related issues is thus central to our work. Secondly, all CPUs are now multi-core and clusters of machines are a commonplace. Parallelism and distribution are both key for fast indexing and high-throughput batch-oriented searching. We describe in this manuscript a high-dimensional indexing technique called eCP. Its design includes the constraints associated to using disks, parallelism and distribution. At its core is an non-iterative unstructured vectorial quantization scheme. eCP builds on an existing indexing scheme that is main memory oriented. Our first contribution is a set of extensions for processing very large data collections, reducing indexing costs and best using disks. The second contribution proposes multi-threaded algorithms for both building and searching, harnessing the power of multi-core processors. Datasets for evaluation contain about 25 million images or over 8 billion SIFT descriptors. The third contribution addresses distributed computing. We adapt eCP to the MapReduce programming model and use the Hadoop framework and HDFS for our experiments. This time we evaluate eCP's ability to scale-up with a collection of 100 million images, more than 30 billion SIFT descriptors, and its ability to scale-out by running experiments on more than 100 machines.

Este trabalho discute a importância do estabelecimento de uma política de indexação e a proposição de uma linguagem documentária (LD) para orientar o documentalista quanto ao processo de indexação de fotografias, alinhado às necessidades do usuário e ao perfil da instituição. Foi realizada uma análise comparativa entre o referencial teórico e as práticas existentes em três instituições-memória. A questão fundamental foi verificar se a metodologia utilizada estava alinhada ao perfil da instituição-memória e se atendia às necessidades dos usuários. Averiguamos que, apesar de haver métodos já consagrados referentes à análise do conteúdo da imagem e à criação de linguagens documentárias, estes não foram utilizados nas instituições-memória com acervos fotográficos. A tarefa de indexação foi realizada ali a partir de critérios muito particulares; no entanto, atendeu às necessidades da instituição, desde que a busca fosse mediada pelo documentalista. Essa constatação reforça a percepção de que o conteúdo da imagem geralmente é identificado conforme o perfil da instituição e as necessidades dos usuários, mas que a adoção de critérios socializáveis de representação do conteúdo da imagem se torna essencial quando o sistema não prevê a mediação do profissional documentalista. / The present paper discusses the importance of establishing an indexing policy and the proposal for a documentary language (DL) to guide documentalists regarding photographic indexing processes, which are aligned to the users´ needs and the institutional profile. A comparative analysis between theoretical references and existing practices has been carried out within three memory-institutions. The pivotal issue was to verify whether the methodology used was aligned to the profile of the memory-institution and whether it catered to users´ needs. The conclusion reached was that, despite the existence of already-established methods related to image content analysis and creation of documentary language, such were not employed at memory-institutions with photo archives. The task of indexing was performed therein by using very particular criteria; nevertheless, it catered to institutional needs, as long as the search was mediated by the documentalist himself. Such evidence reinforces the perception that image content is usually identified according to institutional profiles and users´ needs, but also that the adoption of socializable criteria of image content representation becomes essential when the system does not foresee mediation by the documentalist.

Este trabalho discute a importância do estabelecimento de uma política de indexação e a proposição de uma linguagem documentária (LD) para orientar o documentalista quanto ao processo de indexação de fotografias, alinhado às necessidades do usuário e ao perfil da instituição. Foi realizada uma análise comparativa entre o referencial teórico e as práticas existentes em três instituições-memória. A questão fundamental foi verificar se a metodologia utilizada estava alinhada ao perfil da instituição-memória e se atendia às necessidades dos usuários. Averiguamos que, apesar de haver métodos já consagrados referentes à análise do conteúdo da imagem e à criação de linguagens documentárias, estes não foram utilizados nas instituições-memória com acervos fotográficos. A tarefa de indexação foi realizada ali a partir de critérios muito particulares; no entanto, atendeu às necessidades da instituição, desde que a busca fosse mediada pelo documentalista. Essa constatação reforça a percepção de que o conteúdo da imagem geralmente é identificado conforme o perfil da instituição e as necessidades dos usuários, mas que a adoção de critérios socializáveis de representação do conteúdo da imagem se torna essencial quando o sistema não prevê a mediação do profissional documentalista. / The present paper discusses the importance of establishing an indexing policy and the proposal for a documentary language (DL) to guide documentalists regarding photographic indexing processes, which are aligned to the users´ needs and the institutional profile. A comparative analysis between theoretical references and existing practices has been carried out within three memory-institutions. The pivotal issue was to verify whether the methodology used was aligned to the profile of the memory-institution and whether it catered to users´ needs. The conclusion reached was that, despite the existence of already-established methods related to image content analysis and creation of documentary language, such were not employed at memory-institutions with photo archives. The task of indexing was performed therein by using very particular criteria; nevertheless, it catered to institutional needs, as long as the search was mediated by the documentalist himself. Such evidence reinforces the perception that image content is usually identified according to institutional profiles and users´ needs, but also that the adoption of socializable criteria of image content representation becomes essential when the system does not foresee mediation by the documentalist.

Orientadora: Mariângela Spotti Lopes Fujita / Banca: Deise Maria Antonio Sabbag / Banca: Brigida Maria Nogueira Cervantes / Resumo: As linguagens de indexação são especialmente construídas para fins de indexação de assunto, são responsáveis por fazer a conversão em uma linguagem una e padronizada do catálogo das bibliotecas universitárias. É primordial para o sucesso do processo de indexação e do emprego da linguagem de indexação uma política de indexação que guiará a tomada de decisões do indexador. A proposta aqui apresentada é investigar a aplicação da linguagem de indexação em bibliotecas brasileiras visando uma perspectiva mais ampla do emprego das ferramentas de controle de vocabulário, com o objetivo de contribuir para os estudos da área de organização e representação da informação, especialmente sobre o controle de vocabulário, ao realizar estudo analítico sobre o uso de linguagens de indexação no Brasil. Para isso, foram aplicados questionários elaborados a partir do Google Forms em bibliotecas universitárias brasileiras que foram selecionadas em pesquisas na FEBAB e o e-MEC. Mediante contato por e-mail, foram respondidos 46 questionários. O estudo dos dados contou com a elaboração de categorias de análise a partir dos objetivos específicos estabelecidos e das respostas obtidas pelos participantes, além da decisão de comparar os resultados desta pesquisa com a de Fujita et al. (2019), na qual os autores realizaram estudo semelhante nas bibliotecas universitárias do sudeste do Brasil. Verificou-se que todas as bibliotecas universitárias brasileiras apresentam profissionais dedicados à tarefa de in... (Resumo completo, clicar acesso eletrônico abaixo) / Abstract: Indexing languages are specially built for subject indexing purposes, they are responsible for converting to a standard and unified language of the university library catalog. It is essential for the success of the indexing process and the use of the indexing language an indexing policy that will guide the decision making of the indexer. The present proposal is to investigate the application of the indexing language in university libraries aiming at a broader perspective of the use of vocabulary control tools, with the objective of contributing to the studies of the area of organization and representation of information especially on the control of vocabulary when performing an analytical study on the use of indexing languages in Brazil. For that, questionnaires elaborated from Google Forms were applied in Brazilian university libraries that were selected from research in FEBAB and e-MEC. Through the contact by e-mail, 46 questionnaires were answered. The analysis of the data counted on the elaboration of categories of analysis elaborated from the specific objectives established and of the answers obtained by the participants, besides the decision to compare the results of this research with that of Fujita et al. (2019), in which the authors carried out a similar study in university libraries in southeastern Brazil. It was verified that all Brazilian university libraries present professionals dedicated to the task of indexing and 84.8% use indexing language in the thematic in... (Complete abstract click electronic access below) / Mestre

This thesis presents work aimed at exploiting the grammar of film for the purpose of automated film understanding, and addresses the semantic gap that exists between the simplicity of features that can be currently computed in automated content indexing systems and the richness of semantics in user queries posed for media search and retrieval. The problem is set within the broader context of the need for enabling technologies for multimedia content management, and arises in response to the growing presence of multimedia data made possible by advances in storage, processing, and transmission technologies. The first demonstration of this philosophy uses the attributes of motion and shot length to define and compute a novel measure of film tempo. Tempo flow plots are defined and derived for a number of full length movies, and edge analysis is performed leading to the extraction of dramatic story sections and events signaled by their unique tempo. In addition to the development of this computable tempo measure, a study is conducted as to the usefulness of biasing it toward either of its constituents, namely motion or shot length. Thirdly, a refinement is made to the shot length normalizing mechanism, driven by the peculiar characteristics of shot length distribution exhibited by movies. The next aspect of film examined is film rhythm. In the rhythm model presented, motion behaviour is classified as being either nonexistent, fluid or staccato for a given shot. Shot neighbourhoods in movies are then grouped by proportional makeup of these motion behavioural classes to yield seven high-level rhythmic arrangements that prove adept at indicating likely scene content (e.g., dialogue or chase sequence). The second part of the investigation presents a novel computational model to detect editing patterns as either metric, accelerated, decelerated, or free. / It is also found that combined motion and editing rhythms allow us to determine that the media content has changed and hypothesize as to why this is so. Three such categories are presented along with their efficacy for capturing useful film elements (e.g., scene change precipitated by plot event). Finally, the first attempt to extract narrative structure, the prevalent 3-Act storytelling paradigm in film, is detailed. The identification of act boundaries in the narrative allows for structuralizing film at a level far higher than existing segmentation frameworks which include shot detection and scene identification, and provides a reliable basis for inferences about the semantic content of dramatic events in film. Additionally, the narrative constructs identified have analogues in many other domains, including news, training video, sitcoms, etc., making these ideas widely applicable. A novel act boundary posterior function for Act 1 and 2 is derived using a Bayesian formulation under guidance from film grammar, tested under many configurations, and the results are reported for experiments involving 25 full-length movies. The framework is shown to have a role in both the automatic and semi-interactive setting for semantic analysis of film.