Efficient and effective querying by image content
Journal of Intelligent Information Systems - Special issue: advances in visual information management systems
Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Locally adaptive dimensionality reduction for indexing large time series databases
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Efficient Retrieval of Similar Time Sequences Under Time Warping
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
The Haar Wavelet Transform in the Time Series Similarity Paradigm
PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
Leaf Image Retrieval with Shape Features
VISUAL '00 Proceedings of the 4th International Conference on Advances in Visual Information Systems
3D Shape Histograms for Similarity Search and Classification in Spatial Databases
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
An Index-Based Approach for Similarity Search Supporting Time Warping in Large Sequence Databases
Proceedings of the 17th International Conference on Data Engineering
CVPR '96 Proceedings of the 1996 Conference on Computer Vision and Pattern Recognition (CVPR '96)
Warping indexes with envelope transforms for query by humming
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Exact indexing of dynamic time warping
Knowledge and Information Systems
Feature-based similarity search in 3D object databases
ACM Computing Surveys (CSUR)
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
A Leaf Image Retrieval Scheme Based on Partial Dynamic Time Warping and Two-Level Filtering
CIT '07 Proceedings of the 7th IEEE International Conference on Computer and Information Technology
Ranked subsequence matching in time-series databases
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A survey of content based 3D shape retrieval methods
Multimedia Tools and Applications
Efficient Similarity Join of Large Sets of Moving Object Trajectories
TIME '08 Proceedings of the 2008 15th International Symposium on Temporal Representation and Reasoning
Fast correlation analysis on time series datasets
Proceedings of the 17th ACM conference on Information and knowledge management
3D object retrieval using an efficient and compact hybrid shape descriptor
EG 3DOR'08 Proceedings of the 1st Eurographics conference on 3D Object Retrieval
| Hi-index | 0.00 |
Camera view invariant 3-D object retrieval is an important issue in many traditional and emerging applications such as security, surveillance, computer-aided design (CAD), virtual reality, and place recognition. One straightforward method for camera view invariant 3-D object retrieval is to consider all the possible camera views of 3-D objects. However, capturing and maintaining such views require an enormous amount of time and labor. In addition, all camera views should be indexed for reasonable retrieval performance, which requires extra storage space and maintenance overhead. In the case of shape-based 3-D object retrieval, such overhead could be relieved by considering the symmetric shape feature of most objects. In this paper, we propose a new shape-based indexing and matching scheme of real or rendered 3-D objects for camera view invariant object retrieval. In particular, in order to remove redundant camera views to be indexed, we propose a camera view skimming scheme, which includes: i) mirror shape pairing and ii) camera view pruning according to the symmetrical patterns of object shapes. Since our camera view skimming scheme considerably reduces the number of camera views to be indexed, it could relieve the storage requirement and improve the matching speed without sacrificing retrieval accuracy. Through various experiments, we show that our proposed scheme can achieve excellent performance.