arXiv subjects

Yao Wang

Publications and source records attributed to Yao Wang.

At least 415 records · Page 23Linked to original sources

arXiv2015

Shrinkage degree in $L_2$-re-scale boosting for regression

Re-scale boosting (RBoosting) is a variant of boosting which can essentially improve the generalization performance of boosting learning. The key feature of RBoosting lies in introducing a shrinkage degree to re-scale the ensemble estimate in each gradient-descent step. Thus, the shrinkage degree determines the performance of RBoosting. The aim of this paper is to develop a concrete analysis concerning how to determine the shrinkage degree in $L_2$-RBoosting. We propose two feasible ways to select the shrinkage degree. The first one is to parameterize the shrinkage degree and the other one is to develope a data-driven approach of it. After rigorously analyzing the importance of the shrinkage degree in $L_2$-RBoosting learning, we compare the pros and cons of the proposed methods. We find that although these approaches can reach the same learning rates, the structure of the final estimate of the parameterized approach is better, which sometimes yields a better generalization capability when the number of sample is finite. With this, we recommend to parameterize the shrinkage degree of $L_2$-RBoosting. To this end, we present an adaptive parameter-selection strategy for shrinkage degree and verify its feasibility through both theoretical analysis and numerical verification. The obtained results enhance the understanding of RBoosting and further give guidance on how to use $L_2$-RBoosting for regression tasks.

cs.LG↗

arXiv2015

Re-scale boosting for regression and classification

Boosting is a learning scheme that combines weak prediction rules to produce a strong composite estimator, with the underlying intuition that one can obtain accurate prediction rules by combining "rough" ones. Although boosting is proved to be consistent and overfitting-resistant, its numerical convergence rate is relatively slow. The aim of this paper is to develop a new boosting strategy, called the re-scale boosting (RBoosting), to accelerate the numerical convergence rate and, consequently, improve the learning performance of boosting. Our studies show that RBoosting possesses the almost optimal numerical convergence rate in the sense that, up to a logarithmic factor, it can reach the minimax nonlinear approximation rate. We then use RBoosting to tackle both the classification and regression problems, and deduce a tight generalization error estimate. The theoretical and experimental results show that RBoosting outperforms boosting in terms of generalization.

cs.LG↗

arXiv2015

Influences of pump transitions on thermal effects of multi-kilowatt thulium-doped fiber lasers

Thermal effects are critical constrains for developing high-power thulium-doped fiber lasers (TDFLs). In this paper, we numerically investigate the lasing and thermal characteristics of the TDFLs under different pump transitions. Our results show, the widely-used pump transition $^3H_6\rightarrow^3H_4$, taking advantages of high-power high-efficiency laser diodes at $\sim$0.8 $μ$m, may not be a superior choice for directly outputting multi-kilowatt at 2 $μ$m because of severe thermal problems. Meanwhile, using other pump transitions resulting 2-$μ$m emissions, especially the in-band pump transition $^3H_6\rightarrow^3F_4$, will decrease the generated heat to a large extent. By optimizing the power filling factor of the gain fiber, we find a 2-$μ$m TDFL cladding-pumped at 1.9 $μ$m will lead to the laser slope efficiency close to its quantum efficiency (95\%). The induced ultra-low quantum defect would be of great importance for power scaling. We thus propose tandem-pumped TDFLs for reducing the heat at high powers and discuss the related issues of design. Besides, we also explore the differences of the thermal characteristics between laser and superfluorescent operations, which will contribute to deepening the understanding of the thermal effects in high-power thulium-doped fiber amplifiers.

physics.optics↗

arXiv2015

Screen Content Image Segmentation Using Least Absolute Deviation Fitting

