Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Develop bipartite graph match operator. #7615

Closed
qingqing01 opened this issue Jan 17, 2018 · 0 comments
Closed

Develop bipartite graph match operator. #7615

qingqing01 opened this issue Jan 17, 2018 · 0 comments
Assignees
@qingqing01

Comments

@qingqing01
Copy link
Contributor

qingqing01 commented Jan 17, 2018 •
edited
Loading

Related to #7402 and #7488

The greedy bi-partite matching operator is used in objection detection to obtain the matching with maximum distance, especially in SSD algorithm. The doc in TensorFlow is very good. But our implementation is different from TF, we need to support batched input which is a LoDTensor.
@qingqing01 qingqing01 changed the title Develop bipartite match operator. Develop bipartite graph match operator. Jan 17, 2018
@qingqing01 qingqing01 self-assigned this Jan 17, 2018
@qingqing01 qingqing01 mentioned this issue Jan 19, 2018
Merged
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@qingqing01 qingqing01

Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@qingqing01