|
|
Marçal Rusiñol, & Josep Llados. (2006). Symbol Spotting in Technical Drawings Using Vectorial Signatures. In Graphics Recognition: Ten Years Review and Future Perspectives, W. Liu, J. Llados (Eds.), LNCS 3926: 35–46.
|
|
|
|
Angel Sappa. (2006). Splitting up Panoramic Range Images into Compact 2½D Representations. International Journal of Imaging Systems and Technology, 16(3): 85–91.
|
|
|
|
Jordi Vitria, M. Bressan, & Petia Radeva. (2006). Bayesian classification of cork stoppers using class-conditional independent component analysis. IEEE Transactions on Systems, Man and Cybernetics (Part C), 36(6).
|
|
|
|
Salim Jouili, Salvatore Tabbone, & Ernest Valveny. (2010). Comparing Graph Similarity Measures for Graphical Recognition. In Graphics Recognition. Achievements, Challenges, and Evolution. 8th International Workshop, GREC 2009. Selected Papers (Vol. 6020, pp. 37–48). LNCS. Springer Berlin Heidelberg.
Abstract: In this paper we evaluate four graph distance measures. The analysis is performed for document retrieval tasks. For this aim, different kind of documents are used including line drawings (symbols), ancient documents (ornamental letters), shapes and trademark-logos. The experimental results show that the performance of each graph distance measure depends on the kind of data and the graph representation technique.
|
|
|
|
Fadi Dornaika, & Franck Davoine. (2006). On appearance based face and facial action tracking. IEEE Transactions on Circuits and Systems for Video Technology, 16(9): 1838–1853.
|
|
|
|
Fadi Dornaika, & J. Ahlberg. (2006). Fitting 3D face models for tracking and active appearance model training. Image and Vision Computing, 24(9): 1010–1024.
|
|
|
|
Jaume Amores. (2015). MILDE: multiple instance learning by discriminative embedding. KAIS - Knowledge and Information Systems, 42(2), 381–407.
Abstract: While the objective of the standard supervised learning problem is to classify feature vectors, in the multiple instance learning problem, the objective is to classify bags, where each bag contains multiple feature vectors. This represents a generalization of the standard problem, and this generalization becomes necessary in many real applications such as drug activity prediction, content-based image retrieval, and others. While the existing paradigms are based on learning the discriminant information either at the instance level or at the bag level, we propose to incorporate both levels of information. This is done by defining a discriminative embedding of the original space based on the responses of cluster-adapted instance classifiers. Results clearly show the advantage of the proposed method over the state of the art, where we tested the performance through a variety of well-known databases that come from real problems, and we also included an analysis of the performance using synthetically generated data.
Keywords: Multi-instance learning; Codebook; Bag of words
|
|
|
|
Albert Gordo, Florent Perronnin, Yunchao Gong, & Svetlana Lazebnik. (2014). Asymmetric Distances for Binary Embeddings. TPAMI - IEEE Transactions on Pattern Analysis and Machine Intelligence, 36(1), 33–47.
Abstract: In large-scale query-by-example retrieval, embedding image signatures in a binary space offers two benefits: data compression and search efficiency. While most embedding algorithms binarize both query and database signatures, it has been noted that this is not strictly a requirement. Indeed, asymmetric schemes which binarize the database signatures but not the query still enjoy the same two benefits but may provide superior accuracy. In this work, we propose two general asymmetric distances which are applicable to a wide variety of embedding techniques including Locality Sensitive Hashing (LSH), Locality Sensitive Binary Codes (LSBC), Spectral Hashing (SH), PCA Embedding (PCAE), PCA Embedding with random rotations (PCAE-RR), and PCA Embedding with iterative quantization (PCAE-ITQ). We experiment on four public benchmarks containing up to 1M images and show that the proposed asymmetric distances consistently lead to large improvements over the symmetric Hamming distance for all binary embedding techniques.
|
|
|
|
Josep Llados. (2006). Computer Vision: Progress of Research and Development ( J. Llados(ed.), Ed.).
|
|
|
|
Joaquin Salas, P. Martinez, & Jordi Gonzalez. (2006). Background Updating with the Use of Intrinsic Curves. In International Conference on Image Analysis and Recognition (ICIAR´06), LNCS 4141 (A. Campilho et al., eds.), 1: 731–742, ISBN 978–3–540–44891–4.
|
|
|
|
F. Pla, Petia Radeva, & Jordi Vitria. (2006). Pattern Recognition: Progress, Directions and Applications.
|
|
|
|
Josep Llados, & Dorothea Blostein. (2007). Special Issue on Graphics Recognition. IJDAR - International Journal on Document Analysis and Recognition, 1–2.
|
|
|
|
Fadi Dornaika, & Bogdan Raducanu. (2007). Efficient Facial Expression Recognition for Human Robot Interaction. In Computational and Ambient Intelligence, 9th International Work–Conference on Artificial Neural Networks (Vol. 4507, 700–708). LNCS.
|
|
|
|
Matthias S. Keil, & Jordi Vitria. (2007). Pushing it to the Limit: Adaptation with Dynamically Switching Gain Control. EURASIP Journal on Advances in Signal Processing, Vol 2007, Article ID 51684, 10 pages, doi: 10.1155/2007/51684.
|
|
|
|
Jordi Vitria, M. Bressan, & Petia Radeva. (2007). Bayesian classification of cork stoppers using class-conditional independent component analysis. IEEE Transactions on Systems, Man and Cybernetics (Part C), 37(1): 32–38 (ISI 0,482).
|
|