We propose an algorithm for separating the foreground (mainly text and line graphics) from the smoothly varying background in screen content images. The proposed method is designed based on the assumption that the background part of the image is smoothly varying and can be represented by a linear combination of a few smoothly varying basis functions, while the foreground text and graphics create sharp discontinuity and cannot be modeled by this smooth representation. The algorithm separates the background and foreground using a least absolute deviation method to fit the smooth model to the image pixels. This algorithm has been tested on several images from HEVC standard test sequences for screen content coding, and is shown to have superior performance over other popular methods, such as k-means clustering based segmentation in DjVu and shape primitive extraction and coding (SPEC) algorithm. Such background/foreground segmentation are important pre-processing steps for text extraction and separate coding of background and foreground for compression of screen content images.

cs.CV↗

arXiv2015

A two-stage video coding framework with both self-adaptive redundant dictionary and adaptively orthonormalized DCT basis

In this work, we propose a two-stage video coding framework, as an extension of our previous one-stage framework in [1]. The two-stage frameworks consists two different dictionaries. Specifically, the first stage directly finds the sparse representation of a block with a self-adaptive dictionary consisting of all possible inter-prediction candidates by solving an L0-norm minimization problem using an improved orthogonal matching pursuit with embedded orthonormalization (eOMP) algorithm, and the second stage codes the residual using DCT dictionary adaptively orthonormalized to the subspace spanned by the first stage atoms. The transition of the first stage and the second stage is determined based on both stages' quantization stepsizes and a threshold. We further propose a complete context adaptive entropy coder to efficiently code the locations and the coefficients of chosen first stage atoms. Simulation results show that the proposed coder significantly improves the RD performance over our previous one-stage coder. More importantly, the two-stage coder, using a fixed block size and inter-prediction only, outperforms the H.264 coder (x264) and is competitive with the HEVC reference coder (HM) over a large rate range.

cs.MM↗

arXiv2015

eOMP: Finding Sparser Representation by Recursively Orthonormalizing the Remaining Atoms

Greedy algorithms for minimizing L0-norm of sparse decomposition have profound application impact on many signal processing problems. In the sparse coding setup, given the observations $\mathrm{y}$ and the redundant dictionary $\mathbfΦ$, one would seek the most sparse coefficient (signal) $\mathrm{x}$ with a constraint on approximation fidelity. In this work, we propose a greedy algorithm based on the classic orthogonal matching pursuit (OMP) with improved sparsity on $\mathrm{x}$ and better recovery rate, which we name as eOMP. The key ingredient of the eOMP is recursively performing one-step orthonormalization on the remaining atoms, and evaluating correlations between residual and orthonormalized atoms. We show a proof that the proposed eOMP guarantees to maximize the residual reduction at each iteration. Through extensive simulations, we show the proposed algorithm has better exact recovery rate on i.i.d. Gaussian ensembles with Gaussian signals, and more importantly yields smaller L0-norm under the same approximation fidelity compared to the original OMP, for both synthetic and practical scenarios. The complexity analysis and real running time result also show a manageable complexity increase over the original OMP. We claim that the proposed algorithm has better practical perspective for finding more sparse representations than existing greedy algorithms.

math.NA↗

arXiv2014

A Novel No-reference Video Quality Metric for Evaluating Temporal Jerkiness due to Frame Freezing

In this work, we propose a novel no-reference (NR) video quality metric that evaluates the impact of frame freezing due to either packet loss or late arrival. Our metric uses a trained neural network acting on features that are chosen to capture the impact of frame freezing on the perceived quality. The considered features include the number of freezes, freeze duration statistics, inter-freeze distance statistics, frame difference before and after the freeze, normal frame difference, and the ratio of them. We use the neural network to find the mapping between features and subjective test scores. We optimize the network structure and the feature selection through a cross validation procedure, using training samples extracted from both VQEG and LIVE video databases. The resulting feature set and network structure yields accurate quality prediction for both the training data containing 54 test videos and a separate testing dataset including 14 videos, with Pearson Correlation Coefficients greater than 0.9 and 0.8 for the training set and the testing set, respectively. Our proposed metric has low complexity and could be utilized in a system with realtime processing constraint.

cs.MM↗

arXiv2014

Perceptual Quality of Video with Periodic Frame Rate and Quantization Variation-Subjective Studies and Analytical Modeling

