Vertical derivative conversion of irregular-range potential fi eld data based on improved projection onto convex sets method

Gravity and magnetic exploration areas are usually irregular,and there is some data defi ciency.Missing data must be interpolated before the vertical derivative conversion in the wavenumber domain.Meanwhile,for improved processing precision,the data need to be edge-padded to the length required by the fast Fourier transform algorithm.For conventional vertical derivative conversion of potential fi eld data(PFD),only vertical derivative conversion is considered,or interpolation,border padding,and vertical derivative conversion are executed independently.In this paper,these three steps are considered uniformly,and a vertical derivative conversion method for irregular-range PFD based on an improved projection onto convex sets method is proposed.The cutoff wavenumber of the filter used in the proposed method is determined by fractal model fi tting of the radial average power spectrum(RAPS)of the potential fi eld.Theoretical gravity models and real aeromagnetic data show the following:(1)The fitting of the RAPS with a fractal model can separate useful signals and noise reasonably.(2)The proposed iterative method has a clear physical sense,and its interpolation,border padding error,and running time are much smaller than those of the conventional kriging and minimum curvature methods.

Seismic data reconstruction based on CS and Fourier theory

Traditional seismic data sampling follows the Nyquist sampling theorem. In this paper, we introduce the theory of compressive sensing （CS）, breaking through the limitations of the traditional Nyquist sampling theorem, rendering the coherent aliases of regular undersampling into harmless incoherent random noise using random undersampling, and effectively turning the reconstruction problem into a much simpler denoising problem. We introduce the projections onto convex sets （POCS） algorithm in the data reconstruction process, apply the exponential decay threshold parameter in the iterations, and modify the traditional reconstruction process that performs forward and reverse transforms in the time and space domain. We propose a new method that uses forward and reverse transforms in the space domain. The proposed method uses less computer memory and improves computational speed. We also analyze the antinoise and anti-aliasing ability of the proposed method, and compare the 2D and 3D data reconstruction. Theoretical models and real data show that the proposed method is effective and of practical importance, as it can reconstruct missing traces and reduce the exploration cost of complex data acquisition.

Iterative analytic extension in tomographic imaging

If a spatial-domain function has a finite support,its Fourier transform is an entire function.The Taylor series expansion of an entire function converges at every finite point in the complex plane.The analytic continuation theory suggests that a finite-sized object can be uniquely determined by its frequency components in a very small neighborhood.Trying to obtain such an exact Taylor expansion is difficult.This paper proposes an iterative algorithm to extend the measured frequency components to unmeasured regions.Computer simulations show that the proposed algorithm converges very slowly,indicating that the problem is too ill-posed to be practically solvable using available methods.

A NOVEL ALGORITHM OF SUPER-RESOLUTION RECONSTRUCTION FOR COMPRESSED VIDEO

Super-Resolution (SR) technique means to reconstruct High-Resolution (HR) images from a sequence of Low-Resolution (LR) observations,which has been a great focus for compressed video. Based on the theory of Projection Onto Convex Set (POCS),this paper constructs Quantization Constraint Set (QCS) using the quantization information extracted from the video bit stream. By combining the statistical properties of image and the Human Visual System (HVS),a novel Adaptive Quantization Constraint Set (AQCS) is proposed. Simulation results show that AQCS-based SR al-gorithm converges at a fast rate and obtains better performance in both objective and subjective quality,which is applicable for compressed video.

A POCS-Based Algorithm for Blocking Artifacts Reduction

An algorithm for blocking artifacts reduction in DCT domain for block-based image coding was developed. The algorithm is based on the projection onto convex set （POCS） theory. Due to the fact that the DCT characteristics of shifted blocks are different caused by the blocking artifacts, a novel smoothness constraint set and the corresponding projection operator were proposed to reduce the blocking artifacts by discarding the undesired high frequency coefficients in the shifted DCT blocks. The experimental resuhs show that the propo,sed algorithm outperforms the conventional algorithms in terms of objective quality, subiective quality, and convergence property.

Image enhancement and post-processing for low resolution compressed video

This research paper recommends the point spread function(PSF)forecasting technique based on the projection onto convex set(POCS)and regularization to acquire low resolution images.As the environment for the production of user created contents(UCC)videos(one of the contents on the Internet)becomes widespread,resolution reduction and image distortion occurs,failing to satisfy users who desire high quality images.Accordingly,this research neutralizes the coding artifact through POCS and regularization processes by:1)factoring the local characteristics of the image when it comes to the noise that results during the discrete cosine transform(DCT)and quantization process;and 2)removing the blocking and ring phenomena which are problems with the existing video compression.Moreover,this research forecasts the point spread function to obtain low resolution images using the above-mentioned methods.Thus,a method is suggested for minimizing the errors found among the forecasting interpolation pixels.Low-resolution image quality obtained through the experiment demonstrates that significant enhancement was made on the visual level compared to the original image.

Super-resolution enhancement of UAV images based on fractional calculus and POCS

A super-resolution enhancement algorithm was proposed based on the combination of fractional calculus and Projection onto Convex Sets(POCS)for unmanned aerial vehicles(UAVs)images.The representative problems of UAV images including motion blur,fisheye effect distortion,overexposed,and so on can be improved by the proposed algorithm.The fractional calculus operator is used to enhance the high-resolution and low-resolution reference frames for POCS.The affine transformation parameters between low-resolution images and reference frame are calculated by Scale Invariant Feature Transform(SIFT)for matching.The point spread function of POCS is simulated by a fractional integral filter instead of Gaussian filter for more clarity of texture and detail.The objective indices and subjective effect are compared between the proposed and other methods.The experimental results indicate that the proposed method outperforms other algorithms in most cases,especially in the structure and detail clarity of the reconstructed images.

Reconstruction algorithm of super-resolution infrared image based on human vision processing mechanism

Aiming at solving the problem of low resolu- tion and visual blur in infrared imaging, a super-resolution infrared image reconstruction method using human vision processing mechanism （HVPM） was proposed. This method combined a mechanism of vision lateral inhibition with an algorithm projection onto convex sets （POCS） reconstruction, the improved vision lateral inhibition network was utilized to enhance the contrast between object and background of low-resolution image sequences, then POCS algorithm was adopted to reconstruct super- resolution image. Experimental results showed that the proposed method can significantly improve the visual effect of image, whose contrast and information entropy of reconstructed infrared images were improved by approxi- mately 5 times and 1.6 times compared with traditional POCS reconstruction algorithm, respectively.

A Super-resolution Reconstruction Algorithm for Surveillance Video

Recent technological developments have resulted in surveillance video becoming a primary method of preserving public security.Many city crimes are observed in surveillance video.The most abundant evidence collected by the police is also acquired through surveillance video sources.Surveillance video footage offers very strong support for solving criminal cases,therefore,creating an effective policy and applying useful methods to the retrieval of additional evidence is becoming increasingly important.However,surveillance video has had its failings,namely,video footage being captured in low resolution(LR)and bad visual quality.In this paper,we discuss the characteristics of surveillance video and describe the manual feature registration-maximum a posteriori-projection onto convex sets to develop a super-resolution reconstruction method,which improves the quality of surveillance video.From this method,we can make optimal use of information contained in the LR video image,but we can also control the image edge clearly as well as the convergence of the algorithm.Finally,we make a suggestion on how to adjust the algorithm adaptability by analyzing the prior information of target image.