Weichuan Yu

Dr. Weichuan Yu

orcid

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 June 2012 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
XZXiaowei Zhou
Xiaowei Zhou
CYCan Yang
Can Yang
WYWeichuan Yu
Weichuan Yu
Object detection is a fundamental step for automated video analysis in many vision applications. Object detection in a video is usually performed by object detectors or background subtraction techniques. Often, an object detector requires manually labeled examples to train a binary classifier, while background subtraction needs a training sequence that contains no objects to build a background model. To automate the analysis, object detection without a separate training phase becomes a critical task. People have tried to tackle this task by using motion information. But existing motion-based methods are usually limited when coping with complex scenarios such as nonrigid motion and dynamic background. In this paper, we show that the above challenges can be addressed in a unified framework named DEtecting Contiguous Outliers in the LOw-rank Representation (DECOLOR). This formulation integrates object detection and background learning into a single process of optimization, which can be solved by an alternating algorithm efficiently. We explain the relations between DECOLOR and other sparsity-based methods. Experiments on both simulated data and real sequences demonstrate that DECOLOR outperforms the state-of-the-art approaches and it can work effectively on a wide range of complex scenarios.

1 September 2010 in The American Journal of Human Genetics
Verified
Journal Article
Closed access
XWXiang Wan
Xiang Wan
CYCan Yang
Can Yang
QYQiang Yang
Qiang Yang
HXHong Xue
Hong Xue
XFXiaodan Fan
Xiaodan Fan
WYWeichuan Yu
Weichuan Yu

1 August 2010 in Computational Biology and Chemistry
Verified
Journal Article
Closed access
ZHZengyou He
Zengyou He
WYWeichuan Yu
Weichuan Yu

6 January 2009 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
CYChao Yang
Chao Yang
ZHZengyou He
Zengyou He
WYWeichuan Yu
Weichuan Yu
In mass spectrometry (MS) based proteomic data analysis, peak detection is an essential step for subsequent analysis. Recently, there has been significant progress in the development of various peak detection algorithms. However, neither a comprehensive survey nor an experimental comparison of these algorithms is yet available. The main objective of this paper is to provide such a survey and to compare the performance of single spectrum based peak detection methods.

19 December 2008 in Bioinformatics
Verified
Journal Article
Open access
PDF file
CYCan Yang
Can Yang
ZHZengyou He
Zengyou He
XWXiang Wan
Xiang Wan
QYQiang Yang
Qiang Yang
HXHong Xue
Hong Xue
WYWeichuan Yu
Weichuan Yu
Motivation: Hundreds of thousands of single nucleotide polymorphisms (SNPs) are available for genome-wide association (GWA) studies nowadays. The epistatic interactions of SNPs are believed to be very important in determining individual susceptibility to complex diseases. However, existing methods for SNP interaction discovery either suffer from high computation complexity or perform poorly when marginal effects of disease loci are weak or absent. Hence, it is desirable to develop an effective method to search epistatic interactions in genome-wide scale. Results: We propose a new method SNPHarvester to detect SNP–SNP interactions in GWA studies. SNPHarvester creates multiple paths in which the visited SNP groups tend to be statistically associated with diseases, and then harvests those significant SNP groups which pass the statistical tests. It greatly reduces the number of SNPs. Consequently, existing tools can be directly used to detect epistatic interactions. By using a wide range of simulated data and a real genome-wide data, we demonstrate that SNPHarvester outperforms its recent competitor significantly and is promising for practical disease prognosis. Availability:http://bioinformatics.ust.hk/SNPHarvester.html Contact:eeyang@ust.hk Supplementary information: Supplementary data are available at Bioinformatics online.

19 December 2014 in ACM Computing Surveys
Verified
Journal Article
Open access
XZXiaowei Zhou
Xiaowei Zhou
CYCan Yang
Can Yang
HZHongyu Zhao
Hongyu Zhao
WYWeichuan Yu
Weichuan Yu
Low-rank modeling generally refers to a class of methods that solves problems by representing variables of interest as low-rank matrices. It has achieved great success in various fields including computer vision, data mining, signal processing, and bioinformatics. Recently, much progress has been made in theories, algorithms, and applications of low-rank modeling, such as exact low-rank matrix recovery via convex programming and matrix completion applied to collaborative filtering. These advances have brought more and more attention to this topic. In this article, we review the recent advances of low-rank modeling, the state-of-the-art algorithms, and the related applications in image analysis. We first give an overview of the concept of low-rank modeling and the challenging problems in this area. Then, we summarize the models and algorithms for low-rank matrix recovery and illustrate their advantages and limitations with numerical experiments. Next, we introduce a few applications of low-rank modeling in the context of image analysis. Finally, we conclude this article with some discussions.