Paper Info

Title | ||
---|---|---|

Properties and some fast algorithms of the Haar transform in image processing and pattern recognition. |

Abstract | ||
---|---|---|

Properties of the Haar transform in image processing and pattern recognition are investigated. A lower bound of the performance of the Haar transform relative to that of the Karhunen-Loeve transform for first-order Markov processes is found. It is proved that the Haar transform is inferior to the Walsh-Hadamard transform for such processes. A unique condition is presented which, if satisfied by the elements of a matrix, will make the Karhunen-Loeve transform of the matrix and the Haar transform equivalent. Some fast algorithms are given to realize the diagonal elements of a Haar transformed matrix. |

Year | DOI | Venue |
---|---|---|

1984 | 10.1016/0167-8655(84)90019-9 | Pattern Recognition Letters |

Keywords | Field | DocType |

haar transform,first-order markov process,image processing,pattern recognition,karhunen-loeve transform,unique condition,fast algorithm,diagonal element,karhunen loeve transform | Constant Q transform,Karhunen–Loève theorem,Pattern recognition,Haar,Matrix (mathematics),Algorithm,Image processing,Artificial intelligence,Discrete wavelet transform,S transform,Fractional Fourier transform,Mathematics | Journal |

Volume | Issue | ISSN |

2 | 5 | Pattern Recognition Letters |

Citations | PageRank | References |

2 | 0.75 | 5 |

Authors | ||

3 |

Authors (3 rows)

Cited by (2 rows)

References (5 rows)

Name | Order | Citations | PageRank |
---|---|---|---|

P.C Mali | 1 | 3 | 1.12 |

B.B. Chaudhuri | 2 | 678 | 57.99 |

D. Dutta Majumder | 3 | 363 | 68.55 |