arXiv subjects

Qian Yin

Publications and source records attributed to Qian Yin.

29 records · Page 2Linked to original sources

arXiv2021

Lossless Point Cloud Attribute Compression with Normal-based Intra Prediction

The sparse LiDAR point clouds become more and more popular in various applications, e.g., the autonomous driving. However, for this type of data, there exists much under-explored space in the corresponding compression framework proposed by MPEG, i.e., geometry-based point cloud compression (G-PCC). In G-PCC, only the distance-based similarity is considered in the intra prediction for the attribute compression. In this paper, we propose a normal-based intra prediction scheme, which provides a more efficient lossless attribute compression by introducing the normals of point clouds. The angle between normals is used to further explore accurate local similarity, which optimizes the selection of predictors. We implement our method into the G-PCC reference software. Experimental results over LiDAR acquired datasets demonstrate that our proposed method is able to deliver better compression performance than the G-PCC anchor, with $2.1\%$ gains on average for lossless attribute coding.

eess.IV↗

arXiv2021

RAI-Net: Range-Adaptive LiDAR Point Cloud Frame Interpolation Network

LiDAR point cloud frame interpolation, which synthesizes the intermediate frame between the captured frames, has emerged as an important issue for many applications. Especially for reducing the amounts of point cloud transmission, it is by predicting the intermediate frame based on the reference frames to upsample data to high frame rate ones. However, due to high-dimensional and sparse characteristics of point clouds, it is more difficult to predict the intermediate frame for LiDAR point clouds than videos. In this paper, we propose a novel LiDAR point cloud frame interpolation method, which exploits range images (RIs) as an intermediate representation with CNNs to conduct the frame interpolation process. Considering the inherited characteristics of RIs differ from that of color images, we introduce spatially adaptive convolutions to extract range features adaptively, while a high-efficient flow estimation method is presented to generate optical flows. The proposed model then warps the input frames and range features, based on the optical flows to synthesize the interpolated frame. Extensive experiments on the KITTI dataset have clearly demonstrated that our method consistently achieves superior frame interpolation results with better perceptual quality to that of using state-of-the-art video frame interpolation methods. The proposed method could be integrated into any LiDAR point cloud compression systems for inter prediction.

eess.IV↗

arXiv2020

Synergetic Learning Systems: Concept, Architecture, and Algorithms

Drawing on the idea that brain development is a Darwinian process of ``evolution + selection'' and the idea that the current state is a local equilibrium state of many bodies with self-organization and evolution processes driven by the temperature and gravity in our universe, in this work, we describe an artificial intelligence system called the ``Synergetic Learning Systems''. The system is composed of two or more subsystems (models, agents or virtual bodies), and it is an open complex giant system. Inspired by natural intelligence, the system achieves intelligent information processing and decision-making in a given environment through cooperative/competitive synergetic learning. The intelligence evolved by the natural law of ``it is not the strongest of the species that survives, but the one most responsive to change,'' while an artificial intelligence system should adopt the law of ``human selection'' in the evolution process. Therefore, we expect that the proposed system architecture can also be adapted in human-machine synergy or multi-agent synergetic systems. It is also expected that under our design criteria, the proposed system will eventually achieve artificial general intelligence through long term coevolution.

cs.NE↗

arXiv2020

Two-dimensional Multi-fiber Spectrum Image Correction Based on Machine Learning Techniques

Due to limited size and imperfect of the optical components in a spectrometer, aberration has inevitably been brought into two-dimensional multi-fiber spectrum image in LAMOST, which leads to obvious spacial variation of the point spread functions (PSFs). Consequently, if spatial variant PSFs are estimated directly , the huge storage and intensive computation requirements result in deconvolutional spectral extraction method become intractable. In this paper, we proposed a novel method to solve the problem of spatial variation PSF through image aberration correction. When CCD image aberration is corrected, PSF, the convolution kernel, can be approximated by one spatial invariant PSF only. Specifically, machine learning techniques are adopted to calibrate distorted spectral image, including Total Least Squares (TLS) algorithm, intelligent sampling method, multi-layer feed-forward neural networks. The calibration experiments on the LAMOST CCD images show that the calibration effect of proposed method is effectible. At the same time, the spectrum extraction results before and after calibration are compared, results show the characteristics of the extracted one-dimensional waveform are more close to an ideal optics system, and the PSF of the corrected object spectrum image estimated by the blind deconvolution method is nearly central symmetry, which indicates that our proposed method can significantly reduce the complexity of spectrum extraction and improve extraction accuracy.

astro-ph.IM↗

arXiv2019

Quadratic video interpolation

Video interpolation is an important problem in computer vision, which helps overcome the temporal limitation of camera sensors. Existing video interpolation methods usually assume uniform motion between consecutive frames and use linear models for interpolation, which cannot well approximate the complex motion in the real world. To address these issues, we propose a quadratic video interpolation method which exploits the acceleration information in videos. This method allows prediction with curvilinear trajectory and variable velocity, and generates more accurate interpolation results. For high-quality frame synthesis, we develop a flow reversal layer to estimate flow fields starting from the unknown target frame to the source frame. In addition, we present techniques for flow refinement. Extensive experiments demonstrate that our approach performs favorably against the existing linear models on a wide variety of video datasets.

cs.CV↗

arXiv2019

Pulsar Candidate Identification with Artificial Intelligence Techniques

