The aim of this thesis is to familiarize with the issue of registration of medical image sequences. The main objective was to focus on the method of feature tracking in the image and various options of its implementation. The theoretical part describes various methods for detection of feature points and future point matching methods. In the practical part these methods were implemented in Matlab programming environment and a simple graphical user interface was created.

Freehand sketching is both a natural and crucial part of design, yet is unsupported by current design automation software. We are working to combine the flexibility and ease of use of paper and pencil with the processing power of a computer to produce a design environment that feels as natural as paper, yet is considerably smarter. One of the most basic steps in accomplishing this is converting the original digitized pen strokes in the sketch into the intended geometric objects using feature point detection and approximation. We demonstrate how multiple sources of information can be combined for feature detection in strokes and apply this technique using two approaches to signal processing, one using simple average based thresholding and a second using scale space.

This thesis is based on the DSP to develop a facial expression recognition system. Most facial expression recognition systems suppose that human faces have been found, or the background colors are simple, or the facial feature points are extracted manually. Only few recognition systems are automatic and complete. This thesis is a complete facial expression system. Images are captured by CCD camera. DSP locates the human face, extracts the facial feature points and recognizes the facial expression automatically. The recognition system is divided into four sub-system: Image capture system, Genetic Algorithm human face location system, Facial feature points extraction system, Fuzzy logic facial expression recognition system. Image capture system is using CCD camera to capture the facial expression image which will be recognized in any background, and transmitting the image data to SRAM on DSP through the PPI interface on DSP. Human face location system is using genetic algorithm to find the human face¡¦s position in image by facial skin color and ellipse information, no matter what the size of the human face or the background is simple. Feature points extraction system is finding 16 facial feature points in located human face by many image process skills. Facial expression recognition system is analyzing facial action units by 16 feature points and making them fuzzily. Judging the four facial expression: happiness, anger, surprise and neutral, by fuzzy rule bases.. According to the results of the experiment. The facial expression system has nice performance on recognition rate and recognition speed.

The technology of machine vision is board applied in many aspects such as industrial inspection, medical image processing, remote sensing and nanotechnology. It recovers useful information about a scene from its two-dimension projections. This recovery requires the inversion of a many-to-one mapping. But we usually lose some important data for not exactly correct mapping. It might occur from lens distortion, rotation and perspective distortion, and non-ideal vision systems. Camera calibration can compensate for these ill-conditions. In this thesis I present an active calibration technique derived from Song¡¦s research (1996) for calibrating the camera intrinsic parameters. It requires no reference object and directly uses the images of the environment. We only have to control the camera acting a series translational motion by the XYZ 3-D table.

The use of computer animated interactive faces in film, TV, games is ever growing, with new application areas emerging also on the Internet and mobile environments. Morph targets are one of the most popular methods to animate the face. Up until now 3D artists had to design each morph target defined by the MPEG-4 standard by hand. This is a very monotonous and tedious task. With the newly developed method of Facial Motion Cloning [11]the heavy work is relieved from the artists. From an already animated face model the morph targets can now be copied onto a new static face model. For the Facial Motion Cloning process there must be a subset of the feature points specified by the MPEG-4 standard defined. The purpose of this is to correlate the facial features of the two faces. The goal of this project is to develop a graphical editor in which the artists can define the feature points for a face model. The feature points will be saved in a file format that can be used in a Facial Motion Cloning software.

<p>The use of computer animated interactive faces in film, TV, games is ever growing, with new application areas emerging also on the Internet and mobile environments. Morph targets are one of the most popular methods to animate the face. Up until now 3D artists had to design each morph target defined by the MPEG-4 standard by hand. This is a very monotonous and tedious task. With the newly developed method of Facial Motion Cloning [11]the heavy work is relieved from the artists. From an already animated face model the morph targets can now be copied onto a new static face model. </p><p>For the Facial Motion Cloning process there must be a subset of the feature points specified by the MPEG-4 standard defined. The purpose of this is to correlate the facial features of the two faces. The goal of this project is to develop a graphical editor in which the artists can define the feature points for a face model. The feature points will be saved in a file format that can be used in a Facial Motion Cloning software.</p>

