BZPEERPapers, people, evidence and research paths
Menu

Discover

SearchFind papers, people, topics, institutions and opportunities from one place.GraphSee how papers, authors, topics and evidence connect.

Research tools

HomeContinue from the papers, people and topics that matter now.CollectionsTurn saved papers into reading lists, evidence maps and shareable context.ResearchReconstruct the path that led you from search to paper to question.CollaborationMove from a paper, topic or expert request into a focused thread.PublishCreate full-text research articles with metadata, formulas and versions.

Network

ExpertsFind specialists whose work and reviews explain why they can help.CommunitiesJoin research groups organized around papers, topics and shared evidence.

Opportunities

ListingsBrowse roles, calls and collaborations connected to real research context.

Account

Log inReturn to your saved papers, graph views and active threads.Create accountStart saving papers, building a research trail and joining teams.
Log inCreate account

Source author record

Zhang Yi

Zhang Yi appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record
Computer Visionphysics.ins-detastro-ph.IMMachine LearningDiscrete Mathematicseess.IVmath.OCmath.PRNetworking and Internet Architecture

Catalog footprint

What is connected

13works
9topics
4close collaborators

Actions

Connect this record

Log in to claim
Open graphBrowse works

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

13 published item(s)

preprint2026arXiv

QB-LIF: Learnable-Scale Quantized Burst Neurons for Efficient SNNs

Binary spike coding enables sparse and event-driven computation in spiking neural networks (SNNs), yet its 1-bit-per-timestep representation fundamentally limits information throughput. This bottleneck becomes increasingly restrictive in deep architectures under short simulation horizons. We propose the Quantized Burst-LIF (QB-LIF) neuron, which reformulates burst spiking as a saturated uniform quantization of membrane potentials with a learnable scale. Instead of relying on predefined multi-threshold structures, QB-LIF treats the quantization scale as a trainable parameter, allowing each layer to autonomously adapt its spiking resolution to the underlying membrane-potential statistics. To preserve hardware efficiency, we introduce an absorbable scale strategy that folds the learned quantized scale into synaptic weights during inference, maintaining a strict accumulate-only (AC) execution paradigm. To enable stable optimization in the discrete multi-level space, we further design ReLSG-ET, a rectified-linear surrogate gradient with exponential tails that sustains gradient flow across burst intervals. Extensive experiments on static (CIFAR-10/100, ImageNet) and event-driven (CIFAR10-DVS, DVS128-Gesture) benchmarks demonstrate that QB-LIF consistently outperforms binary and fixed-burst SNNs, achieving higher accuracy under ultra-low latency while preserving neuromorphic compatibility.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Deep Dictionary Learning with An Intra-class Constraint

In recent years, deep dictionary learning (DDL)has attracted a great amount of attention due to its effectiveness for representation learning and visual recognition.~However, most existing methods focus on unsupervised deep dictionary learning, failing to further explore the category information.~To make full use of the category information of different samples, we propose a novel deep dictionary learning model with an intra-class constraint (DDLIC) for visual classification. Specifically, we design the intra-class compactness constraint on the intermediate representation at different levels to encourage the intra-class representations to be closer to each other, and eventually the learned representation becomes more discriminative.~Unlike the traditional DDL methods, during the classification stage, our DDLIC performs a layer-wise greedy optimization in a similar way to the training stage. Experimental results on four image datasets show that our method is superior to the state-of-the-art methods.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

RegNet: Self-Regulated Network for Image Classification

The ResNet and its variants have achieved remarkable successes in various computer vision tasks. Despite its success in making gradient flow through building blocks, the simple shortcut connection mechanism limits the ability of re-exploring new potentially complementary features due to the additive function. To address this issue, in this paper, we propose to introduce a regulator module as a memory mechanism to extract complementary features, which are further fed to the ResNet. In particular, the regulator module is composed of convolutional RNNs (e.g., Convolutional LSTMs or Convolutional GRUs), which are shown to be good at extracting Spatio-temporal information. We named the new regulated networks as RegNet. The regulator module can be easily implemented and appended to any ResNet architecture. We also apply the regulator module for improving the Squeeze-and-Excitation ResNet to show the generalization ability of our method. Experimental results on three image classification datasets have demonstrated the promising performance of the proposed architecture compared with the standard ResNet, SE-ResNet, and other state-of-the-art architectures.

