| [Deriche, 1987] | R. Deriche. Using Canny's criteria to derive a recursively implemented optimal edge detector. International Journal of Computer Vision, 1(2):167-187, May 1987. Referenced by qgar::DericheGradientImage.
|
| [Freeman and Shapira, 1975] | H. Freeman, and R. Shapira. Determining the Minimum-Area Encasing Rectangle for an arbitrary closed curve. Communications of the ACM, 18(7):409-413, 1975. Referenced by qgar::Maer.
|
| [Graham, 1972] | R.L. Graham. An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters, 1(4):132-133, 1972. Referenced by qgar::GenConvexHull.
|
| [Jain et al, 1995] | R. Jain, R. Kasturi, and B. Schunk. Machine vision, pages 46-47. Mc Graw Hill, New York, March 1995. Referenced by qgar::PruneSmallCCBinaryImage.
|
| [Kanungo et al, 2000] | T. Kanungo, R.M. Haralick, H.S. Baird, W. Stuezle, and D. Madigan. A statistical, nonparametric methodology for document degradation model validation. IEEE Transactions on PAMI, 22(11):1209-1223, November 2000. Referenced by qgar::KanungoBinaryImage
|
| [Kirk, 1992] | David Kirk, editor. Graphics Gems III. Academic Press, New York, 1992. Referenced by qgar::GenSegment.
|
| [Meyer, 1996] | S. Meyer. More Effective C++. Addison-Wesley Professional Computing Series, Addison-Wesley, Reading (MA), 1996 (ISBN 0-201-63371-X). Referenced by qgar::GenImage, qgar::GenPoint.
|
| [Meyer, 2001] | S. Meyer. Effective STL. Addison Wesley, Reading (MA), 2001 (ISBN 0201749629). Referenced by qgar::qstlCloneObject, qgar::qstlDeleteObject.
|
| [Niblack, 1986] | W. Niblack. An introduction to digital image processing, pages 115-116. Prentice-Hall, Englewood Cliffs (NJ), 1986. Referenced by qgar::NiblackBinaryImage.
|
| [O'Rourke, 1994] | J. O'Rourke. Computational Geometry in C. Cambridge University Press, Cambridge (MA), 1994. Referenced by qgar::GenSegment.
|
| [Rosin and West, 1989] | J. Rosin, and G. West. Segmentation of edges into lines and arcs. Image and Vision Computing, 7(2):109-114, May 1989. Referenced by qgar::RWSegmentList.
|
| [Sanniti di Baja, 1994] | G. Sanniti di Baja. Well-shaped, stable, and reversible skeletons from the (3,4)-distance transform. Journal of Visual Communication and Image Representation, 5(1):107-115, March 1994. Referenced by qgar::LabeledSkeletonImage.
|
| [Trier and Jain, 1995] | O.D. Trier, and A.K. Jain. Goal-directed evaluation of binarization methods. IEEE Transactions on PAMI, 17(12):1191-1201, December 1995. Referenced by qgar::NiblackBinaryImage.
|
| [Trier and Taxt, 1995] | D. Trier, and T. Taxt. Improvement of ''integrated function algorithm'' for binarization of document images. Pattern Recognition Letters, 16(3):277-283, March 1995. Referenced by qgar::TTBinaryImage.
|
| [van Herk, 1992] | M. van Herk. A fast algorithm for local minimum and maximum filters on rectangular and octogonal kernels . Pattern Recognition Letters, 13(7):517-521, 1992. Referenced by qgar::LinDilatedImage, qgar::LinErodedImage.
|
| [Vincent, 1993] | L. Vincent. Morphological grayscale reconstruction in image analysis: Applications and efficient algorithms. IEEE Transactions on Image Processing, (2)2:176-201, 1993. Referenced by qgar::GeodesicRecBinaryImage, qgar::GeodesicRecEroBinaryImage, qgar::GeodesicRecEroImage, qgar::GeodesicRecImage.
|
| [Wall and Danielsson, 1984] | K. Wall, and P. Danielsson. A fast sequential method for polygonal approximation of digitized curves. Computer Vision, Graphics and Image Processing, 28(2):220-227, 1984. Referenced by qgar::WDSegmentList.
|
| [Yanowitz and Bruckstein, 1989] | S.D. Yanowitz, and A.M. Bruckstein. A new method for image segmentation. Computer Vision, Graphics, and Image Processing, 46(1):82-95, April 1989. Referenced by qgar::NiblackBinaryImage.
|