Convexity is a known important cue in human vision. We propose shape convexity as a new high-order regularization constraint for binary image segmentation. In the context of discrete …
D Marin, M Tang, IB Ayed… - Proceedings of the IEEE …, 2019 - openaccess.thecvf.com
The simplicity of gradient descent (GD) made it the default method for training ever-deeper and complex neural networks. Both loss functions and architectures are often explicitly tuned …
S Luo, XC Tai, L Huo, Y Wang… - Proceedings of the …, 2019 - openaccess.thecvf.com
Many objects in real world have convex shapes. It is a difficult task to have representations for convex shapes with good and fast numerical solutions. This paper proposes a method to …
Abstract Convexity is known as an important cue in human vision. We propose shape convexity as a new high-order regularization constraint for binary image segmentation. In …
High-order and non-submodular pairwise energies are important for image segmentation, surface matching, deconvolution, tracking and other computer vision problems. Minimization …
Many computer vision problems require optimization of binary non-submodular energies. We propose a general optimization framework based on local submodular approximations …
G He, Y Gao, JC Hou, K Park - Computer Networks, 2004 - Elsevier
Analytical and empirical studies have shown that self-similar traffic can have detrimental impact on network performance including amplified queuing delay and packet loss ratio. On …
Y Kitamura, Y Li, W Ito, H Ishikawa - International Journal of Computer …, 2016 - Springer
We propose a novel segmentation method based on energy minimization of higher-order potentials. We introduce higher-order terms into the energy to incorporate prior knowledge …
NY El-Zehiry, L Grady - IEEE Transactions on Image …, 2016 - ieeexplore.ieee.org
Minimization of boundary curvature is a classic regularization technique for image segmentation in the presence of noisy image data. Techniques for minimizing curvature …