2016
DOI: 10.1016/j.cviu.2015.10.016
|View full text |Cite
|
Sign up to set email alerts
|

Lazy Generic Cuts

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 23 publications
0
3
0
Order By: Relevance
“…The performed large scale experiments and the acquired quite promising results demonstrate the extreme potentials of the developed method. The integration of prior knowledge regarding texture and geometric features under a higher order formulation [10], [13] is currently under consideration and a GPU implementation is among the future perspectives as well.…”
Section: Discussionmentioning
confidence: 99%
“…The performed large scale experiments and the acquired quite promising results demonstrate the extreme potentials of the developed method. The integration of prior knowledge regarding texture and geometric features under a higher order formulation [10], [13] is currently under consideration and a GPU implementation is among the future perspectives as well.…”
Section: Discussionmentioning
confidence: 99%
“…Through experimental simulations across three distinct scenarios, it was observed that the ACO algorithm was less suitable for grid scheduling problems, as it consumed considerably more computational time compared to other existing evolutionary models. Khandelwala et al [12] developed a lazy version of Generic Cuts (GC) by leveraging the observation in many inference problems, a substantial portion of the constraints had never been utilized during the minimization process. Experimental results indicated that the algorithm typically required less than 3% of the total constraints.…”
Section: Related Workmentioning
confidence: 99%
“…Furthermore, in [17] an efficient method to infer solutions for higher order graphical models with submodular potentials was presented while in [18] a submodular relaxation approach was proposed for pair-wise and higher order graphical models inference. More recently [19] tackled higher order inference for graphical models which can be expressed as the minimization of partially separable function of discrete variables, while in [20] the principle of active constraints adaptively learnt over multiple iterations was adopted. Further aspects on inference, and specifically on the most commonly used optimization principles in the context of graphical models, are discussed in [21].…”
Section: Inference On Graphical Modelsmentioning
confidence: 99%