python - Hungarian/munkres algorithm that is able to not link a point based on a max "price" -


i have been using of hungarian/munkres algorithms have been implemented in python (munkres package , scipy linear_sum_assignment specific) , both work (they based on same c implementation think anyway), lacking feature need.

to give context tracking points 1 image another, cost matrix distance between point in image 1 points in image 2.

the issue arises in specific case, if point image 1 lost in second image, new different point detected in image 2, 1 of image 1 points matched new point. , hungarian algorithm working intended, dont me wrong. need hungarian algorithm return "no match" point if point wants match far away. in matlab there example of on file exchange called simpletracker.m, , munkres implementation there can allow case theres no link. if have 2 images 5 particles, might link 2 of particles, cause can use max linking distance parameter decide whether assignment should made or not.

as simple example, if have image1 2 points @ (1,1) , (10,1), , sake of arguement know move 1 pixel right in next image, expect them @ (2,1) , (11,1) in image 2, , hungarian algorithm link correct particles if found in second image. issue arises if 1 of them isnt found, point @ (11,1) , instead random noise point or new point emerging in video found @ (20,1). hungarian algorithm link points (1,1) , (2,1) intended, link (10,1) (20,1).

so in matlab implementation can choose max linking distance value , set cost matrix entries infinity, , if 1 particle can assigned, thats ok , algorithm returns 1 link. in munkres.py package, there called disallowed, prevents assignment every point, algorithm fails. e.g. difference matrix [[1, 9^2],[8^2, 10^2]]. if set 70 max linking distance matrix [[1, disallowed],[64, disallowed]] means valid assignment point 1 in image 1 (1,1) point 1 in image2 (2,1). munkres algorithm return unsolvablematrix: matrix cannot solved! since cant link second point.

so sorry wall of text , possible confusion. im asking if knows of munkres implementation can allow non-assignment has been implemented in python? alternatively, best course of action deal wrongly matched points? thinking try filter out outliers after assignment has been made, or potentially remove columns distance matrix after has been calculated if values disallowed, im not sure if robust enough cover possible cases.


Comments

Post a Comment

Popular posts from this blog

Is there a better way to structure post methods in Class Based Views -

i'm using class based views in django , never specify url in ajax calls , omit action parameter in form because know these requests go through post method of class based view. notice view - profile page make many requests depending on user updating on page - post method become convoluted , if/else mess example: def post(self, request, *args, **kwargs): # handle user changing available date if request.post.get('availabledate') != none: self.updateavailabledate(request) return jsonresponse({'result':'success'}) if request.post.get('newprojectname') != none: creative_user = creativeuserprofile.objects.get(id = request.user.id) project = project.create_project(creative_user, request.post['newprojectname']) project.save() return jsonresponse({'projectid': project.id }) if request.post.get('projectimage') != none , request.files['file']: proj
Read more

performance - Why is XCHG reg, reg a 3 micro-op instruction on modern Intel architectures? -

i'm doing micro-optimization on performance critical part of code , came across sequence of instructions (in at&t syntax): add %rax, %rbx mov %rdx, %rax mov %rbx, %rdx i thought had use case xchg allow me shave instruction , write: add %rbx, %rax xchg %rax, %rdx however, dimay found agner fog's instruction tables , xchg 3 micro-op instruction 2 cycle latency on sandy bridge, ivy bridge, broadwell, haswell , skylake. 3 whole micro-ops , 2 cycles of latency! 3 micro-ops throws off 4-1-1-1 cadence , 2 cycle latency makes worse original in best case since last 2 instructions in original might execute in parallel. now... cpu might breaking instruction micro-ops equivalent to: mov %rax, %tmp mov %rdx, %rax mov %tmp, %rdx where tmp anonymous internal register , suppose last 2 micro-ops run in parallel latency 2 cycles. given register renaming occurs on these micro-architectures, though, doesn't make sense me done way. why wouldn't register renamer
Read more

jquery - Responsive Navbar with Sub Navbar -

good day, forgive me nav vocabulary not best. if question confusing apologize. i'm working on navigation bar needs centered on page @ 768px , above. items in nav open (or perhaps toggle) subnav lives directly below. these nav should appear centered on page. i have been able work through responsive portion of nav bar, having main items align vertically , sub nav menu of each item roll out below, , gave them indent separation. working well. however, issue not responsive side, behavior @ width greater 768px. happens toggling menu's sub navigation pushes other main items down page below sub nav. here's code: $(document).ready(function () { //stick in fixed 100% height behind navbar don't wrap $('#slide-nav.navbar-inverse').after($('<div class="inverse" id="navbar-height-col"></div>')); $('#slide-nav.navbar-default').after($('<div id="navbar-height-col"></d
Read more