mirror of
https://github.com/wassname/scikit-image.git
synced 2026-07-13 17:45:20 +08:00
Harris corner detector
This commit is contained in:
@@ -0,0 +1,30 @@
|
||||
"""
|
||||
===============================================================================
|
||||
Harris Corner detector
|
||||
===============================================================================
|
||||
|
||||
The Harris corner filter detects interest points using edge detection in many
|
||||
direction.
|
||||
"""
|
||||
from matplotlib import pyplot as plt
|
||||
from matplotlib import cm
|
||||
|
||||
from skimage import data
|
||||
from skimage.filter import harris
|
||||
|
||||
|
||||
def plot_harris_points(image, filtered_coords):
|
||||
""" plots corners found in image"""
|
||||
|
||||
plt.subplot(111)
|
||||
plt.imshow(image, cmap=cm.gray)
|
||||
plt.plot([p[1] for p in filtered_coords],
|
||||
[p[0] for p in filtered_coords],
|
||||
'b.')
|
||||
plt.axis('off')
|
||||
plt.show()
|
||||
|
||||
|
||||
im = data.lena().astype(float)
|
||||
filtered_coords = harris.harris_corner_detector(im, 6)
|
||||
plot_harris_points(im, filtered_coords)
|
||||
@@ -5,3 +5,4 @@ from edges import sobel, hsobel, vsobel, hprewitt, vprewitt, prewitt
|
||||
from tv_denoise import tv_denoise
|
||||
from rank_order import rank_order
|
||||
from thresholding import threshold_otsu
|
||||
from harris import harris_corner_detector
|
||||
|
||||
@@ -0,0 +1,103 @@
|
||||
#
|
||||
# Harris detector
|
||||
#
|
||||
# http://www.janeriksolem.net/2009/01/harris-corner-detector-in-python.html
|
||||
|
||||
import numpy as np
|
||||
from scipy import ndimage
|
||||
|
||||
|
||||
def _compute_harris_response(image, eps=1e-6):
|
||||
"""Compute the Harris corner detector response function
|
||||
for each pixel in the image
|
||||
|
||||
Params
|
||||
-------
|
||||
image: ndarray
|
||||
|
||||
eps: float, optional, default: 1e-6
|
||||
normalisation factor
|
||||
|
||||
Returns
|
||||
--------
|
||||
ndarray
|
||||
"""
|
||||
if len(image.shape) == 3:
|
||||
image = image.mean(axis=2)
|
||||
|
||||
# derivatives
|
||||
image = ndimage.gaussian_filter(image, 1)
|
||||
imx = ndimage.sobel(image, axis=0, mode='constant')
|
||||
imy = ndimage.sobel(image, axis=1, mode='constant')
|
||||
|
||||
Wxx = ndimage.gaussian_filter(imx * imx, 1.5, mode='constant')
|
||||
Wxy = ndimage.gaussian_filter(imx * imy, 1.5, mode='constant')
|
||||
Wyy = ndimage.gaussian_filter(imy * imy, 1.5, mode='constant')
|
||||
|
||||
# determinant and trace
|
||||
Wdet = Wxx * Wyy - Wxy ** 2
|
||||
Wtr = Wxx + Wyy
|
||||
harris = Wdet / (Wtr + eps)
|
||||
|
||||
# Non maximum filter of size 3
|
||||
harris_max = ndimage.maximum_filter(harris, 3, mode='constant')
|
||||
harris *= harris == harris_max
|
||||
# Remove the image corners
|
||||
harris[:3] = 0
|
||||
harris[-3:] = 0
|
||||
harris[:, :3] = 0
|
||||
harris[:, -3:] = 0
|
||||
|
||||
return harris
|
||||
|
||||
|
||||
def harris_corner_detector(image, min_distance=10, threshold=0.1, eps=1e-6):
|
||||
"""Return corners from a Harris response image
|
||||
|
||||
params
|
||||
-------
|
||||
harrisim: ndarray
|
||||
|
||||
min_distance: int, optional, default: 10
|
||||
minimum number of pixels separating corners and image boundary
|
||||
|
||||
threshold: float, optional, default: 0.1
|
||||
|
||||
eps: float, optional, default: 1e-6
|
||||
|
||||
returns:
|
||||
--------
|
||||
array: coordinates
|
||||
"""
|
||||
harrisim = _compute_harris_response(image, eps=eps)
|
||||
corner_threshold = np.max(harrisim.ravel()) * threshold
|
||||
# find top corner candidates above a threshold
|
||||
# corner_threshold = max(harrisim.ravel()) * threshold
|
||||
harrisim_t = (harrisim >= corner_threshold) * 1
|
||||
|
||||
# get coordinates of candidates
|
||||
candidates = harrisim_t.nonzero()
|
||||
coords = [(candidates[0][c], candidates[1][c]) for c
|
||||
in range(len(candidates[0]))]
|
||||
|
||||
# ...and their values
|
||||
candidate_values = [harrisim[c[0]][c[1]] for c in coords]
|
||||
|
||||
# sort candidates
|
||||
index = np.argsort(candidate_values)
|
||||
|
||||
# store allowed point locations in array
|
||||
allowed_locations = np.zeros(harrisim.shape)
|
||||
allowed_locations[min_distance:-min_distance,
|
||||
min_distance:-min_distance] = 1
|
||||
|
||||
# select the best points taking min_distance into account
|
||||
filtered_coords = []
|
||||
for i in index:
|
||||
if allowed_locations[coords[i][0]][coords[i][1]] == 1:
|
||||
filtered_coords.append(coords[i])
|
||||
allowed_locations[
|
||||
(coords[i][0] - min_distance):(coords[i][0] + min_distance),
|
||||
(coords[i][1] - min_distance):(coords[i][1] + min_distance)] = 0
|
||||
|
||||
return np.array(filtered_coords)
|
||||
Reference in New Issue
Block a user