Osteoarthritis (OA) is the most common form of human joint disease causing significant pain and disability. Current treatment for hip OA is limited to pain management and joint replacement for end-stage disease. The development of methods for early diagnosis and new treatment options are urgently needed to minimise the impact of the disease. Studies of hip OA have shown that hip joint morphology correlates with susceptibility to hip OA and disease progression. Bone shape analyses play an important role in disease diagnosis, pre-operative planning, and treatment analysis as well as in epidemiological studies aimed at identifying risk factors for hip OA. Statistical Shape Models (SSMs) are being increasingly applied to imaging-based bone shape analyses as they provide a means of quantitatively describing the global shape of the bone. This is in contrast to conventional clinical and research practice where the analysis of bone shape is reduced to a series of measurements of lengths and angles. This thesis describes the development of a novel fully automatic software system that segments the proximal femur from anteroposterior (AP) pelvic radiographs by densely placing 65 points along its contour. These annotations can then be used for the detailed morphometric analysis of proximal femur shape. The performance of the system was evaluated on a large dataset of 839 radiographs of mixed quality. Achieving a mean point-to-curve error of less than 0.9mm for 99% of all 839 AP pelvic radiographs, this is the most accurate and robust automatic method for segmenting the proximal femur in two-dimensional radiographs yet published. The system was also applied to a number of morphometric analyses of the proximal femur, showing that SSM-based radiographic proximal femur shape significantly differs between males and females, and is highly symmetric between the left and right hip joint of an individual. In addition, the research described in this thesis demonstrates how the point annotations resulting from the system can be used for univariate and multivariate genetic association analyses, identifying three novel genetic variants that contribute to radiographic proximal femur shape while also showing an association with hip OA.The developed system will facilitate complex morphometric and genetic analyses of shape variation of the proximal femur across large datasets, paving the way for the development of new options to diagnose, treat and prevent hip OA.

The evolution of technology has led the research into new emerging wearable devices such as the Smart Glasses. This technology provides with new visualization techniques. Augmented Reality is an advanced technology that could significantly ease the execution of much complex operations. Augmented Reality is a combination of both Virtual and Actual Reality, making accessible to the user new tools to safeguard in the transfer of knowledge in several environments and for several processes. This thesis explores the development of an android based image recognition application. The feature point detectors and descriptors are used as they can deal great with the correspondence problems. The selection of best image recognition technique on the smart glasses is chosen based on the time taken to retrieve the results and the amount of power consumed in the process. As the smart glasses are equipped with the limited resources, the selected approach should use low computation on it by making the device operations uninterruptable. The effective and efficient method for detection and recognition of the safety signs from images is selected. The ubiquitous SIFT and SURF feature detectors consume more time and are computationally complex and require very high-level hardware components for processing. The binary descriptors are taken into account as they are light weight and can support low power devices in a much effective style. A comparative analysis is being done on the working of binary descriptors like BRIEF, ORB, AKAZE, FREAK, etc., on the smart glasses based on their performance and the requirements. ORB is the most efficient among the binary descriptors and has been more effective for the smart glasses in terms of time measurements and low power consumption.

O registro de imagens tem um papel importante em várias aplicações, tais como reconstrução de objetos 3D, reconhecimento de padrões, imagens microscópicas, entre outras. Este registro é composto por três passos principais: (1) seleção de pontos de interesse; (2) extração de características dos pontos de interesse; (3) correspondência entre os pontos de interesse de uma imagem para a outra. Para os passos 1 e 2, algoritmos como SIFT e SURF têm apresentado resultados satisfatórios. Entretanto, para o passo 3 ocorre a presença de outliers, ou seja, pontos de interesse que foram incorretamente correspondidos. Uma única correspondência incorreta leva a um resultado final indesejável. Os algoritmos para remoção de outliers (consenso) possuem um alto custo computacional, que cresce à medida que a quantidade de outliers aumenta. Com o objetivo de reduzir o tempo de processamento necessário por esses algoritmos, o algoritmo FOMP(do inglês, Filtering out Outliers from Matched Points), foi proposto e desenvolvido neste trabalho para realizar a filtragem de outliers no conjunto de pontos inicialmente correspondidos. O método FOMP considera cada conjunto de pontos como um grafo completo, no qual os pesos são as distâncias entre os pontos. Por meio da soma de diferenças entre os pesos das arestas, o vértice que apresentar maior valor é removido. Para validar o método FOMP, foram realizados experimentos utilizando quatro bases de imagens. Cada base apresenta características intrínsecas: (a) diferenças de rotação zoom da câmera; (b) padrões repetitivos, os quais geram duplicidade nos vetores de características; (c) objetos de formados, tais como plásticos, papéis ou tecido; (d) transformações afins (diferentes pontos de vista). Os experimentos realizados mostraram que o filtro FOMP remove mais de 65% dos outliers, enquanto mantém cerca de 98%dos inliers. A abordagem proposta mantém a precisão dos métodos de consenso, enquanto reduz o tempo de processamento pela metade para os métodos baseados em grafos. / Image matching plays a major role in many applications, such as pattern recognition and microscopic imaging. It encompasses three steps: 1) interest point selection; 2) feature extraction from each point; 3) feature point matching. For steps 1 and 2, traditional interest point detectors/ extractors have worked well. However, for step 3 even a few points incorrectly matched (outliers), might lead to an undesirable result. State-of-the-art consensus algorithms present a high time cost as the number of outlier increases. Aiming at overcoming this problem, we present FOMP, a preprocessing approach, that reduces the number of outliers in the initial set of matched points. FOMP filters out the vertices that present a higher difference among their edges in a complete graph representation of the points. To validate the proposed method, experiments were performed with four image database: (a) variations of rotation or camera zoom; (b) repetitive patterns, which leads to duplicity of features vectors; (c) deformable objects, such as plastics, clothes or papers; (d) affine transformations (different viewpoint). The experimental results showed that FOMP removes more than 65% of the outliers, while keeping over 98% of the inliers. Moreover, the precision of traditional methods is kept, while reducing the processing time of graph based approaches by half.

