Please wait, while we are loading the content...
Please wait, while we are loading the content...
Content Provider | IEEE Xplore Digital Library |
---|---|
Author | Saran, R. Sarje, A.K. |
Copyright Year | 2011 |
Description | Author affiliation: Department of Electronics and Computer Engineering, Indian Institute of Technology, Roorkee, 247667, India (Saran, R.; Sarje, A.K.) |
Abstract | Mathematical morphology is widely used in the area of signal and image analysis. It has enormous applications in detection of weak targets, object recognition and feature extraction, edge detection, image enhancement and many more. However, its use has long been hampered by its algorithmic complexity as the size of the structuring element or image grows. With the trend toward larger images and proportionally larger structuring element, the need for a fast and more efficient morphological processing algorithms become pressing. The performance of morphological processing algorithm can be speedup using AltiVec vetor processing unit. But the AltiVec programmers are frequently disappointed to discover that their AltiVec code is not much faster than their pre-existing scalar code. In some cases it may even be slower. In this correspondence, a new, simple yet much faster vectorized algorithm using AltiVec exhibiting constant-time complexity is described and analyzed. It is compared against the scalar version of the algorithm and other implementations. The proposed vectorized constant-time gray-scale morphological processing algorithm using AltiVec outperforms the 2-D naïve implementation, IXLib-AV library based implementation and the scalar version of constant-time morphological processing algorithm. It also exhibits the run time complexity independent of size of structuring element. |
Starting Page | 1 |
Ending Page | 5 |
File Size | 491297 |
Page Count | 5 |
File Format | |
ISBN | 9781612840901 |
e-ISBN | 9781612840918 |
DOI | 10.1109/NCC.2011.5734721 |
Language | English |
Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Publisher Date | 2011-01-28 |
Publisher Place | India |
Access Restriction | Subscribed |
Rights Holder | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subject Keyword | Algorithm design and analysis AltiVec PowerPC Vectorized algorithm Gray-scale VHGW algorithm Complexity theory Gray-scale morphology Constant-time Morphology Signal processing algorithms Filtering algorithms Pixel |
Content Type | Text |
Resource Type | Article |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
Sl. | Authority | Responsibilities | Communication Details |
---|---|---|---|
1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
Loading...
|