CONTENT-ADAPTIVE PYRAMID REPRESENTATION FOR 3D OBJECT CLASSIFICATION

被引：0

作者：

Kounalakis, T. ^{[1
]}

Boulgouris, N. V. ^{[1
]}

Triantafyllidis, G. A. ^{[2
]}

机构：

[1] Brunel Univ London, Uxbridge, Middx, England

[2] Aalborg Univ, Aalborg, Denmark

来源：

2016 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP) | 2016年

关键词：

Content-adaptivenage representation; pyramid representation; 3D image/object classification;

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

In this paper we introduce a novel representation for the classification of 3D images. Unlike most current approaches, our representation is not based on a fixed pyramid but adapts to image content and uses image regions instead of rectangular pyramid scales. Image characteristics, such as depth and color, are used for defining regions within images. Multiple region scales are formed in order to construct the proposed pyramid image representation. The proposed method achieves excellent results in comparison to conventional representations.

引用

页码：231 / 235

页数：5

共 23 条

[1]

Bo L., 2009, Advances in neural information processing systems, P135

[2]

Bo L., 2012, ISER

[3]

Bo LF, 2011, IEEE INT C INT ROBOT, P821, DOI 10.1109/IROS.2011.6048717

[4]

Chai YN, 2011, IEEE I CONF COMP VIS, P2579, DOI 10.1109/ICCV.2011.6126546

[5]

Fei-Fei L, 2005, PROC CVPR IEEE, P524

[6] Efficient graph-based image segmentation [J].

Felzenszwalb, PF ;

Huttenlocher, DP .

INTERNATIONAL JOURNAL OF COMPUTER VISION, 2004, 59 (02) :167-181

[7]

Feng J., 2011, ICCV

[8] Decomposing a Scene into Geometric and Semantically Consistent Regions [J].

Gould, Stephen ;

Fulton, Richard ;

Koller, Daphne .

2009 IEEE 12TH INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2009, :1-8

[9]

Hespanha JoaoP., 2004, An efficient matlab algorithm for graph partitioning, P1

[10] Recovering surface layout from an image [J].

Hoiem, Derek ;

Efros, Alexei A. ;

Hebert, Martial .

INTERNATIONAL JOURNAL OF COMPUTER VISION, 2007, 75 (01) :151-172

← 1 2 3 →