Advanced indexing schema for imaging applications: Three case studies

IET Image Processing

Volumn 1, Issue 3, 2007, Pages 249-268

  Battiato, S ^a   Di Blasi, G ^a   Reforgiato, D ^a  

^a UNIVERSITY OF CATANIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; IMAGE QUALITY; IMAGE RESOLUTION; INDEXING (OF INFORMATION); PROGRAM PROCESSORS;

IMAGE COLOURIZATION; INDEXING SCHEMAS; SPEED PERFORMANCE; TEXTURE SYNTHESIS;

IMAGING SYSTEMS;

EID: 34548386174     PISSN: 17519659     EISSN: None     Source Type: Journal    
DOI: 10.1049/iet-ipr:20060315     Document Type: Article

References (63)

1. ' Super-resolution ', Technical report, 2002, 24 Régis Destobbeleire:
2. Bozkaya, T., and Ozsoyoglu, M.: ' Indexing large metric spaces for similarity search queries ', ACM Trans. Database Syst., 1999, 24, (3), p. 361-404 10.1145/328939.328959 0362-5915
3. Ciaccia, P., Patella, M., and Zezula, P.: ' M-tree: an efficient access method for similarity search in metric spaces ', Proc. 23th Int. Conf. on Very Large Databases, 1997, p. 426-435
4. Cantone, D., Ferro, A., Pulvirenti, A., Reforgiato, D., and Shasha, D.: ' Antipole tree indexing to support range search and k-nearest-neighbor search in metric spaces ', IEEE Trans. Knowl. Data Eng., 2005, 17, (4), p. 535-550 1041-4347
5. Traina, C., Traina, A., Seeger, D., and Faloutsos, C.: ' Slim-trees: high performace metric trees minimizing overlap between nodes ', Proc. 7th Int. Conf. Extending Database Technology, 2000, p. 51-56, (Lect. Notes Comput. Sci., 1777)
6. Baeza-Yates, R., Cunto, W., Manber, U., and Wu, S.: ' Proximity matching using fixed-queries trees ', Proc. Combinatorial Pattern Matching, 5th Annual Symp., 1994, p. 198-212, (Lect. Notes Comput. Sci., 807)
7. Chávez, E., and Navarro, G.: ' An effective clustering algorithm to index high dimensional metric spaces ', Proc. SPIRE, 2000, p. 75-86
8. Navarro, G.: ' Searching in metric spaces by spatial approximation ', VLDB J., 2002, 11, p. 28-46 10.1007/s007780200060 1066-8888
9. Gersho, A., and Gray, R.: ' Vector quantization and signal compression ', (Kluwer Academic Publishers, 1992)
10. Vidal, E.: ' An algorithm for finding nearest neighbours in (approximately) constant average time ', Pattern Recognit. Lett., 1986, 4, (3), p. 145-157 10.1016/0167-8655(86)90013-9 0167-8655
11. Figueroa, K., Chavez, E., Navarro, G., and Paredes, R.: ' On the least cost for proximity searching in metric spaces ', WEA 2006, 2006, p. 279-290
12. Chávez, E., Navarro, G., BaezaYates, R., and Marroquin, J.L.: ' Searching in metric spaces ', ACM Comput. Surv., 2001, 33, (3), p. 273-321 0360-0300
13. Aggarwal, C., Wolf, J.L., Yu, P.S., and Epelman, M.: ' Using unbalanced trees for indexing multidimensional objects ', Knowl. Inf. Syst., 1999, 1, (3), p. 309-336 0219-1377
14. Gionis, A., Indyk, P., and Motwani, R.: ' Similarity search in high dimensions via hashing ', Proc 25th VLDB Conf., 1999, p. 518-529
15. Beyer, K., Goldstein, J., Ramakrishnan, R., and Shaft, U.: ' When is nearest neighbor meaningful?'. Proc. 7th Int. Conf. Database Theory ', 1999, 1540, p. 217-235
16. Berchtold, S., Keim, D.A., and Kriegel, H.P.: ' The x-tree: an index structure for high-dimensional data ', Proc. 22th Int. Conf. Very Large Database, 1996, p. 28-39
17. Sumanasekara, S., and Ramakrishna, M.V.: ' Chilma: an efficient high dimensional indexing structure for image database ', Proc. First IEEE Pacific-Rim Conf. Multimedia, 2000, p. 76-79
18. Di Blasi, G., Gallo, G., and Petralia, M.: ' Puzzle image mosaic ', Proc. IASTED/VIIP2005, 2005
19. Di Blasi, G., Gallo, G., and Petralia, M.: ' Smart ideas for photomosaic rendering ', Proc. Eurographics Italian Chapter 2006, 2006, p. 267-271
20. Indyk, P., and Motwani, R.: ' Approximate nearest neighbors: towards removing the curse of dimensionality ', Proc. 30th Annual ACM Symp. Theory of Computing, 1998, p. 604-613
21. Chazelle, B.: ' Computational geometry: a retrospective ', Proc. 26th Annual ACM Symp. Theory of Computing, 1994, p. 75-94
22. Chávez, E., and Navarro, G.: ' A probabilistic spell for the curse of dimensionality ', Proc. 3rd Workshop on Algorithm Engineering and Experimentation (ALENENEX'01), 2001, 2153, p. 147-160, Lect. Notes Comput. Sci
23. Ciaccia, P., and Patella, M.: ' Pac nearest neighbor queries: approximate and controlled search in high-dimensional and metric spaces ', ICDE, 2000, p. 244-255
24. Mitchell, T.M.: ' Machine learning ', McGraw-Hill, 1997)
25. Hjaltason, G.R., and Samet, H.: ' Distance browsing in spatial database ', ACM Trans. Inf. Syst., 1999, 24, (2), p. 265-318 1046-8188
26. Chávez, E., and Navarro, G.: ' A compact space decomposition for effective metric indexing ', Pattern Recognit. Lett., 2005, 26, (9), p. 1363-1376 10.1016/j.patrec.2004.11.014 0167-8655
27. Bustos, B., and Navarro, G.: ' Probabilistic proximity searching algorithms based on compact partitions ', Proc. SPIRE, 2002, p. 284-297
28. University of Washington Data Compression Laboratory: 'TSVQ'. http://dcl.ee.washington.edu/
29. Battiato, S., Pulvirenti, A., and Reforgiato, D.: ' Antipole clustering for fast texture synthesis ', Proc. Winter School of Computer Graphics (WSCG), 2003
30. Vidal, E.: ' New formulation and improvements of the nearest- neighbour approximating and eliminating search algorithm (AESA) ', Pattern Recognit. Lett., 1994, 15, (1), p. 1-7 10.1016/0167-8655(94)90094-9 0167-8655
31. Moreno-Seco, F., Oncina, J., and Mico', L.: ' Improving the LAESA algorithm error rates ', Proc. VIII Symp. NdRdFyAdI, 1999, 1, p. 413-419
32. Moreno-Seco, F., Oncina, J., and Mico', L.: ' Improving the linear approximating and eliminating search algorithm (LAESA) error rates ', Pattern Recognit. Appl., 2000, 56, p. 37-43
33. ' An optimized version of the approximating and eliminating search algorithm (AESA) for nearest neighbour classification ', Technical report ITI-ITE-3/98, 1998
34. De Bonet, J.S.: ' Multiresolution sampling procedure for analysis and synthesis of texture images ', Proc. ACM SIGGRAPH, 1997, p. 361-368
35. Efros, A., and Leung, T.: ' Texture synthesis by a non-parametric sampling ', Proc. IEEE Int. Conf. Comput. Vis., 1999, 2, p. 1033-1038
36. Zhu, S.C., Wu, Y.N., and Mumford, D.: ' Filters, random fields, and maximum entropy (frame) - towards a unified theory for texture modeling ', Int. J. Comput. Vis., 1998, 27, (2), p. 107-126 10.1023/A:1007925832420 0920-5691
37. Popat, K., and Picard, R.: ' Novel cluster-based probability model for texture synthesis, classification, and compression ', Proc. SPIE, 1993, 2094, p. 756-768
38. Heeger, D.J., and Bergen, J.R.: ' Pyramid-based texture analysis/synthesis ', Computer Graphics, ACM SIGGRAPH, 1995, p. 229-238
39. Simoncelli, E., and Portilla, J.: ' Texture characterization via joint statistics of wavelet coefficient magnitudes ', Fifth Int. Conf. Image Processing, 1998, 1, p. 62-66
40. Hertzmann, A., Jacobs, C.E., Oliver, N., Curless, B., and Salesin, D.H.: ' Image analogies ', Proc. ACM SIGGRAPH 2001, 2001
41. Wei, L.Y., and Levoy, M.: ' Fast texture synthesis using tree-structured vector quantization ', Proc. ACM-SIGGRAPH, 2000, p. 479-488
42. Ebert, D.S., Musgrave, F.K., Peachey, D., Perlin, K., and Worley, S.: ' Texturing and modeling: a procedural approach ', (Morgan Kaufmann Publishers, 1998)
43. Peachey, D.: ' Solid texturing of complex surfaces ', Proc. SIGGRAPH' 85, 1985, p. 279-286
44. Perlin, K.: ' An image synthesizer ', Proc. SIGGRAPH' 85, 1985, p. 287-296
45. ' Order-independent texture synthesis ', Technical report, 2002
46. Ashikhmin, M.: ' Synthesizing natural textures ', ACM Symp. Interactive 3D Graphics, 2001, p. 217-226
47. Efros, A.A., and Freeman, W.T.: ' Image quilting for texture synthesis and transfer ', Proc. SIGGRAPH 2001, 2001
48. Gonzalez, R.C., and Wintz, P.: ' Digital image processing ', (Addison-Wesley, Reading, MA, 1987)
49. Silberg J.: http://www.cinesite.com/core/press/articles/1998/10_00_98- team.html1998
50. Reinhard, E., Ashikhmin, M., Gooch, B., and Shirley, P.: ' Color transfer between images ', IEEE Comput. Graph. Appl., 2001, 21, p. 34-40 0272-1716
51. Rogowitz, B.E., and Kalvin, A.D.: ' The "Which Blair Project": a quick visual method for evaluating perceptual color maps ', Proc. IEEE Visualization 2001, 2001
52. Pratt, W.K.: ' Digital image processing ', (Wiley, 1991)
53. Welsh, T., Ashikmin, M., and Mueller, K.: ' Transferring color to greyscale images ', Proc. ACM SIGGRAPH 2002, 2002
54. Di Blasi, G., and Reforgiato Recupero, D.: 'Fast colorization of gray images'. Eurographics Italian Chapter, 2004
55. Keys, R.: ' Cubic convolution interpolation for digital image processing ', IEEE Trans. Acoust. Speech Signal Process., 1981, 29, (6), p. 1153-1160 10.1109/TASSP.1981.1163711 0096-3518
56. Fekri, F., Mersereau, R.M., and Schafer, R.W.: ' A generalized interpolative vq method for jointly optimal quantization and interpolation of images ', Proc. Int. Conf. Acoustics, Speech, and Signal Processing (ICASSP), 1998, 5, p. 2657-2660
57. Schreiber, W.F.: ' Fundamentals of eletronic imaging systems ', Springer, New York, 1986)
58. Thurnhofer, S., and Mitra, S.: ' Edge-enhanced image zooming ', Opt. Eng., 1996, 35, (7), p. 1862-1870 10.1117/1.600619
59. Schultz, R.R., and Stevenson, R.L.: ' A bayesian approach to image expansion for improved definition ', IEEE Trans. Image Process., 1994, 3, (3), p. 233-242 10.1109/83.287017 1057-7149
60. Freeman, W.T., and Pasztor, E.C.: ' Learning to estimate scenes from images ', Adv. Neural Information Process. Syst., 1999, 11, p. 775-781
61. Freeman, W.T., Pasztor, E.C., and Carmichael, O.T.: ' Learning low-level vision ', Int. J. Comput. Vis., 2000, 40, (1), p. 25-47 0920-5691
62. ' Example-based superresolution ', 2001, MERL TR-2001-340
63. Hertzmann, A., Jacobs, C.E., Olivier, N., Curless, B., and Salesin, D.H.: ' Image analogies ', ACM SIGGRAPH, 2001