Simon, J.C.,
Guiho, G.,
Picture Representation and Transformations by Computer,
PR(3), No. 2, July 1971, pp. 169-178.
WWW Version.
BibRef
7107
Vapnik, V.N.,
Chervonenkis, A.Y.,
On the Uniform Convergence of Relative Frequencies of Events to Their
Probabilities,
JournalTheory of Probability and Applicationss(16) No. 2, 1971, pp. 264-280.
BibRef
7100
Irani, K.B.,
Jackson, J.H.,
An approach to the optimum implementation of interactive display data
structures,
CGIP(1), No. 3, November 1972, pp. 221-243.
WWW Version.
0501
BibRef
Huang, T.S.,
Coding of Two-Tone Images,
Commun(25), No. 11, November 1977, pp. 1406-1424.
Representation, 2D. Good review of different techniques for binary images.
BibRef
7711
Barrett, R.C.,
Jordan, Jr., B.W.,
Scan Conversion Algorithms for a Cell Organized Raster Display,
CACM(17), 1974, pp. 157-163.
BibRef
7400
Jordan, Jr., B.W.,
Barrett, R.C.,
A Cell Organized Raster Display for Line Drawings,
CACM(17), 1974, pp. 70-77.
BibRef
7400
Shapiro, L.G.,
Data Structures for Picture Processing: A Survey,
CGIP(11), No. 2, October 1979, pp. 162-184.
WWW Version.
Survey, Data Structures.
BibRef
7910
Haralick, R.M.,
Shapiro, L.G.,
A Spatial Data Structure,
Geo-Processing(1), 1980, pp. 313-337.
BibRef
8000
Kitchen, L., and
Callahan, M.,
Optimal Cell Size for Efficient Retrieval of Sparse Data by
Approximate 2D Position Using a Coarse Spatial Array,
CVPR86(357-361).
Very simply store the sparse array as an array of blocks and a
linear search through the list in each block. Works best if the
array is very sparse! the optimal size was around 9 for the
assumptions given in the paper, but it doesn't matter too much if
you are close.
BibRef
8600
Nagy, G.,
What is a 'Good' Data Structure for 2-D Points?,
MDP80(119-135).
BibRef
8000
Gonnet, G.H.,
Munro, J.I.,
Wood, D.,
Direct Dynamic Structures for Some Line Segment Problems,
CVGIP(23), No. 2, August 1983, pp. 178-186.
WWW Version.
BibRef
8308
Scott, D.S.[David S.],
Iyengar, S.S.[Sitharama S.],
TID: A Translation Invariant Data Structure for Storing Images,
CACM(29), No. 5, May 1986, pp. 418-429.
MAT. Based on the MAT, uses maximal black squares in the image.
Discuss union and intersection of such images.
BibRef
8605
Scott, D.S.,
Iyengar, S.S.,
A New Data Structure for Efficient Storing of Images,
PRL(3), 1985, pp. 211-214.
BibRef
8500
Chang, C.C.,
Lin, D.C.,
A Spatial Data Representation: An Adaptive 2D-H String,
PRL(17), No. 2, February 8 1996, pp. 175-185.
BibRef
9602
Hobby, J.D.,
Space-Efficient Outlines from Image Data via Vertex Minimization
and Grid Constraints,
GMIP(59), No. 2, March 1997, pp. 73-88.
9704
BibRef
Abel, D.J.[David J.],
Gaede, V.J.[Volker J.],
Power, R.A.[Robert A.],
Zhou, X.F.[Xiao-Fang],
Caching Strategies for Spatial Joins,
GeoInfo(3), No. 1, March 1999, pp. 33-59.
WWW Version.
BibRef
9903
Son, S.H.[Se-Hoon],
Scan interleaving based scalable binary shape coding,
SP:IC(15), No. 7-8, May 2000, pp. 619-629.
WWW Version.
0005
The listing left out some authors.
BibRef
Braquelaire, J.P.[Jean-Pierre],
Domenger, J.P.[Jean-Philipe],
Representation of segmented images with discrete geometric maps,
IVC(17), No. 10, August 1999, pp. 715-735.
WWW Version.
BibRef
9908
Yi, J.W.[Jong-Won],
Cho, S.J.[Soon-Jae],
Kim, W.J.[Wook-Joong],
Kim, S.D.[Seong-Dae],
Lee, S.J.[Sang-Jee],
A new coding algorithm for arbitrarily shaped image segments,
SP:IC(12), No. 3, June 1998, pp. 231-242.
WWW Version.
BibRef
9806
Accame, M.[Marco],
de Natale, F.G.B.[Francesco G.B.],
Granelli, F.[Fabrizio],
Efficient labeling procedures for image partition encoding,
SP(80), No. 6, June 2000, pp. 1127-1131.
0008
BibRef
Accame, M.,
de Natale, F.G.B.,
Lossless shape coding using the four colors theorem,
ICIP98(I: 281-285).
IEEE DOI Link
9810
BibRef
Couprie, M.[Michel],
Bertrand, G.[Gilles],
Tessellations by connection,
PRL(23), No. 6, April 2002, pp. 637-647.
Elsevier DOI Link
0202
BibRef
Lin, Y.K.[Yih-Kai],
Yen, H.C.[Hsu-Chun],
An omega-automata approach to the representation of bilevel images,
SMC-B(33), No. 3, June 2003, pp. 524-531.
IEEE Abstract.
0308
BibRef
Chung, K.L.[Kuo-Liang],
Huang, H.L.[Hsu-Lien],
Chen, I.C.[I-Chien],
New two-phase spatial data structures with applications to binary
images,
JVCIR(14), No. 2, June 2003, pp. 97-113.
WWW Version.
0306
BibRef
Luengo Hendriks, C.L.[Cris L.],
Revisiting priority queues for image analysis,
PR(43), No. 9, September 2010, pp. 3003-3012.
Elsevier DOI Link
WWW Version.
1006
Image analysis; Priority queue; Heap; Binary search tree; AVL tree;
Splay tree; Red-black tree; Ladder queue; Hierarchical heap;
Grey-weighted distance transform; Watershed
Data structures for image processing.
BibRef
Devir, Z.[Zvi],
Lindenbaum, M.[Michael],
Generalised blind sampling of images,
ICIP08(2904-2907).
IEEE DOI Link
0810
only know the data returned, not where?
BibRef
Pracko, R.,
Polec, J.,
Correlation optimized scanning of segmented images,
WSSIP08(9-12).
IEEE DOI Link
0806
space filling curve to turn into 1-D representation.
BibRef
Servais, M.,
Vlachos, T.,
Davies, T.,
Progressive polygon encoding of segmentation maps,
ICIP04(II: 1121-1124).
IEEE DOI Link
0505
BibRef
Jebara, T.,
Images as bags of pixels,
ICCV03(265-272).
IEEE DOI Link
0311
Model the image as a collection of (X,Y,I) values.
BibRef
Massad, A.[Amin],
Medioni, G.[Gerard],
2-D Shape Decomposition into Overlapping Parts,
VF01(398 ff.).
HTML Version.
0209
BibRef
Garrido, L.,
Salembier, P.,
Casas, J.R.,
Representing and Retrieving Regions using Binary Partition Trees,
ICIP99(II:605-609).
IEEE Abstract.
BibRef
9900
Lam, W.M.,
Shapiro, J.H.,
A class of fast algorithms for the Peano-Hilbert space-filling curve,
ICIP94(I: 638-641).
IEEE DOI Link
9411
BibRef
Perez, A.,
Kamata, S.,
Kawaguchi, E.,
Peano scanning of arbitrary size images,
ICPR92(III:565-568).
IEEE DOI Link
9208
BibRef
Chapter on 2-D Feature Analysis, Extraction and Representations, Shape, Skeletons, Texture continues in
Run-Length Coding Representations and Operations .