Hierarchized block wise image approximation by greedy pursuit strategies
An approach for effective implementation of greedy selection methodologies, to approximate an image partitioned into blocks, is proposed. The method is specially designed for approximating partitions on a transformed image. It evolves by selecting, at each iteration step, i) the elements for approximating each of the blocks partitioning the image and ii) the hierarchized sequence in which the blocks are approximated to reach the required global condition on sparsity.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
SEDONA: Search for Decoupled Neural Networks toward Greedy Block-wise Learning
Backward locking and update locking are well-known sources of inefficiency in backpropagation that prevent from concurrently updating layers. Several works have recently suggested using local error signals to train netwo…
Neural Architecture SearchConstrained Robust Submodular Partitioning
In the robust submodular partitioning problem, we aim to allocate a set of items into $m$ blocks, so that the evaluation of the minimum block according to a submodular function is maximized. Robust submodular partitionin…
Practical Block-wise Neural Network Architecture Generation
Convolutional neural networks have gained a remarkable success in computer vision. However, most usable network architectures are hand-crafted and usually require expertise and elaborate design. In this paper, we provide…
image-classificationImage ClassificationQ-LearningBlockQNN: Efficient Block-wise Neural Network Architecture Generation
Convolutional neural networks have gained a remarkable success in computer vision. However, most usable network architectures are hand-crafted and usually require expertise and elaborate design. In this paper, we provide…
GPUimage-classificationImage ClassificationQ-LearningBeyond Pointwise Submodularity: Non-Monotone Adaptive Submodular Maximization in Linear Time
In this paper, we study the non-monotone adaptive submodular maximization problem subject to a cardinality constraint. We first revisit the adaptive random greedy algorithm proposed in \citep{gotovos2015non}, where they …