Unravel parking difficulty via relative chain code algorithm / Chan Huey Min
Searching for parking space is a familiar challenge to city-dwellers everyday. With the increasing numbers of vehicles, not only the roads are congested, it is also difficult to find parking space everywhere especially in shopping complexes. Unravel Parking Difficulty via Relative Chain Code Algorit...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Published: |
2005
|
| Subjects: | |
| Online Access: | http://studentsrepo.um.edu.my/11257/ http://studentsrepo.um.edu.my/11257/1/Huey_Min_2.pdf |
| Summary: | Searching for parking space is a familiar challenge to city-dwellers everyday. With the increasing numbers of vehicles, not only the roads are congested, it is also difficult to find parking space everywhere especially in shopping complexes. Unravel Parking Difficulty via Relative Chain Code Algorithm is a parking system which will help vehicles' owner to maneuver their means of transportation without the need of scrupulously locating a vacant parking space in the parking bay. This system will allow drivers to quickly locate an available parking space without hassle, thus they can save time from searching for vacant space. This project focuses on the image processing stage, where it will go through from the process of detecting empty space, character recognition, updating the database to notifying drives about available car park. |
|---|