#### Filter Results:

#### Publication Year

2001

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Omar Javed, Khurram Shafique, Zeeshan Rasheed, Mubarak Shah
- Computer Vision and Image Understanding
- 2008

Tracking across cameras with non-overlapping views is a challenging problem. Firstly, the observations of an object are often widely separated in time and space when viewed from non-overlapping cameras. Secondly, the appearance of an object in one camera view might be very different from its appearance in another camera view due to the differences in… (More)

- Omar Javed, Zeeshan Rasheed, Khurram Shafique, Mubarak Shah
- ICCV
- 2003

Conventional tracking approaches assume proximity in space, time and appearance of objects in successive observations. However, observations of objects are often widely separated in time and space when viewed from multiple non-overlapping cameras. To address this problem, we present a novel approach for establishing object correspondence across… (More)

- Omar Javed, Khurram Shafique, Mubarak Shah
- 2005 IEEE Computer Society Conference on Computer…
- 2005

When viewed from a system of multiple cameras with non-overlapping fields of view, the appearance of an object in one camera view is usually very different from its appearance in another camera view due to the differences in illumination, pose and camera parameters. In order to handle the change in observed colors of an object as it moves from one camera to… (More)

We present a background subtraction method that uses multiple cues to robustly detect objects in adverse conditions. The algorithm consists of three distinct levels i.e pixel level, region level and frame level. At the pixel level, statistical models of gradients and color are separately used to classify each pixel as belonging to background or foreground.… (More)

- Khurram Shafique, Mubarak Shah
- IEEE Transactions on Pattern Analysis and Machine…
- 2003

This work presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multiframe point correspondence is NP-hard for three or more frames. A polynomial time algorithm for a restriction of this problem is presented and is used as the basis of the proposed greedy algorithm for the general… (More)

- Alper Yilmaz, Khurram Shafique, Mubarak Shah
- Image Vision Comput.
- 2003

In this paper, we propose a robust approach for tracking targets in forward looking infrared (FLIR) imagery taken from an airborne moving platform. First, the targets are detected using fuzzy clustering, edge fusion and local texture energy. The position and the size of the detected targets are then used to initialize the tracking algorithm. For each… (More)

- Khurram Shafique, Mubarak Shah
- 2004 International Conference on Image Processing…
- 2004

The mapping that relates the image irradiance to the image brightness (intensity) is known as the Radiometric Response Function or Camera Response Function. This usually unknown mapping is nonlinear and varies from one color channel to another. In this paper, we present a method to estimate the radiometric response functions (of R, G and B channels) of a… (More)

- Mubarak Shah, Omar Javed, Khurram Shafique
- IEEE MultiMedia
- 2007

present Knight, an automated surveillance system deployed in a variety of real-world scenarios ranging from railway security to law enforcement. We also discuss the challenges of developing surveillance systems, present some solutions implemented in Knight that overcome these challenges, and evaluate Knight's performance in unconstrained environments.… (More)

A defensive k−alliance in a graph G = (V, E) is a set of vertices A ⊆ V such that for every vertex v ∈ A, the number of neighbors v has in A is at least k more than the number of neighbors it has in V − A (where k is the strength of defensive k−alliance). An offensive k−alliance is a set of vertices A ⊆ V such that for every vertex v ∈ ∂A, the number of… (More)

For any x ∈ X ⊆ V(G), x is "satisfied" when X contains at least half of x's neighbors. The set X is "cohesive" if all it's vertices are satisfied, and a graph is said to be " satisfiable " if there is a vertex partition into two or more non-empty cohesive sets. Such a partition is referred to as " satisfactory partition." Not all graphs have such a… (More)