Descargar la presentación
La descarga está en progreso. Por favor, espere
Publicada porNieves Carrasco Vega Modificado hace 10 años
1
PROCESAMIENTO DE IMÁGENES DIGITALES Verónica Padua Castilleja ESTUDIO DE UN FILTRO DE CODIFICACIÓN PREDICTIVO-CORRECTIVO
2
CODIFICACIÓN PREDICTIVA-CORRECTIVA PREDICTOR ESTADO PASADO MENO S PREDICTOR MENO S ESTADO PASADO In Out Codificador Decodificador Corrector Canal Adaptive (APC) coders Whitening filter Logical Arithmetic Minimum
3
METODOLOGÍA DE LA COMPRESIÓN IMAGEN DE ENTRADA IMAGEN COMPRIMIDA IMAGEN DESCOMPRIMIDA Compresión Descompresión
4
METODOLOGÍA DE LA COMPRESIÓN
6
MÉTODO: MINIMUN Imagen de entrada Plantilla de predicción ‘-’ datos no tenidos en cuenta ‘a’, ‘b’, ‘c’ datos de interés ‘.’ datos no procesados ‘*’ entrada actual Basado en la predicción de valores No adaptativo Imágenes en blanco y negro
7
MÉTODO: MINIMUN P(a, b, c) predice Cumple las siguientes propiedades: P(a, a, a) = a P(a, b, c) = P(a, c, b) P(a, b, c)’= P(a’, b’, c’) P(a, b, c) es elemento de {a, b, c} a b 0 0 0 1 0 0 0 1 1 0 1 1 1 0 1 1 c (*) 0 (0) 0 (1) 1 (1) 1 (1) 0 (0) 0 (0) 1 (0) 1 (1) 99% 66% 73% 71% 67% 90% 89% 98%
8
MÉTODO: MINIMUN Función de predicción function y=predice(a, b, c) p=b+c-a; pa=abs(p-a); pb=abs(p-b); pc=abs(p-c); if ((pa<=pb)&(pa<=pc)) y=a; elseif ((pb<=pa)&(pb<=pc)) y=b; else y=c; end
9
MÉTODO: MINIMUN PROCESO DE COMPRESIÓN 1 0 0 1 0 1 0 0 1 1 0 1 0 1 0 1 1 -1 0 -1 0 -1 0 -1 1 0 0 1 0 1 0 0 1 1 0 1 0 1 0 1 1 -1 0 -1 0 -1 0 -1 1 0 0 1 0 1 0 0 1 1 0 1 0 1 0 1 1 -1 0 -1 0 -1 0 -1 1 0 0 1 0 1 0 0 1 1 0 1 0 1 0 1 1 -1 0 -1 0 -1 0 -1 1 0 0 1 0 1 0 0 1 1 0 1 0 1 0 1 1 -1 0 -1 0 -1 0 -1 1 0 0 1 0 1 0 0 1 1 0 1 0 1 0 1 1 -1 0 -1 0 -1 0 -1 1 0 0 1 0 1 0 0 1 1 0 1 0 1 0 1 1 -1 0 -1 0 -1 0 -1 1 0 0 1 0 1 0 0 1 1 0 1 0 1 0 1 1 -1 0 -1 0 -1 0 -1 1 0 0 1 0 1 0 0 1 1 0 1 0 1 0 1
10
MÉTODO: MINIMUN PROCESO DE COMPRESIÓN 1 0 0 1 0 1 0 0 1 1 0 1 0 1 0 1 1 0 0 1 0 0 0 0 0 1 0 1 0 1 0 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 0 1 1 1 0 0 0 1 0 0 1 1 1 1 1 1 0 1 1 0 0 1 0 1 0 0 1 1 0 1 0 1 0 1 1 0 0 1 0 1 1 1 1 0 0 1 0 0 0 1 1 0 0 0 0 1 1 1 1 1 1 1 0 1 0 1 1 1 1 1 1 0 0 0 1 1 0 1 1 1 0 1 1 0 0 1 1 1 1 0 1 1 0 0 0 1 0 1 1 0 0 1 0 1 0 0 1 1 0 1 0 1 0 1 1 -1 0 -1 0 -1 0 -1 1 0 0 1 0 1 0 0 1 1 0 1 0 1 0 1 1 -1 0 -1 0 -1 0 -1 1 0 0 1 0 1 0 0 1 1 0 1 0 1 0 1 1 -1 0 -1 0 -1 0 -1 1 0 0 1 0 1 0 0 1 1 0 1 0 1 0 1 1 -1 0 -1 0 -1 0 -1 1 0 0 1 0 0 0 0 0 1 0 1 0 1 0 1 1 -1 0 -1 1 -1 1 -1 1 -1 1 -1 0 -1 0 -1 1 1 0 0 0 1 0 0 1 1 1 1 1 1 0 1 1 -1 0 -1 0 -1 0 -1 1 0 0 1 0 1 1 1 1 0 0 1 0 0 0 1 1 -1 0 -1 0 -1 1 -1 1 -1 1 -1 0 -1 0 -1 1 1 1 1 1 0 0 0 1 1 0 1 1 1 0 1 1 -1 0 -1 1 -1 1 -1 1 -1 0 -1 0 -1 0 -1 1 0 0 1 0 1 0 0 1 1 0 1 0 1 0 1 1 0 0 1 0 0 0 0 0 1 0 1 0 1 0 1 1 0 0 1 1 1 1 1 1 1 1 1 0 1 0 1 1 1 0 0 0 1 0 0 1 1 1 1 1 1 0 1 1 1 0 0 0 1 0 0 1 1 0 0 0 0 0 1 1 0 0 1 0 1 1 1 1 0 0 1 0 0 0 1 1 0 0 1 0 1 1 1 1 0 1 1 0 0 0 1 1 1 1 1 1 0 0 0 1 1 0 1 1 1 0 1 1 1 0 0 1 0 1 1 1 1 0 1 0 0 0 1
11
MÉTODO: MINIMUN PROCESO DE COMPRESIÓN 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 1 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 -1 0 -1 0 -1 0 -1 0 -1 0 –1 0 -1 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 -1 0 -1 0 -1 1 -1 1 -1 0 -1 0 –1 0 -1 0 0 0 0 1 1 0 1 1 0 0 0 0 0 0 0 0 -1 0 -1 0 -1 0 -1 1 -1 0 -1 0 –1 0 -1 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 -1 0 -1 0 -1 0 -1 1 -1 0 -1 0 –1 0 -1 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 -1 0 -1 0 -1 0 -1 1 -1 0 -1 0 –1 0 -1 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 -1 0 -1 0 -1 0 –1 1 -1 0 -1 0 –1 0 -1 0 0 0 0 1 1 1 1 1 1 1 1 0 0 0 0 0 -1 0 -1 1 -1 1 -1 1 -1 1 -1 0 –1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 -1 0 -1 0 -1 0 -1 0 -1 0 –1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 1 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
12
MÉTODO: MINIMUN PROCESO DE COMPRESIÓN 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 1 1 1 0 0 1 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 1 0 0 1 1 1 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 -1 0 -1 1 -1 1 -1 0 –1 0 –1 0 -1 0 0 0 0 0 1 1 1 1 1 1 0 0 0 0 0 0 -1 0 -1 1 -1 1 -1 0 -1 1 –1 0 -1 0 -1 0 0 0 0 1 1 0 0 0 0 1 1 0 0 0 0 0 -1 0 -1 1 -1 0 -1 0 -1 1 –1 0 -1 0 -1 0 0 0 0 1 1 0 0 0 0 1 1 0 0 0 0 0 -1 0 -1 1 -1 0 -1 0 -1 1 –1 0 –1 0 -1 0 0 0 0 1 1 0 0 0 0 1 1 0 0 0 0 0 -1 0 -1 1 -1 0 -1 0 -1 1 –1 0 –1 0 -1 0 0 0 0 1 1 0 0 0 0 1 1 0 0 0 0 0 -1 0 -1 1 -1 1 -1 0 -1 1 –1 0 –1 0 -1 0 0 0 0 0 1 1 1 1 1 1 0 0 0 0 0 0 -1 0 -1 0 -1 1 -1 1 -1 0 –1 0 –1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 -1 0 -1 0 -1 0 -1 0 –1 0 –1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 1 1 0 0 1 1 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
13
MÉTODO: MINIMUN PROCESO DE COMPRESIÓN 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 0 0 0 1 1 0 0 0 1 0 1 0 0 0 0 1 1 0 0 1 1 1 1 0 0 1 0 0 1 1 1 1 1 0 0 1 1 0 1 1 1 1 1 1 1 1 0 1 0 0 0 0 1 1 1 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 1 -1 0 -1 0 -1 0 -1 0 –1 0 –1 0 -1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 1 -1 0 -1 0 -1 0 -1 0 –1 0 –1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 -1 0 -1 0 -1 0 -1 0 –1 0 –1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 -1 0 -1 1 -1 1 -1 1 –1 0 –1 0 -1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 -1 0 -1 1 -1 1 -1 1 -1 1 –1 1 –1 0 -1 0 1 1 0 0 0 1 0 1 0 0 0 0 1 1 0 0 -1 1 -1 1 -1 0 -1 0 -1 1 –1 1 –1 1 -1 0 1 1 0 1 1 1 1 1 1 1 1 0 1 0 0 0 -1 1 -1 1 -1 0 -1 0 -1 0 –1 1 –1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 -1 0 -1 0 –1 0 -1 0 –1 0 –1 0 -1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 0 0 0 1 1 0 0 0 1 0 1 0 0 0 0 1 1 0 0 1 1 0 1 1 0 0 0 0 1 1 1 1 1 0 0 1 1 0 1 1 1 1 1 1 1 1 0 1 0 0 0 1 1 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
14
MÉTODO: MINIMUN PROCESO DE COMPRESIÓN 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 1 1 1 0 0 0 1 0 0 0 0 1 1 1 0 0 1 0 1 0 0 1 1 1 0 0 0 1 0 0 1 0 1 1 1 0 1 0 0 1 0 0 0 0 1 0 0 1 1 1 1 1 0 0 1 0 0 0 0 1 0 0 0 1 1 1 1 1 0 0 0 1 0 0 1 0 1 0 0 1 1 1 1 1 0 0 1 0 1 0 1 0 0 1 1 1 1 1 1 1 1 1 0 0 1 0 0 1 1 0 0 1 1 1 1 1 0 0 1 1 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 -1 0 -1 0 -1 0 -1 0 –1 0 –1 0 -1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 -1 1 -1 0 -1 1 -1 1 -1 0 –1 1 –1 0 -1 0 1 1 1 0 0 1 0 1 0 0 1 1 1 0 0 0 -1 0 -1 1 -1 1 -1 1 -1 1 –1 0 –1 0 -1 0 0 1 0 0 1 1 1 1 1 0 0 1 0 0 0 0 -1 1 -1 0 -1 1 -1 1 -1 0 –1 1 –1 0 -1 0 1 0 0 0 1 1 1 1 1 0 0 0 1 0 0 1 -1 1 -1 0 -1 1 -1 1 -1 0 –1 1 –1 1 -1 1 0 0 1 1 1 1 1 1 1 1 1 0 0 1 0 0 -1 1 -1 0 -1 1 -1 1 -1 0 –1 1 –1 0 -1 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 -1 0 -1 0 -1 0 -1 0 -1 0 –1 0 –1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 -1 0 -1 0 -1 0 -1 0 –1 0 –1 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 1 1 0 1 1 1 1 1 0 0 1 1 0 0 0 1 1 1 0 0 1 0 1 0 0 1 1 1 0 0 0 1 0 0 1 1 1 0 1 0 1 1 0 0 0 0 0 0 1 0 0 1 1 1 1 1 0 0 1 0 0 0 0 1 0 0 0 1 1 1 1 1 0 0 0 1 0 0 1 1 1 1 0 1 1 1 1 1 0 0 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 0 0 1 0 0 0 1 1 0 0 1 1 1 1 0 0 1 1 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
15
ADAPTACIÓN a b 0 0 0 1 0 0 0 1 1 0 1 1 1 0 1 1 c (*) 0 (0) 0 (1) 1 (1) 1 (1) 0 (0) 0 (0) 1 (0) 1 (1) 99% 66% 73% 71% 67% 90% 89% 98% function y=predice2(a,b,c) r=rand; if ((a==0)&(b==0)&(c==0)) if r<=0.99 y=0 else y=1 end elseif ((a==0)&(b==1)&(c==0)) if r<=0.66 y=1 else y=0 end elseif ((a==0)&(b==0)&(c==1)) if r<=0.73 y=1 else y=0 end elseif ((a==1)&(b==1)&(c==0)) if r<=0.90 y=0 else y=1 end elseif ((a==1)&(b==0)&(c==1)) if r<=0.89 y=0 else y=1 end elseif ((a==0)&(b==1)&(c==1)) if r<=0.71 y=1 else y=0 end elseif ((a==1)&(b==1)&(c==1)) if r<=0.98 y=1 else y=0 end elseif ((a==1)&(b==0)&(c==0)) if r<=0.67 y=0 else y=1 end
16
COMPARACIÓN DE RESULTADOS
Presentaciones similares
© 2025 SlidePlayer.es Inc.
All rights reserved.