This paper presents a literature survey on existing disparity map algorithms. It focuses on four main stages of processing as proposed by Scharstein and Szeliski in a taxonomy and evaluation of dense two-frame stereo correspondence algorithms performed in 2002. To assist future researchers in developing their own stereo matching algorithms, a summary of the existing algorithms developed for every stage of processing is also provided. The survey also notes the implementation of previous software-based and hardware-based algorithms. Generally, the main processing module for a software-based implementation uses only a central processing unit. By contrast, a hardware-based implementation requires one or more additional processors for its processing module, such as graphical processing unit or a field programmable gate array. This literature survey also presents a method of qualitative measurement that is widely used by researchers in the area of stereo vision disparity mappings.

/pdf/literature-survey-on-stereo-vision-disparity-map-algorithms-3mtr9e2zyc.pdf

Literature Survey on Stereo Vision Disparity Map Algorithms

1. Introduction to Probability 2. Conditional Probability 3. Random Variables and Distributions 4. Expectation 5. Special Distributions 6. Large Random Samples 7. Estimation 8. Sampling Distributions of Estimators 9. Testing Hypotheses 10. Categorical Data and Nonparametric Methods 11. Linear Statistical Models 12. Simulation

Probability and Statistics

Predicting the price of housing is of paramount importance for near-term economic forecasting of any nation. This paper presents a novel and comprehensive model for estimating the price of new housing in any given city at the design phase or beginning of the construction through ingenious integration of a deep belief restricted Boltzmann machine and a unique nonmating genetic algorithm. The model can be used by construction companies to gauge the sale market before they start a new construction and consider to build or not to build. An effective data structure is presented that takes into account a large number of economic variables/indices. The model incorporates time-dependent and seasonal variations of the variables. Clever stratagems have been developed to overcome the dimensionality curse and make the solution of the problem amenable on standard workstations. A case study is presented to demonstrate the effectiveness and accuracy of the model.

A Novel Machine Learning Model for Estimation of Sale Prices of Real Estate Units

Within the field of computer vision, change detection algorithms aim at automatically detecting significant changes occurring in a scene by analyzing the sequence of frames in a video stream. In this paper we investigate how state-of-the-art change detection algorithms can be combined and used to create a more robust algorithm leveraging their individual peculiarities. We exploited genetic programming (GP) to automatically select the best algorithms, combine them in different ways, and perform the most suitable post-processing operations on the outputs of the algorithms. In particular, algorithms’ combination and post-processing operations are achieved with unary, binary and ${n}$ -ary functions embedded into the GP framework. Using different experimental settings for combining existing algorithms we obtained different GP solutions that we termed In Unity There Is Strength . These solutions are then compared against state-of-the-art change detection algorithms on the video sequences and ground truth annotations of the ChangeDetection.net 2014 challenge. Results demonstrate that using GP, our solutions are able to outperform all the considered single state-of-the-art change detection algorithms, as well as other combination strategies. The performance of our algorithm are significantly different from those of the other state-of-the-art algorithms. This fact is supported by the statistical significance analysis conducted with the Friedman test and Wilcoxon rank sum post-hoc tests.

Combination of Video Change Detection Algorithms by Genetic Programming

Recently, many optimization algorithms have been applied for Feature selection (FS) problems and show a clear outperformance in comparison with traditional FS methods. Therefore, this has motivated our study to apply the new Salp swarm algorithm (SSA) on the FS problem. However, SSA, like other optimizations algorithms, suffer from the problem of population diversity and fall into local optima. To solve these problems, this study presents an enhanced version of SSA which is known as the Dynamic Salp swarm algorithm (DSSA). Two main improvements were included in SSA to solve its problems. The first improvement includes the development of a new equation for salps’ position update. The use of this new equation is controlled by using Singer's chaotic map. The purpose of the first improvement is to enhance SSA solutions' diversity. The second improvement includes the development of a new local search algorithm (LSA) to improve SSA exploitation. The proposed DSSA was combined with the K-nearest neighbor (KNN) classifier in a wrapper mode. 20 benchmark datasets were selected from the UCI repository and 3 Hadith datasets to test and evaluate the effectiveness of the proposed DSSA algorithm. The DSSA results were compared with the original SSA and four well-known optimization algorithms including Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Ant Lion Optimizer (ALO), and Grasshopper Optimization Algorithm (GOA). From the obtained results, DSSA outperformed the original SSA and the other well-known optimization algorithms over the 23 datasets in terms of classification accuracy, fitness function values, the number of selected features, and convergence speed. Also, DSSA accuracy results were compared with the most recent variants of the SSA algorithm. DSSA showed a significant improvement over the competing algorithms in statistical analysis. These results confirm the capability of the proposed DSSA to simultaneously improve the classification accuracy while selecting the minimal number of the most informative features.