Discovering pulsars is a significant and meaningful research topic in the field of radio astronomy. With the advent of astronomical instruments such as he Five-hundred-meter Aperture Spherical Telescope (FAST) in China, data volumes and data rates are exponentially growing. This fact necessitates a focus on artificial intelligence (AI) technologies that can perform the automatic pulsar candidate identification to mine large astronomical data sets. Automatic pulsar candidate identification can be considered as a task of determining potential candidates for further investigation and eliminating noises of radio frequency interferences or other non-pulsar signals. It is very hard to raise the performance of DCNN-based pulsar identification because the limited training samples restrict network structure to be designed deep enough for learning good features as well as the crucial class imbalance problem due to very limited number of real pulsar samples. To address these problems, we proposed a framework which combines deep convolution generative adversarial network (DCGAN) with support vector machine (SVM) to deal with imbalance class problem and to improve pulsar identification accuracy. DCGAN is used as sample generation and feature learning model, and SVM is adopted as the classifier for predicting candidate's labels in the inference stage. The proposed framework is a novel technique which not only can solve imbalance class problem but also can learn discriminative feature representations of pulsar candidates instead of computing hand-crafted features in preprocessing steps too, which makes it more accurate for automatic pulsar candidate selection. Experiments on two pulsar datasets verify the effectiveness and efficiency of our proposed method.

astro-ph.IM↗

arXiv2019

Pulsar Candidate Selection Using Ensemble Networks for FAST Drift-Scan Survey

The Commensal Radio Astronomy Five-hundred-meter Aperture Spherical radio Telescope (FAST) Survey (CRAFTS) utilizes the novel drift-scan commensal survey mode of FAST and can generate billions of pulsar candidate signals. The human experts are not likely to thoroughly examine these signals, and various machine sorting methods are used to aid the classification of the FAST candidates. In this study, we propose a new ensemble classification system for pulsar candidates. This system denotes the further development of the pulsar image-based classification system (PICS), which was used in the Arecibo Telescope pulsar survey, and has been retrained and customized for the FAST drift-scan survey. In this study, we designed a residual network model comprising 15 layers to replace the convolutional neural networks (CNNs) in PICS. The results of this study demonstrate that the new model can sort >96% of real pulsars to belong the top 1% of all candidates and classify >1.6 million candidates per day using a dual--GPU and 24--core computer. This increased speed and efficiency can help to facilitate real-time or quasi-real-time processing of the pulsar-search data stream obtained from CRAFTS. In addition, we have published the labeled FAST data used in this study online, which can aid in the development of new deep learning techniques for performing pulsar searches.

astro-ph.IM↗

arXiv2019

Understanding Kernel Size in Blind Deconvolution

Most blind deconvolution methods usually pre-define a large kernel size to guarantee the support domain. Blur kernel estimation error is likely to be introduced, yielding severe artifacts in deblurring results. In this paper, we first theoretically and experimentally analyze the mechanism to estimation error in oversized kernel, and show that it holds even on blurry images without noises. Then to suppress this adverse effect, we propose a low rank-based regularization on blur kernel to exploit the structural information in degraded kernels, by which larger-kernel effect can be effectively suppressed. And we propose an efficient optimization algorithm to solve it. Experimental results on benchmark datasets show that the proposed method is comparable with the state-of-the-arts by accordingly setting proper kernel size, and performs much better in handling larger-size kernels quantitatively and qualitatively. The deblurring results on real-world blurry images further validate the effectiveness of the proposed method.

cs.CV↗

arXiv2018

Iterative Residual Image Deconvolution

Image deblurring, a.k.a. image deconvolution, recovers a clear image from pixel superposition caused by blur degradation. Few deep convolutional neural networks (CNN) succeed in addressing this task. In this paper, we first demonstrate that the minimum-mean-square-error (MMSE) solution to image deblurring can be interestingly unfolded into a series of residual components. Based on this analysis, we propose a novel iterative residual deconvolution (IRD) algorithm. Further, IRD motivates us to take one step forward to design an explicable and effective CNN architecture for image deconvolution. Specifically, a sequence of residual CNN units are deployed, whose intermediate outputs are then concatenated and integrated, resulting in concatenated residual convolutional network (CRCNet). The experimental results demonstrate that proposed CRCNet not only achieves better quantitative metrics but also recovers more visually plausible texture details compared with state-of-the-art methods.

cs.CV↗

arXiv2014

Thurston maps and asymptotic upper curvature

A Thurston map is a branched covering map from $§^2$ to $§^2$ with a finite postcritical set. We associate a natural Gromov hyperbolic graph $\G=\G(f,\mathcal C)$ with an expanding Thurston map $f$ and a Jordan curve $\mathcal C$ on $§^2$ containing $\post(f)$. The boundary at infinity of $\G$ with associated visual metrics can be identified with $§^2$ equipped with the visual metric induced by the expanding Thurston map $f$. We define asymptotic upper curvature of an expanding Thurston map $f$ to be the asymptotic upper curvature of the associated Gromov hyperbolic graph, and establish a connection between the asymptotic upper curvature of $f$ and the entropy of $f$.

math.DS↗

arXiv2014

Lattès maps and combinatorial expansion

A Lattès map $f\colon \hat{\mathbb{C}}\rightarrow \hat{\mathbb{C}}$ is a rational map that is obtained from a finite quotient of a conformal torus endomorphism. We characterize Lattès maps by their combinatorial expansion behavior.

math.DS↗