TEA-graph
TEA-graph copied to clipboard
Question About The Paper
I am a beginner. I would like to ask, the article says that distance d and Angle a are embedded as edge features. Take the length,d ={d11,d12,... dNN}, where d11 and patch feature dimensions are consistent, what is the specific calculation method for distance d? Are the corresponding elements of two node eigenvectors subtracted?