0 citations0 reviewsNo code linkedOpen access
preprint2015arXiv

Discriminating cosmic muon and x-ray based on rising time using GEM detector

Gas electron multiplier(GEM) detector is used in Cosmic Muon Scattering Tomography and neutron imaging in the last decade. In this work, a triple GEM device with an effective readout area of 10 cm X 10 cm is developed, and an experiment of discriminating between cosmic muon and x-ray based on rising time is tested. The energy resolution of GEM detector is tested by 55Fe ray source to prove the GEM detector has a good performance. The analysis of the complete signal-cycles allows to get the rising time and pulse heights. The experiment result indicates that cosmic muon and x-ray can be discriminated with an appropriate rising time threshold.

0 citations0 reviewsNo code linkedOpen access
preprint2015arXiv

Fast Low-rank Representation based Spatial Pyramid Matching for Image Classification

Spatial Pyramid Matching (SPM) and its variants have achieved a lot of success in image classification. The main difference among them is their encoding schemes. For example, ScSPM incorporates Sparse Code (SC) instead of Vector Quantization (VQ) into the framework of SPM. Although the methods achieve a higher recognition rate than the traditional SPM, they consume more time to encode the local descriptors extracted from the image. In this paper, we propose using Low Rank Representation (LRR) to encode the descriptors under the framework of SPM. Different from SC, LRR considers the group effect among data points instead of sparsity. Benefiting from this property, the proposed method (i.e., LrrSPM) can offer a better performance. To further improve the generalizability and robustness, we reformulate the rank-minimization problem as a truncated projection problem. Extensive experimental studies show that LrrSPM is more efficient than its counterparts (e.g., ScSPM) while achieving competitive recognition rates on nine image data sets.

0 citations0 reviewsNo code linkedOpen access
preprint2015arXiv

Symmetric low-rank representation for subspace clustering

We propose a symmetric low-rank representation (SLRR) method for subspace clustering, which assumes that a data set is approximately drawn from the union of multiple subspaces. The proposed technique can reveal the membership of multiple subspaces through the self-expressiveness property of the data. In particular, the SLRR method considers a collaborative representation combined with low-rank matrix recovery techniques as a low-rank representation to learn a symmetric low-rank representation, which preserves the subspace structures of high-dimensional data. In contrast to performing iterative singular value decomposition in some existing low-rank representation based algorithms, the symmetric low-rank representation in the SLRR method can be calculated as a closed form solution by solving the symmetric low-rank optimization problem. By making use of the angular information of the principal directions of the symmetric low-rank representation, an affinity graph matrix is constructed for spectral clustering. Extensive experimental results show that it outperforms state-of-the-art subspace clustering algorithms.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

A linear calibration method on DNL error for energy spectrum

A calibration method aimed for the differential nonlinearity (DNL) error of the Low Energy X-ray Instrument (LE) onboard the Hard X-ray Modulation Telescope (HXMT) is presented, which is independent with electronic systems used as testing platform and is only determined by the analog-to-digital converter (ADC) itself. Exploring this method, ADCs that are used within the flight model phase of HXMT-LE can be calibrated individually and independently by a non-destructive and low-cost way, greatly alleviating the complexity of the problem. As a result, the performance of the energy spectrum can be significantly improved, further more, noise reduced and resolution enhanced.

0 citations0 reviewsNo code linkedOpen access
preprint2013arXiv

Calibration of pulse transit time through a cable for EAS experiments

In ground-based extensive air shower experiments, the direction and energy are reconstructed by measuring the relative arrival time of secondary particles, and the energy they deposit. The measurement precision of the arrival time is crucial for determination of the angular resolution. For this purpose, we need to obtain a precise relative time offset for each detector, and to apply the calibration process. The time offset is associated with the photomultiplier tube, cable, relevant electronic circuits, etc. In view of the transit time through long cables being heavily dependent on the ambient temperature, a real-time calibration method for the cable transit time is investigated in this paper. Even with a poor-resolution time-to-digital converter, this method can achieve high precision. This has been successfully demonstrated with the Front-End-Electronic board used in the Daya Bay neutrino experiment.

0 citations0 reviewsNo code linkedOpen access
preprint2013arXiv

Inductive Sparse Subspace Clustering

