Dynamic programming (DP) has been a useful tool for a variety of computer vision problems. However its application is usually limited to problems with a one dimensional or low tre...
Graph-cuts based algorithms are effective for a variety
of segmentation tasks in computer vision. Ongoing research
is focused toward making the algorithms even more general,
as ...
Information retrieval techniques have to face both the growing amount of data to be processed and the "natural" distribution of these data over the network. Hence, we in...
In many vision problems, instead of having fully labeled training data, it is easier to obtain the input in small groups, where the data in each group is constrained to be from th...
Belief Propagation (BP) can be very useful and efficient for performing approximate inference on graphs. But when the graph is very highly connected with strong conflicting intera...