Dissertations / Theses on the topic 'Geodesic distances'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 21 dissertations / theses for your research on the topic 'Geodesic distances.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Oliveira, Guilherme do Nascimento. "Procedural textures mapping using geodesic distances." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2011. http://hdl.handle.net/10183/34767.
Full textTexture mapping is an important technique to add detail to geometric models. Imagebased texture mapping is the preferred approach but employs pre-computed images, which are better suited for static patterns. On the other hand, procedural-based texture mapping offers an alternative that rely on functions to describe texturing patterns. This allows more flexibility to define patterns in dynamic scenes, while also having a more compact representation and more control for parametric adjustments on the texture visual appearance. When mapped with 3D coordinates, the procedural textures do not consider the model surface, and with 2D mapping the coordinates must be defined in a coherent way, which for complex models is not an easy task. In this work we give a introduction to procedural texturing and texture mapping, and introduce GeoTextures, an original approach that uses geodesic distance defined from multiple sources at different locations over the surface of the model. The geodesic distance is passed as a parameter that allows the shape of the model to be considered in the definition of the procedural texture. We validate the proposal using procedural textures that are applied in real-time to complex surfaces, and show examples that change both the shading of the models, as well as their shape using hardware-based tessellation.
Bertrand, Théo. "Méthodes géodésiques et apprentissage pour l’imagerie de microscopie par localisation ultrasonore." Electronic Thesis or Diss., Université Paris sciences et lettres, 2024. http://www.theses.fr/2024UPSLD024.
Full textUltrasound Localization Microscopy is a new method in super-resolved Medical Imaging that allow us to overcome compromise between precision and penetration distance in the tissues for the imaging of the vascular network. This new type of images raises new mathematical questions, especially for the segmentaton and analysis, necessary steps to achieve medical diagnostic of patients. Our work is positioned at the intersection of geodesic and Machine Learning methods. In this thesis, we make three contributions. The first of these is centered on the constraints linked to ULM images and proposes the tracking of the entire vascular tree through the detection of key points of blood vessels appearing on the image. The second contribution of this thesis deals with learning to define Riemannian metrics to handle segmentation tasks on brain MRI data and eye fundus images. The final part of our work focuses on an inverse problem for reconstructing contrast agent trajectories in medical images in the context of grid-free super-resolution
Nilsson, Ola. "Level-set methods and geodesic distance functions /." Norrköping : Department of Science and Technology, Linköping University, 2009. http://www.bibl.liu.se/liupubl/disp/disp2009/tek1275s.pdf.
Full textWang, Rui, and 王睿. "Medial axis simplification based on global geodesic slope and accumulated hyperbolic distance." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2012. http://hub.hku.hk/bib/B48330139.
Full textpublished_or_final_version
Computer Science
Master
Master of Philosophy
Lu, Shi-Jian. "The significance of atmospheric effects in electronic distance measurement." Thesis, University of Leeds, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.278369.
Full textBrandão, Artur Caldas. "Possibilidade de emprego de um campo de pontos planimetrico como definidor de um comparador de distancias colineares." reponame:Repositório Institucional da UFPR, 1996. http://hdl.handle.net/1884/48609.
Full textCo-orientador: Tarcisio Ferreira Silva
Dissertação (mestrado) - Universidade Federal do Paraná
Resumo: O procedimento clássico usado para determinar as distâncias interpilares de uma linha base multipilar para calibração de distanciômetros, consiste em avaliar essas distâncias diretamente, usando equipamentos de alta precisão. Nesse caso, a precisão final das distâncias interpilares fica limitada à precisão do próprio equipamento usado. Neste trabalho, foi desenvolvido um procedimento metodológico para definir as distâncias interpilares de uma linha base a partir de um campo de pontos planimétrico, em que os pontos da linha base foram incluídos. Para tanto, a configuração geométrica do campo de pontos foi adequadamente otimizada através de procedimentos de simulação. Garantiu-se assim que os resultados esperados para a precisão final dos pontos da rede fossem obtidos antes mesmo do trabalho de campo ser conduzido. O programa "NETZ2D" de análise e ajustamento de redes 2D foi usado como ferramenta computacional. Os experimentos realizados no processo de simulação e de medição do campo de pontos, foram conduzidos sobre a linha base da UFPE. Na medição do campo de pontos otimizado, garantiu-se o controle do processo de medição em termos de escolha adequada do período de medição e dos equipamentos. Verificou-se que a metodologia proposta, quando comparado ao procedimento clássico, apresentou vantagens em termos de facilidades de implementação bem como nos resultados obtidos. No experimento realizado, as distâncias interpilares da linha base da UFPE foram definidas com uma precisão cinco vezes maior que a precisão das medidas de distâncias avaliadas no campo de pontos. Por outro lado, resultado final equivalente foi obtido para os pontos da linha base simulando um campo de pontos com um único padrão metrológico de distância.
Abstract: The used classic proceeding to determine the interpillares distancies of one multipillar base line to calibration of eletronic distancies measuring (EDM), consist in to evaluate this distancies directing using equipmenty of high precision. In this case, the finish precision of the interpillares distancies stay limited the precision of proper equipment used. In this work, was developed a metodologic proceeding to define the interpillares distancies of one base line until of the network 2D, in that the points of base line was incluids. To that effect, the geometric configuration of network 2D was adequatement optimized through of proceeding of simulation. Was guaranted that the hoped results to the finish precision of the points of the net have was obtain before the work of field to be conduzed. The program "NETZ2D" of analysis and adjustment of the nets was used how computation instrument. The experiments realized in the simulation and measure process of the network, was conduzed about the base line of UFPE. On the measuring of network optmized, was guaranty the control of the measuring process adequad choose of the time of the measuring and of the equipments. Was verified that the offered metodology, when compared to the classic proceeding, showed advantagies of easilies implementation, as in the results obtained. On the experiment realized, the interpillares distancies of base line of the UFPE was define with one precision five time bigger than the precision o f the measure of the distancies evaluated on network. On the other hand, the equivalent finish result was obtained to the points of the base line, simulating one network with only one standart metrologic of the distance.
Kohli, Mathieu. "De la notion de courbure géodésique en géométrie sous-Riemannienne." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLX043/document.
Full textWe present a notion of geodesic curvature for smooth horizontal curves in a contact sub-Riemannian manifold, measuring how far a horizontal curve is from being a geodesic. This geodesic curvature consists in two functions that both vanish along a smooth horizontal curve if and only if this curve is a geodesic. The main result of this thesis is the metric interpretation of these geodesic curvature functions. This interpretation consists in seeing the geodesic curvature functions as the first corrective coefficients in the Taylor expansion of the sub-Riemannian distance between two close points on the curve
Arcostanzo, Marc. "Rigidité et prolongement au disque d'une distance sur le bord." Université Joseph Fourier (Grenoble), 1994. http://www.theses.fr/1994GRE10216.
Full textMiller, Charles Miller. "THE EFFECT OF DISTANCE DECAY: A STUDY OF AUTOMOTIVE RETAILING." Diss., Temple University Libraries, 2017. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/439401.
Full textD.B.A.
Retail automotive literature that examines how the distance between a retail automotive facility and the prospective purchaser affects market performance is limited. Primary data for this study indicates that distance and purchase in the retail automotive sector move in opposite directions. This study examines similar goods that have high barriers of entry and proposes other methods of increasing market reach. This is a study of the conditions that affect the market performance for imported luxury vehicles. First, is the effect of distance on purchase decisions. Vehicular sales drop the further away a customer is from a car dealership. We call this phenomenon distance decay. Distance decay is defined as: the interaction between two locations declines as the distance between then increases. Secondly, when similar brands are viewed as substitutes, the consumer will choose the brand with the closest automotive service department to their residence or place of employment. Thirdly, door-to-door selling can decrease distance decay. Lastly, pick-up and delivery service can decrease distance decay. Data from 30,936 prospects and individuals who entered, phoned, or emailed a dealership inquiring about purchasing a new Audi were used in the study. These prospects will be categorized by who intended to buy and who actually purchased a car. In addition to the prospects, data from 6,153 individuals who purchased a new Audi from four Audi dealerships in the greater Philadelphia area and from the framed field experiment were used in the study. These categories will then be further labeled by ZIP code and city to determine the effects of distance. Then, possible solutions will be performed on test groups to determine what alternatives from other industries can be used to improve market performance involving long distances.
Temple University--Theses
Cruz, Barbosa Raúl. "Generative manifold learning for the exploration of partially labeled data." Doctoral thesis, Universitat Politècnica de Catalunya, 2009. http://hdl.handle.net/10803/78053.
Full textResum de la tesi (màxim 4000 caràcters. Si se supera aquest límit, el resum es tallarà automàticament al caràcter 4000) En muchos problemas de aplicación del mundo real, la disponibilidad de etiquetas de datos para aprendizaje supervisado es bastante limitada. La existencia de conjuntos de datos etiquetados de manera incompleta es común en muchas de las bases de datos generadas en algunas de las áreas de investigación actualmente más activas. Es frecuente que un número limitado de casos etiquetados venga acompañado de un número mucho mayor de datos no etiquetados. Éste es el contexto en el que opera el aprendizaje semi-supervisado, en el cual enfoques no-supervisados prestan ayuda a problemas supervisados y vice versa. Un modelo de aprendizaje de variaciones (manifold learning, en inglés), llamado Mapeo Topográfico Generativo (GTM, en acrónimo de su nombre en inglés), es la base de los métodos desarrollados en esta tesis. La no-linealidad del mapeo que GTM genera hace que éste sea propenso a errores de fiabilidad y continuidad, los cuales pueden reducir la fidelidad de la representación de los datos, especialmente para conjuntos de datos de geometría intrincada. En esta tesis, una extensión de GTM que utiliza una aproximación vía grafos a la métrica geodésica es definida en primer lugar. Este modelo es capaz de representar datos con geometrías intrincadas. En él, el GTM estándar es modificado para priorizar relaciones de vecindad a lo largo de la variación generada. Esto se logra penalizando las divergencias existentes entre las distancias Euclideanas de los datos a los prototipos del modelo y las correspondientes distancias geodésicas a lo largo de la variación. Se muestra que el modelo Geo-GTM resultante mejora la continuidad y fiabilidad de la representación generada y que se comporta de manera robusta en presencia de ruido. Más adelante, la tesis nos lleva a la definición y desarrollo de versiones semi-supervisadas de GTM para la exploración de conjuntos de datos parcialmente etiquetados. Como un primer paso en esta dirección, se presenta un procedimiento de agrupamiento en dos etapas que utiliza información de pertenencia a clase. Una extensión de GTM enriquecida con información de pertenencia a clase, llamada class-GTM, produce una primera descripción de grupos de los datos. El número de grupos definidos por GTM es normalmente grande para propósitos de visualización y no corresponde necesariamente con la estructura de clases global. Por ello, en una segunda etapa, los grupos son aglomerados usando el algoritmo K-means con diferentes estrategias de inicialización novedosas las cuales se benefician de la definición probabilística de GTM. Evaluamos si el uso de información de clase influye en la separabilidad de clase por grupos. Una extensión robusta de GTM que detecta datos atípicos a un tiempo que minimiza de forma efectiva su impacto negativo en el proceso de agrupamiento es evaluada también en este contexto. Se procede después a la definición de un nuevo modelo semi-supervisado, SS-Geo-GTM, que extiende Geo-GTM para ocuparse de problemas semi-supervisados. En SS-Geo-GTM, los prototipos del modelo son vinculados al vecino más cercano a la variación construída por Geo-GTM. El grafo de proximidad resultante es utilizado como base para un algoritmo de propagación de etiquetas de clase. El rendimiento de SS-Geo-GTM es valorado experimentalmente, comparando positivamente tanto con la contraparte de este modelo basada en la distancia Euclideana como con el método alternativo Laplacian Eigenmaps. Finalmente, los modelos desarrollados (el procedimiento de agrupamiento en dos etapas y los modelos semi-supervisados) son aplicados al análisis de un conjunto de datos de tumores cerebrales humanos (obtenidos mediante Espectroscopia de Resonancia Magnética Nuclear), donde las tareas a realizar son el agrupamiento de datos y el modelado de pronóstico de supervivencia.
Muller, Sonia Isoldi Marty Gama 1957. "Comparação entre os metodos da maxima verossimilhança, distancia minima e o metodo de Fisher para reconhecimento de padrões em imagens coloridas." reponame:Repositório Institucional da UFPR, 1997. http://hdl.handle.net/1884/44185.
Full textCo-orientador: Hideo Araki
Dissertação (mestrado) - Universidade Federal do Parana
Resumo: Uma das grandes preocupações no processo de automação em Fotogramentria esta relacionado com os algoritmos de reconhecimento de padrões. Apesar da metodologia ter avançado significativamente nos últimos anos, principalmente no que se refere ao tom de cinza, o reconhecimento de padrões de cores reais em imagens coloridas ainda se encontra em fase de desenvolvimento. Neste sentido objetiva-se realizar uma serie de ensaios com dados (cores) controlados e também com dados reais para comparar a performance dos métodos estatísticos de Máxima Verossimilhança, Distancia Mínima e de Fisher para reconhecimento das cores reais. A comparação entre os métodos estatísticos foi feita controlando o processo de classificação, ou seja, utilizando amostras determinísticas para treinamento das funções discriminantes e criando imagens para classificação no software (MATLAB). Com o intuito de que a comparação pudesse ser feita sem controle da imagem a ser classificada e das amostras, utilizou-se uma imagem retirada de uma foto digitalizada, para verificar a performance dos métodos frente a um caso real. A analise de desempenho dos métodos foi observada pela estatística kappa e a comparação pelo teste Z apropriado. Os resultados indicam que o Método de Distancia Mínima foi o melhor para classificação de cores reais sob todos os aspectos estudados.
Abstract: One o f the main issues in the photogrametry automation process is related to pattern recognition algorithms. Although there were significant advances in the last years, mainly in regard to the gray tones, color pattern recognition in colored images is still in a developmental stage. In this sense, a series o f tests with controlled data (colors) and also with real data is made to compare the performance o f the statistical methods: Maximum Likelihood, Minimum Distance, and Fisher's method in their ability to recognize real colors. The comparison among the statistical methods was performed by controlling the classification process, that is, using deterministic samples for the training o f discriminant functions and test images created by a software (MATLAB). For the case o f real images, the statistical methods were compared without controlling both the sample and the image by the utilization o f an image extracted from a digitized picture. The methods performance was analyzed using the kappa statistic and the Z test. The results indicated that the Minimum Distance Method was the best method to classify real colors under all assumptions.
Chaniot, Johan. "Caractérisation morphologique efficace de matériaux par cartes de distance." Thesis, Lyon, 2019. http://www.theses.fr/2019LYSES039.
Full textIn a technologically advanced world, energy consumption is rapidly increasing deepening the ongoing environmental crisis. Therefore, solutions must be found to provide the required energy, while reducing greenhouse gas emissions.Catalysis is an excellent way to improve the energy efficiency of industrial processes. Heterogeneous catalysts, here porous microstructures, are at the heart of this process, particularly for refining and petrochemical industry, specifically for biofuel generation.Their morphological description provides key information. Thus far, correlations have been established between the structural properties and performance of these materials. Nevertheless, heterogeneous catalysis is a very complex process and the traditional numerical descriptors provide insufficient information and fail to assist in material selection. The work addressed in this thesis aims to develop new digital descriptors of microstructures that are easily interpretable, efficient and complementary to the current state-of-the-art solutions. The objective is to complete the set of descriptors, to help in the optimal selection of the appropriate catalysts for a given application. More specifically, we focus our work on a geometric and topological characterization of the porous network, without taking into account physicochemical phenomena, and not being limited by the complexity of the microstructure studied.Our different approaches focus on the concepts of percolation, ability to cross a microstructure; geometric tortuosity, sinuosity and interconnectivity of a network; and heterogeneity. The geometric and topological characteristics linked to the Minkowski functionals in 3D are fitted to catalysis field by estimating accessibility of a microstructure for a given sphere size (A-protocol), described by morphological erosion efficiently calculated by distance maps. To characterize the pore topology, we define an operator, the M-tortuosity, that can be applied to any segmented volume, without arbitrarily defining source points or planes. We propose an efficient M-tortuosity estimator by calculating distance maps; which is then generalized by power factors. This operator is then extended to distinct ways.First, to the case of a probe of finite size (M-tortuosity-by-iterative-erosions), characterizing bottleneck effects which are usually quantified using constrictivity. Then, to characterize the spatial scale dependence of tortuosity (H-tortuosity), characterizing, among others, the heterogeneity of the structure. Finally, both aspects are gathered into the H-tortuosity-by-iterative-erosions.Secondly, these ensemble operators, suitable for binary images, are extended to the functional case, to discriminate grayscale images (F-tortuosity and HF-tortuosity). These functional extensions have various purposes: combining local information with tortuosity assessment of the overall structure, and characterizing tomographic images without accurate segmentation.The discrimination power of these operators, ensemble and functional, is assessed on toy cases and on multi-scale Boolean Cox schemes. Moreover, their similarities and complementarities are analysed using these very same stochastic models.In catalysis and biocatalysis, three types of catalysts are considered: zeolites, MOFs (Metal-Organic Framework) and aluminas. These applications highlight their wide scope, and lead to consider their usefulness out of catalyst domain; in neuroscience and for turbid media characterization
Gigli, Nicola. "On the geometry of the space of probability measures in ℝn endowed with the quadratic optimal transport distance." Doctoral thesis, Scuola Normale Superiore, 2008. http://hdl.handle.net/11384/85696.
Full textMerhy, Mayss'aa. "Reconnaissance de formes basée géodésiques et déformations locales de formes." Thesis, Brest, 2017. http://www.theses.fr/2017BRES0051/document.
Full textThe quality of the segmentation process directly affects the performance of the shape recognition. Despite the progress that has been made, it is often unreachable to segment the entire object (i.e. closed contour). In fact, only some parts/fragments of objects can be detected. We first develop a new alignment method based on Procrustes analysis in order to ensure invariance of shape parts to geometric transformations (translation, rotation and scale factor). The proposed method consists in finding optimal extremities which minimize the Procrustes distance. Then, we propose a shape part recognition approach and a partial shape recognition approach. These two contour-based approaches are based on matching between shape parts to compare. This matching process consists in establishing a robust registration between shape parts based on geodesics in the shape space. Thus, we exploit the registration residual to define a novel distance for shape part recognition. Later, for partial shape recognition, we describe a geodesics-based combining strategy with the same distance. As well, we propose to use the geodesics distance proposed for shape part recognition to define a global distance for entire shape recognition. Experiments are carried out on parts of shapes and entire shapes of theMPEG-7 database, then on parts issued from segmented real images. The obtained results demonstrate the effectiveness of our proposed recognition schemes. The proposed approaches are shown to significantly outperform previous works for classification and retrieval applications
Diourté, Adama. "Génération et optimisation de trajectoire dans la fabrication additive par soudage à l'arc." Thesis, Toulouse 3, 2021. http://www.theses.fr/2021TOU30213.
Full textWire Arc Additive Manufacturing (WAAM) is becoming the primary Additive Manufacturing (AM) technology used to produce medium to large (order of magnitude: 1 m) thin-walled parts at lower cost. To manufacture a part with this technology, the path planning strategy used is 2.5D. This strategy consists in cutting a 3D model into different plane layers parallel to each other. The use of this strategy limits the complexity of the topologies achievable in WAAM, especially those with large variations in curvature. It also implies several start/stop of the arc during its passage from one layer to another, which induces transient phenomena in which the control of energy and material supply is complex. In this thesis, a new manufacturing strategy to reduce the arc start/stop phases to a single cycle is presented. The objective of this strategy, called "Continuous Three-dimensional Path Planning" (CTPP), is to generate a continuous spiral-shaped trajectory for thin parts in a closed loop. An adaptive wire speed coupled with a constant travel speed allows a modulation of the deposition geometry that ensures a continuous supply of energy and material throughout the manufacturing process. The use of the 5-axis strategy coupled with CTPP allows the manufacturing of closed parts with a procedure to determine the optimal closure zone and parts on non-planar substrates useful for adding functionality to an existing structure. Two geometries based on continuous manufacturing with WAAM technology are presented to validate this approach. The manufacturing of these parts with CTPP and several numerical evaluations have shown the reliability of this strategy and its ability to produce new complex shapes with good geometrical restitution, difficult or impossible to achieve today in 2.5D with WAAM technology
Cerocchi, Filippo. "Dynamical and Spectral applications of Gromov-Hausdorff Theory." Thesis, Grenoble, 2013. http://www.theses.fr/2013GRENM077/document.
Full textThis Ph.D. Thesis is divided into two parts. In the first part we present the barycenter method, a technique which has been introduced by G. Besson, G. Courtois and S. Gallot in 1995, in order to solve the Minimal Entropy conjecture. In Chapter 1 we are interested in the more recent developments of this method, more precisely in the recent extension of the method to the case of manifolds having sectional curvature of variable sign. In Chapters 2 and 3 we shall present some new results whose proofs make use of the barycenter method. The Conjugacy Rigidity problem is the theme of Chapter 2. First we show a general result which provide a comparison between the large scale geometry of the Riemannian universal coverings of two compact manifolds whose geodesic flows are conjugates. Then we shall show how we can apply the latter result and the barycenter method in curvature of variable sign in order to give a new proof of the conjugacy rigidity of flat manifolds. In Chapter 3 we shall give a proof of a spectra comparison theorem for a compact Riemannian manifold which admits a Gromov-Hausdorff-approximation of non zero absolute degree on a fixed compact manifold (X,g') and which has volume almost smaller than the one of the reference manifold. The proof relies on the barycenter method in curvature of variable sign and on iterated Sobolev inequalities. We underline that it is an approximation result (and not just a convergence result) and that no curvature assumptions are made or inferred on (Y,g). The second part of the Thesis consists of a single chapter. In this chapter we prove a Margulis Lemma without curvature assumptions for Riemannian manifolds having decomposable 2-torsionless fundamental group. We shall give also a proof of a universal lower bound for the homotopy systole of compact Riemannian manifolds having bounded volume entropy and diameter, and decomposable torsionless fundamental group. As a consequence of the latter result we shall deduce a Precompactness and Finiteness theorem and a Volume estimate without curvature assumptions
LIN, RONG-SI, and 林榮賜. "Proximity problems of link distance and geodesic distance." Thesis, 1989. http://ndltd.ncl.edu.tw/handle/86911237779054622624.
Full textSu, Long-Shyang, and 蘇龍祥. "3D Model Retrieval – Using Geodesic Distance." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/50041003581287851851.
Full text國立成功大學
資訊工程學系碩博士班
90
Due to the fast development of three dimensional model in many fileds, like game, animation, network, mechanical engineering and entertainments, we believe that searching three dimensional models in database will become more important. A traditional searching method, keyword searching, is not a stable method. Because the classify standard of each people is different, it can’t satisfy our requirement in three dimensional retrieval. In two dimensional image retrieval, the problem is easier because only one information, color, in a image. But in three dimensional model retrieval problem, there isn’t a standard function which can evaluate similarity between two models. We use a matching method to evaluate similarity between two skeletal graphs of models, namely 2-pass axis-to-axis matching method. The method is like a jigsaw puzzle. We first use geodesic distance to establish a skeletal graph - Reeb graph. It can roughly represent the skeleton of model and invariant to translation, rotation, scaling. Then we match two Reeb graphs and evaluate similarity. When matching two Reeb graphs, a concept of matching significant node first is used. It is different to depth-first and width-first, and we will matching most significant node first. We don’t need to subdivide triangles of model by using modified fast marching method, and we can approximate the geodesic distance. Building Reeb graph by geodesic distance and evaluating similarity between two Reeb graph by using our 2-pass axis-to-axis matching method.
Liu, L., Y. Sheng, G. Zhang, and Hassan Ugail. "Graph Cut Based Mesh Segmentation Using Feature Points and Geodesic Distance." 2015. http://hdl.handle.net/10454/8220.
Full textBoth prominent feature points and geodesic distance are key factors for mesh segmentation. With these two factors, this paper proposes a graph cut based mesh segmentation method. The mesh is first preprocessed by Laplacian smoothing. According to the Gaussian curvature, candidate feature points are then selected by a predefined threshold. With DBSCAN (Density-Based Spatial Clustering of Application with Noise), the selected candidate points are separated into some clusters, and the points with the maximum curvature in every cluster are regarded as the final feature points. We label these feature points, and regard the faces in the mesh as nodes for graph cut. Our energy function is constructed by utilizing the ratio between the geodesic distance and the Euclidean distance of vertex pairs of the mesh. The final segmentation result is obtained by minimizing the energy function using graph cut. The proposed algorithm is pose-invariant and can robustly segment the mesh into different parts in line with the selected feature points.
Tsai, Yueh-Lin, and 蔡岳霖. "Deformation Invariant Descriptors Based on Geodesic Distance Features for Protein Surface Comparison." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/80357621642270930711.
Full text國立臺灣海洋大學
資訊工程學系
99
Protein functions are highly correlated to structural conformation of biomolecular components, and especially some specific functions of proteins would be evoked by deforming the surface conformation to interact with other proteins. It is therefore important to identify the similarity and congruence between the original protein surface and its deformed conformation for protein structure-function analysis. Most existing structure comparison methods treat protein structures as rigid bodies. Though conventional approaches possessed translation and rotation invariant characteristics, the problems of deformed structures could not be correctly identified during surface comparison. To solve these dilemmas, this thesis proposes two local shape descriptors based on geodesic distance features which possess deformation invariant characteristics. The first descriptor is the Linear Geodesic Vector (LGV) obtained by taking average geodesic distances among the target residue and its sequentially neighboring residues, and the second descriptor is the Conformational Geodesic Adjacency Matrix (CGAM) formulated by calculating the geodesic distances among the target residue and its surface neighboring residues within a specified spatial radius. Each vector or matrix represents corresponding local shape characteristics of a protein surface and it can be adopted as a shape profile for efficient protein surface comparison. Values of scoring function and matrix correlation are computed for evaluating surface similarity between two proteins. In this thesis, we collected 401 protein structures from a 3D domain swapping dataset which was clustered into 32 groups, and each group of deformed proteins was trained for optimizing system default parameters. The results have shown that the deformed proteins could be correctly identified with an average rank of 1.13 and both of the sensitivity and precision rates achieved 92.7%. The hinge atlas dataset from MolMovDB was also applied to compare the performance of existing shape descriptors. As the results of comparison, the E-measure of proposed methods was 37.2% and outperformed all other descriptors. In addition, the proposed shape features and comparison methods can stably handle the phenomena of self-connection on surface or topological changes caused by serious shape deformation.
Ochoa, Mayorga Victor Manuel. "Geometric approach to multi-scale 3D gesture comparison." Phd thesis, 2010. http://hdl.handle.net/10048/1530.
Full text