| Publication | Date of Publication | Type |
|---|
Accelerated Griffin-Lim algorithm: a fast and provably converging numerical method for phase retrieval
IEEE Transactions on Signal Processing | 2024-09-16 | Paper |
Accelerated Griffin-Lim algorithm: A fast and provably converging numerical method for phase retrieval
| 2023-06-21 | Paper |
Faster than Fast: Accelerating the Griffin-Lim Algorithm
| 2023-04-25 | Paper |
Frame-related Sequences in Chains and Scales of Hilbert Spaces
| 2022-02-17 | Paper |
Harmonic-aligned Frame Mask Based on Non-stationary Gabor Transform with Application to Content-dependent Speaker Comparison
| 2019-04-23 | Paper |
A measure of directional convexity inspired by binary tomography
Fundamenta Informaticae | 2016-08-15 | Paper |
Eliminating switching components in binary matrices by 0-1 flips and column permutations
Fundamenta Informaticae | 2016-08-15 | Paper |
Binary image reconstruction from a small number of projections and the morphological skeleton
Annals of Mathematics and Artificial Intelligence | 2015-10-06 | Paper |
Random generation of \(hv\)-convex polyominoes with given horizontal projection
Fundamenta Informaticae | 2015-06-26 | Paper |
Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections
Discrete Applied Mathematics | 2013-12-17 | Paper |
An empirical study of reconstructing hv-convex binary matrices from horizontal and vertical projections
Acta Cybernetica | 2013-11-07 | Paper |
The reconstruction of polyominoes from horizontal and vertical projections and morphological skeleton is NP-complete
Fundamenta Informaticae | 2013-08-29 | Paper |
Binary Image Reconstruction from Two Projections and Skeletal Information
Combinatorial Image Analaysis | 2013-04-04 | Paper |
Learning connectedness and convexity of binary images from their projections
PU.M.A. Pure Mathematics and Applications | 2012-09-18 | Paper |
A benchmark set for the reconstruction of \(hv\)-convex discrete sets
Discrete Applied Mathematics | 2010-04-28 | Paper |
DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION
International Journal of Shape Modeling | 2010-03-22 | Paper |
A fast algorithm for reconstructing hv-convex 8-connected but not 4-connected discrete sets.
Lecture Notes in Computer Science | 2010-01-05 | Paper |
Reconstruction of canonical \(hv\)-convex discrete sets from horizontal and vertical projections
Lecture Notes in Computer Science | 2009-12-11 | Paper |
On the ambiguity of reconstructing \(hv\)-convex binary matrices with decomposable configurations
| 2009-03-19 | Paper |
A framework for generating some discrete sets with disjoint components by using uniform distributions
Theoretical Computer Science | 2008-11-12 | Paper |
The Number of Line-Convex Directed Polyominoes Having the Same Orthogonal Projections
Discrete Geometry for Computer Imagery | 2008-04-17 | Paper |
Decomposition algorithms for reconstructing discrete sets with disjoint components
| 2008-01-04 | Paper |
Reconstruction of Discrete Sets from Four Projections: Strong Decomposability
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Discrete Geometry for Computer Imagery
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Reconstruction of 8-connected but not 4-connected \(hv\)-convex discrete sets
Discrete Applied Mathematics | 2005-05-04 | Paper |
