A busca por padrões em imagens é um problema clássico em visão computacional e consiste em detectar a presença de uma dada máscara em uma imagem digital. Tal tarefa pode se tornar consideravelmente mais complexa com a invariância aos aspectos da imagem tais como rotação, escala, translação, brilho e contraste (RSTBC - rotation, scale, translation, brightness and contrast). Um algoritmo de busca de máscara foi recentemente proposto. Este algoritmo, chamado de Ciratefi, é invariante aos aspectos RSTBC e mostrou-se bastante robusto. Entretanto, a execução deste algoritmo em um computador convencional requer diversos segundos. Além disso, sua implementação na forma mais geral em hardware é difícil pois há muitos parâmetros ajustáveis. Este trabalho propõe o projeto de um software que gera automaticamente módulos compiláveis em Hardware Description Logic (VHDL) que implementam o filtro circular do algoritmo Ciratefi em dispositivos Field Programmable Gate Array (FPGA). A solução proposta acelera o tempo de processamento de 7s (em um PC de 3GHz) para 1,367ms (em um dispositivo Stratix III da Altera). Esta performance excelente (mais do que o necessário em sistemas em tempo-real) pode levar a sistemas de visão computacional de alta performance e de baixo custo. / Template matching is a classical problem in computer vision. It consists in detecting the presence of a given template in a digital image. This task becomes considerably more complex with the invariance to rotation, scale, translation, brightness and contrast (RSTBC). A novel RSTBC-invariant robust template matching algorithm named Ciratefi was recently proposed. However, its execution in a conventional computer takes several seconds. Moreover, the implementation of its general version in hardware is difficult, because there are many adjustable parameters. This work proposes a software that automatically generates compilable Hardware Description Logic (VHDL) modules that implement the circular filter of the Ciratefi template matching algorithm in Field Programmable Gate Array (FPGA) devices. The proposed solution accelerates the time to process a frame from 7s (in a 3GHz PC) to 1.367ms (in Altera Stratix III device). This excellent performance (more than the required for a real-time system) may lead to cost-effective high-performance coprocessing computer vision systems.

Durant ces dernières années, Il est de plus en plus compliqué d'écrire du code qui utilise une architecture au mieux de ses capacités. Certaines opérations clefs ont soit un accélérateur dédié, ou admettent une implémentation finement optimisée qui délivre les meilleurs performances. Ainsi, il est intéressant d'identifier ces opérations pendant la compilation d'un programme, et de faire appel à une implémentation optimisée.Nous nous intéressons dans cette thèse au problème de détection de ces opérations. Nous proposons un procédé qui détecte des sous-calculs correspondant à des opérations d'algèbre linéaire à l'intérieur de programmes polyédriques. L'idée principale de ce procédé est de découper le programme en sous-calculs isolés, et essayer de reconnaître chaque sous-calculs comme une combinaison d'opérateurs d'algèbre linéaire.Le découpage du calcul est effectué en utilisant une transformation de programme appelée tuilage monoparamétrique. Cette transformation partitionne le calcul en tuiles dont la forme est un agrandissement paramétrique d'une tuile de taille constante. Nous montrons que le programme tuilé reste polyédrique tout en permettant une paramétrisation limitée des tailles de tuile. Les travaux précédents sur le tuilage nous forçaient à choisir l'une de ces deux propriétés.Ensuite, afin d'identifier les opérateurs, nous introduisons un algorithme de reconnaissance de template, qui est une extension d'un algorithme d'équivalence de programme. Nous proposons plusieurs extensions afin de tenir compte des propriétés sémantiques communément rencontrées en algèbre linéaire.Enfin, nous combinons les deux contributions précédentes en un procédé qui détecte les sous-calculs correspondant à des opérateurs d'algèbre linéaire. Une de ses composantes est une librairie de template, inspirée de la spécification BLAS. Nous démontrons l'efficacité de notre procédé sur plusieurs applications. / Writing a code which uses an architecture at its full capability has become an increasingly difficult problem over the last years. For some key operations, a dedicated accelerator or a finely tuned implementation exists and delivers the best performance. Thus, when compiling a code, identifying these operations and issuing calls to their high-performance implementation is attractive. In this dissertation, we focus on the problem of detection of these operations. We propose a framework which detects linear algebra subcomputations within a polyhedral program. The main idea of this framework is to partition the computation in order to isolate different subcomputations in a regular manner, then we consider each portion of the computation and try to recognize it as a combination of linear algebra operations.We perform the partitioning of the computation by using a program transformation called monoparametric tiling. This transformation partitions the computation into blocks, whose shape is some homothetic scaling of a fixed-size partitioning. We show that the tiled program remains polyhedral while allowing a limited amount of parametrization: a single size parameter. This is an improvement compared to the previous work on tiling, that forced us to choose between these two properties.Then, in order to recognize computations, we introduce a template recognition algorithm. This template recognition algorithm is built on a state-of-the-art program equivalence algorithm. We also propose several extensions in order to manage some semantic properties.Finally, we combine these two previous contributions into a framework which detects linear algebra subcomputations. A part of this framework is a library of template, based on the BLAS specification. We demonstrate our framework on several applications.

