Due to the natural, non-intrusive, easily collectible, widespread applicability, machine-based face recognition has received significant attention from the biometrics community over the past three decades. Compared with traditional appearance-based (2D) face recognition, shape-based (3D) face recognition is more stable to illumination variations, small head pose changes, and varying facial cosmetics. However, 3D face scans captured in unconstrained conditions may lead to various difficulties, such as non-rigid deformations caused by varying expressions, data missing due to self occlusions and external occlusions, as well as low-quality data as a result of some imperfections in the scanning technology. In order to deal with those difficulties and to be useful in real-world applications, in this thesis, we propose two 3D face recognition approaches: one is focusing on handling various expression changes, while the other one can recognize people in the presence of large facial expressions, occlusions and large pose various. In addition, we provide a provable and practical surface meshing algorithm for data-quality improvement. To deal with expression issue, we assume that different local facial region (e.g. nose, eyes) has different intra-expression/inter-expression shape variability, and thus has different importance. Based on this assumption, we design a learning strategy to find out the quantification importance of local facial regions in terms of their discriminating power. For facial description, we propose a novel shape descriptor by encoding the micro-structure of multi-channel facial normal information in multiple scales, namely, Multi-Scale and Multi-Component Local Normal Patterns (MSMC-LNP). It can comprehensively describe the local shape changes of 3D facial surfaces by a set of LNP histograms including both global and local cues. For face matching, Weighted Sparse Representation-based Classifier (W-SRC) is formulated based on the learned quantification importance and the LNP histograms. The proposed approach is evaluated on four databases: the FRGC v2.0, Bosphorus, BU-3DFE and 3D-TEC, including face scans in the presence of diverse expressions and action units, or several prototypical expressions with different intensities, or facial expression variations combine with strong facial similarities (i.e. identical twins). Extensive experimental results show that the proposed 3D face recognition approach with the use of discriminative facial descriptors can be able to deal with expression variations and perform quite accurately over all databases, and thereby has a good generalization ability. To deal with expression and data missing issues in an uniform framework, we propose a mesh-based registration free 3D face recognition approach based on a novel local facial shape descriptor and a multi-task sparse representation-based face matching process. [...]

Proteins and the formation of large protein complexes are essential parts of living organisms. Proteins are present in all aspects of life processes, performing a multitude of various functions ranging from being structural components of cells, to facilitating the passage of certain molecules between various regions of cells. The 'protein docking problem' refers to the computational method of predicting the appropriate matching pair of a protein (receptor) with respect to another protein (ligand), when attempting to bind to one another to form a stable complex. Research shows that matching the three-dimensional (3D) geometric structures of candidate proteins plays a key role in determining a so-called docking pair, which is one of the key aspects of the Computer Aided Drug Design process. However, the active sites which are responsible for binding do not always present a rigid-body shape matching problem. Rather, they may undergo sufficient deformation when docking occurs, which complicates the problem of finding a match. To address this issue, we present an isometry-invariant and topologically robust partial shape matching method for finding complementary protein binding sites, which we call the ProtoDock algorithm. The ProtoDock algorithm comes in two variations. The first version performs a partial shape complementarity matching by initially segmenting the underlying protein object mesh into smaller portions using a spectral mesh segmentation approach. The Heat Kernel Signature (HKS), the underlying basis of our shape descriptor, is subsequently computed for the obtained segments. A final descriptor vector is constructed from the Heat Kernel Signatures and used as the basis for the segment matching. The three different descriptor methods employed are, the accepted Bag of Features (BoF) technique, and our two novel approaches, Closest Medoid Set (CMS) and Medoid Set Average (MSA). The second variation of our ProtoDock algorithm aims to perform the partial matching by utilizing the pointwise HKS descriptors. The use of the pointwise HKS is mainly motivated by the suggestion that, at adequate times, the Heat Kernel Signature of a point on a surface sufficiently describes its neighbourhood. Hence, the HKS of a point may serve as the representative descriptor of its given region of which it forms a part. We propose three (3) sampling methods---Uniform, Random, and Segment-based Random sampling---for selecting these points for the partial matching. Random and Segment-based Random sampling both prove superior to the Uniform sampling method. Our experimental results, run against the Protein-Protein Benchmark 4.0, demonstrate the viability of our approach, in that, it successfully returns known binding segments for known pairing proteins. Furthermore, our ProtoDock-1 algorithm still still yields good results for low resolution protein meshes. This results in even faster processing and matching times with sufficiently reduced computational requirements when obtaining the HKS.

