Cart (Loading....) | Create Account
Close category search window

An Extension of Eklundh's Matrix Transposition Algorithm and Its Application in Digital Image Processing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Twogood, R.E. ; Lawrence Livermore Laboratory, University of California ; Ekstrom, M.P.

Eklundh's fast matrix transposition algorithm for transposing a 2nX 2nmatrix is extended here to the general case where 2i( j ≥ 1) of its rows will fit into primary storage. The perpormance characteristics of the extension are described and subsuquently compared with those of Eklundh, and its use in a two-dimensional image filtering routine is described.

Published in:

Computers, IEEE Transactions on  (Volume:C-25 ,  Issue: 9 )

Date of Publication:

Sept. 1976

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.