Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  study the problem of multi-target tracking and data association in video.  formulate this in terms of selecting a subset of high-quality tracks subject to the constraint that no pair of selected tracks is associated with a common detection (of an object). This objective is equivalent to the classic NP-hard problem of finding a maximum-ight set packing (MWSP) where tracks correspond to sets and is made further difficult since the number of candidate tracks grows exponentially in the number of detections.  present a relaxation of this combinatorial problem that uses a column generation formulation where the pricing problem is solved via dynamic programming to efficiently explore the space of tracks.  employ row generation to tighten the bound in such a way as to preserve efficient inference in the pricing problem.  show the practical utility of this algorithm for tracking problems in natural and biological video datasets.
['Shaofei Wang', 'Steffen Wolf', 'Charless C. Fowlkes', 'Julian Yarkony']
I am writing a research paper on a idea Tracking Objects with Higher Order Interactions using Delayed Column Generation
[{"from": "human", "value": "I am writing a research paper on a idea Tracking Objects with Higher Order Interactions using Delayed Column Generation"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  study the problem of multi-target tracking and data association in video.  formulate this in terms of selecting a subset of high-quality tracks subject to the constraint that no pair of selected tracks is associated with a common detection (of an object). This objective is equivalent to the classic NP-hard problem of finding a maximum-ight set packing (MWSP) where tracks correspond to sets and is made further difficult since the number of candidate tracks grows exponentially in the number of detections.  present a relaxation of this combinatorial problem that uses a column generation formulation where the pricing problem is solved via dynamic programming to efficiently explore the space of tracks.  employ row generation to tighten the bound in such a way as to preserve efficient inference in the pricing problem.  show the practical utility of this algorithm for tracking problems in natural and biological video datasets."}]