Convex Cardinal Shape Composition

  title={Convex Cardinal Shape Composition},
  author={Alireza Aghasi and Justin K. Romberg},
  journal={SIAM J. Imaging Sci.},
We propose a new shape-based modeling technique for applications in imaging problems. Given a collection of shape priors (a shape dictionary), we define our problem as choosing the right dictionary elements and geometrically composing them through basic set operations to characterize desired regions in an image. This is a combinatorial problem solving which requires an exhaustive search among a large number of possibilities. We propose a convex relaxation to the problem to make it… 

Convex cardinal shape composition and object recognition in computer vision

  • A. AghasiJ. Romberg
  • Computer Science
    2015 49th Asilomar Conference on Signals, Systems and Computers
  • 2015
This work considers an alternating direction method of multipliers (ADMM) scheme, which suits a parallel processing framework and supports large-scale problems and proposes a convex relaxation to this combinatorial problem.

Learning Shapes by Convex Composition

This paper derives general sufficient conditions under which this convex shape composition identifies a target composition.

Object Learning and Convex Cardinal Shape Composition

This paper improves the results presented in the original work, by deriving the general sufficient conditions under which CSC identifies a target composition, and provides qualitative results on who well the CSC outcome approximates the combinatorial solution.

Extracting the Principal Shape Components via Convex Programming

A set of sufficient conditions for which this convex program returns the “correct” shape are presented, which are robust in that they can account for the shapes that have indistinct boundaries, or model mismatch between the shapes in the dictionary and the target region in the image.

CoShaRP: a convex program for single-shot tomographic shape sensing

This paper circumvents the non-linearity of single-shot X-ray tomography by using a dictionary of possible roto-translations of the shapes, and proposes a convex program CoShaRP to recover the dictionary-coefficients successfully.

Incorporating shape prior into active contours with a sparse linear combination of training shapes: Application to corpus callosum segmentation

A novel method of embedding shape information into level set image segmentation by inferring shape variations by a sparse linear combination of instances in the shape repository is proposed and has been applied to the problem of segmentation of corpus callosum from 2D sagittal MR images.

Interpretable machine learning via convex cardinal shape composition

  • K. Varshney
  • Computer Science
    2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2016
This paper extends cardinal shape composition, a new method developed in the image processing and computer vision literature for image segmentation, to general machine learning problems, and results in a computationally-tractable ℓ1-regularized hinge loss optimization over a shape dictionary.

Sweep distortion removal from terahertz images via blind demodulation

Inspection and imaging through scattering layers is a decades-old problem in optics. Unlike x-ray and ultrasonic imaging techniques, time-domain spectroscopy methods can provide detailed chemical and

Sweep Distortion Removal from THz Images via Blind Demodulation

An algorithmic framework based on low-rank matrix recovery and alternating minimization that exploits the forward model for THz acquisition is proposed and implemented, which allows recovering the original signal in spite of the presence of temporal-spatial distortions.

Optimal allocation of quantized human eye depth perception for multi-focal 3D display design.

A general optimization framework is proposed, which locates the depth levels in a globally optimal way for band limited displays and provides fundamental guidelines for designing optimal near eye displays, light-field monitors, and 3D screens.



Sparse Shape Reconstruction

This paper introduces a new shape-based image reconstruction technique applicable to a large class of imaging problems formulated in a variational sense and provides a new sparse nonlinear reconstruction technique to approach this problem.

A Multiphase Dynamic Labeling Model for Variational Recognition-driven Image Segmentation

This framework fundamentally extends previous work on shape priors in level set segmentation by directly addressing the central question of where to apply which prior and may selectively use specific shape knowledge for simultaneously enhancing segmentation and recognizing shape.

Statistical shape influence in geodesic active contours

A novel method of incorporating shape information into the image segmentation process is presented. We introduce a representation for deformable shapes and define a probability distribution over the

Optimal Multiple Surface Segmentation With Shape and Context Priors

A novel approach to multi-object segmentation that incorporates both shape and context prior knowledge in a 3-D graph-theoretic framework to help overcome the stated challenges is reported.

A Review of Statistical Approaches to Level Set Segmentation: Integrating Color, Texture, Motion and Shape

A survey of a specific class of region-based level set segmentation methods and how they can all be derived from a common statistical framework is presented.

Completely Convex Formulation of the Chan-Vese Image Segmentation Model

A convex relaxation approach to solve the case in which both the segmentation and the optimal constants are unknown for two phases and multiple phases of the popular K-means algorithm.

Variational PDE models in image processing

A broad picture of mathematical image processing is given through one of the most recent and very successful approaches - the variational PDE method, which discusses two crucial ingredients for image processing: image modeling or representation, and processor modeling.

Optimal approximations by piecewise smooth functions and associated variational problems

Abstract : This reprint will introduce and study the most basic properties of three new variational problems which are suggested by applications to computer vision. In computer vision, a fundamental

Curve evolution implementation of the Mumford-Shah functional for image segmentation, denoising, interpolation, and magnification

The resulting active contour model offers a tractable implementation of the original Mumford-Shah model to simultaneously segment and smoothly reconstruct the data within a given image in a coupled manner and leads to a novel PDE-based approach for simultaneous image magnification, segmentation, and smoothing.

Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models

We show how certain nonconvex optimization problems that arise in image processing and computer vision can be restated as convex minimization problems. This allows, in particular, the finding of