Dynamic Salp swarm algorithm for feature selection

The evolution of digital circuit technology, leadind to higher speeds and more reliability allowed the development of machine controllers adapted to new production systems (e.g., Flexible Manufacturing Systems - FMS). Most of the controllers are developed in agreement with the CNC technology of the correspondent machine tool manufacturer. Any alterations or adaptation of their components are not easy to be implemented. The machine designers face up hardware and software restrictions such as lack of interaction among system's elements and impossibility of adding new function. This is due to hardware incompatibility and to software not allowing alterations in the source program. The introduction of open architecture philosophy propitiated the evolution of a new generation of numeric controllers. This brought the conventional CNC technology to the standard IBM - PC microcomputer. As a consequence, the characteristics of the CNC (positioning) and the microcomputer (easy of programming, system configuration, network communication etc) are combined. Some researchers have addressed a flexible structure of software and hardware allowing changes in the hardware basic configuration and all control software levels. In this work, the development of open architecture controllers in the OSACA, OMAC, HOAM-CNC and OSEC architectures is described.

Analysis of open CNC architecture for machine tools

A new approach to solve the flexible job shop problem based on a hybrid particle swarm optimization and Random-Restart Hill Climbing

Convolution is one of the most important operators used in image processing. With the constant need to increase the performance in high-end applications and the rise and popularity of parallel architectures, such as GPUs and the ones implemented in FPGAs, comes the necessity to compare these architectures in order to determine which of them performs better and in what scenario. In this article, convolution was implemented in each of the aforementioned architectures with the following languages: CUDA for GPUs and Verilog for FPGAs. In addition, the same algorithms were also implemented in MATLAB, using predefined operations and in C using a regular x86 quad-core processor. Comparative performance measures, considering the execution time and the clock ratio, were taken and commented in the paper. Overall, it was possible to achieve a CUDA speedup of roughly 200× in comparison to C, 70× in comparison to Matlab and 20× in comparison to FPGA.

Image convolution processing: A GPU versus FPGA comparison

The manual selection of linear and nonlinear operators for producing image filters is not a trivial task in practice, so new proposals that can automatically improve and speed up the process can be of great help. This paper presents a new proposal for constructing image filters using an evolutionary programming approach, which has been implemented as the IFbyGP software. IFbyGP employs a variation of the Genetic Programming algorithm GP and can be applied to binary and gray level image processing. A solution to an image processing problem is represented by IFbyGP as a set of morphological, convolution and logical operators. The method has a wide range of applications, encompassing pattern recognition, emulation filters, edge detection, and image segmentation. The algorithm works with a training set consisting of input images, goal images, and a basic set of instructions supplied by the user, which would be suitable for a given application. By making the choice of operators and operands involved in the process more flexible, IFbyGP searches for the most efficient operator sequence for a given image processing application. Results obtained so far are encouraging and they stress the feasibility of the proposal implemented by IFbyGP. Also, the basic language used by IFbyGP makes its solutions suitable to be directly used for hardware control, in a context of evolutionary hardware. Although the proposal implemented by IFbyGP is general enough for dealing with binary, gray level and color images, only applications using the first two are considered in this paper; as it will become clear in the text, IFbyGP aims at the direct use of induced sequences of operations by hardware devices. Several application examples discussing and comparing IFbyGP results with those obtained by other methods available in the literature are presented and discussed.

A genetic programming based system for the automatic construction of image filters

Mathematical morphology supplies powerful tools for low level image analysis, with applications in many areas. In this paper, the development of a novel reconfigurable hardware using a genetic algorithm and a pipeline architecture is proposed for the task of shape recognition in binary images. For the recognition process, a large sized convex structuring element representing the object shape to be recognized is decomposed into the architecture stages. Each stage can handle structuring elements of a limited size. In this approach, a genetic algorithm was used to decompose this structuring element. Thus, a simple erosion performed in each stage is used to detect the goal object. The hardware is capable of processing binary images at high speed. The developed system is based on FPGAs. Our approach represents an intelligent mechanism to reconfigure the pipeline architecture, it is different from other systems found in the literature, and the obtained results are promising.

E.R.R. Kato

Papers

Analysis of open CNC architecture for machine tools

A new approach to solve the flexible job shop problem based on a hybrid particle swarm optimization and Random-Restart Hill Climbing

Image convolution processing: A GPU versus FPGA comparison

A genetic programming based system for the automatic construction of image filters

Intelligent FPGA based system for shape recognition