Skip to search formSkip to main contentSkip to account menu

Bregman method

Known as: Bregman 
Bregman's method is an iterative algorithm to solve certain convex optimization problems. The algorithm is a row-action method accessing constraint… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Many methods have been developed for abnormal linear systems. However, these methods often assume locality for datasets; thus the… 
Review
2016
Review
2016
– Compressive Sensing (CS) – a novel sensing paradigm asserts that signals can be reconstructed from fewer samples than that… 
2016
2016
Compared with traditional patch-based sparse representation, recent studies have concluded that group-based sparse representation… 
2013
2013
Sparse logistic regression is an important linear classifier in statistical learning, providing an attractive route for feature… 
2013
2013
— In this paper we proposed a hybrid method for Poisson noise amputation in MRI (Magnetic Resonance Imaging) datasets. The… 
2013
2013
In parallel magnetic resonance imaging (pMRI) reconstruction without using estimation of coil sensitivity functions, one group of… 
2013
2013
In this paper we present an modified active contour model for fast multiphase image segmentation based on the piecewise constant… 
2012
2012
This paper presents PDE based document image segmentation and restoration approach using active contours, non-linear diffusion… 
2012
2012
Feature extraction and object recognition from images acquired by various imaging modalities are playing the key role in… 
2010
2010
In order to solve general L1 projection problems,this paper proposes Alternating Split Bregman L1 projection algorithm.The…