Multiscale Hierarchical Decomposition of Images with Applications to Deblurring, Denoising and Segmentation

Tadmor, Eitan; Nezzar, Suzanne; Vese, Luminita A.

doi:10.21236/ada489758

Cited by 19 publications

(38 citation statements)

References 12 publications

(26 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A related but different representation was proposed in [39,40] based on total variation (TV) regularization [36]. This time, the representation embeds f : Ω ⊂ R 2 → R in a sequence {T n f : Ω → R, n ≥ 0} such that T 0 f = 0 and lim n→∞ T n f = f .…”

Section: Multiscale Representations In Image Analysismentioning

confidence: 99%

Nonlinear Multilayered Representation of Graph-Signals

2012

View full text Add to dashboard Cite

We propose a nonlinear multiscale decomposition of signals defined on the vertex set of a general weighted graph. This decomposition is inspired by the hierarchical multiscale (BV , L 2 ) decomposition of Tadmor, Nezzar, and Vese (Multiscale Model. Simul. 2(4): 2004). We find the decomposition by iterative regularization using a graph variant of the classical total variation regularization (Rudin et al, Physica D 60(1-4):259-268, 1992). Using tools from convex analysis, and in particular Moreau's identity, we carry out the mathematical study of the proposed method, proving the convergence of the representation and providing an energy decomposition result. The choice of the sequence of scales is also addressed. Our study shows that the initial scale can be related to a discrete version of Meyer's norm (Meyer, Oscillating Patterns in Image Processing and Nonlinear Evolution Equations, 2001) which we introduce in the present paper. We propose to use the recent primal-dual algorithm of Chambolle and Pock (J. Math. Imaging Vis. 40:120-145, 2011) in order to compute both the minimizer of the graph total variation and the corresponding dual norm. By applying the graph model to digital images, we investigate the use of nonlocal methods to the multiscale decomposition task. Since the only assumption needed to apply our method is that the input data is living on a graph, we are also able to tackle the task of adaptive multi-

show abstract

Section: Multiscale Representations In Image Analysismentioning

confidence: 99%

Nonlinear Multilayered Representation of Graph-Signals

2012

View full text Add to dashboard Cite

show abstract

“…Copy and triad are derived from the stream benchmark suite [18], and are streaming benchmarks. Deblur [25], registration [35], and denoise [30] are medical imaging benchmarks. In order to generate memory transaction traffic for a multiprogrammed workload (or a system using virtualization) running on a many-core CMP, we need to model several of the benchmarks on separate cores concurrently.…”

Section: Experimental Frameworkmentioning

confidence: 99%

Utilizing Radio-Frequency Interconnect for a Many-DIMM DRAM System

Therdsteerasukdi

Byun

et al. 2012

IEEE J. Emerg. Sel. Topics Circuits Syst.

View full text Add to dashboard Cite

Abstract-The demand for capacity and off-chip bandwidth to dynamic random-access memory (DRAM) will continue to grow as we integrate more cores onto a die. However, as the data rate of DRAM has increased, the number of dual in-line memory modules (DIMMs) supported on a multi-drop bus has decreased. Therefore, traditional memory systems are not sufficient to meet both these demands. We propose the DIMM tree architecture for better scalability by connecting the DIMMs as a tree. The DIMM tree architecture is able to grow the number of DIMMs exponentially with each level of latency in the tree. We also propose application of multiband radio-frequency interconnect (MRF-I) to the DIMM tree architecture for even greater scalability and higher throughput. The DIMM tree architecture without MRF-I was able to scale up to 64 DIMMs with only an 8% degradation in throughput over an ideal system. The DIMM tree architecture with MRF-I was able to increase throughput by 68% (up to 200%) on a 64-DIMM system over a 4-DIMM system. Finally, we propose the partitioned DIMM tree, which allows the scaling of a main memory system to a many-DIMM memory system while still maintaining high throughput. The partitioned DIMM tree is able to improve throughput by an average of 19% up to 35% over the DIMM tree with 256 DIMMs on a single channel.Index Terms-Integrated circuit interconnections, memory architecture, radio-frequency integrated circuits, random access memory.

show abstract

“…The approach can be extended to obtain a hierarchical decomposition of images for denoising, deblurring, and segmentation purposes [13].…”

Section: Norm-based Approachmentioning

confidence: 99%

Null Space Pursuit: An Operator-based Approach to Adaptive Signal Separation

Peng

Hwang

2010

IEEE Trans. Signal Process.

View full text Add to dashboard Cite

The operator-based signal separation approach uses an adaptive operator to separate a signal into additive subcomponents. The approach can be formulated as an optimization problem whose optimal solution can be derived analytically. However, the following issues must still be resolved: estimating the robustness of the operator's parameters and the Lagrangian multipliers, and determining how much of the information in the null space of the operator should be retained in the residual signal. To address these problems, we propose a novel optimization formula for operator-based signal separation and show that the parameters of the problem can be estimated adaptively.We demonstrate the efficacy of the proposed method by processing several signals, including real-life signals.

show abstract

Multiscale Hierarchical Decomposition of Images with Applications to Deblurring, Denoising and Segmentation

Cited by 19 publications

References 12 publications

Nonlinear Multilayered Representation of Graph-Signals

Nonlinear Multilayered Representation of Graph-Signals

Utilizing Radio-Frequency Interconnect for a Many-DIMM DRAM System

Null Space Pursuit: An Operator-based Approach to Adaptive Signal Separation

Contact Info

Product

Resources

About