Geometric Consistency Checking for Local-Descriptor Based Document Retrieval

International audienceIn this paper, we evaluate different geometric consistency schemes, which can be used in tandem with an efficient architecture, based on voting and local descriptors, to retrieve multimedia documents. In many contexts the geometric consistency enforcement is essential to boost the retrieval performance. Our empirical results show however, that geometric consistency alone is unable to guarantee high-quality results in databases that contain too many non-discriminating descriptors

Towards visualization and searching :a dual-purpose video coding approach

In modern video applications, the role of the decoded video is much more than filling a screen for visualization. To offer powerful video-enabled applications, it is increasingly critical not only to visualize the decoded video but also to provide efficient searching capabilities for similar content. Video surveillance and personal communication applications are critical examples of these dual visualization and searching requirements. However, current video coding solutions are strongly biased towards the visualization needs. In this context, the goal of this work is to propose a dual-purpose video coding solution targeting both visualization and searching needs by adopting a hybrid coding framework where the usual pixel-based coding approach is combined with a novel feature-based coding approach. In this novel dual-purpose video coding solution, some frames are coded using a set of keypoint matches, which not only allow decoding for visualization, but also provide the decoder valuable feature-related information, extracted at the encoder from the original frames, instrumental for efficient searching. The proposed solution is based on a flexible joint Lagrangian optimization framework where pixel-based and feature-based processing are combined to find the most appropriate trade-off between the visualization and searching performances. Extensive experimental results for the assessment of the proposed dual-purpose video coding solution under meaningful test conditions are presented. The results show the flexibility of the proposed coding solution to achieve different optimization trade-offs, notably competitive performance regarding the state-of-the-art HEVC standard both in terms of visualization and searching performance.Em modernas aplicações de vídeo, o papel do vídeo decodificado é muito mais que simplesmente preencher uma tela para visualização. Para oferecer aplicações mais poderosas por meio de sinais de vídeo,é cada vez mais crítico não apenas considerar a qualidade do conteúdo objetivando sua visualização, mas também possibilitar meios de realizar busca por conteúdos semelhantes. Requisitos de visualização e de busca são considerados, por exemplo, em modernas aplicações de vídeo vigilância e comunicações pessoais. No entanto, as atuais soluções de codificação de vídeo são fortemente voltadas aos requisitos de visualização. Nesse contexto, o objetivo deste trabalho é propor uma solução de codificação de vídeo de propósito duplo, objetivando tanto requisitos de visualização quanto de busca. Para isso, é proposto um arcabouço de codificação em que a abordagem usual de codificação de pixels é combinada com uma nova abordagem de codificação baseada em features visuais. Nessa solução, alguns quadros são codificados usando um conjunto de pares de keypoints casados, possibilitando não apenas visualização, mas também provendo ao decodificador valiosas informações de features visuais, extraídas no codificador a partir do conteúdo original, que são instrumentais em aplicações de busca. A solução proposta emprega um esquema flexível de otimização Lagrangiana onde o processamento baseado em pixel é combinado com o processamento baseado em features visuais objetivando encontrar um compromisso adequado entre os desempenhos de visualização e de busca. Os resultados experimentais mostram a flexibilidade da solução proposta em alcançar diferentes compromissos de otimização, nomeadamente desempenho competitivo em relação ao padrão HEVC tanto em termos de visualização quanto de busca