O registro de imagens tem um papel importante em várias aplicações, tais como reconstrução de objetos 3D, reconhecimento de padrões, imagens microscópicas, entre outras. Este registro é composto por três passos principais: (1) seleção de pontos de interesse; (2) extração de características dos pontos de interesse; (3) correspondência entre os pontos de interesse de uma imagem para a outra. Para os passos 1 e 2, algoritmos como SIFT e SURF têm apresentado resultados satisfatórios. Entretanto, para o passo 3 ocorre a presença de outliers, ou seja, pontos de interesse que foram incorretamente correspondidos. Uma única correspondência incorreta leva a um resultado final indesejável. Os algoritmos para remoção de outliers (consenso) possuem um alto custo computacional, que cresce à medida que a quantidade de outliers aumenta. Com o objetivo de reduzir o tempo de processamento necessário por esses algoritmos, o algoritmo FOMP(do inglês, Filtering out Outliers from Matched Points), foi proposto e desenvolvido neste trabalho para realizar a filtragem de outliers no conjunto de pontos inicialmente correspondidos. O método FOMP considera cada conjunto de pontos como um grafo completo, no qual os pesos são as distâncias entre os pontos. Por meio da soma de diferenças entre os pesos das arestas, o vértice que apresentar maior valor é removido. Para validar o método FOMP, foram realizados experimentos utilizando quatro bases de imagens. Cada base apresenta características intrínsecas: (a) diferenças de rotação zoom da câmera; (b) padrões repetitivos, os quais geram duplicidade nos vetores de características; (c) objetos de formados, tais como plásticos, papéis ou tecido; (d) transformações afins (diferentes pontos de vista). Os experimentos realizados mostraram que o filtro FOMP remove mais de 65% dos outliers, enquanto mantém cerca de 98%dos inliers. A abordagem proposta mantém a precisão dos métodos de consenso, enquanto reduz o tempo de processamento pela metade para os métodos baseados em grafos. / Image matching plays a major role in many applications, such as pattern recognition and microscopic imaging. It encompasses three steps: 1) interest point selection; 2) feature extraction from each point; 3) feature point matching. For steps 1 and 2, traditional interest point detectors/ extractors have worked well. However, for step 3 even a few points incorrectly matched (outliers), might lead to an undesirable result. State-of-the-art consensus algorithms present a high time cost as the number of outlier increases. Aiming at overcoming this problem, we present FOMP, a preprocessing approach, that reduces the number of outliers in the initial set of matched points. FOMP filters out the vertices that present a higher difference among their edges in a complete graph representation of the points. To validate the proposed method, experiments were performed with four image database: (a) variations of rotation or camera zoom; (b) repetitive patterns, which leads to duplicity of features vectors; (c) deformable objects, such as plastics, clothes or papers; (d) affine transformations (different viewpoint). The experimental results showed that FOMP removes more than 65% of the outliers, while keeping over 98% of the inliers. Moreover, the precision of traditional methods is kept, while reducing the processing time of graph based approaches by half.