Recently, very large collections of images and videos have grown rapidly. In parallel with this growth, content-based retrieval and querying the indexed collections are required to access visual information. Three main components of the visual information are color, texture and shape. In this thesis, an XML based content-based image retrieval system is presented that combines three visual descriptors of MPEG-7 and measures similarity of images by applying a distance function. An XML database is used for storing these three descriptors. The system is also extended to support high dimensional indexing for efficient search and retrieval from its XML database. To do this, an index structure, called M-Tree, is implemented which uses weighted Euclidean distance function for similarity measure. Ordered Weighted Aggregation (OWA) operators are used to define the weights of the distance function and to combine three features&rsquo / distance functions into one. The system supports nearest neighbor queries and three types of fuzzy queries / feature-based, image-based and color-based queries. Also it is shown through experimental results and analysis of retrieval effectiveness of querying that the content-based retrieval system is effective in terms of retrieval and scalability.

The Comenius Network Project “Developing Quality in Mathematics Education II” funded by the European Commission consists of partners from schools, universities and teacher training centres from eleven European countries. One advantage of the project is the mutual exchange between teachers, teacher trainers and researchers in developing learning material. To support the teachers most effectively the researchers asked the teachers what they wanted the researchers to do. The answer was also a question: How can we identify (good) modelling tasks? A discussion ensued in the research group of this project which resulted in a list of descriptors characterising modelling tasks. This paper focuses on the theoretical background of mathematical modelling and will thereby substantiate the list of descriptors for modelling tasks.

