On Euclidean Metric Approximation via Graph Cuts

Author(s):  
Ondřej Daněk ◽  
Pavel Matula
Author(s):  
Bernhard M¨uhlherr ◽  
Holger P. Petersson ◽  
Richard M. Weiss

This chapter presents some results about groups generated by reflections and the standard metric on a Bruhat-Tits building. It begins with definitions relating to an affine subspace, an affine hyperplane, an affine span, an affine map, and an affine transformation. It then considers a notation stating that the convex closure of a subset a of X is the intersection of all convex sets containing a and another notation that denotes by AGL(X) the group of all affine transformations of X and by Trans(X) the set of all translations of X. It also describes Euclidean spaces and assumes that the real vector space X is of finite dimension n and that d is a Euclidean metric on X. Finally, it discusses Euclidean representations and the standard metric.


2016 ◽  
Vol 202 ◽  
pp. 194-204 ◽  
Author(s):  
Kyle Austin ◽  
Žiga Virk
Keyword(s):  

NeuroImage ◽  
2008 ◽  
Vol 43 (4) ◽  
pp. 708-720 ◽  
Author(s):  
Fedde van der Lijn ◽  
Tom den Heijer ◽  
Monique M.B. Breteler ◽  
Wiro J. Niessen

2014 ◽  
Vol 556-562 ◽  
pp. 4206-4210
Author(s):  
Wei Liu ◽  
Xue Jun Xu

Interactive segmentation with graph cuts has become very popular and many priors have been introduced into graph cuts to improve the results. This paper proposed a method which uses the deformable part-based model to pre-label the seeds. First the deformable part-based model finds out the bounding box, then we can pre-label the seed point based on the assumption of compact shape. Our results show that our method can get more accurate result especially the appearance of the object and background are similar and the shape is compact.


2009 ◽  
Author(s):  
Alexander M. Nelson ◽  
Jeremiah J. Neubert
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document