基于线性不变矩和角度向量的立体匹配算法

针对室内场景双目立体匹配有别于一般场景立体匹配的特殊性,提出了一种计算简便、准确度高的立体图像匹配算法。该算法首先利用canny算子检测物体的边缘,根据边缘的线性不变矩寻找出目标物体,然后提取出目标物体轮廓的特征点,利用角度直方图计算出左右图像的旋转角度,最后利用角度向量实现左右图像的对应像素点的匹配。线性不变矩有效地将计算复杂度由二维降低到一维,大大降低了计算量。角度向量的提出降低了特征点匹配的复杂度,而且计算简便,准确率高。实验表明,该算法对图像的缩放、旋转、平移均免疫,具有较高的识别精度和良好的抗干扰性,计算效率高于传统方法,有着较高的应用价值。

基于外极线分区的动态立体匹配算法

基于区域的立体匹配算法仅针对支撑窗内的灰度信息定义匹配代价函数,导致在弱(无)纹理区域采用WTA优化出现歧义性。该文在外极线分区的基础上,改用区域作为匹配基元,针对歧义性区域,在代价函数中引入遮挡项和平滑项,并按照区域优先级的高低,动态匹配相应区域,获得可靠的视差信息。实验证明,该算法在保持实时性的同时对弱纹理区域处理具有有效性。

基于点集曲面投影算法的自由曲面匹配

测量数据的精确定位是实现复杂曲面加工检测的关键,针对测量点云数据与NURBS表示的CAD自由曲面模型匹配中求最近点计算方面存在的问题,提出了一种简单、有效的寻找最近点的方法。该方法与由测量点集评估给定曲面上的最近点的传统算法相反,采用点集曲面(point set surface,PSS)投影算法,对给定自由曲面模型上有限个点与不附加任何几何和拓扑信息的散乱点集之间进行粗匹配获得初始位置,进而以最近点迭代算法(ICP)完成测量数据定位的精确调整,达到全局及局部最优的目标。实验结果表明,采用PSS投影算法法寻找最近点不仅效率高,而且能得到全局匹配结果,可以为精匹配提供较好的计算初值,减少了ICP算法进行二次匹配时,迭代次数及执行时间并且精度得到了较大提高。

Three-Dimensional Recognition of Solid Objects from a Two-Dimensional Image

This thesis addresses the problem of recognizing solid objects in the three-dimensional world, using two-dimensional shape information extracted from a single image. Objects can be partly occluded and can occur in cluttered scenes. A model based approach is taken, where stored models are matched to an image. The matching problem is separated into two stages, which employ different representations of objects. The first stage uses the smallest possible number of local features to find transformations from a model to an image. This minimizes the amount of search required in recognition. The second stage uses the entire edge contour of an object to verify each transformation. This reduces the chance of finding false matches.

Automatic Video Analysis for Fisheries Survey Systems

Thesis (Ph.D.)--University of Washington, 2015

Using Modern Tools to Explain the Use of the Smith Chart

The concept of explaining the use of an old tool like the Smith chart, using modern tools like MATLAB [1] scripts in combination with e-learning facilities, is exemplified by two MATLAB scripts. These display, step by step, the graphical procedure that must be used to solve the double-stub impedance-matching problem. These two scripts correspond to two different possible ways to analyze this matching problem, and they are important for students to learn by themselves.

Quantum wire with periodic serial structure

Electron wave motion in a quantum wire with periodic structure is treated by direct solution of the Schrödinger equation as a mode-matching problem. Our method is particularly useful for a wire consisting of several distinct units, where the total transfer matrix for wave propagation is just the product of those for its basic units. It is generally applicable to any linearly connected serial device, and it can be implemented on a small computer. The one-dimensional mesoscopic crystal recently considered by Ulloa, Castaño, and Kirczenow [Phys. Rev. B 41, 12 350 (1990)] is discussed with our method, and is shown to be a strictly one-dimensional problem. Electron motion in the multiple-stub T-shaped potential well considered by Sols et al. [J. Appl. Phys. 66, 3892 (1989)] is also treated. A structure combining features of both of these is investigated

Derivation of an Efficient Rule System Pattern Matcher

Formalizing algorithm derivations is a necessary prerequisite for developing automated algorithm design systems. This report describes a derivation of an algorithm for incrementally matching conjunctive patterns against a growing database. This algorithm, which is modeled on the Rete matcher used in the OPS5 production system, forms a basis for efficiently implementing a rule system. The highlights of this derivation are: (1) a formal specification for the rule system matching problem, (2) derivation of an algorithm for this task using a lattice-theoretic model of conjunctive and disjunctive variable substitutions, and (3) optimization of this algorithm, using finite differencing, for incrementally processing new data.

Femtosecond pulse shaping using differential evolutionary algorithm and wavelet operators

