Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Local feature descriptors represent image patches as floating-point or binary arrays for computer vision tasks. ,  propose to train Euclidean and Hamming embedding for image patch description with triplet convolutional networks. Thanks to the learning ability of deep ConvNets, the trained local feature generation method, which is called Deeply Learned Feature Transform (DELFT), has good distinctiveness and robustness. Evaluated on the UBC benchmark,  get the state-of-the-art results using floating-point and binary features. Also, the learned features can cooperate with existing nearest neighbor search algorithms in Euclidean and Hamming space. In addition, a new benchmark is constructed to facilitate future related research, which contains 40 million image patches, corresponding to 6.7 million 3D points, being 25 times larger than existing dataset. The distinctiveness and robustness of the proposed method are demonstrated in the experimental results.
['Zishun Liu', 'Zhenxi Li', 'Juyong Zhang', 'Ligang Liu']
I am writing a research paper on a idea Euclidean and Hamming Embedding for Image Patch Description with Convolutional Networks
[{"from": "human", "value": "I am writing a research paper on a idea Euclidean and Hamming Embedding for Image Patch Description with Convolutional Networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Local feature descriptors represent image patches as floating-point or binary arrays for computer vision tasks. ,  propose to train Euclidean and Hamming embedding for image patch description with triplet convolutional networks. Thanks to the learning ability of deep ConvNets, the trained local feature generation method, which is called Deeply Learned Feature Transform (DELFT), has good distinctiveness and robustness. Evaluated on the UBC benchmark,  get the state-of-the-art results using floating-point and binary features. Also, the learned features can cooperate with existing nearest neighbor search algorithms in Euclidean and Hamming space. In addition, a new benchmark is constructed to facilitate future related research, which contains 40 million image patches, corresponding to 6.7 million 3D points, being 25 times larger than existing dataset. The distinctiveness and robustness of the proposed method are demonstrated in the experimental results."}]