In order to get precise and dense disparity maps,a stereo matching algorithm using adaptive cost aggregation and dynamic programming is proposed.

Fast stereo matching algorithm based on adaptive window and graph cuts;

Novel stereo matching algorithm based on pair-wise DNA alignment algorithm in bioinformatics and its implementation;

Stereo matching based on ant colony optimization algorithm;

In order to solve the energy function minimization in stereo matching,an iterative approach based on cooperative Hopfield networks is proposed.

Aiming at this case, a robust and real-time stereo match algorithm based on mutual information is proposed in view of practical applic.

It is well known that stereo matching with global optimization can obtain good matching result but takes too much computation resources.

An approach to addressing the stereo correspondence problem is presented using genetic algorithms (GAs) to obtain a dense disparity map.

A segment-based two-step stereo correspondence algorithm is proposed.

Stereo correspondence algorithm is the most important and complicated part of stereo systems.

A matching algorithm for library searching of mass spectrum;

Geomagnetic matching algorithm based on vector search;

Prediction-based resource matching algorithm;