An attentional template based on a feature in visual working memory (VWM) can be used to bias attention toward feature-matching objects in the visual field. Attentional guidance based on a single feature is highly efficient and has been well characterized. It is debated, however, whether multiple features can be used to guide attention simultaneously. Some argue that only a single feature in VWM can be elevated to an “active” state and influence perceptual selection. To evaluate whether multiple features can guide attention simultaneously, eye movements were recorded while participants completed both traditional and gaze-contingent visual search tasks. Participants demonstrated guidance by multiple features by switching between relevant colors frequently and without delay. Furthermore, relevant objects of different colors actively competed for saccadic selection. These results provide compelling evidence that multiple attentional templates are able to guide selection simultaneously. Although it was originally proposed that a feature in VWM could also be used to bias attention away from irrelevant items (“template for rejection”), the evidence thus far has been mixed. Some studies report that participants were faster to find a target item after being cued with a distractor feature, suggesting participants were using this feature to avoid matching items, while other studies report a cost and find that participants actually attended to cue-matching items even though they are irrelevant. The current work demonstrates that some evidence in support of feature-guided avoidance can be explained by spatially recoding the cued feature information. Furthermore, when shown a distractor color at the beginning of a trial, participants frequently fixated a matching object early in the trial, but avoided matching objects later in the trial. Other work has suggested that this initial attentional capture by a cue-matching object facilitates later avoidance, but the current data do not support a functional relationship of this nature. In sum, it may not be possible to implement an exclusionary template directly as feature-guided avoidance, but it may be possible to implement indirectly by converting the irrelevant feature information into relevant feature or spatial information.

Having conducted the research described in this thesis I found that there exists a possibility to produce polyelectrolyte nanostructures on hydrophobic surfaces by application of the moving contact line approach. It was demonstrated that the morphology of nanostructures displays a range of structure variations from root-like to a single wire structure with a high anisotropy and aspect ratio (providing diameters of several nanometers and the length limited by the sample surface dimensions). Such nanostructures can be produced exactly on the spot of interest or can be transferred from the surface where they were produced to any other surfaces by the contact printing technique. A model describing the polymer deposition during the moving contact line processes on hydrophobic surfaces has been proposed. The application of this model provides the ground for an explanation of all the obtained experimental data. Utilizing moving contact line approach aligned one-dimensional polycation structures were fabricated and these structures were used as templates for assembling amphiphile molecules. Quasiperiodic aligned and oriented nanostructures of polyelectrolyte molecules formed in moving droplets were utilized for fabrication of electrically conductive one-dimensional nanowires.

- Einführung in die Arbeit mit Templates - Vorstellung der in der STL enthaltenen Templates - Beispiele für deren Nutzung

