Professional Documents
Culture Documents
Paper Name
1 Very Deep Convolutional Networks for Large-
Scale Image Recognition
The fundamental idea—to extract more real objects and more faint objects close to bright objects in image
very large dynamic intensity ranges and high levels of noise. Two main components: global detection (whi
can be run as an independent detection routine) and local detection. Global detection: Gaussian filter ->
background subtraction -> histogram equalization -> thresholding by Otsu’s method. These steps are app
a normalized image with intensities from 0 to 1. Local detection: watershed segmentation applied to create
irregularly sized sub-regions. The following image transformations are then applied: grayscale stretching,
background estimation, Histogram equalization. Adaptive noise is removed and layered object detection is
finally applied. The output is deblended to derive locally detected objects. This tool can be used as a stand
(to process astrophysical images) or in combination with other ones.
Adaptive filters recognize and adapt their own impulse to the resolution of the local signal. Thus, it can
recognize the local resolution in presence of noise. It doesn’t degrade the spectrum. Once recovered by th
inverse transform, the adaptive filtered image appears smooth over large regions of the sky background (a
gradients=0), but star-like features (significant gradients) are unchanged—using a one-dimensional versio
the adaptive filter. The authors also present a 2D transform, the H transform (named after Haar).
There is no ideal wavelet transform algorithm—selection depends on the application. Their key advantage
Fourier transforms: capturing both frequency and location information. The algorithms: Mallat’s Transform
the scale parameter is sampled along the dyadic sequence 2^j (j->Integer) and the wavelet transform is
calculated for each point in time; Feauveau’s Transform—not dyadic and allows image decomposition with
resolution factor=√2; Wavelet Transform with FFT—a decomposition with isotropic scaling and wavelet
functions; A Trous Algorithm—[very powerful] produces an isotropic transform (for 2D) and the reconstruc
algorithm is trivial; Pyramidal Algorithm—derived from the a trous algorithm, it allows all computation to be
carried out in direct space, although an iterative algorithm is necessary for exact restoration.
The authors’ first attempt to produce an image of alpha Ori was made by deconvolving the images reprod
in a paper by Gezari, Labeyrie, and Stachnik. The final image was still blurred by some function accountin
the difference between the actual impulse response and the adopted impulse response. A similar result w
later achieved by a procedure in which a digital, scanning microdensitometer was used to superpose indiv
speckle images. The result of this partial deconvolution is, for gamma Orí, an approximate solution for f(x,
function which may be thought of as an image of a point source and as a representation of the intensity im
response of a system that includes all of the data processing that has been introduced. Although the partic
procedure for the reconstruction of the images has only a limited range of validity.
Reference
Simonyan, Karen & Zisserman,
Andrew. (2014), “Very Deep
Convolutional Networks for
Large-Scale Image
Recognition”, arXiv 1409.1556.