Aquesta tesi versa sobre la classificació automàtica de gèneres musicals, basada en l'anàlisi del contingut del senyal d'àudio, plantejant-ne els problemes i proposant solucions. Es proposa un estudi de la classificació de gèneres musicals des del punt de vista computacional però inspirat en teories dels camps de la musicologia i de la percepció. D'aquesta manera, els experiments presentats combinen diferents elements que influeixen en l'encert o fracàs de la classificació, com ara els descriptors d'àudio, les tècniques d'aprenentatge, etc. L'objectiu és avaluar i comparar els resultats obtinguts d'aquests experiments per tal d'explicar els límits d'encert dels algorismes actuals, i proposar noves estratègies per tal de superar-los. A més a més, partint del processat de la informació d'àudio, s'inclouen aspectes musicals i culturals referents al gènere que tradicionalment no han estat tinguts en compte en els estudis existents. En aquest context, es proposa l'estudi de diferents famílies de descriptors d'àudio referents al timbre, ritme, tonalitat o altres aspectes de la música. Alguns d'aquests descriptors són proposats pel propi autor mentre que d'altres ja són perfectament coneguts. D'altra banda, també es comparen les tècniques d'aprenentatge artificial que s'usen tradicionalment en aquest camp i s'analitza el seu comportament davant el nostre problema de classificació. També es presenta una discussió sobre la seva capacitat per representar els diferents models de classificació proposats en el camp de la percepció. Els resultats de la classificació es comparen amb un seguit de tests i enquestes realitzades sobre un conjunt d'individus. Com a resultat d'aquesta comparativa es proposa una arquitectura específica de classificadors que també està raonada i explicada en detall. Finalment, es fa un especial èmfasi en comparar resultats dels classificadors automàtics en diferents escenaris que pressuposen la barreja de bases de dades, la comparació entre bases de dades grans i petites, etc. A títol de conclusió, es mostra com l'arquitectura de classificació proposada, justificada pels resultats dels diferents anàlisis, pot trencar el límit actual en tasques de classificació automàtica de gèneres musicals. De manera condensada, es pot dir que aquesta tesi contribueix al camp de la classificació de gèneres musicals en els següents aspectes: a) Proporciona una revisió multidisciplinar delsgèneres musicals i la seva classificació; b)Presenta una avaluació qualitativa i quantitativa de les famílies de descriptors d'àudio davant el problema de la classificació de gèneres; c) Avalua els pros i contres de les diferents tècniques d'aprenentatge artificial davant el gènere; d) Proposa una arquitectura nova de classificador d'acord amb una visió interdisciplinar dels gèneres musicals; e) Analitza el comportament de l'arquitecturaproposada davant d'entorns molt diversos en el que es podria implementar el classificador. / Esta tesis estudia la clasificación automática degéneros musicales, basada en el análisis delcontenido de la señal de audio, planteando sus problemas y proponiendo soluciones. Sepropone un estudio de la clasificación de los géneros musicales desde el punto de vista computacional, pero inspirado en teorías de los campos de la musicología y la percepción. De este modo, los experimentos persentados combinan distintos elementos que influyen en el acierto o fracaso de la clasificación, como por ejemplo los descriptores de audio, las técnicas de aprondiza je, etc. El objetivo es comparar y evaluar los resultados obtenidos de estos experimentos para explicar los límites de las tasas de acierto de los algorismos actuales, y proponer nuevas estrategias para superarlos. Además, partiendo del procesado de la información de Audio, se han incluido aspectos musicales y culturales al género que tradicionalmente no han sido tomados en cuenta en los estudios existentes. En este contexto, se propone el estudio de distintas famílias de descriptores de audio referentes al timbre, al ritmo, a la tonalidad o a otros aspectos de la música. Algunos de los descriptores son propuestos por el mismo autor, mientras que otros son perfectamente conocidos. Por otra parte, también se comparan las técnicas de aprendiza je artificial que se usan tradicionalmente, y analizamos su comportamiento en frente de nuestro problema de clasificación. Tambien planteamos una discusión sobre su capacidad para representar los diferentes modelos de clasificación propuestos en el campo de la percepción. Estos resultados de la clasificación se comparan con los resultados de unos tests y encuestas realizados sobre un conjunto de individuos. Como resultado de esta comparativa se propone una arquitectura específica de clasificadores que tambien está razonada y detallada en el cuerpo de la tesis. Finalmente, se hace un émfasis especial en comparar los resultados de los clasificadores automáticos en distintos escenarios que assumen la mezcla de bases de datos, algunas muy grandes y otras muy pequeñas, etc. Como conclusión, mostraremos como la arquitectura de clasificación propuesta permite romper el límite actual en el ámbito de la classificación automática de géneros musicales.De forma condensada, se puede decir que esta tesis contribuye en el campo de la clasificación de los géneros musicales el los siguientes aspectos: a) Proporciona una revisión multidisciplinar de los géneros musicales y su clasificación; b) Presenta una evaluación cualitativa y cuantitativa de las famílias de descriptores de audio para la clasificación de géneros musicales; c) Evalua los pros y contras de las distintas técnicas de aprendiza je artificial delante del género; d) Propone una arquitectura nueva del clasificador de acuerdo con una visión interdisciplinar de los géneros musicales; e) Analiza el comportamiento de la arquitectura propuesta delante de entornos muy diversos en los que se podria implementar el clasificador. / This dissertation presents, discusses, and sheds some light on the problems that appear when computers try to automatically classify musical genres from audio signals. In particular, a method is proposed for the automatic music genre classification by using a computational approach that is inspired in music cognition and musicology in addition to Music Information Retrieval techniques. In this context, we design a set of experiments by combining the different elements that may affect the accuracy in the classification (audio descriptors, machine learning algorithms, etc.). We evaluate, compare and analyze the obtained results in order to explain the existing glass-ceiling in genre classification, and propose new strategies to overcome it. Moreover, starting from the polyphonic audio content processing we include musical and cultural aspects of musical genre that have usually been neglected in the current state of the art approaches. This work studies different families of audio descriptors related to timbre, rhythm, tonality and other facets of music, which have not been frequently addressed in the literature. Some of these descriptors are proposed by the author and others come from previous existing studies. We also compare machine learning techniques commonly used for classification and analyze how they can deal with the genre classification problem. We also present a discussion on their ability to represent the different classification models proposed in cognitive science. Moreover, the classification results using the machine learning techniques are contrasted with the results of some listening experiments proposed. This comparison drive us to think of a specific architecture of classifiers that will be justified and described in detail. It is also one of the objectives of this dissertation to compare results under different data configurations, that is, using different datasets, mixing them and reproducing some real scenarios in which genre classifiers could be used (huge datasets). As a conclusion, we discuss how the classification architecture here proposed can break the existing glass-ceiling effect in automatic genre classification. To sum up, this dissertation contributes to the field of automatic genre classification: a) It provides a multidisciplinary review of musical genres and its classification; b) It provides a qualitative and quantitative evaluation of families of audio descriptors used for automatic classification; c) It evaluates different machine learning techniques and their pros and cons in the context of genre classification; d) It proposes a new architecture of classifiers after analyzing music genre classification from different disciplines; e) It analyzes the behavior of this proposed architecture in different environments consisting of huge or mixed datasets.

