我想使用希尔伯特曲线的“路径”访问图像的每个像素。我已经找到了Hilbert 这里的递归实现,但我不知道如何将其应用于图像。有一张宽度和高度相等的图片重要吗?
发布于 2014-12-07 16:44:38
不是,但要确保曲线是自适应的,或者比图像大。自适应曲线是非常复杂的。
发布于 2019-12-04 11:07:41
这是一种算法,它为非方阵生成一条类似希尔伯特的曲线.
其想法是递归应用类似Hilbert的模板,但在将域维度减半时避免出现奇数大小。如果维数恰好是2的幂,则生成经典的Hilbert曲线。
def gilbert2d(x, y, ax, ay, bx, by):
"""
Generalized Hilbert ('gilbert') space-filling curve for arbitrary-sized
2D rectangular grids.
"""
w = abs(ax + ay)
h = abs(bx + by)
(dax, day) = (sgn(ax), sgn(ay)) # unit major direction
(dbx, dby) = (sgn(bx), sgn(by)) # unit orthogonal direction
if h == 1:
# trivial row fill
for i in range(0, w):
print x, y
(x, y) = (x + dax, y + day)
return
if w == 1:
# trivial column fill
for i in range(0, h):
print x, y
(x, y) = (x + dbx, y + dby)
return
(ax2, ay2) = (ax/2, ay/2)
(bx2, by2) = (bx/2, by/2)
w2 = abs(ax2 + ay2)
h2 = abs(bx2 + by2)
if 2*w > 3*h:
if (w2 % 2) and (w > 2):
# prefer even steps
(ax2, ay2) = (ax2 + dax, ay2 + day)
# long case: split in two parts only
gilbert2d(x, y, ax2, ay2, bx, by)
gilbert2d(x+ax2, y+ay2, ax-ax2, ay-ay2, bx, by)
else:
if (h2 % 2) and (h > 2):
# prefer even steps
(bx2, by2) = (bx2 + dbx, by2 + dby)
# standard case: one step up, one long horizontal, one step down
gilbert2d(x, y, bx2, by2, ax2, ay2)
gilbert2d(x+bx2, y+by2, ax, ay, bx-bx2, by-by2)
gilbert2d(x+(ax-dax)+(bx2-dbx), y+(ay-day)+(by2-dby),
-bx2, -by2, -(ax-ax2), -(ay-ay2))更多信息、示例等,可在此处获得:https://github.com/jakubcerveny/gilbert
https://stackoverflow.com/questions/27344965
复制相似问题