Ortogonal Búsqueda de coincidencias (OMP) is a algoritmo codicioso used in the field of aprendizaje automático and procesamiento de señales for solving sparse approximation problems. It aims to find a representación dispersa of a signal or data vector in a given dictionary of basis functions. The algorithm is particularly useful when the number of available measurements is much smaller than the number of potential basis functions, making it a popular choice in various applications such as compressed sensing and selección de características.
The core idea of OMP is to iteratively select the best matching elements from the dictionary that contribute most significantly to the approximation of the target signal. The process begins with an initial guess (often a zero vector) and, at each iteration, identifies the dictionary element that correlates most with the current residual (the difference between the actual signal and its approximation). This selected element is then added to the approximation set.
Una vez que se elige un elemento, OMP actualiza la aproximación proyectando la señal en el subespacio generado por los elementos seleccionados. Luego, se recalcula el residuo y el proceso se repite hasta que se hayan seleccionado un número especificado de elementos o hasta que el residuo esté por debajo de un umbral determinado. Esto hace que OMP sea eficiente en términos de cálculo, ya que reduce el tamaño del problema en cada paso.
OMP is particularly valuable in applications where interpretability and simplicity are crucial, as it results in a sparse representation that highlights the most significant features of the data. However, it is important to note that OMP can be sensitive to noise and may not always guarantee the solución óptima, particularly in highly correlated dictionaries.