Video editing and object recognition are two significant fields in computer vi- sion: the first has remarkably assisted digital production and post-production tasks of a digital video footage; the second is considered fundamental to image classification or image based search in large databases (e.g. the web). In this thesis, we address two problems, namely we present a novel formulation that tackles video editing tasks and we develop a mechanism that allows to generate more robust descriptors for objects in an image. Concerning the first problem, this thesis proposes two variational models to perform temporally coherent video editing. These models are applied to change an object’s (rigid or non-rigid) texture throughout a given video sequence. One model is based on propagating color information from a given frame (or be- tween two given frames) along the motion trajectories of the video; while the other is based on propagating gradient domain information. The models we present in this thesis require minimal user intervention and they automatically accommodate for illumination changes in the scene. Concerning the second problem, this thesis addresses the problem of affine invariance in object recognition. We introduce a way to generate geometric affine invariant quantities that are used in the construction of feature descrip- tors. We show that when these quantities are used they do indeed achieve a more robust recognition than the state of the art descriptors. i / La edición de vídeo y el reconocimiento de objetos son dos áreas fundamentales en el campo de la visión por computador: la primera es de gran utilidad en los procesos de producción y post-producción digital de vídeo; la segunda es esencial para la clasificación o búsqueda de imágenes en grandes bases de datos (por ejemplo, en la web). En esta tesis se acometen ambos problemas, en concreto, se presenta una nueva formulación que aborda las tareas de edición de vídeo y se desarrolla un mecanismo que permite generar descriptores más robustos para los objetos de la imagen. Con respecto al primer problema, en esta tesis se proponen dos modelos variacionales para llevar a cabo la edición de vídeo de forma coherente en el tiempo. Estos modelos se aplican para cambiar la textura de un objeto (rígido o no) a lo largo de una secuencia de vídeo dada. Uno de los modelos está basado en la propagación de la información de color desde un determinado cuadro de la secuencia de vídeo (o entre dos cuadros dados) a lo largo de las trayectorias de movimiento del vídeo. El otro modelo está basado en la propagación de la información en el dominio del gradiente. Ambos modelos requieren una intervención mínima por parte del usuario y se ajustan de manera automática a los cambios de iluminación de la escena. Con respecto al segundo problema, esta tesis aborda el problema de la invariancia afín en el reconocimiento de objetos. Se introduce un nuevo método para generar cantidades geométricas afines que se utilizan en la generación de descriptores de características. También se demuestra que el uso de dichas cantidades proporciona mayor robustez al reconocimiento que los descriptores existentes actualmente en el estado del arte.

Το αντικείμενο της μελέτης αυτής είναι η οργάνωση (ταξινόμηση, αναγνώριση, ανάκτηση κλπ.) βάσεων που περιλαμβάνουν εικόνες (φωτογραφίες) φύλλων δένδρων. Η οργάνωση βασίζεται στο σχήμα των φύλλων και περιλαμβάνει διάφορα στάδια. Το πρώτο στάδιο είναι η εξαγωγή του περιγράμματος και γίνεται με διαδικασίες επεξεργασίας εικόνας που περιλαμβάνουν τεχνικές ομαδοποίησης και κατάτμησης. Από το περίγραμμα του φύλλου εξάγονται χαρακτηριστικά που δίνουν την δυνατότητα αξιόπιστης περιγραφής κάθε φύλλου. Μελετήθηκαν στη διατριβή αυτή οι παρακάτω γνωστές μέθοδοι: Centroid Contour Distance, Angle code (histogram), Chain Code Fourier Descriptors. Προτάθηκαν επίσης και καινούριες μέθοδοι: Pecstrum (pattern spectrum), Multidimension Sequence Similarity Measure (MSSM). Οι παραπάνω μέθοδοι υλοποιήθηκαν. Παράχθηκε κατάλληλο λογισμικό και εφαρμόσθηκαν σε μία βάση εικόνων φύλλων επιλεγμένη από το διαδίκτυο. Η αξιολόγηση των μεθόδων έγινε μέσα από έλεγχο της συνολικής ακρίβειας κατηγοριοποίησης (με τον confusion matrix). H μέθοδος MSSM έδωσε τα καλύτερα αποτελέσματα. Μία οπτική αξιολόγηση έγινε σε αναπαράσταση 2 διαστάσεων (biplot) μέσα απο διαδικασία Multidimensional Scaling. / The objective of this thesis is the leaf images data base organization (i.e classification, recognition, retrieval etc.). The database organization is based on the leaf shape and is accomplished in a few stages. The contour recognition and recording consist the first stage and is performed with image processing operations namely clustering and segmentation. From the leaf contour several features are extracted appropriate for a reliable description of each leaf type. The following well known techniques were studied in this thesis: Centroid Contour Distance, Angle code (histogram), Chain Code, Fourier Descriptors. Two new metods were also proposed: Pecstrum (pattern spectrum), Multidimension Sequence Similarity Measure. In the experimental study appropriate software was produced to realize all the above methods which was applied to the leaf data base downloaded from internet. The overall evaluation of the methods was done by means of the classification in precision and using the confusion matrix. Best results were produced by the MSSM method.

