Shai Dekel
Shai Dekel has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Pencho Petrushev
University of South Carolina
3 shared publications - Tamir Bendory
School of Electrical and Computer Engineering, Tel Aviv University, Tel Aviv 69978, Israel
3 shared publications - Arie Feuer
Department of Electrical Engineering Technion -Israel Institute of Technology
2 shared publications Pencho Petrushev
Department of Mathematics, University of South Carolina, Columbia, USA
2 shared publications- Wolfgang Dahmen
Institut für Geometrie und Praktische Mathematik RWTH Aachen Templergraben 55 52056 Aachen Germany
2 shared publications Arie Feuer
1 shared publication
Latest Publications
- 1 October 2016
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 442 (2) , 511-536
Robust recovery of stream of pulses using convex optimization
- 1 October 2016
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 442 (2) , 511-536
Robust recovery of stream of pulses using convex optimization
- Open Access
Robust Recovery of Stream of Pulses using Convex Optimization
This paper considers the problem of recovering the delays and amplitudes of a weighted superposition of pulses. This problem is motivated by a variety of applications such as ultrasound and radar. We show that for univariate and bivariate stream of pulses, one can recover the delays and weights to any desired accuracy by solving a tractable convex optimization problem, provided that a pulse-dependent separation condition is satisfied. The main result of this paper states that the recovery is robust to additive noise or model mismatch.
Open AccessRobust Recovery of Stream of Pulses using Convex Optimization
This paper considers the problem of recovering the delays and amplitudes of a weighted superposition of pulses. This problem is motivated by a variety of applications such as ultrasound and radar. We show that for univariate and bivariate stream of pulses, one can recover the delays and weights to any desired accuracy by solving a tractable convex optimization problem, provided that a pulse-dependent separation condition is satisfied. The main result of this paper states that the recovery is robust to additive noise or model mismatch.
- Open Access
Machine olfaction using time scattering of sensor multiresolution graphs
In this paper we construct a learning architecture for high dimensional time series sampled by sensor arrangements. Using a redundant wavelet decomposition on a graph constructed over the sensor locations, our algorithm is able to construct discriminative features that exploit the mutual information between the sensors. The algorithm then applies scattering networks to the time series graphs to create the feature space. We demonstrate our method on a machine olfaction problem, where one needs to classify the gas type and the location where it originates from data sampled by an array of sensors. Our experimental results clearly demonstrate that our method outperforms classical machine learning techniques used in previous studies.
Open AccessMachine olfaction using time scattering of sensor multiresolution graphs
In this paper we construct a learning architecture for high dimensional time series sampled by sensor arrangements. Using a redundant wavelet decomposition on a graph constructed over the sensor locations, our algorithm is able to construct discriminative features that exploit the mutual information between the sensors. The algorithm then applies scattering networks to the time series graphs to create the feature space. We demonstrate our method on a machine olfaction problem, where one needs to classify the gas type and the location where it originates from data sampled by an array of sensors. Our experimental results clearly demonstrate that our method outperforms classical machine learning techniques used in previous studies.
- 30 October 2014
- Published by Springer Nature in International Journal of Computer Assisted Radiology and Surgery
- Vol. 10 (7) , 1043-1054
Computer-aided diagnostics in digital pathology: automated evaluation of early-phase pancreatic cancer in mice
Digital pathology diagnostics are often based on subjective qualitative measures. A murine model of early-phase pancreatic ductal adenocarcinoma provides a controlled environment with a priori knowledge of the genetic mutation and stage of the disease. Use of this model enables the application of supervised learning methods to digital pathology. A computerized diagnostics system for histological detection of pancreatic adenocarcinoma was developed and tested. Pathological H&E-stained specimens with early pancreatic lesions were identified and evaluated with a system that models cancer detection using a top-down object learning paradigm, mimicking the way a pathologist learns. First, the dominant primitives were identified and segmented in the images, i.e., the ducts, nuclei and tumor stroma. A boost-based machine learning technique was used for duct segmentation, classification and outlier pruning. Second, a set of morphological features traditionally used for cancer diagnosis which provides quantitative image features was employed to quantify subtle findings such as duct deformation and nuclei malformations. Finally, a visually interpretable predictive model was trained to distinguish between normal tissue and premalignant cancer lesions, given ground truth samples. A predictive success rate of 92 % was achieved using tenfold cross-validation and 93 % on an independent test set. Comparison was made with state-of-the-art classification algorithms that are not interpretable as visible features yielded the contribution of individual primitive features to the prediction outcome. Quantitative image analysis and classification were successful in preclinical histology diagnosis for early-stage pancreatic adenocarcinoma. The usage of annotated contours coupled with interpretable supervised learning methods and outlier pruning can be adapted to other medical imaging tasks. The usage of interpretable supervised learning techniques may improve the success of CAD in histopathological diagnosis.
- 30 October 2014
- Published by Springer Nature in International Journal of Computer Assisted Radiology and Surgery
- Vol. 10 (7) , 1043-1054
Computer-aided diagnostics in digital pathology: automated evaluation of early-phase pancreatic cancer in mice
Digital pathology diagnostics are often based on subjective qualitative measures. A murine model of early-phase pancreatic ductal adenocarcinoma provides a controlled environment with a priori knowledge of the genetic mutation and stage of the disease. Use of this model enables the application of supervised learning methods to digital pathology. A computerized diagnostics system for histological detection of pancreatic adenocarcinoma was developed and tested. Pathological H&E-stained specimens with early pancreatic lesions were identified and evaluated with a system that models cancer detection using a top-down object learning paradigm, mimicking the way a pathologist learns. First, the dominant primitives were identified and segmented in the images, i.e., the ducts, nuclei and tumor stroma. A boost-based machine learning technique was used for duct segmentation, classification and outlier pruning. Second, a set of morphological features traditionally used for cancer diagnosis which provides quantitative image features was employed to quantify subtle findings such as duct deformation and nuclei malformations. Finally, a visually interpretable predictive model was trained to distinguish between normal tissue and premalignant cancer lesions, given ground truth samples. A predictive success rate of 92 % was achieved using tenfold cross-validation and 93 % on an independent test set. Comparison was made with state-of-the-art classification algorithms that are not interpretable as visible features yielded the contribution of individual primitive features to the prediction outcome. Quantitative image analysis and classification were successful in preclinical histology diagnosis for early-stage pancreatic adenocarcinoma. The usage of annotated contours coupled with interpretable supervised learning methods and outlier pruning can be adapted to other medical imaging tasks. The usage of interpretable supervised learning techniques may improve the success of CAD in histopathological diagnosis.
- 27 September 2014
- Published by Springer Nature in Constructive Approximation
- Vol. 42 (2) , 183-207
Exact Recovery of Dirac Ensembles from the Projection Onto Spaces of Spherical Harmonics
- 27 September 2014
- Published by Springer Nature in Constructive Approximation
- Vol. 42 (2) , 183-207
Exact Recovery of Dirac Ensembles from the Projection Onto Spaces of Spherical Harmonics
- Open Access
A new proof of the atomic decomposition of Hardy spaces
A new proof is given of the atomic decomposition of Hardy spaces Hp, in the classical setting of Rn. The new method can be used to establish atomic decomposition of maximal Hardy spaces in general setting and non classical settings.
Open AccessA new proof of the atomic decomposition of Hardy spaces
A new proof is given of the atomic decomposition of Hardy spaces Hp, in the classical setting of Rn. The new method can be used to establish atomic decomposition of maximal Hardy spaces in general setting and non classical settings.
- 7 September 2012
- Published by Wiley in Mathematische Nachrichten
- Vol. 285 (17-18) , 2078-2092
On dual spaces of anisotropic Hardy spaces
In this paper we generalize the analysis of the Campanato‐type dual spaces 1, 3, for the highly anisotropic Hardy spaces on \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mathbb {R}^n$\end{document} introduced in 10. These Hardy spaces are constructed over multi‐level ellipsoid covers of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mathbb {R}^n$\end{document} , where the ellipsoids can change shape rapidly from point to point and from level to level.- 7 September 2012
- Published by Wiley in Mathematische Nachrichten
- Vol. 285 (17-18) , 2078-2092
On dual spaces of anisotropic Hardy spaces
In this paper we generalize the analysis of the Campanato‐type dual spaces 1, 3, for the highly anisotropic Hardy spaces on \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mathbb {R}^n$\end{document} introduced in 10. These Hardy spaces are constructed over multi‐level ellipsoid covers of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mathbb {R}^n$\end{document} , where the ellipsoids can change shape rapidly from point to point and from level to level.- 20 October 2011
- Published by Springer Nature
- p. 95-109
Active Geometric Wavelets
- 9 April 2011
- Published by Springer Nature in Journal of Fourier Analysis and Applications
- Vol. 17 (5) , 1066-1107
Hardy Spaces on ℝ n with Pointwise Variable Anisotropy
- 9 April 2011
- Published by Springer Nature in Journal of Fourier Analysis and Applications
- Vol. 17 (5) , 1066-1107
Hardy Spaces on ℝ n with Pointwise Variable Anisotropy