cart2tripolar
The code starts with a Cartesian image of square pixel size dx*dy=1, and outputs a polar image of polar pixels that has a similar amount of information in polar coordinates dr*dtheta~=1. The signal in each polar pixel is determined via its fractional overlap with the four surrounding Cartesian pixels. The result is a triangular polar representation,
as the number of polar pixels per radius per angle increase with radius, i.e. the larger the radius the higher the angular resolution. The code was originally used in the context of analyzing images with symmetry around a quadrant so that functionality was kept. The code support NaN valued pixels for masking
引用格式
Adi Natan (2024). cart2tripolar (https://github.com/adinatan/cart2tripolar), GitHub. 检索时间: .
MATLAB 版本兼容性
平台兼容性
Windows macOS Linux标签
致谢
参考作品: PolarOnionPeeling
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!无法下载基于 GitHub 默认分支的版本
版本 | 已发布 | 发行说明 | |
---|---|---|---|
1.0.0.2 | - |
|
|
1.0.0.1 | added documentation |
|
|
1.0.0.0 |
minor bug fix
|