Made available in DSpace on 2014-06-11T19:25:32Z (GMT). No. of bitstreams: 0 Previous issue date: 2010-04-08Bitstream added on 2014-06-13T19:53:24Z : No. of bitstreams: 1 pipi_arf_me_ilha.pdf: 5601014 bytes, checksum: e6e8165f62f904c9ebc3d807bad047c8 (MD5) / Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) / O presente trabalho apresenta a preparação e caracterização de uma sílica micelar template modificada com Ti(IV), e posterior reação em H3PO4. O produto formado, chamado de SMT-2, foi caracterizado por espectroscopia na região do infravermelho (FTIR), difração de Raios X (DRX), análise de área superficial e porosidade. Este material não adsorveu metais e sim compostos fenotiazínicos. Uma caracterização dos compostos fenotiazínicos nas cavidades da SMT-2 foi realizada empregando técnicas de FTIR, termogravimetria e voltametrica cíclica. O voltamograma cíclico do eletrodo de pasta de grafite modificado apresentou dois pares redox com potencial padrão (E0’), onde E0’ = (Epa+Epc)/2, 0,09 V para o pico I e 0,42 V para o pico II (v=50 mV s-1; solução tampão Britton-robinson; pH 2) versus Ag/AgCl que foi atribuído ao monômero e dímero do azul de orto toluidina nas cavidades da SMT-2, estes resultados foram análogos ao azul de metileno e azure A. Em uma segunda etapa, preparou-se óxido de titânio seguindo uma nova metodologia de síntese. Por analogia a SMT-2, o material preparado foi modificado com H3PO4, que foi descrito como TiP, e contrariamente ao SMT-2, o material apresentou capacidade de adsorver íons metálicos (Co2+, Cu2+, Ni2+). Após a caracterização do TiP pelas técnicas supracitadas, efetuaram-se os estudos de adsorção de íons de Co2+, Cu2+ e Ni2+ em meio aquoso, etanol/água (42%) e etanol (99%) onde se determinou para estes metais os respectivos tempos de equilíbrio de sorção. Após a determinação do tempo de equilíbrio para a adsorção dos íons metálicos em cada sistema, determinou-se a capacidade específica de sorção (NfMax) através de isotermas de sorção. Para o Co2+, os valores de Nf foram: em meio aquoso (4,95 x 10-4 mol g-1), etanol/água 42% (6,09 x 10-4 mol g-1) e... / This work presents the preparation of a micellar template silica modified with Ti (IV), and subsequent reaction with H3PO4. The product formed, called SMT-2, was characterized by spectroscopy in infrared region (FTIR), X-ray diffraction (XRD), surface area analysis and porosity. This material did not adsorbed metals but adsorbed phenothiazine compounds. A characterization of phenothiazine compounds in the wells of SMT-2 was performed using techniques of FTIR, thermogravimetric analysis and cyclic voltammetry. The cyclic voltammogram of modified graphite paste electrode showed two redox couples with standard potential (E0'), where E0' = (Epa + Epc) / 2, 0.09 to peak I and 0.42 to peak II ( v = 50 mV s-1 BR solution, pH 2) vs. Ag / AgCl which was assigned to the monomer and dimer of ortho toluidine blue into the wells of SMT-2, these results were similar to methylene blue and azure A. In a second step, prepared titanium oxide following a new methodology for synthesis. By analogy of SMT-2, the prepared material was modified with H3PO4, which was abbreviated as TiP, contrary to the SMT-2, the material shows the ability to adsorb metal ions (Co2+, Cu2+, Ni2+). After characterizing the TiP by the techniques described above, were conducted studies of ion adsorption of Co2+, Cu2+ and Ni2+ in water, ethanol/water (42%) and ethanol (99%) which was determined for these metals their equilibrium times sorption. After determining the equilibrium time for adsorption of metal ions in each system, we determined the specific sorption capacity (NfMax) through sorption isotherms. For the Co2+, the values of Nf were in water (4.95 x 10-4 mol g-1), ethanol/water 42% (6.09 x 10-4 mol g-1) and ethanol 99% (3.00 x 10-4 mol g-1), with concentrations of Co2 + ions ranging from 9.03 to 18.63 x 10-4 mol L-1. As for the Cu2 + these values were: in water... (Summary complete electronic access click below)

A busca por padrões em imagens é um problema clássico em visão computacional e consiste em detectar a presença de uma dada máscara em uma imagem digital. Tal tarefa pode se tornar consideravelmente mais complexa com a invariância aos aspectos da imagem tais como rotação, escala, translação, brilho e contraste (RSTBC - rotation, scale, translation, brightness and contrast). Um algoritmo de busca de máscara foi recentemente proposto. Este algoritmo, chamado de Ciratefi, é invariante aos aspectos RSTBC e mostrou-se bastante robusto. Entretanto, a execução deste algoritmo em um computador convencional requer diversos segundos. Além disso, sua implementação na forma mais geral em hardware é difícil pois há muitos parâmetros ajustáveis. Este trabalho propõe o projeto de um software que gera automaticamente módulos compiláveis em Hardware Description Logic (VHDL) que implementam o filtro circular do algoritmo Ciratefi em dispositivos Field Programmable Gate Array (FPGA). A solução proposta acelera o tempo de processamento de 7s (em um PC de 3GHz) para 1,367ms (em um dispositivo Stratix III da Altera). Esta performance excelente (mais do que o necessário em sistemas em tempo-real) pode levar a sistemas de visão computacional de alta performance e de baixo custo. / Template matching is a classical problem in computer vision. It consists in detecting the presence of a given template in a digital image. This task becomes considerably more complex with the invariance to rotation, scale, translation, brightness and contrast (RSTBC). A novel RSTBC-invariant robust template matching algorithm named Ciratefi was recently proposed. However, its execution in a conventional computer takes several seconds. Moreover, the implementation of its general version in hardware is difficult, because there are many adjustable parameters. This work proposes a software that automatically generates compilable Hardware Description Logic (VHDL) modules that implement the circular filter of the Ciratefi template matching algorithm in Field Programmable Gate Array (FPGA) devices. The proposed solution accelerates the time to process a frame from 7s (in a 3GHz PC) to 1.367ms (in Altera Stratix III device). This excellent performance (more than the required for a real-time system) may lead to cost-effective high-performance coprocessing computer vision systems.

Submitted by Fabio Sobreira Campos da Costa (fabio.sobreira@ufpe.br) on 2017-02-20T12:58:09Z No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) DISSERTAÇÃO_VERSÃO FINAL_RENATA GOMES MENDES_UFPE.pdf: 1676208 bytes, checksum: 522afbbba7aa9e69efcc5f019ddcbfa6 (MD5) / Made available in DSpace on 2017-02-20T12:58:09Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) DISSERTAÇÃO_VERSÃO FINAL_RENATA GOMES MENDES_UFPE.pdf: 1676208 bytes, checksum: 522afbbba7aa9e69efcc5f019ddcbfa6 (MD5) Previous issue date: 2016-06-09 / A necessidade de se obter conhecimento tem aumentado com o surgimento das novas tecnologias que facilitam o acesso à informação. Os órgãos e entidades públicas, há algum tempo, despertaram para a necessidade de informar ao cidadão os serviços prestados e suas ações. Para tanto, a sociedade civil tem acompanhado a implantação de políticas de transparência que vêm sendo adotadas por meio da promulgação de legislação que contemple, reforce e amplie a transparência. Assim, a Carta de Serviço ao Cidadão surge como mais um instrumento de informação ao cidadão. Sua implantação, no entanto, precede do conhecimento adequado dos processos de negócios, o que em muitos casos impede sua confecção e implementação. Desse modo, o objetivo deste trabalho é apresentar um método que possibilite descrever as etapas da prestação do serviço que deve compor a Carta de Serviço ao Cidadão a partir do modelo (desenho) do processo de negócio desenvolvido na notação BPMN, mais especificamente os fluxos de mensagens trocadas no processo com o(s) seu(s) participante(s) externo(s). O produto do método é um template que foi aqui especificado a partir de regras de produção que, ao percorrer o fluxo de controle do processo, descreve os serviços da Carta. Assim, a Carta gerada a partir desse template estará em conformidade com o processo de negócio. A pesquisa se classifica como descritiva e adota as estratégias da pesquisa documental, aplicada e estudo de caso. A validação do template ocorreu a partir do estudo de caso com modelos de processos de negócios disponibilizados pela Universidade Federal de Pernambuco (UFPE). Como resultado foi possível constatar que o template, além de compatibilizar os processos de negócios com a Carta, está aderente ao seu propósito inicialmente idealizado. Ou seja, de retratar a realidade dos serviços prestados pelos órgãos públicos, a partir da descrição dos seus processos de negócios, como determina o Decreto 6.932/2009. Tal iniciativa permitirá mais transparência no serviço público, possibilitando, assim, um melhor entendimento por parte dos cidadãos e demais envolvidos sobre o funcionamento dos órgãos públicos. Isso poderá garantir uma maior participação e controle social, que é um dos objetivos propostos pela Carta de Serviços ao Cidadão. / The necessity of obtaining knowledge has increased with the emergence of new technologies that facilitate access to information. Public institutions and authorities have been aware for some time of the need to inform the citizens about its services and actions. To this end, civil society has been monitoring the implementation of transparency policies that have been adopted through the enactment of laws that address, strengthen and deepen transparency. Thus, the Citizen Service Charter emerges as another instrument of information to citizens. Its implementation, however, is preceded by the proper knowledge of business processes, which in many cases prevents its design and implementation. Thus, the aim of this dissertation is to present a method that allows describe steps services provided the Citizen Service Charter from the template (design) of the business process developed in BPMN notation, more specifically the message flows exchanged between the process with the is the participant(s) foreign(s). The product of the method is a template that was specified here from production rules, which describe the Charter to by going through the process control flow. Hence, the Charter described from the template will always be in conformity with business process. The research is classified as descriptive and adopts the documentary research, applied and case study strategies. The template validation has occurred from a case study of business process models of the Federal University of Pernambuco (UFPE). As a result, it was established that the template, in addition to compatibilizing business processes with the Charter is connected to its initially idealized purpose. That is, to portray the reality of services provided by public agencies from the description of their business processes, as determined by Decree 6932/2009. This initiative allows greater transparency in public service and a better understanding by citizens and other stakeholders on the functioning of a public agency. This ensures more participation and social control, which is one of the goals proposed by the Citizen Service Charter.