Au cours des dernières années, innombrables produits ont été conçus en utilisant des modèles numériques 3D, où les courants logiciels pour la conception et le dessin technique utilisent des modèles CAO (Conception Assistée par Ordinateur). Ces logiciels sont utilisés dans de nombreux domaines, tels que l'automobile, la marine, l'aérospatiale et plus encore. À l'intérieur de d'une entreprise qui utilise ces systèmes, il est possible d'avoir accès à des modèles CAO de produits déjà développés puisque la conception de nouveaux produits fait souvent référence à des modèles existants depuis que produits similaires permettent à l'avance la connaissance des éventuels problèmes et leur solutions. Par conséquent, il est utile de disposer de solutions technologiques capables d'évaluer les similitudes de différents produits afin que l'utilisateur puisse récupérer des modèles existants et avoir ainsi accès à des informations utiles pour la nouvelle conception.Le concept de similarité a été largement étudié dans la littérature et il est bien connu que deus objets puissent être similaire de plusieurs façons. Ces multiples possibilités rendent complexe l'évaluation de la similarité entre deux objets. À ce jour, de nombreuses méthodes ont été proposées pour l’identification de différentes similitudes entre les pièces, mais peu de travaux abordent cet problème en évoquant d’assemblages de pièces. Si l’évaluation de la similarité entre deux pièces a beaucoup de points de vue, quand on va examiner des assemblages de pièces, les combinaisons de similarité augmentent vertigineusement puisqu'il y a plus de facteurs à considérer.Sur la base de ces exigences, nous proposons de définir un système qui permettant la récupération des assemblages des pièces similaires en fonction de multiple critères de similarité. Pour ce faire, il faut avoir un descripteur qui peut gérer les informations nécessaires pour caractériser les différentes similitudes entre les deux modèles. Par conséquent, l'un des points principaux de ce travail sera la définition d'un descripteur capable de coder les données nécessaires à l'évaluation des similarités. De plus, certaines des informations du descripteur peuvent être disponibles dans le modèle CAO, tandis que d'autres devront être extraites de manière appropriée. Par conséquent, des algorithmes seront proposés pour extraire les informations nécessaires pour remplir les champs du descripteur. Enfin, pour une évaluation de la similarité, plusieurs mesures entre les modèles seront définies, de sorte que chacune d'entre elles évaluent un aspect particulier de leur similarité. / The large use of CAD systems in many industrial fields, such as automotive, naval, and aerospace, has generated a number of 3D databases making available a lot of 3D digital models. Within enterprises, which make use of these technologies, it is common practice to access to CAD models of previously developed products. In fact, designing new products often refers to existing models since similar products allow knowing in advance common problems and related solutions. Therefore, it is useful to have technological solutions that are able to evaluate the similarities of different products in such a way that the user can retrieve existing models and thus have access to the associated useful information for the new design.The concept of similarity has been widely studied in literature and it is well known that two objects can be similar under different perspectives. These multiple possibilities make complicate the assessment of the similarity between two objects. So far, many methods are proposed for the recognition of different parts similarities, but few researches address this problem for assembly models. If evaluating the similarity between two parts may be done under different perspectives, considering assemblies, the viewpoints increase considerably since there are more elements playing a meaningful role.Based on these requirements, we propose a system for retrieving similar assemblies according to different similarity criteria. To achieve this goal, it is necessary having an assembly description including all the information required for the characterizations of the possible different similarity criteria between the two assemblies. Therefore, one of the main topics of this work is the definition of a descriptor capable of encoding the data needed for the evaluation of similarity adaptable to different objectives. In addition, some of the information included in the descriptor may be available in CAD models, while other has to be extracted appropriately. Therefore, algorithms are proposed for extracting the necessary information to fill out the descriptor elements. Finally, for the evaluation of assembly similarity, several measures are defined, each of them evaluating a specific aspect of their similarity.

