Abstract
Automatically discovering common visual patterns from a collection of images is an interesting but yet challenging task, in part because it is computationally prohibiting. Although representing images as visual documents based on discrete visual words offers advantages in computation, the performance of these word-based methods largely depends on the quality of the visual word dictionary. This paper presents a novel approach base on spatial random partition and fast word-free image matching. Represented as a set of continuous visual primitives, each image is randomly partitioned many times to form a pool of subimages. Each subimage is queried and matched against the pool, and then common patterns can be localized by aggregating the set of matched subimages. The asymptotic property and the complexity of the proposed method are given in this paper, along with many real experiments. Both theoretical studies and experiment results show its advantages.
| Original language | English (US) |
|---|---|
| DOIs | |
| State | Published - Dec 1 2007 |
| Event | 2007 IEEE 11th International Conference on Computer Vision, ICCV - Rio de Janeiro, Brazil Duration: Oct 14 2007 → Oct 21 2007 |
Other
| Other | 2007 IEEE 11th International Conference on Computer Vision, ICCV |
|---|---|
| Country | Brazil |
| City | Rio de Janeiro |
| Period | 10/14/07 → 10/21/07 |
Fingerprint
ASJC Scopus subject areas
- Software
- Computer Vision and Pattern Recognition
Cite this
}
Spatial random partition for common visual pattern discovery. / Yuan, Junsong; Wu, Ying.
2007. Paper presented at 2007 IEEE 11th International Conference on Computer Vision, ICCV, Rio de Janeiro, Brazil.Research output: Contribution to conference › Paper
TY - CONF
T1 - Spatial random partition for common visual pattern discovery
AU - Yuan, Junsong
AU - Wu, Ying
PY - 2007/12/1
Y1 - 2007/12/1
N2 - Automatically discovering common visual patterns from a collection of images is an interesting but yet challenging task, in part because it is computationally prohibiting. Although representing images as visual documents based on discrete visual words offers advantages in computation, the performance of these word-based methods largely depends on the quality of the visual word dictionary. This paper presents a novel approach base on spatial random partition and fast word-free image matching. Represented as a set of continuous visual primitives, each image is randomly partitioned many times to form a pool of subimages. Each subimage is queried and matched against the pool, and then common patterns can be localized by aggregating the set of matched subimages. The asymptotic property and the complexity of the proposed method are given in this paper, along with many real experiments. Both theoretical studies and experiment results show its advantages.
AB - Automatically discovering common visual patterns from a collection of images is an interesting but yet challenging task, in part because it is computationally prohibiting. Although representing images as visual documents based on discrete visual words offers advantages in computation, the performance of these word-based methods largely depends on the quality of the visual word dictionary. This paper presents a novel approach base on spatial random partition and fast word-free image matching. Represented as a set of continuous visual primitives, each image is randomly partitioned many times to form a pool of subimages. Each subimage is queried and matched against the pool, and then common patterns can be localized by aggregating the set of matched subimages. The asymptotic property and the complexity of the proposed method are given in this paper, along with many real experiments. Both theoretical studies and experiment results show its advantages.
UR - http://www.scopus.com/inward/record.url?scp=50649111840&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=50649111840&partnerID=8YFLogxK
U2 - 10.1109/ICCV.2007.4408869
DO - 10.1109/ICCV.2007.4408869
M3 - Paper
ER -