我正在尝试在Python中使用opencv查找两个图像rgb
和rotated
的单应性矩阵:
print(rgb.shape, rotated.shape)
H = cv2.findHomography(rgb, rotated)
print(H)
我得到的错误是
(1080, 1920, 3) (1080, 1920, 3)
---------------------------------------------------------------------------
error Traceback (most recent call last)
<ipython-input-37-26874dc47f1f> in <module>()
1 print(rgb.shape, rotated.shape)
----> 2 H = cv2.findHomography(rgb, rotated)
3 print(H)
error: OpenCV(3.4.1) C:\projects\opencv-python\opencv\modules\calib3d\src\fundam.cpp:372: error: (-5) The input arrays should be 2D or 3D point sets in function cv::findHomography
我还尝试过使用cv2.findHomography(rgb[:,:,0], rotated[:,:,0])
来查看通道或通道顺序是否引起任何问题,但即使是2D矩阵也无法使用。
输入应该如何?
答案 0 :(得分:1)
cv2.findHomography()
不会获取两张图像并返回H
。
如果您需要为两个RGB图像找到H
作为np.arrays:
import numpy as np
import cv2
def findHomography(img1, img2):
# define constants
MIN_MATCH_COUNT = 10
MIN_DIST_THRESHOLD = 0.7
RANSAC_REPROJ_THRESHOLD = 5.0
# Initiate SIFT detector
sift = cv2.xfeatures2d.SIFT_create()
# find the keypoints and descriptors with SIFT
kp1, des1 = sift.detectAndCompute(img1, None)
kp2, des2 = sift.detectAndCompute(img2, None)
# find matches
FLANN_INDEX_KDTREE = 1
index_params = dict(algorithm=FLANN_INDEX_KDTREE, trees=5)
search_params = dict(checks=50)
flann = cv2.FlannBasedMatcher(index_params, search_params)
matches = flann.knnMatch(des1, des2, k=2)
# store all the good matches as per Lowe's ratio test.
good = []
for m, n in matches:
if m.distance < MIN_DIST_THRESHOLD * n.distance:
good.append(m)
if len(good) > MIN_MATCH_COUNT:
src_pts = np.float32([kp1[m.queryIdx].pt for m in good]).reshape(-1, 1, 2)
dst_pts = np.float32([kp2[m.trainIdx].pt for m in good]).reshape(-1, 1, 2)
H, _ = cv2.findHomography(src_pts, dst_pts, cv2.RANSAC, RANSAC_REPROJ_THRESHOLD)
return H
else: raise Exception("Not enough matches are found - {}/{}".format(len(good), MIN_MATCH_COUNT))
注意:
Python 3
和OpenCV 3.4
上进行了测试opencv-contrib-python
软件包,因为SIFT
有专利问题,并且已从opencv-python
中删除img1
并将其重叠在img2
上的H矩阵。如果您想知道如何执行此操作,请访问here