Tesis sobre el tema "Graph-Based visualization and structuring"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 26 mejores tesis para su investigación sobre el tema "Graph-Based visualization and structuring".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Blettery, Emile. "Structuring heritage iconographic collections : from automatic interlinking to semi-automatic visual validation". Electronic Thesis or Diss., Université Gustave Eiffel, 2024. http://www.theses.fr/2024UEFL2001.
Texto completoThis thesis explores automatic and semi-automatic structuring approaches for iconographic heritage contents collections. Indeed, exploiting such contents could prove beneficial for numerous applications. From virtual tourism to increased access for both researchers and the general public, structuring the collections would increase their accessibility and their use. However, the inherent "in silo" organization of those collections, each with their unique organization system hinders automatic structuring approaches and all subsequent applications. The computer vision community has proposed numerous automatic methods for indexing (and structuring) image collections at large scale. Exploiting the visual aspect of the contents, they are not impacted by the differences in metadata structures that mainly organize heritage collections, thus appearing as a potential solution to the problem of linking together unique data structures. However, those methods are trained on large, recent datasets, that do not reflect the visual diversity of iconographic heritage contents. This thesis aims at evaluating and exploiting those automatic methods for iconographic heritage contents structuring.To this end, this thesis proposes three distinct contributions with the common goal of ensuring a certain level of interpretability for the methods that are both evaluated and proposed. This interpretability is necessary to justify their efficiency to deal with such complex data but also to understand how to adapt them to new and different content. The first contribution of this thesis is an evaluation of existing state-of-the-art automatic content-based image retrieval (CBIR) approaches when faced with the different types of data composing iconographic heritage. This evaluation focuses first on image descriptors paramount for the image retrieval step and second, on re-ranking methods that re-order similar images after a first retrieval step based on another criterion. The most relevant approaches can then be selected for further use while the non-relevant ones provide insights for our second contribution. The second contribution consists of three novel re-ranking methods exploiting a more or less global spatial information to re-evaluate the relevance of visual similarity links created by the CBIR step. The first one exploits the first retrieved images to create an approximate 3D scene of the scene in which retrieved images are positioned to evaluate their coherence in the scene. The second one simplifies the first while extending the classical geometric verification setting by performing geometric query expansion, that is aggregating 2D geometric information from retrieved images to encode more largely the scene's geometry without the costly step of 3D scene creation. Finally, the third one exploits a more global location information, at dataset-level, to estimate the coherence of the visual similarity between images with regard to their spatial proximity. The third and final contribution is a framework for semi-automatic visual validation and manual correction of a collection's structuring. This framework exploits on one side the most suited automatic approaches evaluated or proposed earlier, and on the other side a graph-based visualization platform. We exploit several visual clues to focus the expert's manual intervention on impacting areas. We show that this guided semi-automatic approach has merits in terms of performance as it solves mistakes in the structuring that automatic methods can not, these corrections being then largely diffused throughout the structure, improving it even more globally.We hope our work will provide some first insights on automatically structuring heritage iconographic content with content-based approaches but also encourage further research on guided semi-automatic structuring of image collections
WIner, Michael Loyd. "Fifth Graders’ Reasoning on the Enumeration of Cube-Packages in Rectangular Boxes in an Inquiry-Based Classroom". The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1281978828.
Texto completoArchambault, Daniel William. "Feature-based graph visualization". Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/2839.
Texto completoPavlo, Andrew. "Interactive, tree-based graph visualization /". Link to online version, 2006. https://ritdml.rit.edu/dspace/handle/1850/1543.
Texto completoSandelius, Tim. "Graph-based Visualization of Sensor Data". Thesis, Örebro universitet, Institutionen för naturvetenskap och teknik, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-94170.
Texto completoVisualizing movement data is a heavily researched area and complex task. In this project I have used movement data collected by sensors from Akademiska hus placed on campus of Örebro University. The data is used to visualize movement made inside the buildings through a developed webapp written entirely in Python. Connectivity between sensors is studied whether it is possible to generate connectivity graphs with the information associated to specific sensors automatically or done by hand. The project also researches whether movement flows are possible to visualize with the data available from Akademiska hus.
Afzal, Mansoor. "Graph-Based Visualization of Ontology-Based Competence Profiles for Research Collaboration". Thesis, Tekniska Högskolan, Högskolan i Jönköping, JTH. Forskningsmiljö Informationsteknik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-20123.
Texto completoTu, Ying. "Focus-based Interactive Visualization for Structured Data". The Ohio State University, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=osu1366198735.
Texto completoZHONG, LI. "SHORTCUT BASED GRAPH COARSENING FOR PROTEIN INTERACTION NETWORK VISUALIZATION". University of Cincinnati / OhioLINK, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=ucin997457452.
Texto completoLu, Jia Wei. "Clustering-based force-directed algorithms for three-dimensional graph visualization". Thesis, University of Macau, 2018. http://umaclib3.umac.mo/record=b3950626.
Texto completoColmenares, Hugo Armando Gualdron. "Block-based and structure-based techniques for large-scale graph processing and visualization". Universidade de São Paulo, 2015. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-23032016-145752/.
Texto completoTécnicas de análise de dados podem ser úteis em processos de tomada de decisão, quando padrões de interesse indicam tendências em domínios específicos. Tais tendências podem auxiliar a avaliação, a definição de alternativas ou a predição de eventos. Atualmente, os conjuntos de dados têm aumentado em tamanho e complexidade, impondo desafios para recursos modernos de hardware. No caso de grandes conjuntos de dados que podem ser representados como grafos, aspectos de visualização e processamento escalável têm despertado interesse. Arcabouços distribuídos são comumente usados para lidar com esses dados, mas a implantação e o gerenciamento de clusters computacionais podem ser complexos, exigindo recursos técnicos e financeiros que podem ser proibitivos em vários cenários. Portanto é desejável conceber técnicas eficazes para o processamento e visualização de grafos em larga escala que otimizam recursos de hardware em um único nó computacional. Desse modo, este trabalho apresenta uma técnica de visualização chamada StructMatrix para identificar relacionamentos estruturais em grafos reais. Adicionalmente, foi proposta uma estratégia de processamento bimodal em blocos, denominada Bimodal Block Processing (BBP), que minimiza o custo de I/O para melhorar o desempenho do processamento. Essa estratégia foi incorporada a um arcabouço de processamento de grafos denominado M-Flash e desenvolvido durante a realização deste trabalho.Foram conduzidos experimentos a fim de avaliar as técnicas propostas. Os resultados mostraram que a técnica de visualização StructMatrix permitiu uma exploração eficiente e interativa de grandes grafos. Além disso, a avaliação do arcabouço M-Flash apresentou ganhos significativos sobre todas as abordagens baseadas em memória secundária do estado da arte. Ambas as contribuições foram validadas em eventos de revisão por pares, demonstrando o potencial analítico deste trabalho em domínios associados a grafos em larga escala.
Sullivan, Paul Andrew. "Graph-Based Data Visualization in Virtual Reality: A Comparison of User Experiences". DigitalCommons@CalPoly, 2016. https://digitalcommons.calpoly.edu/theses/1598.
Texto completoSpritzer, Andre Suslik. "MagnetViz : design and evaluation of a physics-based interaction technique for graph visualization". reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2009. http://hdl.handle.net/10183/17023.
Texto completoThis dissertation presents MagnetViz, a technique for the visualization of graphs. While most techniques visualize a static pre-computed graph layout, MagnetViz allows users to dynamically alter the layout of a graph to better satisfy their needs. This is done by building on the physics metaphor of force-directed algorithms to provide users with virtual magnets, which can attract nodes that fulfill a set of criteria associated with them. Criteria can be based on either the topology or semantics of the graph. Through boundary shapes, which are simple geometric shapes that can be placed around magnets, users can also define regions within the scene where the attracted nodes should remain. Graphs are described in GraphML, a XML-like description language which allows the specification of nodes and edges between nodes as well as attributes associated to nodes and edges. After loading a graph, Magnetviz displays it using a slightly modified version of the classical Fruchterman and Reingold' algorithm, and allows the user to insert magnets. Users can build the criteria associated with the magnets using the attributes of nodes and/or edges, besides the common graphs' topological attributes. For MagnetViz's evaluation, it was first analyzed how the technique fared in aiding users to perform tasks defined by a graph visualization task taxonomy described in the literature. Then, MagnetViz was tested within a practical context by means of a case study. A co-authorship network was chosen as the target dataset. The MagnetViz prototype was initially used to answer questions relevant to this dataset and then tested by a group of potential users, who had to use it to answer these same questions. After trying the application, subjects answered questionnaires about their opinion on the technique's usability, applicability, relevance and visual results. While some aspects of the technique should still be refined, results of the evaluation proved MagnetViz to be a valid approach when it comes to interaction with graph visualizations.
Tauer, Gregory W. "A graph-based factor screening method for synchronous data flow simulation models /". Online version of thesis, 2009. http://hdl.handle.net/1850/9833.
Texto completoWoods, Taylor. "Program Visualization: An exploration of graph based visualizations to assist in student learning and programmatic evaluation". DigitalCommons@CalPoly, 2015. https://digitalcommons.calpoly.edu/theses/1458.
Texto completoSikansi, Fábio Henrique Gomes. "A similarity-based approach to generate edge bundles". Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-27032017-083934/.
Texto completoGrafos são empregados com sucesso em uma grande variedade de problemas e aplicações, sendo objeto de estudo na modelagem, análise e na construção de representações visuais. Embora existam diferentes formas para a visualização de grafos, a maioria delas sofrem pela desorganização do espaço visual quando o número de vértices ou arestas é alto. Entre as abordagens que lidam com este problema, as técnicas de agrupamentos visuais de arestas obtiveram sucesso na melhora da representação visual pelo encurvamento e agrupamento de arestas que aperfeiçoam a organização da representação. Apesar deste sucesso, a maioria das técniques criam grupos de arestas baseados apenas na informação do espaço visual, não existindo conexão explícita entre o desenho no espaço visual e o conjunto de dados original. Dessa forma, estas técnicas produzem agrupamentos de arestas com baixa significância e podem levar o usuário a uma interpretação incorreta da informação. Esta pesquisa de mestrado apresenta uma nova técnica de agrupamento visual de arestas baseado nas relações de similaridade entre os vértices. Nós desenvolvemos esta técnica com base em duas premissas. Primeiro, ela defende a hipótese que a representação por agrupamento de arestas pode representar melhor o conjunto de dados se existir uma conexão inerente entre a proximidade dos elementos no espaço de informação e a proximidade entre arestas no desenho de arestas agrupadas. Nós atendemos esta questão apresentando um arcabouço para o agrupamento de arestas baseado em similaridade, que considera a similaridade entre vértices para realizar o encurvamento das arestas. Para guiar este encurvamento, nós criamos uma estrutura de similaridade, denominada backbone. Esta estrutura é baseada em um particionamento multi-nível do conjunto de dados, que agrupa arestas de vértices similares. A segunda premissa, nós também defendemos que uma representação multiescala melhora a escalabilidade computacional e visual da representação visual de arestas agrupadas. Nós apresentamos um agrupamento visual multi-nível de arestas que permite uma exploração generalizada e detalhada, revelando detalhes em múltiplos níveis da visualização. Nosso processo de avaliação mostra que a construção do backbone produz uma hierarquia balanceada e com boa representação das relações de similaridade entre os vértices. Além disso, a visualização com arestas guiadas pelo backbone reduz a desordem visual e melhora as técnicas do estado-da-arte na identificação de padrões de arestas globais e locais.
Günther, Manuel [Verfasser]. "Statistical Gabor Graph Based Techniques for the Detection, Recognition, Classification, and Visualization of Human Faces / Manuel Günther". Aachen : Shaker, 2012. http://d-nb.info/1069046140/34.
Texto completoFuruhashi, Takashi, Tomohiro Yoshikawa y Daisuke Kobayashi. "Visualization and analytical support of questionnaire free-texts data based on HK Graph with concepts of words". IEEE, 2011. http://hdl.handle.net/2237/20705.
Texto completoPurnomo, Husnul Khotimah. "A Data Driven Retrospective Study for Medication Strategy Analyses on Longitudinal Prescription Records". Kyoto University, 2018. http://hdl.handle.net/2433/235117.
Texto completoFreivalds, Kārlis. "Algorithms for visualization of graph-based structures". Thesis, 2004. https://dspace.lu.lv/dspace/handle/7/311.
Texto completoLi, Yong-Ming y 李詠銘. "A 3D Dynamic and Interactive Graph Visualization System Based on Physics Laws". Thesis, 2009. http://ndltd.ncl.edu.tw/handle/d83uxh.
Texto completoZou, Feng. "A customization framework for the SVG Graph Visualization Engine". Thesis, 2008. http://hdl.handle.net/1828/1314.
Texto completo(8802671), Jiaxin Sun. "A software visualization-based approach for understanding and analyzing incremental implementations of complex graph-based algorithms". Thesis, 2020.
Buscar texto completoOng, Yongzhi. "Extension of the Rule-Based Programming Language XL by Concepts for Multi-Scaled Modelling and Level-of-Detail Visualization". Doctoral thesis, 2015. http://hdl.handle.net/11858/00-1735-0000-0022-5FC5-B.
Texto completoSaldanha, Rodolfo Luis Dos Santos. "Generic data modeling based on the Markov chain theory part of an AutoML system: customizable library and visualization tool". Master's thesis, 2020. http://hdl.handle.net/10362/100768.
Texto completoArtificial Intelligence and automation have significantly expanded as a research field, and gradually play an increasingly important role in business decision-making. The goal of this internship is to implement a highly customizable library as part of an Automated Machine Learning system, which intends to give accessibility of data-driven decisions to less experienced users, and let them perform in-depth analyzes on large quantities of data. This library is built upon the Markov chain theory, which has several real-world applications and also serves as the basis for other theories with a higher level of complexity. In addition to the library, a visualization tool is also conceived to facilitate the use of the library by providing an interface to process parameter settings and display modeling data in the form of interactive directed graphs.
Chen, Wei-An y 陳韋安. "Harmony Graph, a Social-Network Based Model for Symbolic Music Content, and its Application to Music Visualization and Genre Classification". Thesis, 2011. http://ndltd.ncl.edu.tw/handle/01915270528749095540.
Texto completoGalvão, Marcelo de Lima. "Schematic bus transit maps for the web using genetic algorithms". Master's thesis, 2016. http://hdl.handle.net/10362/18403.
Texto completoThe octilinear schematic map, layout recognized worldwide in metro maps, is an important transit informative tool. This research investigates how algorithms for the visualization of schematic maps can be availed in mobile web devices context in order to empower the efficiency in transmitting information of bus transit maps. A genetic algorithm for path octilinear schematization technique has been used and tested to create the schematic data. Location-based and interactivity functionalities were embedded to the resulting digital maps in order to create personalized maps to meet specific user needs. A prototype of a web application and real transit data of the city of Castellón in Spain was used to test the methodology. The results have shown that real time schematizations open possibilities concerning usability that add extra value to schematic transit maps. Additionally, suggested improvements have been made to the genetic algorithm and performance tests show that genetic algorithms are adequate, in terms of efficiency, to sketch bus transit maps automatically.