A complete hand-drawn sketch vectorization framework

Vectorizing hand-drawn sketches is a challenging task, which is of paramount importance for creating CAD vectorized versions for the fashion and creative workflows. This paper proposes a complete framework that automatically transforms noisy and complex hand-drawn sketches with different stroke types in a precise, reliable and highly-simplified vectorized model. The proposed framework includes a novel line extraction algorithm based on a multi-resolution application of Pearson's cross correlation and a new unbiased thinning algorithm that can get rid of scribbles and variable-width strokes to obtain clean 1-pixel lines. Other contributions include variants of pruning, merging and edge linking procedures to post-process the obtained paths. Finally, a modification of the original Schneider's vectorization algorithm is designed to obtain fewer control points in the resulting Bezier splines. All the proposed steps of the framework have been extensively tested and compared with state-of-the-art algorithms, showing (both qualitatively and quantitatively) its outperformance

Quantification of the plant endoplasmic reticulum

One of the challenges of quantitative approaches to biological sciences is the lack of understanding of the interplay between form and function. Each cell is full of complex-shaped objects, which moreover change their form over time. To address this issue, we exploit recent advances in confocal microscopy, by using data collected from a series of optical sections taken at short regular intervals along the optical axis to reconstruct the Endoplasmic Reticulum (ER) in 3D, obtain its skeleton, then associate to each of its edges key geometric and dynamic characteristics obtained from the original filled in ER specimen. These properties include the total length, surface area, and volume of the ER specimen, as well as the length surface area, and volume of each of its branches. In a view to benefit from the well established graph theory algorithms, we abstract the obtained skeleton by a mathematical entity that is a graph. We achieve this by replacing the inner points in each edge in the skeleton by the line segment connecting its end points. We then attach to this graph the ER geometric properties as weights, allowing therefore a more precise quantitative characterisation, by thinning the filled in ER to its essential features. The graph plays a major role in this study and is the final and most abstract quantification of the ER. One of its advantages is that it serves as a geometric invariant, both in static and dynamic samples. Moreover, graph theoretic features, such as the number of vertices and their degrees, and the number of edges and their lengths are robust against different kinds of small perturbations. We propose a methodology to associate parameters such as surface areas and volumes to its individual edges and monitor their variations with time. One of the main contributions of this thesis is the use of the skeleton of the ER to analyse the trajectories of moving junctions using confocal digital videos. We report that the ER could be modeled by a network of connected cylinders (0.87μm±0.36 in diameter) with a majority of 3-way junctions. The average length, surface area and volume of an ER branch are found to be 2.78±2.04μm, 7.53±5.59μm2 and 1.81±1.86μm3 respectively. Using the analysis of variance technique we found that there are no significant differences in four different locations across the cell at 0.05 significance level. The apparent movement of the junctions in the plant ER consists of different types, namely: (a) the extension and shrinkage of tubules, and (b) the closing and opening of loops. The average velocity of a junction is found to be 0.25μm/sec±0.23 and lies in the range 0 to 1.7μm/sec which matches the reported actin filament range

Quantification of the plant endoplasmic reticulum

One of the challenges of quantitative approaches to biological sciences is the lack of understanding of the interplay between form and function. Each cell is full of complex-shaped objects, which moreover change their form over time. To address this issue, we exploit recent advances in confocal microscopy, by using data collected from a series of optical sections taken at short regular intervals along the optical axis to reconstruct the Endoplasmic Reticulum (ER) in 3D, obtain its skeleton, then associate to each of its edges key geometric and dynamic characteristics obtained from the original filled in ER specimen. These properties include the total length, surface area, and volume of the ER specimen, as well as the length surface area, and volume of each of its branches. In a view to benefit from the well established graph theory algorithms, we abstract the obtained skeleton by a mathematical entity that is a graph. We achieve this by replacing the inner points in each edge in the skeleton by the line segment connecting its end points. We then attach to this graph the ER geometric properties as weights, allowing therefore a more precise quantitative characterisation, by thinning the filled in ER to its essential features. The graph plays a major role in this study and is the final and most abstract quantification of the ER. One of its advantages is that it serves as a geometric invariant, both in static and dynamic samples. Moreover, graph theoretic features, such as the number of vertices and their degrees, and the number of edges and their lengths are robust against different kinds of small perturbations. We propose a methodology to associate parameters such as surface areas and volumes to its individual edges and monitor their variations with time. One of the main contributions of this thesis is the use of the skeleton of the ER to analyse the trajectories of moving junctions using confocal digital videos. We report that the ER could be modeled by a network of connected cylinders (0.87μm±0.36 in diameter) with a majority of 3-way junctions. The average length, surface area and volume of an ER branch are found to be 2.78±2.04μm, 7.53±5.59μm2 and 1.81±1.86μm3 respectively. Using the analysis of variance technique we found that there are no significant differences in four different locations across the cell at 0.05 significance level. The apparent movement of the junctions in the plant ER consists of different types, namely: (a) the extension and shrinkage of tubules, and (b) the closing and opening of loops. The average velocity of a junction is found to be 0.25μm/sec±0.23 and lies in the range 0 to 1.7μm/sec which matches the reported actin filament range.EThOS - Electronic Theses Online ServiceEngineering and Physical Sciences Research Council (Great Britain) (EPSRC)University of Warwick. Molecular Organisation and Assembly in Cells (MOAC)Rodger, AlisonGBUnited Kingdo

Detecção e agrupamento de contornos

A detecção de contornos a partir de imagens digitais é um procedimento do qual resulta informação essencial para muitos algoritmos de visão por computador. A natureza das imagens digitais bidimensionais: a sua relativamente baixa resolução; a amostragem espacial e em amplitude; a presença de ruído; a falta de informação em profundidade; as oclusões, etc., e a importância dos contornos como informação básica para muitos outros algoritmos a montante, fazem com que a detecção de contornos seja um problema apenas parcialmente resolvido, com múltiplas abordagens e dando origem desde há algumas décadas a larga quantidade de publicações. Continua a ser um tema actual de investigação como se comprova pela quantidade e qualidade das publicações científicas mais actuais nesta área. A tese discute a detecção de contornos nas suas fases clássicas: a estimação da amplitude do sinal que aponta a presença de um ponto de contorno; a pré-classificação dos pontos da imagem com base nos sinais estimados e o posterior agrupamento dos pontos de contorno individuais em segmentos de curvas de contorno. Propõe-se, nesta tese: um método de projecto de estimadores de presença de pontos de contorno baseado na utilização de equações integrais de Fredholm; um classificador não-linear que utiliza informação de pontos vizinhos para a tomada de decisão, e uma metodologia de agrupamento de pontos de contorno com crescimento iterativo com uma função de custo com suporte local. A metodologia de extracção das propriedades baseada na equação integral de Fredholm de primeira ordem permite uma análise unificadora de vários métodos previamente propostos na literatura sobre o assunto. O procedimento de classificação dos pontos de contorno baseia-se na análise das sequências ordenadas das amplitudes do gradiente na vizinhança do ponto de contorno. O procedimento é estudado com base nas funções densidade de distribuição das estatísticas ordenadas dos pontos de contorno vizinhos e na assunção de que os pontos de um mesmo contorno possuem distribuições ordenadas similares. A fase final da detecção de contornos é realizada com um procedimento de agrupamento de contornos em que se constrói uma hipótese de vizinhança para eventual crescimento do contorno e em que se estima o melhor ponto para agregação ao contorno. Os resultados experimentais para os métodos propostos são apresentados e analisados com imagens reais e sintéticas