I have two arrays, one of the shape (200000, 28, 28)
and the other of the shape (10000, 28, 28)
, so practically two arrays with matrices as elements.
Now I want to count and get all the elements (in the form (N, 28, 28)
), that overlap in both arrays. With normal for loops it is way to slow, so I tryied it with numpys intersect1d method, but I dont know how to apply it on this types of arrays.
See Question&Answers more detail:
os 与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…