Les contours actifs sont parmi les méthodes de segmentation d'images les plus utilisées et de nombreuses implémentations ont vu le jour durant ces 25 dernières années. Parmi elles, l'approche greedy est considérée comme l'une des plus rapides et des plus stables. Toutefois, quelle que soit l'implémentation choisie, les résultats de segmentation souffrent grandement en présence d'occlusions, de concavités ou de déformation anormales de la forme. Si l'on dispose d'informations a priori sur la forme recherchée, alors son incorporation à un modèle existant peut permettre d'améliorer très nettement les résultats de segmentation. Dans cette thèse, l'inclusion de ce type de contraintes de formes dans un modèle de contour actif explicite est proposée. Afin de garantir une invariance à la rotation, à la translation et au changement d'échelle, les descripteurs de Fourier sont utilisés. Contrairement à la plupart des méthodes existantes, qui comparent la forme de référence et le contour actif en cours d'évolution dans le domaine d'origine par le biais d'une transformation inverse, la méthode proposée ici réalise cette comparaison dans l'espace des descripteurs. Cela assure à notre approche un faible temps de calcul et lui permet d'être indépendante du nombre de points de contrôle choisis pour le contour actif. En revanche, cela induit un biais dans la phase des coefficients de Fourier, handicapant l'invariance à la rotation. Ce problème est résolu par un algorithme original. Les expérimentations indiquent clairement que l'utilisation de ce type de contrainte de forme améliore significativement les résultats de segmentation du modèle de contour actif utilisé. / Active contours are widely used for image segmentation. There are many implementations of active contours. The greedy algorithm is being regarded as one of the fastest and stable implementations. No matter which implementation is being employed, the segmentation results suffer greatly in the presence of occlusion, context noise, concavities or abnormal deformation of shape. If some prior knowledge about the shape of the object is available, then its addition to an existing model can greatly improve the segmentation results. In this thesis inclusion of such shape constraints for explicit active contours is being implemented. These shape priors are introduced through the use of robust Fourier based descriptors which makes them invariant to the translation, scaling and rotation factors and enables the deformable model to converge towards the prior shape even in the presence of occlusion and contextual noise. Unlike most existing methods which compare the reference shape and evolving contour in the spatial domain by applying the inverse transforms, our proposed method realizes such comparisons entirely in the descriptor space. This not only decreases the computational time but also allows our method to be independent of the number of control points chosen for the description of the active contour. This formulation however, may introduce certain anomalies in the phase of the descriptors which affects the rotation invariance. This problem has been solved by an original algorithm. Experimental results clearly indicate that the inclusion of these shape priors significantly improved the segmentation results of the active contour model being used.

