Charless C. Fowlkes

Charless C. Fowlkes

Auto-generated profile, based on publicly available information

Charless C. Fowlkes

University of California

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

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

Representative Publications

View All Publications
28 June 2004 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
CFC. Fowlkes
C. Fowlkes
SBS. Belongie
S. Belongie
FCFan Chung
Fan Chung
JMJ. Malik
J. Malik
Spectral graph theoretic methods have recently shown great promise for the problem of image segmentation. However, due to the computational demands of these approaches, applications to large problems such as spatiotemporal data and high resolution imagery have been slow to appear. The contribution of this paper is a method that substantially reduces the computational requirements of grouping algorithms based on spectral partitioning making it feasible to apply them to very large grouping problems. Our approach is based on a technique for the numerical solution of eigenfunction problems known as the Nystrom method. This method allows one to extrapolate the complete grouping solution using only a small number of samples. In doing so, we leverage the fact that there are far fewer coherent groups in a scene than pixels.

1 June 2011
Verified
Conference Paper
Closed access
HPHamed Pirsiavash
Hamed Pirsiavash
DRDeva Ramanan
Deva Ramanan
CFCharless C. Fowlkes
Charless C. Fowlkes
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as well as their birth and death states. We show that the global solution can be obtained with a greedy algorithm that sequentially instantiates tracks using shortest path computations on a flow network. Greedy algorithms allow one to embed pre-processing steps, such as nonmax suppression, within the tracking algorithm. Furthermore, we give a near-optimal algorithm based on dynamic programming which runs in time linear in the number of objects and linear in the sequence length. Our algorithms are fast, simple, and scalable, allowing us to process dense input data. This results in state-of-the-art performance.

17 September 2016
Verified
Book Chapter
Closed access
PDF file
SKShu Kong
Shu Kong
XSXiaohui Shen
Xiaohui Shen
ZLZhe Lin
Zhe Lin
RMRadomir Mech
Radomir Mech
CFCharless Fowlkes
Charless Fowlkes


1 July 2017
Verified
Conference Paper
Closed access
SKShu Kong
Shu Kong
CFCharless Fowlkes
Charless Fowlkes
Pooling second-order local feature statistics to form a high-dimensional bilinear feature has been shown to achieve state-of-the-art performance on a variety of fine-grained classification tasks. To address the computational demands of high feature dimensionality, we propose to represent the covariance features as a matrix and apply a low-rank bilinear classifier. The resulting classifier can be evaluated without explicitly computing the bilinear feature map which allows for a large reduction in the compute time as well as decreasing the effective number of parameters to be learned. To further compress the model, we propose a classifier co-decomposition that factorizes the collection of bilinear classifiers into a common factor and compact per-class terms. The co-decomposition idea can be deployed through two convolutional layers and trained in an end-to-end architecture. We suggest a simple yet effective initialization that avoids explicitly first training and factorizing the larger bilinear classifiers. Through extensive experiments, we show that our model achieves state-of-the-art performance on several public datasets for fine-grained classification trained with only category labels. Importantly, our final model is an order of magnitude smaller than the recently proposed compact bilinear model [8], and three orders smaller than the standard bilinear CNN model [19].

1 April 2008 in Cell
Verified
Journal Article
Closed access
CFCharless C. Fowlkes
Charless C. Fowlkes
CHCris L. Luengo Hendriks
Cris L. Luengo Hendriks
SKSoile V.E. Keränen
Soile V.E. Keränen
GWGunther H. Weber
Gunther H. Weber
OROliver Rübel
Oliver Rübel
JMJitendra Malik
Jitendra Malik