Elasticsearch Aggregation with hamming distance of a phash
Trying to group together similar documents with matching keyword field values and phashes of their related images.
At the moment I have the following which works well for exact matching phashes
'duplicate_docs':
A('terms',
script={
"lang":
"painless",
"inline":
"def term = doc['make'] + '' +doc['model'] + doc['province'] + doc['mileage'];return term+''+doc['image_hash'];"
}),
}, {'dup_docs': A('top_hits', size=20)}):
However some of the images are slightly different and the whole point of phash is that you can use a hamming distance to figure how different
I realise this probably makes the calculation vastly more expensive as essentially need to compare every image against every other image which seems excessive but unsure how else I could go about this. Thanks
python
elasticsearch hamming-distance phash elasticsearch-dsl-py asked Nov 23 '18 at 13:36
David Kaplan
9117
add a comment |
Trying to group together similar documents with matching keyword field values and phashes of their related images.
At the moment I have the following which works well for exact matching phashes
'duplicate_docs':
A('terms',
script={
"lang":
"painless",
"inline":
"def term = doc['make'] + '' +doc['model'] + doc['province'] + doc['mileage'];return term+''+doc['image_hash'];"
}),
}, {'dup_docs': A('top_hits', size=20)}):
However some of the images are slightly different and the whole point of phash is that you can use a hamming distance to figure how different
I realise this probably makes the calculation vastly more expensive as essentially need to compare every image against every other image which seems excessive but unsure how else I could go about this. Thanks
python
elasticsearch hamming-distance phash elasticsearch-dsl-py asked Nov 23 '18 at 13:36
David Kaplan
9117
I've come up with a potential solution, where i aggregate by all field except the phash ( to narrow down) and then in a python script group them together by working out a hamming distance threshold, will see how this performs
– David Kaplan
Nov 24 '18 at 23:40
add a comment |
Trying to group together similar documents with matching keyword field values and phashes of their related images.
At the moment I have the following which works well for exact matching phashes
'duplicate_docs':
A('terms',
script={
"lang":
"painless",
"inline":
"def term = doc['make'] + '' +doc['model'] + doc['province'] + doc['mileage'];return term+''+doc['image_hash'];"
}),
}, {'dup_docs': A('top_hits', size=20)}):
However some of the images are slightly different and the whole point of phash is that you can use a hamming distance to figure how different
I realise this probably makes the calculation vastly more expensive as essentially need to compare every image against every other image which seems excessive but unsure how else I could go about this. Thanks
python
elasticsearch hamming-distance phash elasticsearch-dsl-py asked Nov 23 '18 at 13:36
David Kaplan
9117
Trying to group together similar documents with matching keyword field values and phashes of their related images.
At the moment I have the following which works well for exact matching phashes
'duplicate_docs':
A('terms',
script={
"lang":
"painless",
"inline":
"def term = doc['make'] + '' +doc['model'] + doc['province'] + doc['mileage'];return term+''+doc['image_hash'];"
}),
}, {'dup_docs': A('top_hits', size=20)}):
However some of the images are slightly different and the whole point of phash is that you can use a hamming distance to figure how different
I realise this probably makes the calculation vastly more expensive as essentially need to compare every image against every other image which seems excessive but unsure how else I could go about this. Thanks
python
elasticsearch hamming-distance phash elasticsearch-dsl-py python
elasticsearch hamming-distance phash elasticsearch-dsl-py asked Nov 23 '18 at 13:36
David Kaplan
9117
asked Nov 23 '18 at 13:36
David Kaplan
9117
asked Nov 23 '18 at 13:36
David Kaplan
9117
asked Nov 23 '18 at 13:36
David Kaplan
9117
asked Nov 23 '18 at 13:36
David Kaplan
9117
9117
I've come up with a potential solution, where i aggregate by all field except the phash ( to narrow down) and then in a python script group them together by working out a hamming distance threshold, will see how this performs
– David Kaplan
Nov 24 '18 at 23:40
add a comment |
I've come up with a potential solution, where i aggregate by all field except the phash ( to narrow down) and then in a python script group them together by working out a hamming distance threshold, will see how this performs
– David Kaplan
Nov 24 '18 at 23:40
I've come up with a potential solution, where i aggregate by all field except the phash ( to narrow down) and then in a python script group them together by working out a hamming distance threshold, will see how this performs
– David Kaplan
Nov 24 '18 at 23:40
I've come up with a potential solution, where i aggregate by all field except the phash ( to narrow down) and then in a python script group them together by working out a hamming distance threshold, will see how this performs
– David Kaplan
Nov 24 '18 at 23:40
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53447731%2felasticsearch-aggregation-with-hamming-distance-of-a-phash%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53447731%2felasticsearch-aggregation-with-hamming-distance-of-a-phash%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
I've come up with a potential solution, where i aggregate by all field except the phash ( to narrow down) and then in a python script group them together by working out a hamming distance threshold, will see how this performs
– David Kaplan
Nov 24 '18 at 23:40