Abstract
A theoretical and experimental analysis related to the effect of noise in the task of vertex identification in unknown shapes is presented. Shapes are seen as real functions of their closed boundary. An alternative global perspective of curvature is examined providing insight into the process of noise-enabled vertex localization. The analysis reveals that noise facilitates in the localization of certain vertices. The concept of noising is thus considered and a relevant global method for localizing Global Vertices is investigated in relation to local methods under the presence of increasing noise. Theoretical analysis reveals that induced noise can indeed help localizing certain vertices if combined with global descriptors. Experiments with noise and a comparison to localized methods validate the theoretical results.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Notes
Supremum of all pair-wise distances between points of \(\varvec{\alpha }\).
Directed to the interior of the bounded region defined by \(\varvec{\alpha }\).
The fact that remote points are perceptually important has been demonstrated in Raftopoulos and Kollias (2011), where shape matching scores in benchmark datasets where improved by permitting correspondences only to remote points.
References
Raftopoulos, K., & Kollias, S. (2011). The Global-local transformation for noise resistant shape representation. Computer Vision and Image Understanding, 115(8), 1170.
Bennett, J. R., & Mac, J. S. (1975). Donald, on the measurement of curvature in a quantized environment. IEEE Transactions on Computers, 24(8), 803.
Rosin, P., & Zunic, J. (2008). Algorithms for measuring shapes with applications in computer vision. In A. Nayak & I. Stojmenovic (Eds.), Handbook of applied algorithms: Solving scientific, engineering, and practical problems (pp. 347–372). Hoboken: Wiley.
Flusser, J., Zitova, B., & Suk, T. (2006). Rotation moment invariants for recognition of symmetric object. Pattern Recognition, 15(12), 3784.
Xu, D., & Li, H. (2008). Geometric moment invariants. Pattern Recognition (PR), 41(1), 240.
Zunic, J. D., Rosin, P. L., & Kopanja, L. (2006). On the orientability of shapes. IEEE Transactions on Image Processing, 15(11), 3478.
Stojmenovic, M., & Zunic, J. (2008). Measuring elongation from shape boundary. Journal of Mathematical Imaging and Vision, 30(1), 73.
Zunic, J. D., Hirota, K., & Rosin, P. L. (2010). A Hu moment invariant as a shape circularity measure. Pattern Recognition, 43(1), 47.
Abbasi, S., Mokhtarian, F., & Kittler, J. (1999). Curvature scale space image in shape similarity retrieval. Multimedia Systems, 7(6), 467.
Zhang, D., & Lu, G. (2003). A comparative study of curvature scale space and Fourier descriptors for shape-based image retrieval. Journal of Visual Communication and Image Representation, 14(1), 39.
Belongie, S., Malik, J., & Puzicha, J. (2002). Shape matching and object recognition using shape contexts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(4), 509.
Sladoje, N., & Lindblad, J. (2009). High-precision boundary length estimation by utilizing gray-level information. IEEE Transaction on Pattern Analysis and Machine Intelligence, 31(2), 357–363.
Biasotti, S., Floriani, L. D., Falcidieno, B., Frosini, P., Giorgi, D., Landi, C., et al. (2008). Describing shapes by geometrical-topological properties of real functions. ACM Computing Surveys, 40(4), 12:1.
Porteous, I. (2001). Geometric Differentiation. Cambridge: Cambridge University Press.
Goldfeather, J., & Interrante, V. (2004). A novel cubic-order algorithm for approximating principal direction vectors. ACM Transactions on Graphics, 23(1), 45.
Razdan, A., & Bae, M. (2005). Curvature estimation scheme for triangle meshes using biquadratic BéZier patches. Computer-Aided Design, 37(14), 1481.
Nguyen, T., & Debled-Rennesson, I. (2007). Curvature estimationin noisy curves. In W. Kropatsch, M. Kampel, & A. Hanbury (Eds.), Computer analysis of images and patterns (Vol. 4673, pp. 474–481)., Lecture notes in computer science Berlin: Springer.
Bajaj, C. L., & Xu, G. (2003). Anisotropic diffusion of surfaces and functions on surfaces. ACM Transactions on Graphics, 22(1), 4.
Pottmann, H., Wallner, J., Huang, Q. X., & Yang, Y. L. (2009). Integral invariants for robust geometry processing. Computer Aided Geometric Design, 26(1), 37.
Tward, D. J., Ma, J., Miller, M. I., & Younes, L. (2013). Robust diffeomorphic mapping via geodesically controlled active shapes. Journal of Biomedical Imaging, 2013, 205494.
Coeurjolly D., Lachaud, J., & Levallois, J. (2013). Integral based curvature estimators in digital geometry. In 17th IAPR International Conference, DGCI (pp. 215–227).
He, X., & Yung, N. H. C. (2004). Curvature scale space corner detector with adaptive threshold and dynamic region of support. In Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004 (vol. 2, pp. 791–794).
Kerautret, B., & Lachaud, J. O. (2009). Curvature estimation along noisy digital contours by approximate global optimization. Pattern Recognition, 42(10), 2265.
Nguyen, T. P., & Debled-Rennesson, I. (2011). A discrete geometry approach for dominant point detection. Pattern Recognition, 44(1), 32.
Raftopoulos, K., & Ferecatu, M. (2014). Noising versus smoothing for vertex identification in unknown shapes. In 2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (pp. 4162–4168).
Manay, S., Cremers, D., Hong, B. W., Yezzi, A., & Soatto, S. (2006). Integral invariant signatures for shape matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(11), 1602.
Sebastian, T. B., Klein, P. N., & Kimia, B. B. (2004). Recognition of shapes by editing their shock graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(5), 550.
Manning, C. D., Raghavan, P., & Schutze, H. (2008). Introduction to information retrieval. New York: Cambridge University Press.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Zhouchen Lin.
Appendices
Appendix 1: Proof of Proposition 1
Proof
For the clarity of this proof the dot and double dot will denote the vector first and second derivatives with respect to s, whereas the respective scalar derivatives will be denoted by \(\frac{d}{ds}\) and \(\frac{d^2}{ds^2}\). For the meanings of \(\varvec{r}\) and \(\omega \) see Sect. 4.
For the view function \(v_{\xi }(s_*)=\Vert \varvec{\alpha }(s_*)-\varvec{\alpha }(\xi )\Vert \equiv \Vert \varvec{r}\Vert \) it is:
where \(\cdot \) is the inner product. Substituting \(\varvec{r}=\Vert \varvec{r}\Vert (-sin(\omega ), cos(\omega ) )\), \(\dot{\varvec{r}}=(1,0)\) we get:
which is also a proof that the view functions are 1-Lipschitz.
We also have:
and substituting \(\varvec{r}=\Vert \varvec{r}\Vert (-sin(\omega ), cos(\omega ) )\), \(\dot{\varvec{r}}=(1,0)\), \(\ddot{\varvec{r}}=-\kappa (s_*)(0,-1)=(0,\kappa (s_*))\) we get:
and the proof is complete. \(\square \)
Appendix 2: Proof of Theorem 1
For the purpose of the following proofs, we will occasionally consider the view functions as scalars of two parameters, thus we will occasionally use \(v(s,\xi )\) meaning \(v_{s}(\xi )\), to make it explicit that we work with the two parameters in mind. Both parameters s and \(\xi \) are arc lengths measured from the curve’s starting point and \(v(s,\xi )\) is the plane distance between the corresponding points on the curve. Always the dot(s) indicate(s) derivative(s) with respect to s. Every derivative of \(v_{\xi }(s)\) or \(v_{s}(\xi )\) and every partial derivative of \(v(s, \xi )\) is computed under the assumption that \(\xi \ne s\).
Proof
(1)
where we have used the Leibniz integral rule. The step of the derivation, marked with * above, is valid due to the fact that \(v(s,\xi )=v(\xi ,s), \forall s, \xi \in (0, \lambda ]\). The integrals make sense since the set where \(v_{\xi }(s)\) (or \(v_{s}(\xi )\)) is not differentiable has vanishing measure in \(\mathbb {R}\). From Proposition 1, the result in (29) is independent of the variable \(\xi \), given the variable s is fixed at \(s_*\), at the corresponding point of which the Frenet frame is considered (see Sect. 4). This fact permits valid integration over \(\xi \), thus:
which is also a proof that the VAR is \(\lambda \)-Lipschitz.
Angle \(\omega \) is a function of \(\xi \) (given \(s_*\)) and the integral on the right hand side of (33) quantifies a notion of displacement of the curve with respect to the normal to the curve at \(s_*\). To see this, consider a point \(\varvec{\alpha }(\xi )\) and notice that as \(\xi \) traverses the domain of \(\varvec{\alpha }\), angle \(\omega \) measures the angular displacement of this point with respect to the normal at \(s_*\), \(\dot{\phi }_\alpha (s_*)\) can thus be thought of measuring the total angular displacement of the whole curve with respect to the normal at \(s_*\). \(\square \)
Proof
(2), (3) From (33) we get:
From the combination of (29) and (31) we get:
and substituting in (34):
If \(s_*\) is a local maximum point for \(\phi _\alpha (s)\), then there exists a neighborhood U of \(s_*\) such that \(\phi _\alpha (s_*) \ge \phi _\alpha (s)\) for every \(s \in U\). In such a case \(\ddot{\phi }_\alpha (s_*) \le 0\) and since \(\int _0^\lambda \frac{cos^2(\omega )}{\Vert \varvec{r}\Vert }d\xi > 0\) from (36) it follows that:
therefore, \(\kappa (s_*)\ne 0\), \(\left. \int _0^\lambda cos(\omega )d\xi \bigg |\smash {\mathop { }_{s=s_*}}\right. \ne 0\).
From (36), by setting \(A(s)=\int _0^\lambda cos(\omega )d\xi \) and \(B(s)=\int _0^\lambda \frac{cos^2(\omega )}{\Vert r\Vert } d\xi \) and given that \(\kappa (s_*)\ne 0\), we finally have:
and the proof is complete. \(\square \)
Rights and permissions
About this article
Cite this article
Raftopoulos, K.A., Kollias, S.D., Sourlas, D.D. et al. On the Beneficial Effect of Noise in Vertex Localization. Int J Comput Vis 126, 111–139 (2018). https://doi.org/10.1007/s11263-017-1034-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11263-017-1034-6