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...

Full description

Bibliographic Details
Main Author: Chan , Huey Min
Format: Thesis
Published: 2005
Subjects:
Online Access:http://studentsrepo.um.edu.my/11257/
http://studentsrepo.um.edu.my/11257/1/Huey_Min_2.pdf
_version_ 1848774336897351680
author Chan , Huey Min
author_facet Chan , Huey Min
author_sort Chan , Huey Min
building UM Research Repository
collection Online Access
description 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.
first_indexed 2025-11-14T13:56:41Z
format Thesis
id um-11257
institution University Malaya
institution_category Local University
last_indexed 2025-11-14T13:56:41Z
publishDate 2005
recordtype eprints
repository_type Digital Repository
spelling um-112572020-06-04T21:19:13Z Unravel parking difficulty via relative chain code algorithm / Chan Huey Min Chan , Huey Min QA75 Electronic computers. Computer science QA76 Computer software 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. 2005 Thesis NonPeerReviewed application/pdf http://studentsrepo.um.edu.my/11257/1/Huey_Min_2.pdf Chan , Huey Min (2005) Unravel parking difficulty via relative chain code algorithm / Chan Huey Min. Undergraduates thesis, University of Malaya. http://studentsrepo.um.edu.my/11257/
spellingShingle QA75 Electronic computers. Computer science
QA76 Computer software
Chan , Huey Min
Unravel parking difficulty via relative chain code algorithm / Chan Huey Min
title Unravel parking difficulty via relative chain code algorithm / Chan Huey Min
title_full Unravel parking difficulty via relative chain code algorithm / Chan Huey Min
title_fullStr Unravel parking difficulty via relative chain code algorithm / Chan Huey Min
title_full_unstemmed Unravel parking difficulty via relative chain code algorithm / Chan Huey Min
title_short Unravel parking difficulty via relative chain code algorithm / Chan Huey Min
title_sort unravel parking difficulty via relative chain code algorithm / chan huey min
topic QA75 Electronic computers. Computer science
QA76 Computer software
url http://studentsrepo.um.edu.my/11257/
http://studentsrepo.um.edu.my/11257/1/Huey_Min_2.pdf