coarse-to-fine algorithm
1Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… …
2Non-blocking algorithm — In computer science, a non blocking algorithm ensures that threads competing for a shared resource do not have their execution indefinitely postponed by mutual exclusion. A non blocking algorithm is lock free if there is guaranteed system wide… …
3Segmentation (image processing) — In computer vision, segmentation refers to the process of partitioning a digital image into multiple regions (sets of pixels). The goal of segmentation is to simplify and/or change the representation of an image into something that is more… …
4Lucas–Kanade method — In computer vision, the Lucas–Kanade method is a two frame differential method for optical flow estimation developed by Bruce D. Lucas and Takeo KanadeOptical flow algorithms estimate the deformations between two image frames. The basic… …
5Donald Geman — Donald Geman, Fall 1983, Paris Born September 20, 1943 ( …
6Word-sense disambiguation — Disambiguation redirects here. For other uses, see Disambiguation (disambiguation). In computational linguistics, word sense disambiguation (WSD) is an open problem of natural language processing, which governs the process of identifying which… …
7Reconfigurable computing — is a computer architecture combining some of the flexibility of software with the high performance of hardware by processing with very flexible high speed computing fabrics like field programmable gate arrays (FPGAs). The principal difference… …
8Liaison 16 — La Liaison 16 (L16) est un standard de liaison de données tactiques de l OTAN pour l échange d informations tactiques entre des unités militaires. Le contenu de sa messagerie et le protocole d émission sont définis par le STANAG[acro 1] 5516 pour …
9Parallel computing — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing …
10Word sense disambiguation — In computational linguistics, word sense disambiguation (WSD) is the process of identifying which sense of a word is used in any given sentence, when the word has a number of distinct senses. For example, consider two examples of the distinct… …
