Hunter, Andrew (1996) Connectionist median filtering networks. Image and vision computing, 14 (4). pp. 277-283. ISSN 0262-8856
Full content URL: http://dx.doi.org/10.1016/0262-8856(95)01068-8
Full text not available from this repository.
| Item Type: | Article |
|---|---|
| Item Status: | Live Archive |
Abstract
A family of connectionist rank filtering networks is presented, suitable for real-time median filtering. It is demonstrated that these have low complexity (from O(N2) processing elements and connections for a single output N element filter to O(N2) for a fully parallelised N × N filter). The networks have some unusual requirements in terms of processing elements and topology compared with the standard neural network models. The feasibility of VLSI implementation of the networks is discussed
| Additional Information: | A family of connectionist rank filtering networks is presented, suitable for real-time median filtering. It is demonstrated that these have low complexity (from O(N2) processing elements and connections for a single output N element filter to O(N2) for a fully parallelised N × N filter). The networks have some unusual requirements in terms of processing elements and topology compared with the standard neural network models. The feasibility of VLSI implementation of the networks is discussed |
|---|---|
| Keywords: | Median filtering, Connectionist networks, VLSI implementation |
| Subjects: | G Mathematical and Computer Sciences > G400 Computer Science |
| Divisions: | College of Science > School of Computer Science |
| ID Code: | 2781 |
| Deposited On: | 14 Jul 2010 13:18 |
Repository Staff Only: item control page