Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning
Look-Up Table (LUT) method for inverse halftoning is computation less, fast, and also yields goods results. It employs a single LUT that is stored in a ROM and contains pre-computed contone (gray level) values for inverse halftone operation. This paper proposes an algorithm that can perform parallel...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , |
| التنسيق: | article |
| منشور في: |
2008
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/14946/1/S-0636.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513384546828288 |
|---|---|
| author | Siddiqi, Umair F. |
| author2 | Sait, Sadiq M. unknown |
| author2_role | author author |
| author_facet | Siddiqi, Umair F. Sait, Sadiq M. unknown |
| author_role | author |
| dc.creator.none.fl_str_mv | Siddiqi, Umair F. Sait, Sadiq M. unknown |
| dc.date.none.fl_str_mv | 2008-10 2020 |
| dc.format.none.fl_str_mv | application/pdf |
| dc.identifier.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/14946/1/S-0636.pdf (2008) Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning. Arabian Journal of Science and Engineering (AJSE). |
| dc.language.none.fl_str_mv | en |
| dc.relation.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/14946/ |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Computer |
| dc.title.none.fl_str_mv | Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning |
| dc.type.none.fl_str_mv | Article PeerReviewed info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| description | Look-Up Table (LUT) method for inverse halftoning is computation less, fast, and also yields goods results. It employs a single LUT that is stored in a ROM and contains pre-computed contone (gray level) values for inverse halftone operation. This paper proposes an algorithm that can perform parallel inverse halftone operation by partitioning the single LUT into N smaller Look-Up Tables (s-LUTs). Thereby, upto k (k≤N) pixels can be concurrently fetched from the halftone image, and their contone values can also be fetched concurrently from separate smaller Look-Up Tables (s-LUT). The parallelization increases the speed of inverse halftoning by upto k times while the total entries in all s-LUTs remains equal to the entries in the single LUT of the serial LUT method. Some degradation in image quality is possible due to pixel loss during parallel fetching. This is due to some contone values cannot be fetched in the same cycle because some other contone value is being fetched from the s-LUT. The complete implementation of the algorithm requires two CPLD devices for computational portion, external content addressable memories (CAM) and static RAMs to store s-LUTs. |
| eu_rights_str_mv | openAccess |
| format | article |
| id | KFUPM_05d63d31ce30f6accb3d38ae9c5347db |
| identifier_str_mv | (2008) Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning. Arabian Journal of Science and Engineering (AJSE). |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::14946 |
| publishDate | 2008 |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | Parallel Inverse Halftoning by Look-Up Table (LUT) PartitioningSiddiqi, Umair F.Sait, Sadiq M.unknownComputerLook-Up Table (LUT) method for inverse halftoning is computation less, fast, and also yields goods results. It employs a single LUT that is stored in a ROM and contains pre-computed contone (gray level) values for inverse halftone operation. This paper proposes an algorithm that can perform parallel inverse halftone operation by partitioning the single LUT into N smaller Look-Up Tables (s-LUTs). Thereby, upto k (k≤N) pixels can be concurrently fetched from the halftone image, and their contone values can also be fetched concurrently from separate smaller Look-Up Tables (s-LUT). The parallelization increases the speed of inverse halftoning by upto k times while the total entries in all s-LUTs remains equal to the entries in the single LUT of the serial LUT method. Some degradation in image quality is possible due to pixel loss during parallel fetching. This is due to some contone values cannot be fetched in the same cycle because some other contone value is being fetched from the s-LUT. The complete implementation of the algorithm requires two CPLD devices for computational portion, external content addressable memories (CAM) and static RAMs to store s-LUTs.2008-102020ArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttps://eprints.kfupm.edu.sa/id/eprint/14946/1/S-0636.pdf (2008) Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning. Arabian Journal of Science and Engineering (AJSE). enhttps://eprints.kfupm.edu.sa/id/eprint/14946/info:eu-repo/semantics/openAccessoai::149462019-11-01T14:09:11Z |
| spellingShingle | Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning Siddiqi, Umair F. Computer |
| status_str | publishedVersion |
| title | Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning |
| title_full | Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning |
| title_fullStr | Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning |
| title_full_unstemmed | Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning |
| title_short | Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning |
| title_sort | Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning |
| topic | Computer |
| url | https://eprints.kfupm.edu.sa/id/eprint/14946/1/S-0636.pdf |