Made available in DSpace on 2016-08-12T19:18:22Z (GMT). No. of bitstreams: 1 FernandoASA_TESE.pdf: 1416076 bytes, checksum: b1c98d86beac7a63692f0bd1fd27af60 (MD5) Previous issue date: 2010-04-29 / The Brazilian melon agribusiness is in expansion, reaching almost 500 thousand tons per year and making melon the main domestic fruit in both exported volume and value, with this activity being concentrated in the Brazilian Semiarid region. However, Brazil ranks only twelfth among the producing countries in area planted and production and the twentieth-third in productivity, demonstrating that there is still much to do on melon breeding and genetic resources of this crop. Thus, the objectives of this work were to estimate the genetic diversity of melon accessions collected from the traditional agricultural areas of the Brazilian Northeastern region by using descriptors for the fruit and microsatellite markers, and to study the nature of genotype vs. environment interaction and to estimate genetic parameters and gains by selection of melon families, in the Jaguaribe/Assú irrigation projects (Ceará and Rio Grande do Norte States, Brazil). The study of genetic diversity showed great variability among accessions, within and among the botanical groups, enabling advances in genetic improvement of fruit quality traits. Cluster analysis by fruit descriptors formed eight groups, without taxonomic criteria. The characters fruit longitudinal diameter, number of fruits per plant, cavity thickness and total soluble solids were descriptors that contributed most to the dissimilarity of the genotypes. The SSR markers amplified 41 alleles with average of 2.41 alleles and three genotypes per locus. A phylogenetic molecular analysis separated the accessions into 13 groups, also without taxonomic coherence in groups formed. The degree of association between genetic distance morpho-agronomic and molecular matrices was null. Then, there was no significant association between the descriptors and SSR markers, which was predictable due the number of distinct groups, the quantitative nature of the descriptors and the distribution of SSR markers in the genome. In the study of genotype vs. environment interaction, there was heterogeneity among the families for all traits. Heritability estimates in the combined analysis were consistently lower than those estimated for each environment. The simple part of G vs. E interaction was always above 99%, except for pulp firmness, with a predominance of the large complex part between the pairs of environments A1 and A3 and A2 and A3. The direct gains by selection were higher than the indirect gains for all traits in all environments evaluated. Gains were closer to the direct genetic gains when the selection was based on the average of the three environments. Estimates of genetic parameters associated with the simple nature of the family vs. environment interaction allowed genetic progress by simple breeding methods. As the genotype-environment interaction overestimates the coefficient of genetic variation and genetic variance among families in an environment, genotype assessments in more than one location are necessary since that selection is made considering the average of the families on the environments. Therefore, the potential of genetic improvement was demonstrated for the germplasm used in the study of genetic diversity as well as for the germplasm evaluated in the analysis of genotype-environment interaction. / O agronegócio do melão brasileiro tem se expandido bastante, alcançando quase 500 mil toneladas de frutos por ano e tornando o melão a principal fruta nacional, tanto em volume de exportação quanto em valor exportado, estando esta atividade concentrada no semiárido brasileiro. Contudo, o Brasil é apenas o décimo segundo país em produção e área plantada e vigésimo terceiro em produtividade, evidenciando que ainda existe muito por ser feito em termos do melhoramento e recursos genéticos desta cultura. Assim sendo, os objetivos deste trabalho foram estimar a divergência genética de acessos de meloeiro coletados em propriedades de agricultura tradicional do Nordeste brasileiro, tanto por descritores do fruto quanto por marcadores microssatélites e estudar a natureza da interação genótipo x ambiente (G x A) bem como estimar parâmetros genéticos e ganhos por seleção de famílias de melão, no polo Jaguaribe-CE/Assu-RN. O estudo de divergência genética mostrou grande variabilidade entre os acessos, entre e dentro dos grupos botânicos, possibilitando avanços no melhoramento genético dos caracteres de qualidade dos frutos. A análise de agrupamento por descritores do fruto formou oito grupos, sem critérios taxonômicos. Os caracteres diâmetro lateral, número de frutos por planta, espessura da cavidade e sólidos solúveis foram os descritores que mais contribuíram para a dissimilaridade dos genótipos. Os marcadores SSR amplificaram 41 alelos com média de 2,41 alelos e três genótipos por loco. A análise filogenética molecular separou os acessos em 13 grupos, também sem coerência taxonômica nos grupos formados. O grau de associação entre as matrizes de distâncias genéticas morfoagronômica e molecular foi nulo, não havendo associação entre os descritores e os marcadores SSR, o que era previsível devido ao número distinto de grupos, a natureza quantitativa dos descritores e a forma de distribuição dos marcadores SSR no genoma. No estudo de interação genótipo x ambiente, houve heterogeneidade entre as famílias para todas as características avaliadas. As herdabilidades estimadas nas análises conjuntas foram sempre inferiores àquelas estimadas em cada ambiente. A parte simples da interação G x A foi sempre superior a 99%, exceto para firmeza da polpa, com amplo predomínio da parte complexa entre pares de ambientes A1 e A3 e A2 e A3. Os ganhos diretos com seleção foram maiores do que os ganhos indiretos para todas as características, em todos os ambientes avaliados. Os ganhos foram mais próximos dos ganhos genéticos diretos quando se praticou a seleção pela média dos três ambientes. As estimativas de parâmetros genéticos associadas à natureza simples da interação família x ambiente permitem progresso genético por meio de métodos de melhoramento menos sofisticados. Como a interação genótipo x ambiente superestima o coeficiente de variação genético e a variância genética entre famílias em um ambiente, são necessárias avaliações dos genótipos em mais de um local, desde que a seleção seja praticada considerando a média das famílias nos ambientes. Portanto, ficou comprovado o potencial de melhoramento genético tanto no germoplasma utilizado no estudo de divergência genética quanto do germoplasma avaliado nas análises da interação genótipo x ambiente.