Subspace Clustering For Information Retrieval In Urban Scene Databases

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)We present a comprehensive study of two important subspace clustering algorithms and their contribution to enhance results for the difficult task of matching images of the same object using different devices at different conditions. Our experiments were performed on two distinct databases containing urban scenes which were tested using state-of-the-art matching algorithms. Our start point was the hypothesis that low discriminant local point descriptors lead to misclassification, which can be reduced employing clustering techniques as filters. A significantly amelioration of the results obtained for the two tested databases was achieved, which indicates that subspace clustering techniques have much to contribute at this research area. Another point is whether the occurrence of obstacles like trees and shadows are responsible for misclassification of images. © 2011 IEEE.173180 Cons. Nac. Desenvolv. Cient. Tecnol. (CNPq),Coordenacao Aperfeicoamento Pessoal Nivel Superior (CAPES),Fundacao de Amparo a Pesquisa do Estado de Alagoas (FAPEAL),Secr. Estado Cienc., Tecnol. Inovacao (SECTI-AL)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)(2009) Nokia Challenge (2009/2010): Where Was This Photo Taken, and How?, , http://comminfo.rutgers.edu/conferences/mmchallenge/2010/02/10/ nokia-challenge/, NokiaPhilbin, J., Chum, O., Isard, M., Sivic, J., Zisserman, A., Object retrieval with large vocabularies and fast spatial matching (2007) Computer Vision and Pattern Recognition, 2007. CVPR '07 IEEE Conference on, 0, pp. 1-8. , Los Alamitos, CA, USA: IEEE Computer SocietyTuytelaars, T., Mikolajczyk, K., Local invariant feature detectors: A survey (2008) Found. Trends. Comput. Graph. Vis., 3, pp. 177-280. , http://portal.acm.org/citation.cfm?id=1391081.1391082, July. [Online]Vapnik, V.N., (1989) Statistical Learning Theory, , Wiley-InterscienceCortes, C., Vapnik, V., Support-vector networks (1995) Mach. Learn., 20, pp. 273-297. , http://portal.acm.org/citation.cfm?id=218919.218929, September. [Online]Valle, E., Picard, D., Cord, M., Geometric consistency checking for local-descriptor based document retrieval (2009) Proceedings of the 9th ACM Symposium on Document Engineering, Ser. DocEng '09, pp. 135-138. , http://doi.acm.org/10.1145/1600193.1600224, New York, NY, USA: ACM. [Online]Picard, D., Cord, M., Valle, E., Study of sift descriptors for image matching based localization in urban street view context (2009) Proccedings of City Models, Roads and Traffic ISPRS Workshop, Ser. CMRT '09, pp. 193-198Lowe, D.G., Distinctive image features from scale-invariant keypoints (2004) Int. J. Comput. Vision, 60, pp. 91-110. , http://portal.acm.org/citation.cfm?id=993451.996342, November. [Online]Valle, E., Cord, M., Philipp-Foliguet, S., High-dimensional descriptor indexing for large multimedia databases (2008) Proceeding of the 17th ACM Conference on Information and Knowledge Management, pp. 739-748. , http://doi.acm.org/10.1145/1458082.1458181, ser. CIKM '08. New York, NY, USA: ACM. [Online]Fischler, M.A., Bolles, R.C., Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography (1981) Commun. ACM, 24, pp. 381-395. , http://doi.acm.org/10.1145/358669.358692, June. [Online]Sivic, J., Zisserman, A., Video google: A text retrieval approach to object matching in videos (2003) Proceedings of the Ninth IEEE International Conference on Computer Vision, 2, p. 1470. , http://portal.acm.org/citation.cfm?id=946247.946751, ser. ICCV '03. Washington, DC, USA: IEEE Computer Society. [Online]Lazebnik, S., Schmid, C., Ponce, J., Beyond bags of features: Spatial pyramid matching for recognizing natural scene categories (2006) Proceedings - 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2006, 2, pp. 2169-2178. , DOI 10.1109/CVPR.2006.68, 1641019, Proceedings - 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2006Kläser, A., Marszalek, M., Laptev, I., Schmid, C., Will person detection help bag-of-features action recognition? (2010) INRIA Grenoble - Rhône-Alpes, 655. , http://lear.inrialpes.fr/pubs/2010/KMLS10, avenue de lEurope, 38334 Montbonnot Saint Ismier, FRANCE, Tech. Rep. RR-7373, sep. [Online]Turcot, P., Lowe, D., Better matching with fewer features: The selection of useful features in large database recognition problems (2009) Computer Vision Workshops (ICCV Workshops), 2009 IEEE 12th International Conference on, pp. 2109-2116. , 27 2009-oct. 4Vogel, J., Schiele, B., Semantic modeling of natural scenes for content-based image retrieval (2007) International Journal of Computer Vision, 72 (2), pp. 133-157. , DOI 10.1007/s11263-006-8614-1Parsons, L., Haque, E., Liu, H., Subspace clustering for high dimensional data: A review (2004) SIGKDD Explor. Newsl., 6, pp. 90-105. , http://doi.acm.org/10.1145/1007730.1007731, June. [Online]Woo, K.-G., Lee, J.-H., Kim, M.-H., Lee, Y.-J., Findit: A fast and intelligent subspace clustering algorithm using dimension voting (2004) Information and Software Technology, 46 (4), pp. 255-271. , http://www.sciencedirect.com/science/ARTICLE/B6V0B-49HMWRS-1/2/ 5374bfa16fe12aeb7c31b64d7c18ba20, [Online]Gan, G., Ma, C., Wu, J., (2007) Data Clustering: Theory Algorithms and Applications, , http://link.aip.org/link/doi/10.1137/1.9780898718348, illustrated edition ed. Philadephia PA: Society for Industrial and Applied Mathematics, May. [Online]Aggarwal, C.C., Wolf, J.L., Yu, P.S., Procopiuc, C., Park, J.S., Fast algorithms for projected clustering (1999) SIGMOD Record (ACM Special Interest Group on Management of Data), 28 (2), pp. 61-72He, X., Niyogi, P., Locality preserving projections (2003) Advances in Neural Information Processing Systems 16, 16, pp. 153-160. , http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.4.5576&rep= rep1&type=pdf, December. [Online