In networked video applications, the frame rate (FR) and quantization stepsize (QS) of a compressed video are often adapted in response to the changes of the available bandwidth. It is important to understand how do the variation of FR and QS and their variation pattern affect the video quality. In this paper, we investigate the impact of temporal variation of FR and QS on the perceptual video quality. Among all possible variation patterns, we focus on videos in which two FR's (or QS's) alternate over a fixed interval. We explore the human responses to such variation by conducting subjective evaluation of test videos with different variation magnitudes and frequencies. We further analyze statistical significance of the impact of variation magnitude, variation frequency, video content, and their interactions. By analyzing the subjective ratings, we propose two models for predicting the quality of video with alternating FR and QS, respectively, The proposed models have simple mathematical forms with a few content-dependent parameters. The models fit the measured data very well using parameters determined by least square fitting with the measured data. We further propose some guidelines for adaptation of FR and QS based on trends observed from subjective test results.

cs.MM↗

arXiv2014

$L_{1/2}$ Regularization: Convergence of Iterative Half Thresholding Algorithm

In recent studies on sparse modeling, the nonconvex regularization approaches (particularly, $L_{q}$ regularization with $q\in(0,1)$) have been demonstrated to possess capability of gaining much benefit in sparsity-inducing and efficiency. As compared with the convex regularization approaches (say, $L_{1}$ regularization), however, the convergence issue of the corresponding algorithms are more difficult to tackle. In this paper, we deal with this difficult issue for a specific but typical nonconvex regularization scheme, the $L_{1/2}$ regularization, which has been successfully used to many applications. More specifically, we study the convergence of the iterative \textit{half} thresholding algorithm (the \textit{half} algorithm for short), one of the most efficient and important algorithms for solution to the $L_{1/2}$ regularization. As the main result, we show that under certain conditions, the \textit{half} algorithm converges to a local minimizer of the $L_{1/2}$ regularization, with an eventually linear convergence rate. The established result provides a theoretical guarantee for a wide range of applications of the \textit{half} algorithm. We provide also a set of simulations to support the correctness of theoretical assertions and compare the time efficiency of the \textit{half} algorithm with other known typical algorithms for $L_{1/2}$ regularization like the iteratively reweighted least squares (IRLS) algorithm and the iteratively reweighted $l_{1}$ minimization (IRL1) algorithm.

math.NA↗

arXiv2014

Real-Space Visualization of Remnant Mott Gap and Magnon Excitations

We demonstrate the ability to visualize real-space dynamics of charge gap and magnon excitations in the Mott phase of the single-band Hubbard model and the remnants of these excitations with hole or electron doping. At short times, the character of magnetic and charge excitations is maintained even for large doping away from the Mott and antiferromagnetic phases. Doping influences both the real-space patterns and long timescales of these excitations with a clear carrier asymmetry attributable to particle-hole symmetry breaking in the underlying model. Further, a rapidly-oscillating charge density wave-like pattern weakens, but persists as a visible demonstration of a sub-leading instability at half-filling which remains upon doping. The results offer an approach to analyzing the behavior of systems where momentum-space is either inaccessible or poorly defined.

cond-mat.str-el↗

arXiv2014

Wireless Video Multicast with Cooperative and Incremental Transmission of Parity Packets

In this paper, a cooperative multicast scheme that uses Randomized Distributed Space Time Codes (R-DSTC), along with packet level Forward Error Correction (FEC), is studied. Instead of sending source packets and/or parity packets through two hops using R-DSTC as proposed in our prior work, the new scheme delivers both source packets and parity packets using only one hop. After the source station (access point, AP) first sends all the source packets, the AP as well as all nodes that have received all source packets together send the parity packets using R-DSTC. As more parity packets are transmitted, more nodes can recover all source packets and join the parity packet transmission. The process continues until all nodes acknowledge the receipt of enough packets for recovering the source packets. For each given node distribution, the optimum transmission rates for source and parity packets are determined such that the video rate that can be sustained at all nodes is maximized. This new scheme can support significantly higher video rates, and correspondingly higher PSNR of decoded video, than the prior approaches. Three suboptimal approaches, which do not require full information about user distribution or the feedback, and hence are more feasible in practice are also presented. The proposed suboptimal scheme with only the node count information and without feedback still outperforms our prior approach that assumes full channel information and no feedback.

