Commit 03e213cc authored by Maksim Shabunin's avatar Maksim Shabunin

Doxygen documentation: BiB references and fixes

parent 1523fdcc
......@@ -166,20 +166,27 @@ if(BUILD_DOCS AND HAVE_DOXYGEN)
set(paths_include)
set(paths_doc)
set(paths_bib)
set(deps)
foreach(m ${BASE_MODULES} ${EXTRA_MODULES})
list(FIND blacklist ${m} _pos)
if(${_pos} EQUAL -1)
# include folder
set(header_dir "${OPENCV_MODULE_opencv_${m}_LOCATION}/include")
if(EXISTS "${header_dir}")
list(APPEND paths_include "${header_dir}")
list(APPEND deps ${header_dir})
endif()
# doc folder
set(docs_dir "${OPENCV_MODULE_opencv_${m}_LOCATION}/doc")
if(EXISTS "${docs_dir}")
list(APPEND paths_doc "${docs_dir}")
file(GLOB bib_file "${docs_dir}" "*.bib")
if(EXISTS "${bib_file}")
list(APPEND paths_bib "${bib_file}")
endif()
list(APPEND deps ${docs_dir})
endif()
# BiBTeX file
set(bib_file "${docs_dir}/${m}.bib")
if(EXISTS "${bib_file}")
set(paths_bib "${paths_bib} ${bib_file}")
list(APPEND deps ${bib_file})
endif()
endif()
endforeach()
......@@ -204,10 +211,11 @@ if(BUILD_DOCS AND HAVE_DOXYGEN)
configure_file(Doxyfile.in ${doxyfile} @ONLY)
configure_file(root.markdown.in ${rootfile} @ONLY)
configure_file(mymath.sty "${CMAKE_DOXYGEN_OUTPUT_PATH}/html/mymath.sty" @ONLY)
configure_file(mymath.sty "${CMAKE_DOXYGEN_OUTPUT_PATH}/latex/mymath.sty" @ONLY)
add_custom_target(doxygen
COMMAND ${DOXYGEN_BUILD} ${doxyfile}
DEPENDS ${doxyfile} ${all_headers} ${all_images})
DEPENDS ${doxyfile} ${rootfile} ${bibfile} ${deps})
endif()
if(HAVE_DOC_GENERATOR)
......
# doxygen citelist build workaround
citelist : .*Unexpected new line character.*
@inproceedings{Agrawal08,
author = {Agrawal, M. and Konolige, K. and Blas, M.R.},
title = {CenSurE: Center Surround Extremas for Realtime Feature Detection and Matching},
booktitle = {ECCV08},
year = {2008},
pages = {IV: 102-115},
bibsource = {http://www.visionbib.com/bibliography/twod276.html#TT22337}
@comment{Bib-it,
This file was created by Bib-it 1.4
97 entries written
}
@INCOLLECTION{ABD12,
author = {Alcantarilla, Pablo Fern{\'a}ndez and Bartoli, Adrien and Davison, Andrew J},
title = {KAZE features},
booktitle = {Computer Vision--ECCV 2012},
year = {2012},
pages = {214--227},
publisher = {Springer}
}
@ARTICLE{ANB13,
author = {Alcantarilla, Pablo F and Nuevo, Jes{\'u}s and Bartoli, Adrien},
title = {Fast Explicit Diffusion for Accelerated Features in Nonlinear Scale Spaces},
year = {2011},
pages = {1281--1298},
journal = {Trans. Pattern Anal. Machine Intell},
volume = {34},
number = {7}
}
@ARTICLE{BA83,
author = {Burt, Peter J and Adelson, Edward H},
title = {A multiresolution spline with application to image mosaics},
year = {1983},
pages = {217--236},
journal = {ACM Transactions on Graphics (TOG)},
volume = {2},
number = {4},
publisher = {ACM}
}
@ARTICLE{BL07,
author = {Brown, Matthew and Lowe, David G},
title = {Automatic panoramic image stitching using invariant features},
year = {2007},
pages = {59--73},
journal = {International journal of computer vision},
volume = {74},
number = {1},
publisher = {Springer}
}
@ARTICLE{BT96,
author = {Birchfield, Stan and Tomasi, Carlo},
title = {Depth discontinuities by pixel-to-pixel stereo},
year = {1999},
pages = {269--293},
journal = {International Journal of Computer Vision},
volume = {35},
number = {3},
publisher = {Springer}
}
@ARTICLE{BT98,
author = {Birchfield, Stan and Tomasi, Carlo},
title = {A pixel dissimilarity measure that is insensitive to image sampling},
year = {1998},
pages = {401--406},
journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
volume = {20},
number = {4},
publisher = {IEEE}
}
@ARTICLE{Ballard1981,
author = {Ballard, Dana H},
title = {Generalizing the Hough transform to detect arbitrary shapes},
year = {1981},
pages = {111--122},
journal = {Pattern recognition},
volume = {13},
number = {2},
publisher = {Elsevier}
}
@ARTICLE{Borgefors86,
author = {Borgefors, Gunilla},
title = {Distance transformations in digital images},
year = {1986},
pages = {344--371},
journal = {Computer vision, graphics, and image processing},
volume = {34},
number = {3},
publisher = {Elsevier}
}
@ARTICLE{Bouguet00,
author = {Bouguet, Jean-Yves},
title = {Pyramidal implementation of the affine lucas kanade feature tracker description of the algorithm},
year = {2001},
journal = {Intel Corporation},
volume = {5}
}
@MISC{BouguetMCT,
author = {Bouguet, Jean-Yves},
title = {Camera Calibration Tool box for Matlab [EB/OL]},
year = {2004}
}
@INPROCEEDINGS{Bradski00,
author = {Bradski, GR and Davis, J},
title = {Motion segmentation and pose recognition with motion history gradients},
booktitle = {Applications of Computer Vision, 2000, Fifth IEEE Workshop on.},
year = {2000},
pages = {238--244},
organization = {IEEE}
}
@ARTICLE{Bradski98,
author = {Bradski, Gary R},
title = {Computer vision face tracking for use in a perceptual user interface},
year = {1998},
publisher = {Citeseer}
}
@ARTICLE{Breiman84,
author = {Olshen, LBJFR and Stone, Charles J},
title = {Classification and regression trees},
year = {1984},
journal = {Wadsworth International Group}
}
@INCOLLECTION{Brox2004,
author = {Brox, Thomas and Bruhn, Andres and Papenberg, Nils and Weickert, Joachim},
title = {High accuracy optical flow estimation based on a theory for warping},
booktitle = {Computer Vision-ECCV 2004},
year = {2004},
pages = {25--36},
publisher = {Springer}
}
@ARTICLE{Burges98,
author = {Burges, Christopher JC},
title = {A tutorial on support vector machines for pattern recognition},
year = {1998},
pages = {121--167},
journal = {Data mining and knowledge discovery},
volume = {2},
number = {2},
publisher = {Springer}
}
@INPROCEEDINGS{CL12,
author = {Lu, Cewu and Xu, Li and Jia, Jiaya},
title = {Contrast preserving decolorization},
booktitle = {Computational Photography (ICCP), 2012 IEEE International Conference on},
year = {2012},
pages = {1--7},
organization = {IEEE}
}
@ARTICLE{Canny86,
author = {Canny, John},
title = {A computational approach to edge detection},
year = {1986},
pages = {679--698},
journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
number = {6},
publisher = {IEEE}
}
@ARTICLE{ChambolleEtAl,
author = {Chambolle, Antonin and Caselles, Vicent and Cremers, Daniel and Novaga, Matteo and Pock, Thomas},
title = {An introduction to total variation for image analysis},
year = {2010},
pages = {263--340},
journal = {Theoretical foundations and numerical methods for sparse recovery},
volume = {9},
publisher = {Walter de Gruyter}
}
@INPROCEEDINGS{DD02,
author = {Durand, Fr{\'e}do and Dorsey, Julie},
title = {Fast bilateral filtering for the display of high-dynamic-range images},
booktitle = {ACM Transactions on Graphics (TOG)},
year = {2002},
pages = {257--266},
volume = {21},
number = {3},
organization = {ACM}
}
@INPROCEEDINGS{DM03,
author = {Drago, Fr{\'e}d{\'e}ric and Myszkowski, Karol and Annen, Thomas and Chiba, Norishige},
title = {Adaptive logarithmic mapping for displaying high contrast scenes},
booktitle = {Computer Graphics Forum},
year = {2003},
pages = {419--426},
volume = {22},
number = {3},
organization = {Wiley Online Library}
}
@INPROCEEDINGS{DM97,
author = {Debevec, Paul E and Malik, Jitendra},
title = {Recovering high dynamic range radiance maps from photographs},
booktitle = {ACM SIGGRAPH 2008 classes},
year = {2008},
pages = {31},
organization = {ACM}
}
@INPROCEEDINGS{Dalal2005,
author = {Dalal, Navneet and Triggs, Bill},
title = {Histograms of oriented gradients for human detection},
booktitle = {Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on},
year = {2005},
pages = {886--893},
volume = {1},
organization = {IEEE}
}
@INPROCEEDINGS{Davis97,
author = {Davis, James W and Bobick, Aaron F},
title = {The representation and recognition of human movement using temporal templates},
booktitle = {Computer Vision and Pattern Recognition, 1997. Proceedings., 1997 IEEE Computer Society Conference on},
year = {1997},
pages = {928--934},
organization = {IEEE}
}
@INPROCEEDINGS{EM11,
author = {Gastal, Eduardo SL and Oliveira, Manuel M},
title = {Domain transform for edge-aware image and video processing},
booktitle = {ACM Transactions on Graphics (TOG)},
year = {2011},
pages = {69},
volume = {30},
number = {4},
organization = {ACM}
}
@ARTICLE{EP08,
author = {Evangelidis, Georgios D and Psarakis, Emmanouil Z},
title = {Parametric image alignment using enhanced correlation coefficient maximization},
year = {2008},
pages = {1858--1865},
journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
volume = {30},
number = {10},
publisher = {IEEE}
}
@INPROCEEDINGS{FGD2003,
author = {Li, Liyuan and Huang, Weimin and Gu, Irene YH and Tian, Qi},
title = {Foreground object detection from videos containing complex background},
booktitle = {Proceedings of the eleventh ACM international conference on Multimedia},
year = {2003},
pages = {2--10},
organization = {ACM}
}
@ARTICLE{FHT98,
author = {Friedman, Jerome and Hastie, Trevor and Tibshirani, Robert},
title = {Additive Logistic Regression: a Statistical View of Boosting},
year = {1998}
}
@INPROCEEDINGS{FL02,
author = {Fattal, Raanan and Lischinski, Dani and Werman, Michael},
title = {Gradient domain high dynamic range compression},
booktitle = {ACM Transactions on Graphics (TOG)},
year = {2002},
pages = {249--256},
volume = {21},
number = {3},
organization = {ACM}
}
@INCOLLECTION{Farneback2003,
author = {Farneb{\"a}ck, Gunnar},
title = {Two-frame motion estimation based on polynomial expansion},
booktitle = {Image Analysis},
year = {2003},
pages = {363--370},
publisher = {Springer}
}
@INPROCEEDINGS{Farsiu03,
author = {Farsiu, Sina and Robinson, Dirk and Elad, Michael and Milanfar, Peyman},
title = {Fast and robust super-resolution},
booktitle = {Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference on},
year = {2003},
pages = {II--291},
volume = {2},
organization = {IEEE}
}
@TECHREPORT{Felzenszwalb04,
author = {Felzenszwalb, Pedro and Huttenlocher, Daniel},
title = {Distance transforms of sampled functions},
year = {2004},
institution = {Cornell University}
}
@ARTICLE{Felzenszwalb10,
author = {Felzenszwalb, Pedro F and Girshick, Ross B and McAllester, David and Ramanan, Deva},
title = {Object detection with discriminatively trained part-based models},
year = {2010},
pages = {1627--1645},
journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
volume = {32},
number = {9},
publisher = {IEEE}
}
@ARTICLE{Felzenszwalb2006,
author = {Felzenszwalb, Pedro F and Huttenlocher, Daniel P},
title = {Efficient belief propagation for early vision},
year = {2006},
pages = {41--54},
journal = {International journal of computer vision},
volume = {70},
number = {1},
publisher = {Springer}
}
@INPROCEEDINGS{Fitzgibbon95,
author = {Fitzgibbon, Andrew W and Fisher, Robert B},
title = {A buyer's guide to conic fitting},
booktitle = {Proceedings of the 6th British conference on Machine vision (Vol. 2)},
year = {1995},
pages = {513--522},
organization = {BMVA Press}
}
@INPROCEEDINGS{G11,
author = {Grundmann, Matthias and Kwatra, Vivek and Essa, Irfan},
title = {Auto-directed video stabilization with robust l1 optimal camera paths},
booktitle = {Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on},
year = {2011},
pages = {225--232},
organization = {IEEE}
}
@ARTICLE{GW03,
author = {Ward, Greg},
title = {Fast, robust image registration for compositing high dynamic range photographs from hand-held exposures},
year = {2003},
pages = {17--30},
journal = {Journal of graphics tools},
volume = {8},
number = {2},
publisher = {Taylor \& Francis}
}
@INPROCEEDINGS{Gold2012,
author = {Godbehere, Andrew B and Matsukawa, Akihiro and Goldberg, Ken},
title = {Visual tracking of human visitors under variable-lighting conditions for a responsive audio art installation},
booktitle = {American Control Conference (ACC), 2012},
year = {2012},
pages = {4305--4312},
organization = {IEEE}
}
@ARTICLE{Guil1999,
author = {Guil, N and Gonzalez-Linares, Jos{\'e} Mar{\'\i}a and Zapata, Emilio L},
title = {Bidimensional shape detection using an invariant approach},
year = {1999},
pages = {1025--1038},
journal = {Pattern Recognition},
volume = {32},
number = {6},
publisher = {Elsevier}
}
@ARTICLE{HH08,
author = {Hirschmuller, Heiko},
title = {Stereo processing by semiglobal matching and mutual information},
year = {2008},
pages = {328--341},
journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
volume = {30},
number = {2},
publisher = {IEEE}
}
@ARTICLE{HTF01,
author = {Trevor, Hastie and Robert, Tibshirani and Jerome, Friedman},
title = {The elements of statistical learning: data mining, inference and prediction},
year = {2001},
pages = {371--406},
journal = {New York: Springer-Verlag},
volume = {1},
number = {8}
}
@ARTICLE{Hartley99,
author = {Hartley, Richard I},
title = {Theory and practice of projective rectification},
year = {1999},
pages = {115--127},
journal = {International Journal of Computer Vision},
volume = {35},
number = {2},
publisher = {Springer}
}
@BOOK{HartleyZ00,
author = {Hartley, Richard and Zisserman, Andrew},
title = {Multiple view geometry in computer vision},
year = {2003},
publisher = {Cambridge university press}
}
@ARTICLE{Horn81,
author = {Horn, Berthold KP and Schunck, Brian G},
title = {Determining Optical Flow},
year = {1981},
pages = {185--203},
journal = {Artificial Intelligence},
volume = {17}
}
@ARTICLE{Hu62,
author = {Hu, Ming-Kuei},
title = {Visual pattern recognition by moment invariants},
year = {1962},
pages = {179--187},
journal = {Information Theory, IRE Transactions on},
volume = {8},
number = {2},
publisher = {IEEE}
}
@ARTICLE{Javier2012,
author = {S{\'a}nchez P{\'e}rez, Javier and Meinhardt-Llopis, Enric and Facciolo, Gabriele},
title = {TV-L1 optical flow estimation},
year = {2012}
}
@ARTICLE{KleeLaskowski85,
author = {Klee, Victor and Laskowski, Michael C},
title = {Finding the smallest triangles containing a given convex polygon},
year = {1985},
pages = {359--375},
journal = {Journal of Algorithms},
volume = {6},
number = {3},
publisher = {Elsevier}
}
@INPROCEEDINGS{Kolmogorov03,
author = {Kim, Junhwan and Kolmogorov, Vladimir and Zabih, Ramin},
title = {Visual correspondence using energy minimization and mutual information},
booktitle = {Computer Vision, 2003. Proceedings. Ninth IEEE International Conference on},
year = {2003},
pages = {1033--1040},
organization = {IEEE}
}
@INPROCEEDINGS{LCS11,
author = {Leutenegger, Stefan and Chli, Margarita and Siegwart, Roland Yves},
title = {BRISK: Binary robust invariant scalable keypoints},
booktitle = {Computer Vision (ICCV), 2011 IEEE International Conference on},
year = {2011},
pages = {2548--2555},
organization = {IEEE}
}
@ARTICLE{LibSVM,
author = {Chang, Chih-Chung and Lin, Chih-Jen},
title = {LIBSVM: a library for support vector machines},
year = {2011},
pages = {27},
journal = {ACM Transactions on Intelligent Systems and Technology (TIST)},
volume = {2},
number = {3},
publisher = {ACM}
}
@INPROCEEDINGS{Lienhart02,
author = {Lienhart, Rainer and Maydt, Jochen},
title = {An extended set of haar-like features for rapid object detection},
booktitle = {Image Processing. 2002. Proceedings. 2002 International Conference on},
year = {2002},
pages = {I--900},
volume = {1},
organization = {IEEE}
}
@INPROCEEDINGS{Lucas81,
author = {Lucas, Bruce D and Kanade, Takeo and others},
title = {An iterative image registration technique with an application to stereo vision.},
booktitle = {IJCAI},
year = {1981},
pages = {674--679},
volume = {81}
}
@MISC{MA13,
author = {Mordvintsev, Alexander},
title = {ROF and TV-L1 denoising with Primal-Dual algorithm},
url = {http://znah.net/rof-and-tv-l1-denoising-with-primal-dual-algorithm.html}
}
@ARTICLE{MHT2011,
author = {Getreuer, Pascal},
title = {Malvar-He-Cutler Linear Image Demosaicking},
year = {2011},
journal = {Image Processing on Line}
}
@INPROCEEDINGS{MK07,
author = {Mertens, Tom and Kautz, Jan and Van Reeth, Frank},
title = {Exposure fusion},
booktitle = {Computer Graphics and Applications, 2007. PG'07. 15th Pacific Conference on},
year = {2007},
pages = {382--390},
organization = {IEEE}
}
@ARTICLE{MM06,
author = {Mantiuk, Rafal and Myszkowski, Karol and Seidel, Hans-Peter},
title = {A perceptual framework for contrast processing of high dynamic range images},
year = {2006},
pages = {286--308},
journal = {ACM Transactions on Applied Perception (TAP)},
volume = {3},
number = {3},
publisher = {ACM}
}
@INCOLLECTION{MOG2001,
author = {KaewTraKulPong, Pakorn and Bowden, Richard},
title = {An improved adaptive background mixture model for real-time tracking with shadow detection},
booktitle = {Video-Based Surveillance Systems},
year = {2002},
pages = {135--144},
publisher = {Springer}
}
@ARTICLE{Malis,
author = {Malis, Ezio and Vargas, Manuel and others},
title = {Deeper understanding of the homography decomposition for vision-based control},
year = {2007}
}
@ARTICLE{Matas00,
author = {Matas, Jiri and Galambos, Charles and Kittler, Josef},
title = {Robust detection of lines using the progressive probabilistic hough transform},
year = {2000},
pages = {119--137},
journal = {Computer Vision and Image Understanding},
volume = {78},
number = {1},
publisher = {Elsevier}
}
@INPROCEEDINGS{Meyer92,
author = {Meyer, Fernand},
title = {Color image segmentation},
booktitle = {Image Processing and its Applications, 1992., International Conference on},
year = {1992},
pages = {303--306},
organization = {IET}
}
@INCOLLECTION{Mitzel09,
author = {Mitzel, Dennis and Pock, Thomas and Schoenemann, Thomas and Cremers, Daniel},
title = {Video super resolution using duality based tv-l 1 optical flow},
booktitle = {Pattern Recognition},
year = {2009},
pages = {432--441},
publisher = {Springer}
}
@INPROCEEDINGS{Muja2009,
author = {Muja, Marius and Lowe, David G},
title = {Fast Approximate Nearest Neighbors with Automatic Algorithm Configuration},
booktitle = {VISAPP (1)},
year = {2009},
pages = {331--340}
}
@ARTICLE{Nister03,
author = {Nist{\'e}r, David},
title = {An efficient solution to the five-point relative pose problem},
year = {2004},
pages = {756--770},
journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
volume = {26},
number = {6},
publisher = {IEEE}
}
@ARTICLE{OF06,
author = {Matsushita, Yasuyuki and Ofek, Eyal and Ge, Weina and Tang, Xiaoou and Shum, Heung-Yeung},
title = {Full-frame video stabilization with motion inpainting},
year = {2006},
pages = {1150--1163},
journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
volume = {28},
number = {7},
publisher = {IEEE}
}
@ARTICLE{ORourke86,
author = {O'Rourke, Joseph and Aggarwal, Alok and Maddila, Sanjeev and Baldwin, Michael},
title = {An optimal algorithm for finding minimal enclosing triangles},
year = {1986},
pages = {258--269},
journal = {Journal of Algorithms},
volume = {7},
number = {2},
publisher = {Elsevier}
}
@INPROCEEDINGS{PM03,
author = {P{\'e}rez, Patrick and Gangnet, Michel and Blake, Andrew},
title = {Poisson image editing},
booktitle = {ACM Transactions on Graphics (TOG)},
year = {2003},
pages = {313--318},
volume = {22},
number = {3},
organization = {ACM}
}
@INPROCEEDINGS{Puzicha1997,
author = {Puzicha, Jan and Hofmann, Thomas and Buhmann, Joachim M},
title = {Non-parametric similarity measures for unsupervised texture segmentation and image retrieval},
booktitle = {Computer Vision and Pattern Recognition, 1997. Proceedings., 1997 IEEE Computer Society Conference on},
year = {1997},
pages = {267--272},
organization = {IEEE}
}
@INPROCEEDINGS{RB99,
author = {Robertson, Mark A and Borman, Sean and Stevenson, Robert L},
title = {Dynamic range improvement through multiple exposures},
booktitle = {Image Processing, 1999. ICIP 99. Proceedings. 1999 International Conference on},
year = {1999},
pages = {159--163},
volume = {3},
organization = {IEEE}
}
@ARTICLE{RD05,
author = {Reinhard, Erik and Devlin, Kate},
title = {Dynamic range reduction inspired by photoreceptor physiology},
year = {2005},
pages = {13--24},
journal = {Visualization and Computer Graphics, IEEE Transactions on},
volume = {11},
number = {1},
publisher = {IEEE}
}
@INPROCEEDINGS{RPROP93,
author = {Riedmiller, Martin and Braun, Heinrich},
title = {A direct adaptive method for faster backpropagation learning: The RPROP algorithm},
booktitle = {Neural Networks, 1993., IEEE International Conference on},
year = {1993},
pages = {586--591},
organization = {IEEE}
}
@INPROCEEDINGS{RRKB11,
author = {Rublee, Ethan and Rabaud, Vincent and Konolige, Kurt and Bradski, Gary},
title = {ORB: an efficient alternative to SIFT or SURF},
booktitle = {Computer Vision (ICCV), 2011 IEEE International Conference on},
year = {2011},
pages = {2564--2571},
organization = {IEEE}
}
@TECHREPORT{RS04,
author = {Szeliski, R},
title = {Image alignment and stitching: a tutorial, Microsoft Corporation, Redmond, WA},
year = {2004},
institution = {MSR-TR-2004-92}
}
@BOOK{RS10,
author = {Szeliski, Richard},
title = {Computer vision: algorithms and applications},
year = {2010},
publisher = {Springer}
}
@ARTICLE{Rafael12,
author = {von Gioi, Rafael Grompone and Jakubowicz, J{\'e}r{\'e}mie and Morel, Jean-Michel and Randall, Gregory},
title = {LSD: a line segment detector},
year = {2012}
}
@INCOLLECTION{Rosten06,
author = {Rosten, Edward and Drummond, Tom},
title = {Machine learning for high-speed corner detection},
booktitle = {Computer Vision--ECCV 2006},
year = {2006},
pages = {430--443},
publisher = {Springer}
}
@ARTICLE{Rubner2000,
author = {Rubner, Yossi and Tomasi, Carlo and Guibas, Leonidas J},
title = {The earth mover's distance as a metric for image retrieval},
year = {2000},
pages = {99--121},
journal = {International Journal of Computer Vision},
volume = {40},
number = {2},
publisher = {Springer}
}
@ARTICLE{RubnerSept98,
author = {Rubner, Yossi and Tomasi, Carlo and Guibas, Leonidas J},
title = {The Earth Mover''s Distance as a Metric for Image Retrieval},
year = {1998},
publisher = {Stanford University}
}
@ARTICLE{SS00,
author = {Shum, Heung-Yeung and Szeliski, Richard},
title = {Systems and experiment paper: Construction of panoramic image mosaics with global and local alignment},
year = {2000},
pages = {101--130},
journal = {International Journal of Computer Vision},
volume = {36},
number = {2},
publisher = {Springer}
}
@INPROCEEDINGS{Shi94,
author = {Shi, Jianbo and Tomasi, Carlo},
title = {Good features to track},
booktitle = {Computer Vision and Pattern Recognition, 1994. Proceedings CVPR'94., 1994 IEEE Computer Society Conference on},
year = {1994},
pages = {593--600},
organization = {IEEE}
}
@ARTICLE{Sklansky82,
author = {Sklansky, Jack},
title = {Finding the convex hull of a simple polygon},
year = {1982},
pages = {79--83},
journal = {Pattern Recognition Letters},
volume = {1},
number = {2},
publisher = {Elsevier}
}
@ARTICLE{Slabaugh,
author = {Slabaugh, Gregory G},
title = {Computing Euler angles from a rotation matrix},
year = {1999},
pages = {2000},
journal = {Retrieved on August},
volume = {6}
}
@MISC{SteweniusCFS,
author = {Stewenius, Henrik},
title = {Calibrated Fivepoint solver},
url = {http://www.vis.uky.edu/~stewe/FIVEPOINT/}
}
@ARTICLE{Suzuki85,
author = {Suzuki, Satoshi and others},
title = {Topological structural analysis of digitized binary images by border following},
year = {1985},
pages = {32--46},
journal = {Computer Vision, Graphics, and Image Processing},
volume = {30},
number = {1},
publisher = {Elsevier}
}
@ARTICLE{TehChin89,
author = {Teh, C-H and Chin, Roland T.},
title = {On the detection of dominant points on digital curves},
year = {1989},
pages = {859--872},
journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
volume = {11},
number = {8},
publisher = {IEEE}
}
@ARTICLE{Telea04,
author = {Telea, Alexandru},
title = {An image inpainting technique based on the fast marching method},
year = {2004},
pages = {23--34},
journal = {Journal of graphics tools},
volume = {9},
number = {1},
publisher = {Taylor \& Francis}
}
@INPROCEEDINGS{UES01,
author = {Uyttendaele, Matthew and Eden, Ashley and Skeliski, R},
title = {Eliminating ghosting and exposure artifacts in image mosaics},
booktitle = {Computer Vision and Pattern Recognition, 2001. CVPR 2001. Proceedings of the 2001 IEEE Computer Society Conference on},
year = {2001},
pages = {II--509},
volume = {2},
organization = {IEEE}
}
@INPROCEEDINGS{V03,
author = {Kwatra, Vivek and Sch{\"o}dl, Arno and Essa, Irfan and Turk, Greg and Bobick, Aaron},
title = {Graphcut textures: image and video synthesis using graph cuts},
booktitle = {ACM Transactions on Graphics (ToG)},
year = {2003},
pages = {277--286},
volume = {22},
number = {3},
organization = {ACM}
}
@INPROCEEDINGS{Viola01,
author = {Viola, Paul and Jones, Michael},
title = {Rapid object detection using a boosted cascade of simple features},
booktitle = {Computer Vision and Pattern Recognition, 2001. CVPR 2001. Proceedings of the 2001 IEEE Computer Society Conference on},
year = {2001},
pages = {I--511},
volume = {1},
organization = {IEEE}
}
@INPROCEEDINGS{WJ10,
author = {Xu, Wei and Mulligan, Jane},
title = {Performance evaluation of color correction approaches for automatic multi-view image and video stitching},
booktitle = {Computer Vision and Pattern Recognition (CVPR), 2010 IEEE Conference on},
year = {2010},
pages = {263--270},
organization = {IEEE}
}
@MISC{Welch95,
author = {Welch, Greg and Bishop, Gary},
title = {An introduction to the Kalman filter},
year = {1995}
}
@INPROCEEDINGS{Yang2010,
author = {Yang, Qingxiong and Wang, Liang and Ahuja, Narendra},
title = {A constant-space belief propagation algorithm for stereo matching},
booktitle = {Computer Vision and Pattern Recognition (CVPR), 2010 IEEE Conference on},
year = {2010},
pages = {1458--1465},
organization = {IEEE}
}
@ARTICLE{Yuen90,
author = {Yuen, HK and Princen, John and Illingworth, John and Kittler, Josef},
title = {Comparative study of Hough transform methods for circle finding},
year = {1990},
pages = {71--77},
journal = {Image and Vision Computing},
volume = {8},
number = {1},
publisher = {Elsevier}
}
@INCOLLECTION{Zach2007,
author = {Zach, Christopher and Pock, Thomas and Bischof, Horst},
title = {A duality based approach for realtime TV-L 1 optical flow},
booktitle = {Pattern Recognition},
year = {2007},
pages = {214--223},
publisher = {Springer}
}
@ARTICLE{Zhang2000,
author = {Zhang, Zhengyou},
title = {A flexible new technique for camera calibration},
year = {2000},
pages = {1330--1334},
journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
volume = {22},
number = {11},
publisher = {IEEE}
}
@INPROCEEDINGS{Zivkovic2004,
author = {Zivkovic, Zoran},
title = {Improved adaptive Gaussian mixture model for background subtraction},
booktitle = {Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on},
year = {2004},
pages = {28--31},
volume = {2},
organization = {IEEE}
}
@ARTICLE{Zivkovic2006,
author = {Zivkovic, Zoran and van der Heijden, Ferdinand},
title = {Efficient adaptive density estimation per image pixel for the task of background subtraction},
year = {2006},
pages = {773--780},
journal = {Pattern recognition letters},
volume = {27},
number = {7},
publisher = {Elsevier}
}
@INPROCEEDINGS{arthur_kmeanspp_2007,
author = {Arthur, David and Vassilvitskii, Sergei},
title = {k-means++: The advantages of careful seeding},
booktitle = {Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms},
year = {2007},
pages = {1027--1035},
organization = {Society for Industrial and Applied Mathematics}
}
@ARTICLE{mitchell2005logistic,
author = {Mitchell, Tom M},
title = {Logistic Regression},
year = {2005},
pages = {701},
journal = {Machine learning},
volume = {10}
}
@inproceedings{Bay06,
address = {Graz Austria},
author = {Bay, H. and Tuytelaars, T. and Van Gool, L.},
booktitle = {9th European Conference on Computer Vision},
keywords = {local-feature, sift},
month = {May},
title = {SURF: Speeded Up Robust Features},
year = {2006}
}
@inproceedings{BT96,
author = {Tomasi, C. and Birchfield, S.T.},
title = {Depth Discontinuities by Pixel-to-Pixel Stereo},
booktitle = {STAN-CS},
year = {1996},
bibsource = {http://www.visionbib.com/bibliography/stereo413.html#TT35577}
}
@article{Borgefors86,
author = {Borgefors, Gunilla},
title = {Distance transformations in digital images},
journal = {Comput. Vision Graph. Image Process.},
volume = {34},
number = {3},
year = {1986},
issn = {0734-189X},
pages = {344--371},
doi = {http://dx.doi.org/10.1016/S0734-189X(86)80047-0},
publisher = {Academic Press Professional, Inc.},
address = {San Diego, CA, USA},
}
@MISC{Bouguet00,
author = {Jean-Yves Bouguet},
title = {Pyramidal Implementation of the Lucas-Kanade Feature Tracker},
year = {2000},
abstract = {},
keywords = {Optical Flow, Lucas Kanade, Pyramidal Method},
}
@inproceedings{Bradski00,
author = {Davis, J.W. and Bradski, G.R.},
title = {Motion Segmentation and Pose Recognition with Motion History Gradients},
booktitle = {WACV00},
year = {2000},
pages = {238-244}
}
@inproceedings{Bradski98,
author = {Bradski, G.R.},
title = {Computer Vision Face Tracking for Use in a Perceptual User Interface},
booktitle = {Intel},
year = {1998},
bibsource = {http://www.visionbib.com/bibliography/people911.html#TT90944}
}
@inproceedings{Davis97,
author = {Davis, J.W. and Bobick, A.F.},
title = {The Representation and Recognition of Action Using Temporal Templates},
booktitle = {CVPR97},
year = {1997},
pages = {928-934}
}
@techreport{Felzenszwalb04,
author = {Felzenszwalb, Pedro F. and Huttenlocher, Daniel P.},
edition = {TR2004-1963},
institution = {Cornell Computing and Information Science},
keywords = {Distance Transform, Hausdorff},
month = {September},
title = {Distance Transforms of Sampled Functions},
year = {2004}
}
@article{Felzenszwalb10,
author = {Felzenszwalb, P.F. and Girshick, R.B. and McAllester, D. and Ramanan, D.},
title = {Object Detection with Discriminatively Trained Part Based Models},
journal = {PAMI},
volume = {32},
year = {2010},
number = {9},
month = {September},
pages = {1627-1645},
bibsource = {http://www.visionbib.com/bibliography/bib/457.html#BB45794}
}
@article{Hartley99,
author = {Hartley, R.I.},
title = {Theory and Practice of Projective Rectification},
journal = {IJCV},
volume = {35},
year = {1999},
number = {2},
month = {November},
pages = {115-127},
bibsource = {http://www.visionbib.com/bibliography/image-proc118.html#TT9097}
}
@article{HH08,
author = {Hirschmuller, H.},
title = "Stereo Processing by Semiglobal Matching and Mutual Information",
journal = {PAMI},
volume = {30},
year = {2008},
number = {2},
month = {February},
pages = {328-341},
bibsource = {http://www.visionbib.com/bibliography/stereo422.html#TT36174}
}
@article{Horn81,
author = {Horn, B.K.P. and Schunck, B.G.},
title = {Determining Optical Flow},
journal = {AI},
volume = {17},
year = {1981},
number = {1-3},
month = {August},
pages = {185-203},
bibsource = {http://www.visionbib.com/bibliography/optic-f733.html#TT69126}
}
@inproceedings{Kolmogorov03,
author = {Kim, Junhwan and Kolmogorov, Vladimir and Zabih, Ramin},
title = {Visual Correspondence Using Energy Minimization and Mutual Information},
booktitle = {ICCV '03: Proceedings of the Ninth IEEE International Conference on Computer Vision},
year = {2003},
isbn = {0-7695-1950-4},
pages = {1033},
publisher = {IEEE Computer Society},
address = {Washington, DC, USA},
}
@inproceedings{Lucas81,
author = {Lucas, B. D. and Kanade, T.},
title = {An Iterative Image Registration Technique with an Application to Stereo Vision (IJCAI)},
booktitle = {Proceedings of the 7th International Joint Conference on Artificial Intelligence (IJCAI '81)},
pages = {674-679},
month = {April},
year = {1981},
Notes = {A more complete version is available as Proceedings DARPA Image Understanding Workshop, April 1981, pp.121-130. When you refer to this work, please refer to the IJCAI paper.}
}
@article{Matas00,
author = {Matas, J. and Galambos, C. and Kittler, J.V.},
title = {Robust Detection of Lines Using the Progressive Probabilistic Hough Transform},
journal = {CVIU},
volume = {78},
year = {2000},
number = {1},
month = {April},
pages = {119-137},
bibsource = {http://www.visionbib.com/bibliography/edge264.html#TT21167}
}
@inproceedings{Meyer92,
author = {Meyer, F.},
title = {Color image segmentation},
booktitle = {ICIP92},
year = {1992},
pages = {303–306}
}
@inproceedings{Shi94,
author = {Tomasi, C. and Shi, J.},
title = {Good Features to Track},
booktitle = {CVPR94},
year = {1994},
pages = {593-600},
bibsource = {http://www.visionbib.com/bibliography/motion-f716.html#TT61248}
}
@article{Sklansky82,
author = {Sklansky, J.},
title = {Finding the Convex Hull of a Simple Polygon},
journal = {PRL},
volume = {1},
year = {1982},
pages = {79-83},
bibsource = {http://www.visionbib.com/bibliography/twod283.html#TT22999}
}
@article{Suzuki85,
author = {Suzuki, S. and Abe, K.},
title = {Topological Structural Analysis of Digitized Binary Images by Border Following},
journal = {CVGIP},
volume = {30},
year = {1985},
number = {1},
month = {April},
pages = {32-46},
bibsource = {http://www.visionbib.com/bibliography/twod289.html#TT23296}
}
@article{TehChin89,
author = {Teh, C.H. and Chin, R.T.},
title = {On the Detection of Dominant Points on Digital Curve},
journal = {PAMI},
volume = {11},
year = {1989},
number = {8},
month = {August},
pages = {859-872},
bibsource = {http://www.visionbib.com/bibliography/edge257.html#TT20546}
}
@article{Telea04,
author = {Alexandru Telea},
title = {An Image Inpainting Technique Based on the Fast Marching Method},
journal = {Journal of Graphics, GPU, and Game Tools},
volume = {9},
number = {1},
pages = {23-34},
year = {2004},
}
@misc{Welch95,
author = {Greg Welch and Gary Bishop},
title = {An Introduction to the Kalman Filter},
year = {1995}
}
@article{Yuen90,
author = {Yuen, H. K. and Princen, J. and Illingworth, J. and Kittler, J.},
title = {Comparative study of Hough transform methods for circle finding},
journal = {Image Vision Comput.},
volume = {8},
number = {1},
year = {1990},
issn = {0262-8856},
pages = {71--77},
doi = {http://dx.doi.org/10.1016/0262-8856(90)90059-E},
publisher = {Butterworth-Heinemann},
address = {Newton, MA, USA},
}
@inproceedings{arthur_kmeanspp_2007,
title = {k-means++: the advantages of careful seeding},
booktitle = {Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms},
publisher = {Society for Industrial and Applied Mathematics Philadelphia, PA, USA},
author = {D. Arthur and S. Vassilvitskii},
year = {2007},
pages = {1027--1035}
}
@inproceedings{muja_flann_2009,
author = {Marius Muja and David G. Lowe},
title = {Fast Approximate Nearest Neighbors with Automatic Algorithm Configuration},
booktitle = {International Conference on Computer Vision Theory and Applications (VISSAPP'09)},
year = {2009},
pages = {331-340},
}
@inproceedings{qx_csbp,
author = {Q. Yang and L. Wang and N. Ahuja},
title = {A Constant-Space Belief Propagation Algorithm for Stereo Matching},
booktitle = {CVPR},
year = {2010}
}
@article{felzenszwalb_bp,
author = {Pedro F. Felzenszwalb and Daniel P. Huttenlocher},
title = {Efficient Belief Propagation for Early Vision},
journal = {International Journal of Computer Vision},
volume = {70},
number = {1},
year = {2006},
month = {October}
}
@article{dalal_hog,
author = {Navneet Dalal and Bill Triggs},
title = {Histogram of Oriented Gradients for Human Detection},
booktitle = {CVPR},
year = {2005}
}
@inproceedings{Puzicha1997,
author = {Puzicha, Jan and Hofmann, Thomas and Buhmann, Joachim M.},
title = {Non-parametric Similarity Measures for Unsupervised Texture Segmentation and Image Retrieval},
booktitle = {Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)},
series = {CVPR '97},
year = {1997},
isbn = {0-8186-7822-4},
pages = {267--},
url = {http://dl.acm.org/citation.cfm?id=794189.794386},
acmid = {794386},
publisher = {IEEE Computer Society},
address = {Washington, DC, USA},
}
@techreport{RubnerSept98,
author = {Rubner, Yossi and Tomasi, Carlo and Guibas, Leonidas J.},
title = {The Earth Mover's Distance As a Metric for Image Retrieval},
year = {1998},
source = {http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail\&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TN-98-86},
publisher = {Stanford University},
address = {Stanford, CA, USA},
}
@article{Rubner2000,
author = {Rubner, Yossi and Tomasi, Carlo and Guibas, Leonidas J.},
title = {The Earth Mover's Distance As a Metric for Image Retrieval},
journal = {Int. J. Comput. Vision},
issue_date = {Nov. 2000},
volume = {40},
number = {2},
month = nov,
year = {2000},
issn = {0920-5691},
pages = {99--121},
numpages = {23},
url = {http://dx.doi.org/10.1023/A:1026543900054},
doi = {10.1023/A:1026543900054},
acmid = {365881},
publisher = {Kluwer Academic Publishers},
address = {Hingham, MA, USA},
}
@article{Hu62,
author={Ming-Kuei Hu},
journal={Information Theory, IRE Transactions on},
title={Visual pattern recognition by moment invariants},
year={1962},
month={February},
volume={8},
number={2},
pages={179-187},
doi={10.1109/TIT.1962.1057692},
ISSN={0096-1000},
}
@inproceedings{Fitzgibbon95,
author = {Fitzgibbon, Andrew W. and Fisher, Robert B.},
title = {A Buyer's Guide to Conic Fitting},
booktitle = {Proceedings of the 6th British Conference on Machine Vision (Vol. 2)},
series = {BMVC '95},
year = {1995},
isbn = {0-9521898-2-8},
location = {Birmingham, United Kingdom},
pages = {513--522},
numpages = {10},
url = {http://dl.acm.org/citation.cfm?id=243124.243148},
acmid = {243148},
publisher = {BMVA Press},
address = {Surrey, UK, UK},
}
@article{KleeLaskowski85,
author = {Klee, Victor and Laskowski, Michael C.},
ee = {http://dx.doi.org/10.1016/0196-6774(85)90005-7},
journal = {J. Algorithms},
number = 3,
pages = {359-375},
title = {Finding the Smallest Triangles Containing a Given Convex Polygon.},
url = {http://dblp.uni-trier.de/db/journals/jal/jal6.html#KleeL85},
volume = 6,
year = 1985
}
@article{Canny86,
author = {Canny, J},
title = {A Computational Approach to Edge Detection},
journal = {IEEE Trans. Pattern Anal. Mach. Intell.},
issue_date = {June 1986},
volume = {8},
number = {6},
month = jun,
year = {1986},
issn = {0162-8828},
pages = {679--698},
numpages = {20},
url = {http://dx.doi.org/10.1109/TPAMI.1986.4767851},
doi = {10.1109/TPAMI.1986.4767851},
acmid = {11275},
publisher = {IEEE Computer Society},
address = {Washington, DC, USA}
}
# '''[Bradski98]''' G.R. Bradski. Computer vision face tracking as a component of a perceptual user interface. In Workshop on Applications of Computer Vision, pages 214?219, Princeton, NJ, Oct. 1998.<<BR>> Updated version can be found at http://www.intel.com/technology/itj/q21998/articles/art\_2.htm.<<BR>> Also, it is included into OpenCV distribution ([[attachment:camshift.pdf]])
# '''[Burt81]''' P. J. Burt, T. H. Hong, A. Rosenfeld. Segmentation and Estimation of Image Region Properties Through Cooperative Hierarchical Computation. IEEE Tran. On SMC, Vol. 11, N.12, 1981, pp. 802-809.
# '''[Canny86]''' J. Canny. A Computational Approach to Edge Detection, IEEE Trans. on Pattern Analysis and Machine Intelligence, 8(6), pp. 679-698 (1986).
# '''[Davis97]''' J. Davis and Bobick. The Representation and Recognition of Action Using Temporal Templates. MIT Media Lab Technical Report 402, 1997.
# '''[DeMenthon92]''' Daniel F. DeMenthon and Larry S. Davis. Model-Based Object Pose in 25 Lines of Code. In Proceedings of ECCV '92, pp. 335-343, 1992.
# '''[Fitzgibbon95]''' Andrew W. Fitzgibbon, R.B.Fisher. A Buyer?s Guide to Conic Fitting. Proc.5th British Machine Vision Conference, Birmingham, pp. 513-522, 1995.
# '''[Ford98]''' Adrian Ford, Alan Roberts. Colour Space Conversions. http://www.poynton.com/PDFs/coloureq.pdf
# '''[Horn81]''' Berthold K.P. Horn and Brian G. Schunck. Determining Optical Flow. Artificial Intelligence, 17, pp. 185-203, 1981.
# '''[Hu62]''' M. Hu. Visual Pattern Recognition by Moment Invariants, IRE Transactions on Information Theory, 8:2, pp. 179-187, 1962.
# '''[Iivarinen97]''' Jukka Iivarinen, Markus Peura, Jaakko Srel, and Ari Visa. Comparison of Combined Shape Descriptors for Irregular Objects, 8th British Machine Vision Conference, BMVC'97.<<BR>>http://www.cis.hut.fi/research/IA/paper/publications/bmvc97/bmvc97.html
# '''[Jahne97]''' B. Jahne. Digital Image Processing. Springer, New York, 1997.
# '''[Lucas81]''' Lucas, B., and Kanade, T. An Iterative Image Registration Technique with an Application to Stereo Vision, Proc. of 7th International Joint Conference on Artificial Intelligence (IJCAI), pp. 674-679.
# '''[Kass88]''' M. Kass, A. Witkin, and D. Terzopoulos. Snakes: Active Contour Models, International Journal of Computer Vision, pp. 321-331, 1988.
# '''[Lienhart02]''' Rainer Lienhart and Jochen Maydt. An Extended Set of Haar-like Features for Rapid Object Detection. IEEE ICIP 2002, Vol. 1, pp. 900-903, Sep. 2002.<<BR>> This paper, as well as the extended technical report, can be retrieved at http://www.lienhart.de/Publications/publications.html
# '''[Matas98]''' J.Matas, C.Galambos, J.Kittler. Progressive Probabilistic Hough Transform. British Machine Vision Conference, 1998.
# '''[Rosenfeld73]''' A. Rosenfeld and E. Johnston. Angle Detection on Digital Curves. IEEE Trans. Computers, 22:875-878, 1973.
# '''[RubnerJan98]''' Y. Rubner. C. Tomasi, L.J. Guibas. Metrics for Distributions with Applications to Image Databases. Proceedings of the 1998 IEEE International Conference on Computer Vision, Bombay, India, January 1998, pp. 59-66.
# '''[RubnerSept98]''' Y. Rubner. C. Tomasi, L.J. Guibas. The Earth Mover?s Distance as a Metric for Image Retrieval. Technical Report STAN-CS-TN-98-86, Department of Computer Science, Stanford University, September 1998.
# '''[RubnerOct98]''' Y. Rubner. C. Tomasi. Texture Metrics. Proceeding of the IEEE International Conference on Systems, Man, and Cybernetics, San-Diego, CA, October 1998, pp. 4601-4607. http://robotics.stanford.edu/~rubner/publications.html
# '''[Serra82]''' J. Serra. Image Analysis and Mathematical Morphology. Academic Press, 1982.
# '''[Schiele00]''' Bernt Schiele and James L. Crowley. Recognition without Correspondence Using Multidimensional Receptive Field Histograms. In International Journal of Computer Vision 36 (1), pp. 31-50, January 2000.
# '''[Suzuki85]''' S. Suzuki, K. Abe. Topological Structural Analysis of Digital Binary Images by Border Following. CVGIP, v.30, n.1. 1985, pp. 32-46.
# '''[Teh89]''' C.H. Teh, R.T. Chin. On the Detection of Dominant Points on Digital Curves. - IEEE Tr. PAMI, 1989, v.11, No.8, p. 859-872.
# '''[Trucco98]''' Emanuele Trucco, Alessandro Verri. Introductory Techniques for 3-D Computer Vision. Prentice Hall, Inc., 1998.
# '''[Viola01]''' Paul Viola and Michael J. Jones. Rapid Object Detection using a Boosted Cascade of Simple Features. IEEE CVPR, 2001.<<BR>> The paper is available online at http://www.ai.mit.edu/people/viola/
# '''[Welch95]''' Greg Welch, Gary Bishop. An Introduction To the Kalman Filter. Technical Report TR95-041, University of North Carolina at Chapel Hill, 1995.<<BR>> Online version is available at http://www.cs.unc.edu/~welch/kalman/kalmanIntro.html
# '''[Williams92]''' D. J. Williams and M. Shah. A Fast Algorithm for Active Contours and Curvature Estimation. CVGIP: Image Understanding, Vol. 55, No. 1, pp. 14-26, Jan., 1992. http://www.cs.ucf.edu/~vision/papers/shah/92/WIS92A.pdf.
# '''[Yuen03]''' H.K. Yuen, J. Princen, J. Illingworth and J. Kittler. Comparative study of Hough Transform methods for circle finding.<<BR>>http://www.sciencedirect.com/science/article/B6V09-48TCV4N-5Y/2/91f551d124777f7a4cf7b18325235673
# '''[Yuille89]''' A.Y.Yuille, D.S.Cohen, and P.W.Hallinan. Feature Extraction from Faces Using Deformable Templates in CVPR, pp. 104-109, 1989.
# '''[Zhang96]''' Z. Zhang. Parameter Estimation Techniques: A Tutorial with Application to Conic Fitting, Image and Vision Computing Journal, 1996.
# '''[Zhang99]''' Z. Zhang. Flexible Camera Calibration By Viewing a Plane From Unknown Orientations. International Conference on Computer Vision (ICCV'99), Corfu, Greece, pages 666-673, September 1999.
# '''[Zhang00]''' Z. Zhang. A Flexible New Technique for Camera Calibration. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(11):1330-1334, 2000.
......@@ -343,7 +343,7 @@ and a rotation matrix.
It optionally returns three rotation matrices, one for each axis, and the three Euler angles in
degrees (as the return value) that could be used in OpenGL. Note, there is always more than one
sequence of rotations about the three principle axes that results in the same orientation of an
object, eg. see @cite Slabaugh. Returned tree rotation matrices and corresponding three Euler angules
object, eg. see @cite Slabaugh . Returned tree rotation matrices and corresponding three Euler angules
are only one of the possible solutions.
*/
CV_EXPORTS_W Vec3d RQDecomp3x3( InputArray src, OutputArray mtxR, OutputArray mtxQ,
......@@ -368,7 +368,7 @@ matrix and the position of a camera.
It optionally returns three rotation matrices, one for each axis, and three Euler angles that could
be used in OpenGL. Note, there is always more than one sequence of rotations about the three
principle axes that results in the same orientation of an object, eg. see @cite Slabaugh. Returned
principle axes that results in the same orientation of an object, eg. see @cite Slabaugh . Returned
tree rotation matrices and corresponding three Euler angules are only one of the possible solutions.
The function is based on RQDecomp3x3 .
......@@ -745,7 +745,7 @@ supplied distCoeffs matrix is used. Otherwise, it is set to 0.
@param criteria Termination criteria for the iterative optimization algorithm.
The function estimates the intrinsic camera parameters and extrinsic parameters for each of the
views. The algorithm is based on @cite Zhang2000 and @cite BouguetMCT. The coordinates of 3D object
views. The algorithm is based on @cite Zhang2000 and @cite BouguetMCT . The coordinates of 3D object
points and their corresponding 2D projections in each view must be specified. That may be achieved
by using an object with a known geometry and easily detectable feature points. Such an object is
called a calibration rig or calibration pattern, and OpenCV has built-in support for a chessboard as
......@@ -1014,7 +1014,7 @@ The function computes the rectification transformations without knowing intrinsi
cameras and their relative position in the space, which explains the suffix "uncalibrated". Another
related difference from stereoRectify is that the function outputs not the rectification
transformations in the object (3D) space, but the planar perspective transformations encoded by the
homography matrices H1 and H2 . The function implements the algorithm @cite Hartley99.
homography matrices H1 and H2 . The function implements the algorithm @cite Hartley99 .
@note
While the algorithm does not need to know the intrinsic parameters of the cameras, it heavily
......@@ -1185,7 +1185,7 @@ confidence (probability) that the estimated matrix is correct.
@param mask Output array of N elements, every element of which is set to 0 for outliers and to 1
for the other points. The array is computed only in the RANSAC and LMedS methods.
This function estimates essential matrix based on the five-point algorithm solver in @cite Nister03.
This function estimates essential matrix based on the five-point algorithm solver in @cite Nister03 .
@cite SteweniusCFS is also a related. The epipolar geometry is described by the following equation:
\f[[p_2; 1]^T K^T E K [p_1; 1] = 0 \\\f]\f[K =
......@@ -1211,7 +1211,7 @@ CV_EXPORTS_W Mat findEssentialMat( InputArray points1, InputArray points2,
@param R2 Another possible rotation matrix.
@param t One possible translation.
This function decompose an essential matrix E using svd decomposition @cite HartleyZ00. Generally 4
This function decompose an essential matrix E using svd decomposition @cite HartleyZ00 . Generally 4
possible poses exists for a given E. They are \f$[R_1, t]\f$, \f$[R_1, -t]\f$, \f$[R_2, t]\f$, \f$[R_2, -t]\f$. By
decomposing E, you can only get the direction of the translation, so the function returns unit t.
*/
......@@ -1236,7 +1236,7 @@ matrix E. Only these inliers will be used to recover pose. In the output mask on
which pass the cheirality check.
This function decomposes an essential matrix using decomposeEssentialMat and then verifies possible
pose hypotheses by doing cheirality check. The cheirality check basically means that the
triangulated 3D points should have positive depth. Some details can be found in @cite Nister03.
triangulated 3D points should have positive depth. Some details can be found in @cite Nister03 .
This function can be used to process output E and mask from findEssentialMat. In this scenario,
points1 and points2 are the same input for findEssentialMat. :
......@@ -1421,7 +1421,7 @@ This function extracts relative camera motion between two views observing a plan
homography H induced by the plane. The intrinsic camera matrix K must also be provided. The function
may return up to four mathematical solution sets. At least two of the solutions may further be
invalidated if point correspondences are available by applying positive depth constraint (all points
must be in front of the camera). The decomposition method is described in detail in @cite Malis.
must be in front of the camera). The decomposition method is described in detail in @cite Malis .
*/
CV_EXPORTS_W int decomposeHomographyMat(InputArray H,
InputArray K,
......@@ -1605,6 +1605,7 @@ public:
int mode = StereoSGBM::MODE_SGBM);
};
//! @} calib3d
/** @brief The methods in this namespace use a so-called fisheye camera model.
@ingroup calib3d_fisheye
......@@ -1851,8 +1852,6 @@ namespace fisheye
//! @} calib3d_fisheye
}
//! @} calib3d
} // cv
#endif
......@@ -75,6 +75,9 @@
@defgroup core_opengl OpenGL interoperability
@defgroup core_ipp Intel IPP Asynchronous C/C++ Converters
@defgroup core_optim Optimization Algorithms
@defgroup core_directx DirectX interoperability
@defgroup core_eigen Eigen support
@defgroup core_opencl OpenCL support
@}
*/
......
......@@ -69,7 +69,7 @@ namespace cv { namespace cuda {
The class discriminates between foreground and background pixels by building and maintaining a model
of the background. Any pixel which does not fit this model is then deemed to be foreground. The
class implements algorithm described in @cite MOG2001.
class implements algorithm described in @cite MOG2001 .
@sa BackgroundSubtractorMOG
......@@ -119,7 +119,7 @@ CV_EXPORTS Ptr<cuda::BackgroundSubtractorMOG>
The class discriminates between foreground and background pixels by building and maintaining a model
of the background. Any pixel which does not fit this model is then deemed to be foreground. The
class implements algorithm described in @cite MOG2004.
class implements algorithm described in @cite Zivkovic2004 .
@sa BackgroundSubtractorMOG2
*/
......@@ -154,7 +154,7 @@ CV_EXPORTS Ptr<cuda::BackgroundSubtractorMOG2>
The class discriminates between foreground and background pixels by building and maintaining a model
of the background. Any pixel which does not fit this model is then deemed to be foreground. The
class implements algorithm described in @cite GMG2012.
class implements algorithm described in @cite Gold2012 .
*/
class CV_EXPORTS BackgroundSubtractorGMG : public cv::BackgroundSubtractor
{
......@@ -208,7 +208,7 @@ CV_EXPORTS Ptr<cuda::BackgroundSubtractorGMG>
of the background.
Any pixel which does not fit this model is then deemed to be foreground. The class implements
algorithm described in @cite FGD2003.
algorithm described in @cite FGD2003 .
@sa BackgroundSubtractor
*/
class CV_EXPORTS BackgroundSubtractorFGD : public cv::BackgroundSubtractor
......
......@@ -205,6 +205,7 @@ struct NcvPoint2D32u
__host__ __device__ NcvPoint2D32u(Ncv32u x_, Ncv32u y_) : x(x_), y(y_) {}
};
//! @cond IGNORED
NCV_CT_ASSERT(sizeof(NcvBool) <= 4);
NCV_CT_ASSERT(sizeof(Ncv64s) == 8);
......@@ -223,6 +224,7 @@ NCV_CT_ASSERT(sizeof(NcvRect32u) == 4 * sizeof(Ncv32u));
NCV_CT_ASSERT(sizeof(NcvSize32u) == 2 * sizeof(Ncv32u));
NCV_CT_ASSERT(sizeof(NcvPoint2D32u) == 2 * sizeof(Ncv32u));
//! @endcond
//==============================================================================
//
......
......@@ -114,7 +114,7 @@ StereoBeliefPropagation uses a truncated linear model for the data cost and disc
\f[DiscTerm = \min (disc \_ single \_ jump \cdot \lvert f_1-f_2 \rvert , max \_ disc \_ term)\f]
For more details, see @cite Felzenszwalb2006.
For more details, see @cite Felzenszwalb2006 .
By default, StereoBeliefPropagation uses floating-point arithmetics and the CV_32FC1 type for
messages. But it can also use fixed-point arithmetics and the CV_16SC1 message type for better
......@@ -192,7 +192,7 @@ CV_EXPORTS Ptr<cuda::StereoBeliefPropagation>
/** @brief Class computing stereo correspondence using the constant space belief propagation algorithm. :
The class implements algorithm described in @cite Yang2010. StereoConstantSpaceBP supports both local
The class implements algorithm described in @cite Yang2010 . StereoConstantSpaceBP supports both local
minimum and global minimum data cost initialization algorithms. For more details, see the paper
mentioned above. By default, a local algorithm is used. To enable a global algorithm, set
use_local_init_data_cost to false .
......@@ -203,7 +203,7 @@ StereoConstantSpaceBP uses a truncated linear model for the data cost and discon
\f[DiscTerm = \min (disc \_ single \_ jump \cdot \lvert f_1-f_2 \rvert , max \_ disc \_ term)\f]
For more details, see @cite Yang2010.
For more details, see @cite Yang2010 .
By default, StereoConstantSpaceBP uses floating-point arithmetics and the CV_32FC1 type for
messages. But it can also use fixed-point arithmetics and the CV_16SC1 message type for better
......
......@@ -215,7 +215,7 @@ typedef Feature2D DescriptorExtractor;
//! @addtogroup features2d_main
//! @{
/** @brief Class implementing the BRISK keypoint detector and descriptor extractor, described in @cite LCS11.
/** @brief Class implementing the BRISK keypoint detector and descriptor extractor, described in @cite LCS11 .
*/
class CV_EXPORTS_W BRISK : public Feature2D
{
......@@ -246,7 +246,7 @@ public:
/** @brief Class implementing the ORB (*oriented BRIEF*) keypoint detector and descriptor extractor
described in @cite RRKB11. The algorithm uses FAST in pyramids to detect stable keypoints, selects
described in @cite RRKB11 . The algorithm uses FAST in pyramids to detect stable keypoints, selects
the strongest features using FAST or Harris response, finds their orientation using first-order
moments and computes the descriptors using BRIEF (where the coordinates of random point pairs (or
k-tuples) are rotated according to the measured orientation).
......@@ -369,7 +369,7 @@ circle around this pixel.
FastFeatureDetector::TYPE_9_16, FastFeatureDetector::TYPE_7_12,
FastFeatureDetector::TYPE_5_8
Detects corners using the FAST algorithm by @cite Rosten06.
Detects corners using the FAST algorithm by @cite Rosten06 .
@note In Python API, types are given as cv2.FAST_FEATURE_DETECTOR_TYPE_5_8,
cv2.FAST_FEATURE_DETECTOR_TYPE_7_12 and cv2.FAST_FEATURE_DETECTOR_TYPE_9_16. For corner
......@@ -505,7 +505,7 @@ public:
//! @addtogroup features2d_main
//! @{
/** @brief Class implementing the KAZE keypoint detector and descriptor extractor, described in @cite ABD12.
/** @brief Class implementing the KAZE keypoint detector and descriptor extractor, described in @cite ABD12 .
@note AKAZE descriptor can only be used with KAZE or AKAZE keypoints .. [ABD12] KAZE Features. Pablo
F. Alcantarilla, Adrien Bartoli and Andrew J. Davison. In European Conference on Computer Vision
......@@ -556,7 +556,7 @@ public:
CV_WRAP virtual int getDiffusivity() const = 0;
};
/** @brief Class implementing the AKAZE keypoint detector and descriptor extractor, described in @cite ANB13. :
/** @brief Class implementing the AKAZE keypoint detector and descriptor extractor, described in @cite ANB13 . :
@note AKAZE descriptors can only be used with KAZE or AKAZE keypoints. Try to avoid using *extract*
and *detect* instead of *operator()* due to performance reasons. .. [ANB13] Fast Explicit Diffusion
......
......@@ -969,7 +969,7 @@ An example using the LineSegmentDetector
/** @brief Line segment detector class
following the algorithm described at @cite Rafael12.
following the algorithm described at @cite Rafael12 .
*/
class CV_EXPORTS_W LineSegmentDetector : public Algorithm
{
......@@ -1418,7 +1418,7 @@ CV_EXPORTS_W void Laplacian( InputArray src, OutputArray dst, int ddepth,
An example on using the canny edge detector
*/
/** @brief Finds edges in an image using the Canny algorithm @cite Canny86.
/** @brief Finds edges in an image using the Canny algorithm @cite Canny86 .
The function finds edges in the input image image and marks them in the output map edges using the
Canny algorithm. The smallest value between threshold1 and threshold2 is used for edge linking. The
......@@ -2940,7 +2940,7 @@ An example using the watershed algorithm
/** @brief Performs a marker-based image segmentation using the watershed algorithm.
The function implements one of the variants of watershed, non-parametric marker-based segmentation
algorithm, described in @cite Meyer92.
algorithm, described in @cite Meyer92 .
Before passing the image to the function, you have to roughly outline the desired regions in the
image markers with positive (\>0) indices. So, every region is represented as one or more connected
......@@ -3050,7 +3050,7 @@ The functions distanceTransform calculate the approximate or precise distance fr
image pixel to the nearest zero pixel. For zero image pixels, the distance will obviously be zero.
When maskSize == DIST_MASK_PRECISE and distanceType == DIST_L2 , the function runs the
algorithm described in @cite Felzenszwalb04. This algorithm is parallelized with the TBB library.
algorithm described in @cite Felzenszwalb04 . This algorithm is parallelized with the TBB library.
In other cases, the algorithm @cite Borgefors86 is used. This means that for a pixel the function
finds the shortest path to the nearest zero pixel consisting of basic shifts: horizontal, vertical,
......@@ -3371,7 +3371,7 @@ CV_EXPORTS_W int connectedComponentsWithStats(InputArray image, OutputArray labe
/** @brief Finds contours in a binary image.
The function retrieves contours from the binary image using the algorithm @cite Suzuki85. The contours
The function retrieves contours from the binary image using the algorithm @cite Suzuki85 . The contours
are a useful tool for shape analysis and object detection and recognition. See squares.c in the
OpenCV sample directory.
......
......@@ -87,7 +87,7 @@ nearest feature vectors from both classes (in case of 2-class classifier) is max
vectors that are the closest to the hyper-plane are called *support vectors*, which means that the
position of other vectors does not affect the hyper-plane (the decision function).
SVM implementation in OpenCV is based on @cite LibSVM.
SVM implementation in OpenCV is based on @cite LibSVM .
Prediction with SVM
-------------------
......@@ -98,7 +98,7 @@ the raw response from SVM (in the case of regression, 1-class or 2-class classif
@defgroup ml_decsiontrees Decision Trees
The ML classes discussed in this section implement Classification and Regression Tree algorithms
described in @cite Breiman84.
described in @cite Breiman84 .
The class cv::ml::DTrees represents a single decision tree or a collection of decision trees. It's
also a base class for RTrees and Boost.
......@@ -184,7 +184,7 @@ qualitative output is called *classification*, while predicting the quantitative
Boosting is a powerful learning concept that provides a solution to the supervised classification
learning task. It combines the performance of many "weak" classifiers to produce a powerful
committee @cite HTF01. A weak classifier is only required to be better than chance, and thus can be
committee @cite HTF01 . A weak classifier is only required to be better than chance, and thus can be
very simple and computationally inexpensive. However, many of them smartly combine results to a
strong classifier that often outperforms most "monolithic" strong classifiers such as SVMs and
Neural Networks.
......@@ -197,7 +197,7 @@ The boosted model is based on \f$N\f$ training examples \f${(x_i,y_i)}1N\f$ with
the learning task at hand. The desired two-class output is encoded as -1 and +1.
Different variants of boosting are known as Discrete Adaboost, Real AdaBoost, LogitBoost, and Gentle
AdaBoost @cite FHT98. All of them are very similar in their overall structure. Therefore, this chapter
AdaBoost @cite FHT98 . All of them are very similar in their overall structure. Therefore, this chapter
focuses only on the standard two-class Discrete AdaBoost algorithm, outlined below. Initially the
same weight is assigned to each sample (step 2). Then, a weak classifier \f$f_{m(x)}\f$ is trained on
the weighted training data (step 3a). Its weighted training error and scaling factor \f$c_m\f$ is
......@@ -236,7 +236,7 @@ induced classifier. This process is controlled with the weight_trim_rate paramet
with the summary fraction weight_trim_rate of the total weight mass are used in the weak
classifier training. Note that the weights for **all** training examples are recomputed at each
training iteration. Examples deleted at a particular iteration may be used again for learning some
of the weak classifiers further @cite FHT98.
of the weak classifiers further @cite FHT98 .
Prediction with Boost
---------------------
......@@ -425,8 +425,8 @@ Regression is a binary classification algorithm which is closely related to Supp
like digit recognition (i.e. recognizing digitis like 0,1 2, 3,... from the given images). This
version of Logistic Regression supports both binary and multi-class classifications (for multi-class
it creates a multiple 2-class classifiers). In order to train the logistic regression classifier,
Batch Gradient Descent and Mini-Batch Gradient Descent algorithms are used (see @cite BatchDesWiki).
Logistic Regression is a discriminative classifier (see @cite LogRegTomMitch for more details).
Batch Gradient Descent and Mini-Batch Gradient Descent algorithms are used (see <http://en.wikipedia.org/wiki/Gradient_descent_optimization>).
Logistic Regression is a discriminative classifier (see <http://www.cs.cmu.edu/~tom/NewChapters.html> for more details).
Logistic Regression is implemented as a C++ class in LogisticRegression.
In Logistic Regression, we try to optimize the training paramater \f$\theta\f$ such that the hypothesis
......
......@@ -53,7 +53,7 @@ Haar Feature-based Cascade Classifier for Object Detection
----------------------------------------------------------
The object detector described below has been initially proposed by Paul Viola @cite Viola01 and
improved by Rainer Lienhart @cite Lienhart02.
improved by Rainer Lienhart @cite Lienhart02 .
First, a classifier (namely a *cascade of boosted classifiers working with haar-like features*) is
trained with a few hundred sample views of a particular object (i.e., a face or a car), called
......
......@@ -97,7 +97,7 @@ needs to be inpainted.
by the algorithm.
@param flags Inpainting method that could be one of the following:
- **INPAINT_NS** Navier-Stokes based method [Navier01]
- **INPAINT_TELEA** Method by Alexandru Telea @cite Telea04.
- **INPAINT_TELEA** Method by Alexandru Telea @cite Telea04 .
The function reconstructs the selected image area from the pixel near the area boundary. The
function may be used to remove dust and scratches from a scanned photo, or to remove undesirable
......@@ -220,12 +220,12 @@ as the variational problem, primal-dual algorithm then can be used to perform de
exactly what is implemented.
It should be noted, that this implementation was taken from the July 2013 blog entry
@cite Mordvintsev, which also contained (slightly more general) ready-to-use source code on Python.
@cite MA13 , which also contained (slightly more general) ready-to-use source code on Python.
Subsequently, that code was rewritten on C++ with the usage of openCV by Vadim Pisarevsky at the end
of July 2013 and finally it was slightly adapted by later authors.
Although the thorough discussion and justification of the algorithm involved may be found in
@cite ChambolleEtAl, it might make sense to skim over it here, following @cite Mordvintsev. To begin
@cite ChambolleEtAl, it might make sense to skim over it here, following @cite MA13 . To begin
with, we consider the 1-byte gray-level images as the functions from the rectangular domain of
pixels (it may be seen as set
\f$\left\{(x,y)\in\mathbb{N}\times\mathbb{N}\mid 1\leq x\leq n,\;1\leq y\leq m\right\}\f$ for some
......@@ -290,9 +290,9 @@ logarithmic domain.
Since it's a global operator the same function is applied to all the pixels, it is controlled by the
bias parameter.
Optional saturation enhancement is possible as described in @cite FL02.
Optional saturation enhancement is possible as described in @cite FL02 .
For more information see @cite DM03.
For more information see @cite DM03 .
*/
class CV_EXPORTS_W TonemapDrago : public Tonemap
{
......@@ -322,7 +322,7 @@ This implementation uses regular bilateral filter from opencv.
Saturation enhancement is possible as in ocvTonemapDrago.
For more information see @cite DD02.
For more information see @cite DD02 .
*/
class CV_EXPORTS_W TonemapDurand : public Tonemap
{
......@@ -358,7 +358,7 @@ createTonemapDurand(float gamma = 1.0f, float contrast = 4.0f, float saturation
Mapping function is controlled by adaptation parameter, that is computed using light adaptation and
color adaptation.
For more information see @cite RD05.
For more information see @cite RD05 .
*/
class CV_EXPORTS_W TonemapReinhard : public Tonemap
{
......@@ -389,7 +389,7 @@ createTonemapReinhard(float gamma = 1.0f, float intensity = 0.0f, float light_ad
transforms contrast values to HVS response and scales the response. After this the image is
reconstructed from new contrast values.
For more information see @cite MM06.
For more information see @cite MM06 .
*/
class CV_EXPORTS_W TonemapMantiuk : public Tonemap
{
......@@ -435,7 +435,7 @@ It is invariant to exposure, so exposure values and camera response are not nece
In this implementation new image regions are filled with zeros.
For more information see @cite GW03.
For more information see @cite GW03 .
*/
class CV_EXPORTS_W AlignMTB : public AlignExposures
{
......@@ -510,7 +510,7 @@ public:
function as linear system. Objective function is constructed using pixel values on the same position
in all images, extra term is added to make the result smoother.
For more information see @cite DM97.
For more information see @cite DM97 .
*/
class CV_EXPORTS_W CalibrateDebevec : public CalibrateCRF
{
......@@ -538,7 +538,7 @@ CV_EXPORTS_W Ptr<CalibrateDebevec> createCalibrateDebevec(int samples = 70, floa
/** @brief Inverse camera response function is extracted for each brightness value by minimizing an objective
function as linear system. This algorithm uses all image pixels.
For more information see @cite RB99.
For more information see @cite RB99 .
*/
class CV_EXPORTS_W CalibrateRobertson : public CalibrateCRF
{
......@@ -579,7 +579,7 @@ public:
/** @brief The resulting HDR image is calculated as weighted average of the exposures considering exposure
values and camera response.
For more information see @cite DM97.
For more information see @cite DM97 .
*/
class CV_EXPORTS_W MergeDebevec : public MergeExposures
{
......@@ -602,7 +602,7 @@ well-exposedness measures.
The resulting image doesn't require tonemapping and can be converted to 8-bit image by multiplying
by 255, but it's recommended to apply gamma correction and/or linear tonemapping.
For more information see @cite MK07.
For more information see @cite MK07 .
*/
class CV_EXPORTS_W MergeMertens : public MergeExposures
{
......@@ -638,7 +638,7 @@ createMergeMertens(float contrast_weight = 1.0f, float saturation_weight = 1.0f,
/** @brief The resulting HDR image is calculated as weighted average of the exposures considering exposure
values and camera response.
For more information see @cite RB99.
For more information see @cite RB99 .
*/
class CV_EXPORTS_W MergeRobertson : public MergeExposures
{
......@@ -656,7 +656,7 @@ CV_EXPORTS_W Ptr<MergeRobertson> createMergeRobertson();
/** @brief Transforms a color image to a grayscale image. It is a basic tool in digital printing, stylized
black-and-white photograph rendering, and in many single channel image processing applications
@cite CL12.
@cite CL12 .
@param src Input 8-bit 3-channel image.
@param grayscale Output 8-bit 1-channel image.
......@@ -673,7 +673,7 @@ CV_EXPORTS_W void decolor( InputArray src, OutputArray grayscale, OutputArray co
deformations) or local changes concerned to a selection. Here we are interested in achieving local
changes, ones that are restricted to a region manually selected (ROI), in a seamless and effortless
manner. The extent of the changes ranges from slight distortions to complete replacement by novel
content @cite PM03.
content @cite PM03 .
@param src Input 8-bit 3-channel image.
@param dst Input 8-bit 3-channel image.
......@@ -749,7 +749,7 @@ CV_EXPORTS_W void textureFlattening(InputArray src, InputArray mask, OutputArray
//! @{
/** @brief Filtering is the fundamental operation in image and video processing. Edge-preserving smoothing
filters are used in many different applications @cite EM11.
filters are used in many different applications @cite EM11 .
@param src Input 8-bit 3-channel image.
@param dst Output 8-bit 3-channel image.
......
......@@ -61,7 +61,7 @@ class it's possible to configure/remove some steps, i.e. adjust the stitching pi
the particular needs. All building blocks from the pipeline are available in the detail namespace,
one can combine and use them separately.
The implemented stitching pipeline is very similar to the one proposed in @cite BL07.
The implemented stitching pipeline is very similar to the one proposed in @cite BL07 .
![image](StitchingPipeline.jpg)
......
......@@ -229,7 +229,7 @@ public:
enum CostType { COST_COLOR, COST_COLOR_GRAD };
};
/** @brief Minimum graph cut-based seam estimator. See details in @cite V03.
/** @brief Minimum graph cut-based seam estimator. See details in @cite V03 .
*/
class CV_EXPORTS GraphCutSeamFinder : public GraphCutSeamFinderBase, public SeamFinder
{
......
......@@ -50,7 +50,7 @@
The Super Resolution module contains a set of functions and classes that can be used to solve the
problem of resolution enhancement. There are a few methods implemented, most of them are descibed in
the papers @cite Farsiu03 and @cite Mitzel09.
the papers @cite Farsiu03 and @cite Mitzel09 .
*/
......
......@@ -65,7 +65,7 @@ enum { OPTFLOW_USE_INITIAL_FLOW = 4,
@param criteria Stop criteria for the underlying meanShift.
returns
(in old interfaces) Number of iterations CAMSHIFT took to converge
The function implements the CAMSHIFT object tracking algorithm @cite Bradski98. First, it finds an
The function implements the CAMSHIFT object tracking algorithm @cite Bradski98 . First, it finds an
object center using meanShift and then adjusts the window size and finds the optimal rotation. The
function returns the rotated rectangle structure that includes the object position, size, and
orientation. The next position of the search window can be obtained with RotatedRect::boundingRect()
......@@ -159,7 +159,7 @@ feature is filtered out and its flow is not processed, so it allows to remove ba
performance boost.
The function implements a sparse iterative version of the Lucas-Kanade optical flow in pyramids. See
@cite Bouguet00. The function is parallelized with the TBB library.
@cite Bouguet00 . The function is parallelized with the TBB library.
@note
......@@ -258,7 +258,7 @@ enum
MOTION_HOMOGRAPHY = 3
};
/** @brief Finds the geometric transform (warp) between two images in terms of the ECC criterion @cite EP08.
/** @brief Finds the geometric transform (warp) between two images in terms of the ECC criterion @cite EP08 .
@param templateImage single-channel template image; CV_8U or CV_32F array.
@param inputImage single-channel input image which should be warped with the final warpMatrix in
......@@ -314,7 +314,7 @@ CV_EXPORTS_W double findTransformECC( InputArray templateImage, InputArray input
/** @brief Kalman filter class.
The class implements a standard Kalman filter <http://en.wikipedia.org/wiki/Kalman_filter>,
@cite Welch95. However, you can modify transitionMatrix, controlMatrix, and measurementMatrix to get
@cite Welch95 . However, you can modify transitionMatrix, controlMatrix, and measurementMatrix to get
an extended Kalman filter functionality. See the OpenCV sample kalman.cpp.
@note
......@@ -383,7 +383,7 @@ public:
/** @brief "Dual TV L1" Optical Flow Algorithm.
The class implements the "Dual TV L1" optical flow algorithm described in @cite Zach2007 and
@cite Javier2012.
@cite Javier2012 .
Here are important members of the class that control the algorithm, which you can set after
constructing the class instance:
......
......@@ -172,4 +172,3 @@
@end
//! @} videoio_ios
......@@ -48,7 +48,7 @@
The video stabilization module contains a set of functions and classes that can be used to solve the
problem of video stabilization. There are a few methods implemented, most of them are descibed in
the papers @cite OF06 and @cite G11. However, there are some extensions and deviations from the orginal
the papers @cite OF06 and @cite G11 . However, there are some extensions and deviations from the orginal
paper methods.
### References
......@@ -68,7 +68,7 @@ Both the functions and the classes are available.
@defgroup videostab_marching Fast Marching Method
The Fast Marching Method @cite T04 is used in of the video stabilization routines to do motion and
The Fast Marching Method @cite Telea04 is used in of the video stabilization routines to do motion and
color inpainting. The method is implemented is a flexible way and it's made public for other users.
@}
......
......@@ -55,7 +55,7 @@ namespace cv
namespace videostab
{
//! @addtogroup vieostab
//! @addtogroup videostab
//! @{
class CV_EXPORTS ISparseOptFlowEstimator
......
......@@ -52,7 +52,7 @@ namespace cv
namespace videostab
{
//! @addtogroup vieostab
//! @addtogroup videostab
//! @{
class CV_EXPORTS IOutlierRejector
......
......@@ -51,7 +51,7 @@ namespace cv
namespace videostab
{
//! @addtogroup vieostab
//! @addtogroup videostab
//! @{
template <typename T> inline T& at(int idx, std::vector<T> &items)
......
......@@ -60,7 +60,7 @@ namespace cv
namespace videostab
{
//! @addtogroup vieostab
//! @addtogroup videostab
//! @{
class CV_EXPORTS StabilizerBase
......
......@@ -54,7 +54,7 @@ namespace cv
namespace videostab
{
//! @addtogroup vieostab
//! @addtogroup videostab
//! @{
class CV_EXPORTS WobbleSuppressorBase
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment