Thèses sur le sujet « Hierarchical representations of images »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les 50 meilleures thèses pour votre recherche sur le sujet « Hierarchical representations of images ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Parcourez les thèses sur diverses disciplines et organisez correctement votre bibliographie.
Fehri, Amin. « Image Characterization by Morphological Hierarchical Representations ». Thesis, Paris Sciences et Lettres (ComUE), 2018. http://www.theses.fr/2018PSLEM063/document.
Texte intégralThis thesis deals with the extraction of hierarchical and multiscale descriptors on images, in order to interpret, characterize and segment them. It breaks down into two parts.The first part outlines a theoretical and methodological approach for obtaining hierarchical clusterings of the nodes of an edge-weighted graph. In addition, we introduce different approaches to combine hierarchical segmentations. These methods are then applied to graphs representing images and derive different hierarchical segmentation techniques. Finally, we propose a methodology for structuring and studying the space of hierarchies by using the Gromov-Hausdorff distance as a metric.The second part explores several applications of these hierarchical descriptions for images. We expose a method to learn how to automatically extract a segmentation of an image, given a type of images and a score of evaluation for a segmentation. We also propose image descriptors obtained by measuring inter-hierarchical distances, and expose their efficiency on real and simulated data. Finally, we extend the potential applications of these hierarchies by introducing a technique to take into account any spatial prior information during their construction
Cui, Yanwei. « Kernel-based learning on hierarchical image representations : applications to remote sensing data classification ». Thesis, Lorient, 2017. http://www.theses.fr/2017LORIS448/document.
Texte intégralHierarchical image representations have been widely used in the image classification context. Such representations are capable of modeling the content of an image through a tree structure. In this thesis, we investigate kernel-based strategies that make possible taking input data in a structured form and capturing the topological patterns inside each structure through designing structured kernels. We develop a structured kernel dedicated to unordered tree and path (sequence of nodes) structures equipped with numerical features, called Bag of Subpaths Kernel (BoSK). It is formed by summing up kernels computed on subpaths (a bag of all paths and single nodes) between two bags. The direct computation of BoSK yields a quadratic complexity w.r.t. both structure size (number of nodes) and amount of data (training size). We also propose a scalable version of BoSK (SBoSK for short), using Random Fourier Features technique to map the structured data in a randomized finite-dimensional Euclidean space, where inner product of the transformed feature vector approximates BoSK. It brings down the complexity from quadratic to linear w.r.t. structure size and amount of data, making the kernel compliant with the large-scale machine-learning context. Thanks to (S)BoSK, we are able to learn from cross-scale patterns in hierarchical image representations. (S)BoSK operates on paths, thus allowing modeling the context of a pixel (leaf of the hierarchical representation) through its ancestor regions at multiple scales. Such a model is used within pixel-based image classification. (S)BoSK also works on trees, making the kernel able to capture the composition of an object (top of the hierarchical representation) and the topological relationships among its subparts. This strategy allows tile/sub-image classification. Further relying on (S)BoSK, we introduce a novel multi-source classification approach that performs classification directly from a hierarchical image representation built from two images of the same scene taken at different resolutions, possibly with different modalities. Evaluations on several publicly available remote sensing datasets illustrate the superiority of (S)BoSK compared to state-of-the-art methods in terms of classification accuracy, and experiments on an urban classification task show the effectiveness of proposed multi-source classification approach
Lagrange, Adrien. « From representation learning to thematic classification - Application to hierarchical analysis of hyperspectral images ». Thesis, Toulouse, INPT, 2019. http://www.theses.fr/2019INPT0095.
Texte intégralNumerous frameworks have been developed in order to analyze the increasing amount of available image data. Among those methods, supervised classification has received considerable attention leading to the development of state-of-the-art classification methods. These methods aim at inferring the class of each observation given a specific class nomenclature by exploiting a set of labeled observations. Thanks to extensive research efforts of the community, classification methods have become very efficient. Nevertheless, the results of a classification remains a highlevel interpretation of the scene since it only gives a single class to summarize all information in a given pixel. Contrary to classification methods, representation learning methods are model-based approaches designed especially to handle high-dimensional data and extract meaningful latent variables. By using physic-based models, these methods allow the user to extract very meaningful variables and get a very detailed interpretation of the considered image. The main objective of this thesis is to develop a unified framework for classification and representation learning. These two methods provide complementary approaches allowing to address the problem using a hierarchical modeling approach. The representation learning approach is used to build a low-level model of the data whereas classification is used to incorporate supervised information and may be seen as a high-level interpretation of the data. Two different paradigms, namely Bayesian models and optimization approaches, are explored to set up this hierarchical model. The proposed models are then tested in the specific context of hyperspectral imaging where the representation learning task is specified as a spectral unmixing problem
Xu, Zijian. « A hierarchical compositional model for representation and sketching of high-resolution human images ». Diss., Restricted to subscribing institutions, 2007. http://proquest.umi.com/pqdweb?did=1495960431&sid=1&Fmt=2&clientId=1564&RQT=309&VName=PQD.
Texte intégralHuynh, Lê Duy. « Taking into account inclusion and adjacency information in morphological hierarchical representations, with application to the extraction of text in natural images and videos ». Electronic Thesis or Diss., Sorbonne université, 2018. http://www.theses.fr/2018SORUS341.
Texte intégralThe inclusion and adjacency relationship between image regions usually carry contextual information. The later is widely used since it tells how regions are arranged in images. The former is usually not taken into account although it parallels the object-background relationship. The mathematical morphology framework provides several hierarchical image representations. They include the Tree of Shapes (ToS), which encodes the inclusion of level-line, and the hierarchies of segmentation (e.g., alpha-tree, BPT), which is useful in the analysis of the adjacency relationship. In this work, we take advantage of both inclusion and adjacency information in these representations for computer vision applications. We introduce the spatial alignment graph w.r.t inclusion that is constructed by adding a new adjacency relationship to nodes of the ToS. In a simple ToS such as our Tree of Shapes of Laplacian sign, which encodes the inclusion of Morphological Laplacian 0-crossings, the graph is reduced to a disconnected graph where each connected component is a semantic group. In other cases, e.g., classic ToS, the spatial alignment graph is more complex. To address this issue, we expand the shape-spaces morphology. Our expansion has two primary results: 1)It allows the manipulation of any graph of shapes. 2)It allows any tree filtering strategy proposed by the connected operators frameworks. With this expansion, the spatial graph could be analyzed with the help of an alpha-tree. We demonstrated the application aspect of our method in the application of text detection. The experiment results show the efficiency and effectiveness of our methods, which is appealing to mobile applications
Esteban, Baptiste. « A Generic, Efficient, and Interactive Approach to Image Processing with Applications in Mathematical Morphology ». Electronic Thesis or Diss., Sorbonne université, 2023. http://www.theses.fr/2023SORUS623.
Texte intégralImage processing libraries play an important role in the researcher toolset and should respect three criteria: genericity, performance, and interactivity. In short, genericity boosts code reuse and algorithm flexibility for various data inputs, while performance speeds up experiments and supports real-time applications. Additionally, interactivity allows software evolution and maintenance without full recompilation, often through integration with dynamic languages like Python or Julia. The first two criteria are not straightforward to reach with static languages such as C++ or Rust which require knowing some information at compile time to optimize generated machine code related to the different input and output data types of an algorithm. The latest criterion usually requires waiting until runtime to obtain type information and is thus performed at the cost of runtime efficiency. The work presented in this thesis aims to go beyond this limitation in the context of image processing algorithms. To do so, a methodology to develop generic algorithms whose type information about its input and output data may be known either at compile-time or at runtime is presented. This methodology is evaluated on different image processing algorithmic schemes, and it is concluded that the performance gap between the runtime and compile-time versions of the construction algorithm for hierarchical representations of images is negligible. As an application, hierarchical representations are employed to expand the applicability of grayscale noise level estimation to color images to enhance its genericity. That raises the importance of studying the impact of such corruption in the hierarchies built on noisy images to improve their efficiency in the presence of noise. It is demonstrated that the noise has an impact on the tree structure, and this impact is related to some kinds of functional in the context of energy optimization on hierarchies
Drumetz, Lucas. « Endmember Variability in hyperspectral image unmixing ». Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAT075/document.
Texte intégralThe fine spectral resolution of hyperspectral remote sensing images allows an accurate analysis of the imaged scene, but due to their limited spatial resolution, a pixel acquired by the sensor is often a mixture of the contributions of several materials. Spectral unmixing aims at estimating the spectra of the pure materials (called endmembers) in the scene, and their abundances in each pixel. The endmembers are usually assumed to be perfectly represented by a single spectrum, which is wrong in practice since each material exhibits a significant intra-class variability. This thesis aims at designing unmixing algorithms to better handle this phenomenon. First, we perform the unmixing locally in well chosen regions of the image where variability effects are less important, and automatically discard wrongly estimated local endmembers using collaborative sparsity. In another approach, we refine the abundance estimation of the materials by taking into account the group structure of an image-derived endmember dictionary. Second, we introduce an extended linear mixing model, based on physical considerations, modeling spectral variability in the form of scaling factors, and develop optimization algorithms to estimate its parameters. This model provides easily interpretable results and outperforms other state-of-the-art approaches. We finally investigate two applications of this model to confirm its relevance
Yeh, Hur-jye. « 3-D reconstruction and image encoding using an efficient representation of hierarchical data structure / ». The Ohio State University, 1987. http://rave.ohiolink.edu/etdc/view?acc_num=osu148732651171353.
Texte intégralKeeter, Matthew (Matthew Joseph). « Hierarchical volumetric object representations for digital fabrication workflows ». Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/82426.
Texte intégralCataloged from PDF version of thesis.
Includes bibliographical references (p. 111-114).
Modern systems for computer-aided design and manufacturing (CAD/CAM) have a history dating back to drafting boards, early computers, and machine shops with specialized technicians for each stage in a manufacturing workflow. In recent years, personal-scale digital fabrication has challenged many of these workflows' build-in assumptions. A single individual may control the entire workflow, from design to manufacture; they will be using computers that are exponentially more powerful than those in the 1970s; and they may be using a wide variety of tools, machines, and processes. The variety of tools and machines leads to a combinatorial explosion of possible workflows. In addition, tools are based on boundary representations, which are fragile and can easily describe nonsensical objects. This thesis addresses these issues with a set of tools for end-to-end digital fabrication based on volumetric solid models. Workflows are modular, making it easy to add new machines, and a shared core of path-planning operations reduces system complexity. Replacing boundary representations with volumetric representations guarantees that models represent reasonable real-world solids. Adaptively sampled distance fields are used as a generic interchange format. Functional representations are used as a design representation, and we examine scaling behavior and efficient rendering. We present interactive design tools that use these representations as their geometry engine. Data from CT scans is also used to populate these distance fields, showing significant benefits in file size and resolution compared to meshes. Finally, these representations are used as inputs to a modular multimachine CAM workflow. Toolpath generation is implemented, characterized, and tested on a complex solid model. We conclude with a summary of results and recommendations for future research directions.
by Matthew Keeter.
S.M.
Miflah, Hussain Ismail Ahamed. « Higher-level representations of natural images ». Thesis, Queen Mary, University of London, 2018. http://qmro.qmul.ac.uk/xmlui/handle/123456789/39759.
Texte intégralOn, Vu Ngoc Minh. « A new minimum barrier distance for multivariate images with applications to salient object detection, shortest path finding, and segmentation ». Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS454.
Texte intégralHierarchical image representations are widely used in image processing to model the content of an image in the multi-scale structure. A well-known hierarchical representation is the tree of shapes (ToS) which encodes the inclusion relationship between connected components from different thresholded levels. This kind of tree is self-dual, contrast-change invariant and popular in computer vision community. Typically, in our work, we use this representation to compute the new distance which belongs to the mathematical morphology domain. Distance transforms and the saliency maps they induce are generally used in image processing, computer vision, and pattern recognition. One of the most commonly used distance transforms is the geodesic one. Unfortunately, this distance does not always achieve satisfying results on noisy or blurred images. Recently, a new pseudo-distance, called the minimum barrier distance (MBD), more robust to pixel fluctuation, has been introduced. Some years after, Géraud et al. have proposed a good and fast-to-compute approximation of this distance: the Dahu pseudodistance. Since this distance was initially developed for grayscale images, we propose here an extension of this transform to multivariate images; we call it vectorial Dahu pseudo-distance. This new distance is easily and efficiently computed thanks to the multivariate tree of shapes (MToS). We propose an efficient way to compute this distance and its deduced saliency map in this thesis. We also investigate the properties of this distance in dealing with noise and blur in the image. This distance has been proved to be robust for pixel invariant. To validate this new distance, we provide benchmarks demonstrating how the vectorial Dahu pseudo-distance is more robust and competitive compared to other MB-based distances. This distance is promising for salient object detection, shortest path finding, and object segmentation. Moreover, we apply this distance to detect the document in videos. Our method is a region-based approach which relies on visual saliency deduced from the Dahu pseudo-distance. We show that the performance of our method is competitive with state-of-the-art methods on the ICDAR Smartdoc 2015 Competition dataset
Yang, Yang. « Learning Hierarchical Representations for Video Analysis Using Deep Learning ». Doctoral diss., University of Central Florida, 2013. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/5892.
Texte intégralPh.D.
Doctorate
Electrical Engineering and Computer Science
Engineering and Computer Science
Electrical Engineering
Vij, Madhav. « Hierarchical lattice vector quantisation of wavelet transformed images ». Thesis, University of Cambridge, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.624538.
Texte intégralWhyte, Sophie. « Symmetric generation : permutation images and irreducible monomial representations ». Thesis, University of Birmingham, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.435413.
Texte intégralMeyer, Christina. « War & ; trauma images in Vietnam War representations ». Hildesheim Zürich New York, NY Olms, 2007. http://d-nb.info/991472861/04.
Texte intégralUlrich, Markus. « Hierarchical real-time recognition of compound objects in images ». München : Beck, 2003. http://www.loc.gov/catdir/toc/fy0607/2004457892.html.
Texte intégralNicolov, N. N. « Approximate text generation from non-hierarchical representations in a declarative framework ». Thesis, University of Edinburgh, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.659996.
Texte intégralTimoner, Samson J. (Samson Joshua) 1975. « Compact representations for fast nonrigid registration of medical images ». Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/29950.
Texte intégralIncludes bibliographical references (p. 167-179).
We develop efficient techniques for the non-rigid registration of medical images by using representations that adapt to the anatomy found in such images. Images of anatomical structures typically have uniform intensity interiors and smooth boundaries. We create methods to represent such regions compactly using tetrahedra. Unlike voxel-based representations, tetrahedra can accurately describe the expected smooth surfaces of medical objects. Furthermore, the interior of such objects can be represented using a small number of tetrahedra. Rather than describing a medical object using tens of thousands of voxels, our representations generally contain only a few thousand elements. Tetrahedra facilitate the creation of efficient non-rigid registration algorithms based on finite element methods (FEM). We create a fast, FEM-based method to non-rigidly register segmented anatomical structures from two subjects. Using our compact tetrahedral representations, this method generally requires less than one minute of processing time on a desktop PC. We also create a novel method for the non-rigid registration of gray scale images. To facilitate a fast method, we create a tetrahedral representation of a displacement field that automatically adapts to both the anatomy in an image and to the displacement field. The resulting algorithm has a computational cost that is dominated by the number of nodes in the mesh (about 10,000), rather than the number of voxels in an image (nearly 10,000,000). For many non-rigid registration problems, we can find a transformation from one image to another in five minutes. This speed is important as it allows use of the algorithm during surgery.
(cont.) We apply our algorithms to find correlations between the shape of anatomical structures and the presence of schizophrenia. We show that a study based on our representations outperforms studies based on other representations. We also use the results of our non-rigid registration algorithm as the basis of a segmentation algorithm. That algorithm also outperforms other methods in our tests, producing smoother segmentations and more accurately reproducing manual segmentations.
by Samson J. Timoner.
Ph.D.
CHATER, ABDELHAFID. « Images et representations maitre-eleve a l'ecole primaire marocaine ». Université Marc Bloch (Strasbourg) (1971-2008), 1992. http://www.theses.fr/1992STR20015.
Texte intégralEven through the present study can be understood within a broad 9contribution framework related to the study of the teacher-pupil relation ship, we have especialy considered both the pupil's image of his teacher and this latter's personal representation of that image. As perceived by pupil, we have tried to know if the moroccah pupil gives more importance to the human and relational qualities the practical purpose of the investigation has been to analyze the pupil's image of their teacher, to study any possible variables which may influence the elaboration of that image and finally define the foregone expectations. As to our inquiry on teachers, it concerns attitudes, expectations of the teacher-pupil relationship as well as their representations pf the teacher's role given the multidimensionality of representation as a notion. By and large, the inquiry on teachers has two aims; the first consisted in pinning down the kind of relations to which the teacher's discourse is committed the second has been to specify the image that both have of themselves
Høvik, Ingeborg. « Arctic images 1818-1859 ». Thesis, University of Edinburgh, 2013. http://hdl.handle.net/1842/12261.
Texte intégralCosmas, John Paul. « The generation of 3-dimensional object representations from range images ». Thesis, Imperial College London, 1988. http://hdl.handle.net/10044/1/47007.
Texte intégralCichocki, Radoslaw. « Classification of objects in images based on various object representations ». Thesis, Blekinge Tekniska Högskola, Avdelningen för programvarusystem, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-5774.
Texte intégralMail the author at radoslaw.cichocki(at)gmail.com
Penn, Gemma Louise. « Medicalization and representations of smoking in public discourse and images ». Thesis, London School of Economics and Political Science (University of London), 1998. http://etheses.lse.ac.uk/1503/.
Texte intégralChongburee, Wachira. « Implementation of Iterative Reconstruction of Images from Multiple Bases Representations ». Thesis, Virginia Tech, 1998. http://hdl.handle.net/10919/35379.
Texte intégralIn this thesis, test images are distorted by MBR compression using a Recursive Residual Projection algorithm. This algorithm is a sub-optimal method to find the best basis vector subset for representing images based on multiple orthogonal bases. The MBR distorted images are reconstructed by the iterative method of Projection onto Convex Sets (POCS). Many constraints that form convex sets are reviewed and examined.
Due to the high distortion at the block boundaries, some constraints are introduced particularly to reduce artifacts at the boundaries. Some constraints add energy to the reconstructed images while others remove energy. Thus, the initial vectors play a key role in the performance of the POCS method for better MBR reconstruction. This thesis also determines the most appropriate initial vector for each constraint.
Finally, the composite projections associated with the sign, minimum decreasing and norm-of-slope constraints are used to improve the reconstruction of the MBR distorted images and the effect of ordering of the projections is investigated.
Master of Science
Truong, Kwan K. « Vector quantizer design for images and video based on hierarchical structures ». Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/13266.
Texte intégralSelvan, A. D. Arul Nirai. « Highlighting dissimilarity in medical images using hierarchical clustering based segmentation (HCS) ». Thesis, Sheffield Hallam University, 2007. http://shura.shu.ac.uk/20342/.
Texte intégralWestwell, Guy. « History-in-images/images in history : American cultural memory and film representations of the Vietnam War ». Thesis, University of Glasgow, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.340278.
Texte intégralHilliard, Kristina Marie. « Images of a Gendered Kingship : Visual Representations of Hatshepsut and Her Influence on Images of Nefertiti ». Thesis, University of North Texas, 2006. https://digital.library.unt.edu/ark:/67531/metadc5323/.
Texte intégralFarber, Lee. « Symmetric generation of finite homomorphic images ? » CSUSB ScholarWorks, 2005. https://scholarworks.lib.csusb.edu/etd-project/2901.
Texte intégralGoh, Hanlin. « Learning deep visual representations ». Paris 6, 2013. http://www.theses.fr/2013PA066356.
Texte intégralRecent advancements in the areas of deep learning and visual information processing have presented an opportunity to unite both fields. These complementary fields combine to tackle the problem of classifying images into their semantic categories. Deep learning brings learning and representational capabilities to a visual processing model that is adapted for image classification. This thesis addresses problems that lead to the proposal of learning deep visual representations for image classification. The problem of deep learning is tackled on two fronts. The first aspect is the problem of unsupervised learning of latent representations from input data. The main focus is the integration of prior knowledge into the learning of restricted Boltzmann machines (RBM) through regularization. Regularizers are proposed to induce sparsity, selectivity and topographic organization in the coding to improve discrimination and invariance. The second direction introduces the notion of gradually transiting from unsupervised layer-wise learning to supervised deep learning. This is done through the integration of bottom-up information with top-down signals. Two novel implementations supporting this notion are explored. The first method uses top-down regularization to train a deep network of RBMs. The second method combines predictive and reconstructive loss functions to optimize a stack of encoder-decoder networks. The proposed deep learning techniques are applied to tackle the image classification problem. The bag-of-words model is adopted due to its strengths in image modeling through the use of local image descriptors and spatial pooling schemes. Deep learning with spatial aggregation is used to learn a hierarchical visual dictionary for encoding the image descriptors into mid-level representations. This method achieves leading image classification performances for object and scene images. The learned dictionaries are diverse and non-redundant. The speed of inference is also high. From this, a further optimization is performed for the subsequent pooling step. This is done by introducing a differentiable pooling parameterization and applying the error backpropagation algorithm. This thesis represents one of the first attempts to synthesize deep learning and the bag-of-words model. This union results in many challenging research problems, leaving much room for further study in this area
Amorós, Carafí Laia. « Images of Galois representations and p-adic models of Shimura curves ». Doctoral thesis, Universitat de Barcelona, 2016. http://hdl.handle.net/10803/471452.
Texte intégralAbraham, Christiana. « Images of third world women : difference and disjuncture in development representations ». Thesis, McGill University, 2008. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=18780.
Texte intégralRésumé Les Images des Femmes du Tiers Monde: Différence et Rupture dans les Représentations du Développement Cette thèse analyse l'usage des images des femmes du Tiers Monde par l'Agence Canadienne de Développement International (ACDI) durant la période 'Les Femmes dans le Développement' (FED). Cette analyse interprétative critique examine comment ces images, - en tant que textes institutionnels -, fonctionnent pour reproduire les notions de différence à propos des femmes et du Tiers Monde. Cette étude se penche sur la rupture entre le langage et les images du développement et analyse la manière dont les messages médiatiques véhiculent les discours relativement au genre par le truchement de formes résiduelles de savoirs colonial et racisé en tant que moyens normalisés de classifier le monde par l'entremise de catégories imaginaires. Cette étude suggère que, par l'entremise de catégories représentatives récurrentes, l'époque FED facilita la production délibérée d'une figure du développement fortement identifiable - celle de la femme du Tiers Monde. Cette tendance à cibler les femmes a permis à ces images d'assurer une immense valeur véhiculaire dans l'imaginaire du développement de l'ACDI, de sorte que ces images des femmes du Tiers Monde sont devenues elles-mêmes représentatives du développement. Fonctionnant comme systèmes de signes, ces images des femmes du Tiers Monde ont également opérés comme d'importants symboles de la singularité des valeurs canadiennes. Cette étude fournit un cadre pour comprendre les représentations du développement en tant que systèmes de signes puissants qui priorisent et hiérarchisent les préférences narratives.
Lindohf, Jessica Malin. « Images of the end : representations of the apocalyptic in contemporary film ». Thesis, University of Glasgow, 2002. http://theses.gla.ac.uk/3104/.
Texte intégralFenwick, Melissa E. « Reel Images : Representations of Adult Male Prisons by the Film Industry ». Scholar Commons, 2009. https://scholarcommons.usf.edu/etd/1962.
Texte intégralSchick, Wiebke [Verfasser], et Hanspeter A. [Akademischer Betreuer] Mallot. « Acquisition and consolidation of hierarchical representations of space / Wiebke Schick ; Betreuer : Hanspeter A. Mallot ». Tübingen : Universitätsbibliothek Tübingen, 2018. http://d-nb.info/1168634679/34.
Texte intégralTzanoudaki, Stephany. « The transition of the Olympic city from visual representations Of Coubertin's modern ideal to city representations as fashionable images ». Thesis, University of Edinburgh, 2011. http://hdl.handle.net/1842/9380.
Texte intégralEl-Harby, Ahmed Ahmed Abd El-Fattah. « Automatic extraction of vector representations of line features from remotely sensed images ». Thesis, Keele University, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.344096.
Texte intégralWaldroup, Heather Leigh. « Traveling images : representations of the south pacific from colonial and postcolonial worlds / ». Diss., Digital Dissertations Database. Restricted to UC campuses, 2004. http://uclibs.org/PID/11984.
Texte intégralLeyk, Williams Malgorzata. « Summarizing FLARE assay images in colon carcinogenesis ». Texas A&M University, 2004. http://hdl.handle.net/1969.1/3132.
Texte intégralDunn, David Richard. « Home truths from abroad : television representations of the tourist destination ». Thesis, University of Birmingham, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.343895.
Texte intégralXu, Shanna, et Pengzhan You. « Western images of China : media representations of Chinese attempts to invest in Saab ». Thesis, Högskolan Väst, Institutionen för ekonomi och it, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:hv:diva-4390.
Texte intégralSullivan, Sandra Jean. « Representations of Mary of Modena, Duchess, Queen Consort and exile : images and texts ». Thesis, University College London (University of London), 2008. http://discovery.ucl.ac.uk/1349620/.
Texte intégralBülow, Thomas [Verfasser]. « Hypercomplex Spectral Signal Representations for the Processing and Analysis of Images / Thomas Bülow ». Kiel : Universitätsbibliothek Kiel, 1999. http://d-nb.info/1080332537/34.
Texte intégralFrappart, Virginie. « La mise en mots de la ville contemporaine, representations et images de nantes ». Nantes, 2001. http://www.theses.fr/2001NANT3001.
Texte intégralFrey, Nathan J. « Hierarchical Latent Networks for Image and Language Correlation ». Ohio University / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1320847134.
Texte intégralLynn, Jennifer M. Hagemann Karen. « Contesting images representations of the Modern Woman in the German illustrated press, 1924-1933 / ». Chapel Hill, N.C. : University of North Carolina at Chapel Hill, 2008. http://dc.lib.unc.edu/u?/etd,1536.
Texte intégralTitle from electronic title page (viewed Sep. 16, 2008). "... in partial fulfillment of the requirements for the degree of Masters of Arts in the Department of History." Discipline: History; Department/School: History.
KALDRIMIDOU, MARIA. « Images mentales et representations en mathematiques chez des mathematiciens et des etudiants en mathematiques ». Paris 7, 1987. http://www.theses.fr/1987PA077297.
Texte intégralChen, Chia-Hwan. « Images of the other, images of the self : reciprocal representations of the British and the Chinese from the 1750s to the 1840s ». Thesis, University of Warwick, 2007. http://wrap.warwick.ac.uk/63281/.
Texte intégralBosilj, Petra. « Image indexing and retrieval using component trees ». Thesis, Lorient, 2016. http://www.theses.fr/2016LORIS396/document.
Texte intégralThis thesis explores component trees, hierarchical structures from Mathematical Morphology, and their application to image retrieval and related tasks. The distinct component trees are analyzed and a novel classification into two superclasses is proposed, as well as a contribution to indexing and representation of the hierarchies using dendrograms. The first contribution to the field of image retrieval is in developing a novel feature detector, built upon the well-established MSER detection. The tree-based implementation of the MSER detector allows for changing the underlying tree in order to produce features of different stability properties. This resulted in the Tree of Shapes based Maximally Stable Region detector, leading to improvements over MSER in retrieval performance. Focusing on feature description, we extend the concept of 2D pattern spectra and adapt their global variant to more powerful, local schemes. Computed on the components of Min/Max-tree, they are histograms holding the information on distribution of image region attributes. The rotation and translation invariance is preserved from the global descriptor, while special attention is given to achieving scale invariance. We report comparable results to SIFT in image classification, as well as outperforming Morphology-based descriptors in satellite image retrieval, with a descriptor shorter than SIFT. Finally, a preprocessing or simplification technique for component trees is also presented, allowing the user to reevaluate the measures of region level of aggregation imposed on a component tree. The thesis is concluded by outlining the future perspectives based on the content of the thesis
Garrido, Ostermann Luís. « Hierarchical region based processing of images and video sequences : application to filtering, segmentation and information retrieval ». Doctoral thesis, Universitat Politècnica de Catalunya, 2002. http://hdl.handle.net/10803/6878.
Texte intégralSe han desarrollado dos representaciones basadas en árboles: el Árbol de Máximos, y el Árbol de Particiones Binario. El Árbol de Máximos estructura de forma compacta las componentes conexas que surgen de todos los posibles conjuntos de niveles de una imagen de nivel de gris. Es una representación adecuada para la implementación de operadores conexos antiextensivos, desde operadores clásicos (por ejemplo, filtro de área) hasta operadores nuevos (como el filtro de movimiento desarrollado en este trabajo). El Árbol de Particiones Binario estructura el conjunto de regiones que se obtiene durante la ejecución de un algoritmo de fusión basado en regiones. Desarrollado para superar alguno de los inconvenientes impuestos por el árbol de Máximos -- en particular la falta de flexibilidad de la creación del árbol y la auto-dualidad de la representación del árbol --, ha demostrado ser una representación apta para un gran número de aplicaciones, tal y como se muestra en este trabajo.
Las estrategias de procesado se basan en técnicas de poda. Las técnicas de poda eliminan algunas ramas del árbol basándose en un algoritmo de análisis aplicado a los nodos del árbol. Las técnicas de poda aplicadas al árbol de Máximos permiten obtener operadores anti-extensivos, mientras que para el caso del árbol de Particiones Binario se obtienen operadores auto-duales si éste ha sido creado de forma auto-dual. Las técnicas de poda desarrolladas en este trabajo están dirigidas hacia las siguiente aplicaciones: filtrado, segmentación y recuperación de datos basada en el contenido.
Las aplicaciones de filtrado (en el contexto de los operadores conexos) y segmentación están basados en el mismo principio: los nodos del árbol son analizados de acuerdo a un criterio determinado, y la decisión de eliminar o preservar un nodo se basada normalmente en un umbral aplicado sobre la anterior medida del criterio. La poda se realiza entonces de acuerdo con la ésta decisión. Como resultado, la imagen asociada al árbol podado representa una versión filtrada o segmentada de la imagen original de acuerdo con el criterio seleccionado. Alguno de los criterios discutidos en este trabajo están basados, por ejemplo, en área, movimiento, marcador & propagación o una estrategia de tasa-distorsión. El problema de la falta de robustez de las estrategias clásicas para criterios no crecientes es estudiado y solucionado gracias a un algoritmo de optimización basado en el algoritmo de Viterbi.
La recuperación de imágenes basada en el contenido es la tercera aplicación en la que nos hemos centrado en este trabajo. Las representaciones jerárquicas basadas en regiones son particularmente adecuadas para este propósito ya que permiten representar la imagen a diferentes escalas de resolución, y por lo tanto las regiones asociadas a una imagen pueden ser descritas a diferentes escalas de resolución. En este trabajo nos centramos en un sistema de recuperación de imágenes que soporta preguntas de bajo nivel basadas en descriptores visuales y relaciones espaciales. Para ello, se adjuntan descriptores de región a los nodos del árbol. Se discuten dos tipos de preguntas: pregunta basada en una región, en el que la pregunta esta formada por una región, y pregunta basada en múltiples regiones, en el que la pregunta esta formada por un conjunto de regiones. En el primero la recuperación se realiza utilizando descriptores visuales, mientras que en el segundo se utilizan descriptores visuales y relaciones espaciales. Además, se presenta una estrategia de realimentación por relevancia para eludir la necesidad de establecer manualmente el peso asociado a cada uno de los descriptores.
Un aspecto importante que se ha tenido en cuenta a lo largo de este trabajo es la implementación eficiente de los algoritmos desarrollados tanto para la creación como el procesado del árbol. En el caso de la creación del árbol, la eficiencia se obtiene principalmente gracias al uso de colas jerárquicas, mientras que en el procesado se utilizan algoritmos basados en estrategias recursivas para obtener algoritmos eficientes.
This work discusses the usefulness of hierarchical region based representations for image and video processing. Region based representations offer a way to perform a first level of abstraction and reduce the number of elements to process with respect to the classical pixel based representation. In this work the two representations that have demonstrated to be useful for region based processing are reviewed, namely region adjacency graphs and trees, and it is discussed why tree based representations are better suited for our purpose. In fact, trees allow representing the image in a hierarchical way and efficient and complex processing techniques can be applied on it. Two major issues are discussed in this work: how the hierarchical representation may be created from a given image and how the tree may be manipulated or processed.
Two tree based representations have been developed: the Max-Tree, and the Binary Partition Tree. The Max-Tree structures in a compact way the connected components that arise from all possible level sets from a gray-level image. It is suitable for the implementation of anti-extensive connected operators, ranging from classical ones (for instance, area filter) to new ones (such as the motion filter developed in this work). The Binary Partition Tree structures the set of regions that are obtained during the execution of a region merging algorithm. Developed to overcome some of the drawbacks imposed by the Max-Tree -- in particular the lack of flexibility of the tree creation and the self-duality of the tree representation --, it has demonstrated to be a representation useful for a rather large range of applications, as it is shown in this work.
Processing strategies are focused on pruning techniques. Pruning techniques remove some of the branches of the tree based on an analysis algorithm applied on the nodes of the tree. Pruning techniques applied on the Max-Tree lead to anti-extensive operators, whereas self-dual operators are obtained on the Binary Partition Tree, if the tree is created in a self-dual manner. The pruning techniques that have been developed in this work are directed to the following applications: filtering, segmentation and content based image retrieval.
The filtering (in the context of connected operators) and segmentation applications are based on the same principle: the nodes of the tree are analyzed according to a fixed criterion, and the decision to remove or preserve a node usually relies on a threshold applied on the former measured criterion. Pruning is then performed according to the previous decision. As a result, the image associated to the pruned tree represents a filtered or segmented version of the original image according to the selected criterion. Some of the criteria that are discussed in this work are based, for instance, on area, motion, marker & propagation or a rate-distortion strategy. The problem of the lack of robustness of classical decision approaches of non-increasing criteria is discussed and solved by means of an optimization strategy based on the Viterbi algorithm.
Content based image retrieval is the third application we have focused on in this work. Hierarchical region based representations are particularly well suited for this purpose since they allow to represent the image at different scales of resolution, and thus the regions of the image can be described at different scales of resolution. In this work we focus on an image retrieval system which supports low level queries based on visual descriptors and spatial relationships. For that purpose, region descriptors are attached to the nodes of the tree. Two types of queries are discussed: single region query, in which the query is made up of one region and, multiple region query, in which the query is made up of a set of regions. In the former visual descriptors are used to perform the retrieval whereas visual descriptors and spatial relationships are used in the latter case. Moreover, a relevance feedback approach is presented to avoid the need of manually setting the weights associated to each descriptor.
An important aspect that has been taken into account throughout this work is the efficient implementation of the algorithms that have been developed for both creation and processing of the tree. In the case of the tree creation, efficiency has been obtained mainly due to the use of hierarchical queues, whereas in the processing step analysis algorithms based on recursive strategies are used to get efficient algorithms.