cs.MM↗

arXiv2013

Coupled Mesoscale-Large-Eddy Modeling of Realistic Stable Boundary Layer Turbulence

Site-specific flow and turbulence information are needed for various practical applications, ranging from aerodynamic/aeroelastic modeling for wind turbine design to optical diffraction calculations. Even though highly desirable, collecting on-site meteorological measurements can be an expensive, time-consuming, and sometimes a challenging task. In this work, we propose a coupled mesoscale-large-eddy modeling framework to synthetically generate site-specific flow and turbulence data. The workhorses behind our framework are a state-of-the-art, open-source atmospheric model called the Weather Research and Forecasting (WRF) model and a tuning-free large-eddy simulation (LES) model. Using this coupled framework, we simulate a nighttime stable boundary layer (SBL) case from the well-known CASES-99 field campaign. One of the unique aspects of this work is the usage of a diverse range of observations for characterization and validation. The coupled models reproduce certain characteristics of observed low-level jets. They also capture various scaling regimes of energy spectra, including the so-called spectral gap. However, the coupled models are unable to capture the intermittent nature of the observed surface fluxes. Lastly, we document and discuss: (i) the tremendous spatio-temporal variabilities of observed and modeled SBL flow fields, and (ii) the significant disagreements among different observational platforms. Based on these results, we strongly recommend that future SBL modeling studies consider rigorous validation exercises based on multi-sensor/multi-platform datasets. In summary, we believe that the numerical generation of realistic SBL is not an impossible task. Without any doubt, there remain several computational and fundamental challenges. The present work should be viewed as a first step to confront some of these challenges.

physics.ao-ph↗

arXiv2012

Rate Model for Compressed Video Considering Impacts Of Spatial, Temporal and Amplitude Resolutions and Its Applications for Video Coding and Adaptation

In this paper, we investigate the impacts of spatial, temporal and amplitude resolution (STAR) on the bit rate of a compressed video. We propose an analytical rate model in terms of the quantization stepsize, frame size and frame rate. Experimental results reveal that the increase of the video rate as the individual resolution increases follows a power function. Hence, the proposed model expresses the rate as the product of power functions of the quantization stepsize, frame size and frame rate, respectively. The proposed rate model is analytically tractable, requiring only four content dependent parameters. We also propose methods for predicting the model parameters from content features that can be computed from original video. Simulation results show that model predicted rates fit the measured data very well with high Pearson correlation (PC) and small relative root mean square error (RRMSE). The same model function works for different coding scenarios (including scalable and non-scalable video, temporal prediction using either hierarchical B or IPPP structure, etc.) with very high accuracy (average PC $>$ 0.99), but the values of model parameters differ. Using the proposed rate model and the quality model introduced in a separate work, we show how to optimize the STAR for a given rate constraint, which is important for both encoder rate control and scalable video adaptation. Furthermore, we demonstrate how to order the spatial, temporal and amplitude layers of a scalable video in a rate-quality optimized way.

cs.MM↗

arXiv2012

Q-STAR:A Perceptual Video Quality Model Considering Impact of Spatial, Temporal, and Amplitude Resolutions

