Skip Navigation

This Article
Right arrow Full Text (Print PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Gomel, J.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Gomel, J.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

/ Oxford University Press

A fast algorithm for evaluating an approximation to the information enclosed within coronas and their sectors in square matrices

J. Gomel

UFR de Mathémariques and J. Monod Institute, Université Paris 7 and CNRS, 2 Place Jussieu, 75251 Paris Cedex 05, France

From numerical data distributed in an even square matrix A, we wish to determine the proportion of the data belonging to a selected area (S). We restrict the problem to any field of the initial data square enclosed within the part of a corona (characterized by the real values of its two limiting radii) limited by a circular sector (defined by its two limiting angles), both corona and sector being centred at the centre of the square. A fast and accurate approximation algorithm is presented, which collects the contribution of all the pixels of A by exploration of the first quadrant. For each pixel of it and, at the same time, for its three symmetrical ones in the other quadrants, the program evaluates the part belonging to (S), using radial and angular factors. Finally, the weighted contributions are summed up. Compared to the classical methods (exact determination, testing the position of the pixel centres or others), this algorithm offers a better time/accuracy ratio. Suitable accuracy at the border makes it possible to choose larger pixel size, hence to spend shorter CPU time (even and especially in the case of thin rings with large radii).

Received on May 30, 1989; accepted on October 24, 1989

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.