Sparse Subspace Clustering (SSC) has achieved state-of-the-art clustering quality by performing spectral clustering over a $\ell^{1}$-norm based similarity graph. However, SSC is a transductive method which does not handle with the data not used to construct the graph (out-of-sample data). For each new datum, SSC requires solving $n$ optimization problems in O(n) variables for performing the algorithm over the whole data set, where $n$ is the number of data points. Therefore, it is inefficient to apply SSC in fast online clustering and scalable graphing. In this letter, we propose an inductive spectral clustering algorithm, called inductive Sparse Subspace Clustering (iSSC), which makes SSC feasible to cluster out-of-sample data. iSSC adopts the assumption that high-dimensional data actually lie on the low-dimensional manifold such that out-of-sample data could be grouped in the embedding space learned from in-sample data. Experimental results show that iSSC is promising in clustering out-of-sample data.

0 citations0 reviewsNo code linkedOpen access
preprint2013arXiv

Infinite Horizon Optimal Impulsive Control Theory with Application to Internet Congestion Control

We develop Bellman equation based approach for infinite time horizon optimal impulsive control problems. Both discounted and time average criteria are considered. We establish very general and at the same time natural conditions under which a canonical control triplet produces an optimal feedback policy. Then, we apply our general results for Internet congestion control providing a convenient setting for the design of active queue management algorithms. In particular, our general theoretical results suggest a simple threshold-based active queue management scheme which takes into account the main parameters of the transmission control protocol.

0 citations0 reviewsNo code linkedOpen access
preprint2013arXiv

Learning Locality-Constrained Collaborative Representation for Face Recognition

The model of low-dimensional manifold and sparse representation are two well-known concise models that suggest each data can be described by a few characteristics. Manifold learning is usually investigated for dimension reduction by preserving some expected local geometric structures from the original space to a low-dimensional one. The structures are generally determined by using pairwise distance, e.g., Euclidean distance. Alternatively, sparse representation denotes a data point as a linear combination of the points from the same subspace. In practical applications, however, the nearby points in terms of pairwise distance may not belong to the same subspace, and vice versa. Consequently, it is interesting and important to explore how to get a better representation by integrating these two models together. To this end, this paper proposes a novel coding algorithm, called Locality-Constrained Collaborative Representation (LCCR), which improves the robustness and discrimination of data representation by introducing a kind of local consistency. The locality term derives from a biologic observation that the similar inputs have similar code. The objective function of LCCR has an analytical solution, and it does not involve local minima. The empirical studies based on four public facial databases, ORL, AR, Extended Yale B, and Multiple PIE, show that LCCR is promising in recognizing human faces from frontal views with varying expression and illumination, as well as various corruptions and occlusions.

0 citations0 reviewsNo code linkedOpen access
preprint2013arXiv

Measurements of Charge Transfer Efficiency in a Proton-irradiated Swept Charge Device

Charge Coupled Devices (CCDs) have been successfully used in several low energy X-ray astronomical satellite over the past two decades. Their high energy resolution and high spatial resolution make them an perfect tool for low energy astronomy, such as formation of galaxy clusters and environment of black holes. The Low Energy X-ray Telescope (LE) group is developing Swept Charge Device (SCD) for the Hard X-ray Modulation Telescope (HXMT) satellite. SCD is a special low energy X-ray CCD, which could be read out a thousand times faster than traditional CCDs, simultaneously keeping excellent energy resolution. A test method for measuring the charge transfer efficiency (CTE) of a prototype SCD has been set up. Studies of the charge transfer inefficiency (CTI) have been performed at a temperature range of operation, with a proton-irradiated SCD.

0 citations0 reviewsNo code linkedOpen access
preprint2012arXiv

Markov Processes with Restart

We consider a general honest homogeneous continuous-time Markov process with restarts. The process is forced to restart from a given distribution at time moments generated by an independent Poisson process. The motivation to study such processes comes from modeling human and animal mobility patterns, restart processes in communication protocols, and from application of restarting random walks in information retrieval. We provide a connection between the transition probability functions of the original Markov process and the modified process with restarts. We give closed-form expressions for the invariant probability measure of the modified process. When the process evolves on the Euclidean space there is also a closed-form expression for the moments of the modified process. We show that the modified process is always positive Harris recurrent and exponentially ergodic with the index equal to (or bigger than) the rate of restarts. Finally, we illustrate the general results by the standard and geometric Brownian motions.

0 citations0 reviewsNo code linkedOpen access