Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/3232
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Subashini P | - |
dc.contributor.author | Krishnaveni M | - |
dc.contributor.author | Manjutha M | - |
dc.date.accessioned | 2023-08-01T08:18:58Z | - |
dc.date.available | 2023-08-01T08:18:58Z | - |
dc.date.issued | 2016-10-06 | - |
dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/3232 | - |
dc.description.abstract | Sign Language is the only mode of communication for deaf and dumb people to convey their messages. Many difficulties are faced by the hearing impaired people when they come across certain areas like Banking, Hospital and Post Office. Especially, there is no proper communication aid available in post offices to support disabled people. From available literature, it is understood that computational methods have been existing in the area of sign language recognition for hearing impaired people. These recognition system acts as an interpreter to accomplish the conversion of sign language into text or voice. This paper proposes an efficient object tracking method, that improves the performance of the video recognition system, by introducing Variant based Particle Swarm Optimization (VPSO) technique in Kalman Filter (KF) through postal video signs. The experimental results prove that VPSO based Efficient Kalman Filter (EKF) provides results better than a traditional KF. | en_US |
dc.language.iso | en_US | en_US |
dc.publisher | IEEE | en_US |
dc.title | OPTIMIZED BOUNDARY DETECTION ALGORITHM FOR POSTAL SIGNS RECOGNITION SYSTEM USING VARIANT BASED PARTICLE SWARM INTELLIGENCE | en_US |
dc.type | Article | en_US |
Appears in Collections: | International Conference |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
OPTIMIZED BOUNDARY DETECTION ALGORITHM FOR POSTAL SIGNS RECOGNITION SYSTEM USING VARIANT BASED PARTICLE SWARM INTELLIGENCE.docx | 12.27 kB | Microsoft Word XML | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.