#### Filter Results:

- Full text PDF available (60)

#### Publication Year

2003

2017

- This year (1)
- Last 5 years (22)
- Last 10 years (55)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Allen Y. Yang, John Wright, Yi Ma, S. Shankar Sastry
- Computer Vision and Image Understanding
- 2008

In this paper, we cast natural-image segmentation as a problem of clustering texture features as multivariate mixed data. We model the distribution of the texture features using a mixture of Gaussian distributions. Unlike most existing clustering methods, we allow the mixture components to be degenerate or nearly-degenerate. We contend that this assumption… (More)

In this paper, we examine the role of feature selection in face recognition from the perspective of sparse representation. We cast the recognition problem as finding a sparse representation of the test image features w.r.t. the training set. The sparse representation can be accurately and efficiently computed by `-minimization. The proposed simple algorithm… (More)

- Phoebus Chen, Parvez Ahammad, +12 authors S. Shankar Sastry
- 2008 Second ACM/IEEE International Conference on…
- 2008

In this paper, we propose and demonstrate a novel wireless camera network system, called CITRIC. The core component of this system is a new hardware platform that integrates a camera, a frequency-scalable (up to 624 MHz) CPU, 16MB FLASH, and 64MB RAM onto a single device. The device then connects with a standard sensor network mote to form a camera mote.… (More)

- Yi Ma, Allen Y. Yang, Harm Derksen, Robert M. Fossum
- SIAM Review
- 2008

Recently many scientific and engineering applications have involved the challenging task of analyzing large amounts of unsorted high-dimensional data that have very complicated structures. From both geometric and statistical points of view, such unsorted data are considered mixed as different parts of the data have significantly different structures which… (More)

- Shankar R. Rao, Hossein Mobahi, Allen Y. Yang, S. Shankar Sastry, Yi Ma
- ACCV
- 2009

We present a novel algorithm for unsupervised segmentation of natural images that harnesses the principle of minimum description length (MDL). Our method is based on observations that a homogeneously textured region of a natural image can be well modeled by a Gaussian distribution and the region boundary can be effectively coded by an adaptive chain code.… (More)

- Allen Y. Yang, S. Shankar Sastry, Arvind Ganesh, Yi Ma
- ICIP
- 2010

`1-minimization solves the minimum `1-norm solution to an underdetermined linear system y = Ax. It has recently received much attention, mainly motivated by the new compressive sensing theory that shows that under certain conditions an `1-minimization solution is also the sparsest solution to that system. Although classical solutions to `1-minimization have… (More)

- John Wright, Allen Y. Yang, Arvind Ganesh, S. Shankar Sastry, Yi Ma
- IEEE Transactions on Pattern Analysis and Machine…
- 2009

We consider the problem of automatically recognizing human faces from frontal views with varying expression and illumination, as well as occlusion and disguise. We cast the recognition problem as one of classifying among multiple linear regression models and argue that new theory from sparse signal representation offers the key to addressing this problem.… (More)

- Allen Y. Yang, Roozbeh Jafari, S. Shankar Sastry, Ruzena Bajcsy
- JAISE
- 2009

We propose a distributed recognition framework to classify continuous human actions using a low-bandwidth wearable motion sensor network, called distributed sparsity classifier (DSC). The algorithm classifies human actions using a set of training motion sequences as prior examples. It is also capable of rejecting outlying actions that are not in the… (More)

- Allen Y. Yang, Zihan Zhou, A. G. Balasubramanian, S. Shankar Sastry, Yi Ma
- IEEE Trans. Image Processing
- 2013

l1-minimization refers to finding the minimum l1-norm solution to an underdetermined linear system [Formula: see text]. Under certain conditions as described in compressive sensing theory, the minimum l1-norm solution is also the sparsest solution. In this paper, we study the speed and scalability of its algorithms. In particular, we focus on the numerical… (More)

`1-minimization refers to finding the minimum `1-norm solution to an underdetermined linear system b = Ax. It has recently received much attention, mainly motivated by the new compressive sensing theory that shows under quite general conditions the minimum `1-norm solution is also the sparsest solution to the system of linear equations. Although the… (More)