On maximum weight objects decomposable into based rectilinear convex objects

Authors:
Mahmuda Ahmed;Iffat Chowdhury;Matt Gibson;Mohammad Shahedul Islam;Jessica Sherrette
Affiliations:
Department of Computer Science, University of Texas at San Antonio, San Antonio, TX;Department of Computer Science, University of Texas at San Antonio, San Antonio, TX;Department of Computer Science, University of Texas at San Antonio, San Antonio, TX;Department of Computer Science, University of Texas at San Antonio, San Antonio, TX;Department of Computer Science, University of Texas at San Antonio, San Antonio, TX
Venue:
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Year:
2013

Citing 12
Cited 0

Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Data Mining with optimized two-dimensional association rules

ACM Transactions on Database Systems (TODS)
Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Interactive Graph Cut Based Segmentation with Shape Priors

CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Level Set Based Shape Prior Segmentation

CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Efficient Algorithms for Constructing a Pyramid from a Terrain*This paper was presented at Japan Conference on Discrete and Computation Geometry 2002 (JCDCG 2002).

IEICE - Transactions on Information and Systems
Semiautomatic segmentation with compact shape prior

Image and Vision Computing
Star Shape Prior for Graph-Cut Image Segmentation

ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part III
Consistent Digital Rays

Discrete & Computational Geometry - Special Issue: 24th Annual Symposium on Computational Geometry
Segmentation under Occlusions Using Selective Shape Prior

SIAM Journal on Imaging Sciences
Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Maximum weight digital regions decomposable into digital star-shaped regions

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Our main concern is the following variant of the image segmentation problem: given a weighted grid graph and a set of vertical and/or horizontal base lines crossing through the grid, compute a maximum-weight object which can be decomposed into based rectilinear convex objects with respect to the base lines. Our polynomial-time algorithm reduces the problem to solving a polynomial number of instances of the maximum flow problem.