En anatomie computationnelle, on suppose que les formes d'organes sont issues des déformations d'un template commun. Les données peuvent être des images ou des surfaces d'organes, les déformations peuvent être des difféomorphismes. Pour estimer le template, on utilise souvent un algorithme appelé «max-max» qui minimise parmi tous les candidats, la somme des carrées des distances après recalage entre les données et le template candidat. Le recalage est l'étape de l'algorithme qui trouve la meilleure déformation pour passer d'une forme à une autre. Le but de cette thèse est d'étudier cet algorithme max-max d'un point de vue mathématique. En particulier, on prouve que cet algorithme est inconsistant à cause du bruit. Cela signifie que même avec un nombre infini de données et avec un algorithme de minimisation parfait, on estime le template original avec une erreur non nulle. Pour prouver l'inconsistance, on formalise l'estimation du template. On suppose que les déformations sont des éléments aléatoires d'un groupe qui agit sur l'espace des observations. L'algorithme étudié est interprété comme le calcul de la moyenne de Fréchet dans l'espace des observations quotienté par le groupe des déformations. Dans cette thèse, on prouve que l'inconsistance est dû à la contraction de la distance quotient par rapport à la distance dans l'espace des observations. De plus, on obtient un équivalent de biais de consistance en fonction du niveau de bruit. Ainsi, l'inconsistance est inévitable quand le niveau de bruit est suffisamment grand. / In computational anatomy, organ shapes are assumed to be deformation of a common template. The data can be organ images but also organ surfaces, and the deformations are often assumed to be diffeomorphisms. In order to estimate the template, one often uses the max-max algorithm which minimizes, among all the prospective templates, the sum of the squared distance after registration between the data and a prospective template. Registration is here the step of the algorithm which finds the best deformation between two shapes. The goal of this thesis is to study this template estimation method from a mathematically point of view. We prove in particular that this algorithm is inconsistent due to the noise. This means that even with an infinite number of data, and with a perfect minimization algorithm, one estimates the original template with an error. In order to prove inconsistency, we formalize the template estimation: deformations are assumed to be random elements of a group which acts on the space of observations. Besides, the studied algorithm is interpreted as the computation of the Fréchet mean in the space of observations quotiented by the group of deformations. In this thesis, we prove that the inconsistency comes from the contraction of the distance in the quotient space with respect to the distance in the space of observations. Besides, we obtained a Taylor expansion of the consistency bias with respect to the noise level. As a consequence, the inconsistency is unavoidable when the noise level is high.

- Einführung in die Arbeit mit Templates - Vorstellung der in der STL enthaltenen Templates - Beispiele für deren Nutzung