In recent investigations, the problem of detecting edges given non-uniform Fourier data was reformulated as a sparse signal recovery problem with an 1 -regularized least squares cost function. This result can also be derived by employing a Bayesian formulation. Specifically, reconstruction of an edge map using 1 regularization corresponds to a so-called type-I (maximum a posteriori ) Bayesian estimate. In this paper, we use the Bayesian framework to design an improved algorithm for detecting edges from non-uniform Fourier data. In particular, we employ what is known as type-II Bayesian estimation, specifically a method called sparse Bayesian learning. We also show that our new edge detection method can be used to improve downstream processes that rely on accurate edge information like image reconstruction, especially with regards to compressed sensing techniques. 2 regularization, [10]. The second category is type-II, or evidence maximization Bayesian estimation which employs a hierarchical, flexible parametrized prior that is learned from the given data. For SSR, [20] provides * Department of Mathematics, Dartmouth College, USA 1 Note that while here we only explicitly consider non-uniform Fourier samples, all methods described here apply to uniform Fourier samples as well.2 Although ideally the 0 semi-norm should be used to regularize this problem, the resulting optimization problem is NP-hard. Hence the 1 norm has become a popular convex surrogate that makes the problem computationally tractable and also offers theoretical guarantees for exact reconstruction, [8], as well as a variety of other benefits related to compressed sensing, [14].