220 search results - page 24 / 44 » Simple image set of (max, ) linear mappings |
106
click to vote
PAMI
2007
14 years 9 months ago
2007
This paper considers the problem of dimensionality reduction by orthogonal projection techniques. The main feature of the proposed techniques is that they attempt to preserve both...
BMVC
2010
14 years 7 months ago
2010
The Texture Fragmentation and Reconstruction (TFR) algorithm has been recently introduced [9] to address the problem of image segmentation by textural properties, based on a suita...
81
Voted
ICIP
2003
IEEE
15 years 11 months ago
2003
IEEE
We propose a method of efficient face description for facial image retrieval from a large data set. The novel descriptor is obtained by decomposing the face image into several com...
ICIP
2004
IEEE
15 years 11 months ago
2004
IEEE
Most digital data hiding schemes are sensitive to simple geometric attacks namely rotation, cropping, and scaling. Of these, rotational attacks possess the capability to not only ...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...