2013-04-08 12:48:50 -0600 | received badge | ● Scholar (source) |
2013-04-08 10:11:00 -0600 | commented answer | Matching ranges over many dimensions Hi, I've added a bit of detail to my question. Given the depiction, is 'assign a single matcher to an own created descriptor vector' the way to go? |
2013-04-08 10:08:38 -0600 | received badge | ● Supporter (source) |
2013-04-08 03:04:18 -0600 | received badge | ● Editor (source) |
2013-04-08 03:03:56 -0600 | asked a question | Matching ranges over many dimensions Visualize many lanes of binary valued time ranges. Are there any existing methods for finding pairs or lanes that feature many overlapping regions? There are hundreds to thousands of these lanes. The are not ordered, so the matching dimensions are not necessarily neighboring pixels. I am both interested in lanes that have many co-occurrences of start points '=' and overlaps. |----=-=-=-=-====--------======----====---=| |