Evolutionary meta-algorithms for pulse shaping of broadband femtosecond duration laser pulses are proposed. The genetic algorithm searching the evolutionary landscape for desired pulse shapes consists of a population of waveforms (genes), each made from two concatenated vectors, specifying phases and magnitudes, respectively, over a range of frequencies. Frequency domain operators such as mutation, two-point crossover average crossover, polynomial phase mutation, creep and three-point smoothing as well as a time-domain crossover are combined to produce fitter offsprings at each iteration step. The algorithm applies roulette wheel selection; elitists and linear fitness scaling to the gene population. A differential evolution (DE) operator that provides a source of directed mutation and new wavelet operators are proposed. Using properly tuned parameters for DE, the meta-algorithm is used to solve a waveform matching problem. Tuning allows either a greedy directed search near the best known solution or a robust search across the entire parameter space.

Correspondência estéreo usando imagens em multiresolução com profundidade variável

We propose a multi-resolution, coarse-to-fine approach for stereo matching, where the first matching happens at a different depth for each pixel. The proposed technique has the potential of attenuating several problems faced by the constant depth algorithm, making it possible to reduce the number of errors or the number of comparations needed to get equivalent results. Several experiments were performed to demonstrate the method efficiency, including comparison with the traditional plain correlation technique, where the multi-resolution matching with variable depth, proposed here, generated better results with a smaller processing time

Uma proposição para o cálculo de mapas de disparidade de imagens estéreo usando um interpolador neural baseado em funções de base radial

This study aims to seek a more viable alternative for the calculation of differences in images of stereo vision, using a factor that reduces heel the amount of points that are considered on the captured image, and a network neural-based radial basis functions to interpolate the results. The objective to be achieved is to produce an approximate picture of disparities using algorithms with low computational cost, unlike the classical algorithms

Semi-automatic modeling of buildings from digital surface models

Semi-automatic building detection and extraction is a topic of growing interest due to its potential application in such areas as cadastral information systems, cartographic revision, and GIS. One of the existing strategies for building extraction is to use a digital surface model (DSM) represented by a cloud of known points on a visible surface, and comprising features such as trees or buildings. Conventional surface modeling using stereo-matching techniques has its drawbacks, the most obvious being the effect of building height on perspective, shadows, and occlusions. The laser scanner, a recently developed technological tool, can collect accurate DSMs with high spatial frequency. This paper presents a methodology for semi-automatic modeling of buildings which combines a region-growing algorithm with line-detection methods applied over the DSM.

Advanced Techniques for Face Recognition under Challenging Environments

Automatically recognizing faces captured under uncontrolled environments has always been a challenging topic in the past decades. In this work, we investigate cohort score normalization that has been widely used in biometric verification as means to improve the robustness of face recognition under challenging environments. In particular, we introduce cohort score normalization into undersampled face recognition problem. Further, we develop an effective cohort normalization method specifically for the unconstrained face pair matching problem. Extensive experiments conducted on several well known face databases demonstrate the effectiveness of cohort normalization on these challenging scenarios. In addition, to give a proper understanding of cohort behavior, we study the impact of the number and quality of cohort samples on the normalization performance. The experimental results show that bigger cohort set size gives more stable and often better results to a point before the performance saturates. And cohort samples with different quality indeed produce different cohort normalization performance. Recognizing faces gone after alterations is another challenging problem for current face recognition algorithms. Face image alterations can be roughly classified into two categories: unintentional (e.g., geometrics transformations introduced by the acquisition devide) and intentional alterations (e.g., plastic surgery). We study the impact of these alterations on face recognition accuracy. Our results show that state-of-the-art algorithms are able to overcome limited digital alterations but are sensitive to more relevant modifications. Further, we develop two useful descriptors for detecting those alterations which can significantly affect the recognition performance. In the end, we propose to use the Structural Similarity (SSIM) quality map to detect and model variations due to plastic surgeries. Extensive experiments conducted on a plastic surgery face database demonstrate the potential of SSIM map for matching face images after surgeries.

Metodologie di apprendimento automatico applicate alla generazione di dati 3D

Il framework in oggetto, è un ambiente ideato con lo scopo di applicare tecniche di Machine Learning (in particolare le Random Forest) alle funzionalità dell'algoritmo di stereo matching SGM (Semi Global Matching), al fine di incrementarne l'accuratezza in versione standard. Scopo della presente tesi è quello di modificare alcune impostazioni di tale framework rendendolo un ambiente che meglio si adatti alla direzionalità delle scanline (introducendo finestre di supporto rettangolari e ortogonali e il training di foreste separate in base alla singola scanline) e ampliarne le funzionalità tramite l'aggiunta di alcune nuove feature, quali la distanza dal più vicino edge direzionale e la distintività calcolate sulle immagini Left della stereo pair e gli edge direzionali sulle mappe di disparità. Il fine ultimo sarà quello di eseguire svariati test sui dataset Middlebury 2014 e KITTI e raccogliere dati che descrivano l'andamento in positivo o negativo delle modifiche effettuate.

Variation of vector quantisation and speech waveform coding

A new idea for waveform coding using vector quantisation (VQ) is introduced. This idea makes it possible to deal with codevectors much larger than before for a fixed bit per sample rate. Also a solution to the matching problem (inherent in the present context) in the &-norm describing a measure of neamess is presented. The overall computational complexity of this solution is O(n3 log, n). Sample results are presented to demonstrate the advantage of using this technique in the context of coding of speech waveforms.