In this paper, we investigate the impact of spatial, temporal and amplitude resolution (STAR) on the perceptual quality of a compressed video. Subjective quality tests were carried out on a mobile device. Seven source sequences are included in the tests and for each source sequence we have 27 test configurations generated by JSVM encoder (3 QP levels, 3 spatial resolutions, and 3 temporal resolutions), resulting a total of 189 processed video sequences (PVSs). Videos coded at different spatial resolutions are displayed at the full screen size of the mobile platform. Subjective data reveal that the impact of spatial resolution (SR), temporal resolution (TR) and quantization stepsize (QS) can each be captured by a function with a single content-dependent parameter. The joint impact of SR, TR and QS can be accurately modeled by the product of these three functions with only three parameters. We further find that the quality decay rates with SR and QS, respectively are independent of TR, and likewise, the decay rate with TR is independent of SR and QS, respectively. However, there is a significant interaction between the effects of SR and QS. The overall quality model is further validated on five other datasets with very high accuracy. The complete model correlates well with the subjective ratings with a Pearson Correlation Coefficient (PCC) of 0.991.

cs.MM↗

arXiv2012

Perceptual quality comparison between single-layer and scalable videos at the same spatial, temporal and amplitude resolutions

In this paper, the perceptual quality difference between scalable and single-layer videos coded at the same spatial, temporal and amplitude resolution (STAR) is investigated through a subjective test using a mobile platform. Three source videos are considered and for each source video single-layer and scalable video are compared at 9 different STARs. We utilize paired comparison methods with and without tie option. Results collected from 10 subjects in the without "tie" option and 6 subjects in the with "tie" option show that there is no significant quality difference between scalable and singlelayer video when coded at the same STAR. An analysis of variance (ANOVA) test is also performed to further confirm the finding.

cs.MM↗

arXiv2012

Two-way Wireless Video Communication using Randomized Cooperation, Network Coding and Packet Level FEC

Two-way real-time video communication in wireless networks requires high bandwidth, low delay and error resiliency. This paper addresses these demands by proposing a system with the integration of Network Coding (NC), user cooperation using Randomized Distributed Space-time Coding (R-DSTC) and packet level Forward Error Correction (FEC) under a one-way delay constraint. Simulation results show that the proposed scheme significantly outperforms both conventional direct transmission as well as R-DSTC based two-way cooperative transmission, and is most effective when the distance between the users is large.

cs.IT↗

arXiv2012

Compressed Sensing for Moving Imagery in Medical Imaging

Numerous applications in signal processing have benefited from the theory of compressed sensing which shows that it is possible to reconstruct signals sampled below the Nyquist rate when certain conditions are satisfied. One of these conditions is that there exists a known transform that represents the signal with a sufficiently small number of non-zero coefficients. However when the signal to be reconstructed is composed of moving images or volumes, it is challenging to form such regularization constraints with traditional transforms such as wavelets. In this paper, we present a motion compensating prior for such signals that is derived directly from the optical flow constraint and can utilize the motion information during compressed sensing reconstruction. Proposed regularization method can be used in a wide variety of applications involving compressed sensing and images or volumes of moving and deforming objects. It is also shown that it is possible to estimate the signal and the motion jointly or separately. Practical examples from magnetic resonance imaging has been presented to demonstrate the benefit of the proposed method.

cs.MM↗

arXiv2012

High Speed Compressed Sensing Reconstruction in Dynamic Parallel MRI Using Augmented Lagrangian and Parallel Processing

Magnetic Resonance Imaging (MRI) is one of the fields that the compressed sensing theory is well utilized to reduce the scan time significantly leading to faster imaging or higher resolution images. It has been shown that a small fraction of the overall measurements are sufficient to reconstruct images with the combination of compressed sensing and parallel imaging. Various reconstruction algorithms has been proposed for compressed sensing, among which Augmented Lagrangian based methods have been shown to often perform better than others for many different applications. In this paper, we propose new Augmented Lagrangian based solutions to the compressed sensing reconstruction problem with analysis and synthesis prior formulations. We also propose a computational method which makes use of properties of the sampling pattern to significantly improve the speed of the reconstruction for the proposed algorithms in Cartesian sampled MRI. The proposed algorithms are shown to outperform earlier methods especially for the case of dynamic MRI for which the transfer function tends to be a very large matrix and significantly ill conditioned. It is also demonstrated that the proposed algorithm can be accelerated much further than other methods in case of a parallel implementation with graphics processing units (GPUs).

cs.IT↗