{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:58:04Z","timestamp":1725569884186},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642172731"},{"type":"electronic","value":"9783642172748"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17274-8_9","type":"book-chapter","created":{"date-parts":[[2010,11,18]],"date-time":"2010-11-18T23:09:27Z","timestamp":1290121767000},"page":"85-96","source":"Crossref","is-referenced-by-count":0,"title":["A Sharp Concentration-Based Adaptive Segmentation Algorithm"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Fiorio","sequence":"first","affiliation":[]},{"given":"Andre","family":"Mas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/0146-664X(72)90021-4","volume":"1","author":"T. Pavlidis","year":"1972","unstructured":"Pavlidis, T.: Segmentation of pictures and maps through functional approximation. Computer Graphics and Image Process\u00a01, 360\u2013372 (1972)","journal-title":"Computer Graphics and Image Process"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/S0146-664X(76)80014-7","volume":"5","author":"S.W. Zucker","year":"1976","unstructured":"Zucker, S.W.: Survey: Region growing: Childhood and adolescence. Computer Vision, Graphics, and Image Processing\u00a05, 382\u2013399 (1976)","journal-title":"Computer Vision, Graphics, and Image Processing"},{"key":"9_CR3","volume-title":"Computer Vision: A Modern Approach","author":"D.A. Forsyth","year":"2003","unstructured":"Forsyth, D.A., Ponce, J.: Computer Vision: A Modern Approach. Prentice-Hall, Englewood Cliffs (2003)"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1142\/S0218001487000242","volume":"1","author":"O. Monga","year":"1987","unstructured":"Monga, O.: An optimal region growing algorithm for image segmentation. International Journal of Pattern Recognition and Artificial Intelligence\u00a01, 351\u2013375 (1987)","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Nock, R.: Fast and reliable color region merging inspired by decision tree pruning. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2001), vol.\u00a01, pp. I\u2013271\u2013I\u2013276 (2001)","DOI":"10.1109\/CVPR.2001.990486"},{"key":"9_CR6","first-page":"450","volume-title":"10th IEEE International Conference on Tools with Artificial Intelligence","author":"C. Fiorio","year":"1998","unstructured":"Fiorio, C., Nock, R.: Image segmentation using a generic, fast and non-parametric approach. In: 10th IEEE International Conference on Tools with Artificial Intelligence, Taipe, Taiwan, R.O.C, pp. 450\u2013458. IEEE Computer Society, Los Alamitos (1998)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Fiorio, C., Nock, R.: A concentration-based adaptive approach to region merging of optimal time and space complexities. In: British Machine Vision Conference, Bristol, England, vol.\u00a02, pp. 775\u2013784 (2000)","DOI":"10.5244\/C.14.78"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1109\/TPAMI.2004.110","volume":"26","author":"R. Nock","year":"2004","unstructured":"Nock, R., Nielsen, F.: Statistical region merging. IEEE Trans. Pattern Anal. Mach. Intell.\u00a026, 1452\u20131458 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9_CR9","series-title":"Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1923-9","volume-title":"Testing statistical hypotheses","author":"E.L. Lehmann","year":"1986","unstructured":"Lehmann, E.L.: Testing statistical hypotheses, 2nd edn. Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics. John Wiley & Sons, New York (1986)","edition":"2"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1016\/j.patcog.2004.11.009","volume":"38","author":"R. Nock","year":"2005","unstructured":"Nock, R., Nielsen, F.: Semi-supervised statistical region refinement for color image segmentation. Pattern Recognition: Image Understanding for Photographs\u00a038, 835\u2013846 (2005)","journal-title":"Pattern Recognition: Image Understanding for Photographs"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.tcs.2006.05.008","volume":"361","author":"E.D. Demaine","year":"2006","unstructured":"Demaine, E.D., Emanuel, D., Fiat, A., Immorlica, N.: Correlation clustering in general weighted graphs; approximation and online algorithms. Theoretical Computer Science\u00a0361, 172\u2013187 (2006)","journal-title":"Theoretical Computer Science"},{"key":"9_CR12","first-page":"808","volume-title":"International Conference on Image Processing","author":"C. Fiorio","year":"2000","unstructured":"Fiorio, C., Nock, R.: Sorted region merging to maximize test reliability. In: International Conference on Image Processing, Vancouver, Canada, vol.\u00a001, pp. 808\u2013811. IEEE, Los Alamitos (2000)"},{"key":"9_CR13","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1017\/S0963548301005089","volume":"11","author":"C. Mc Diarmid","year":"2002","unstructured":"Mc Diarmid, C.: Concentration for independent permutations. Comb. Probab. Comput.\u00a011, 163\u2013178 (2002)","journal-title":"Comb. Probab. Comput."},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalitites for sums of bounded random variables. Journal of American Statistical Association\u00a058, 13\u201330 (1963)","journal-title":"Journal of American Statistical Association"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1080\/01621459.1962.10482149","volume":"57","author":"G. Bennett","year":"1962","unstructured":"Bennett, G.: Probability inequalities for the sum of independent random variables. Journal of American Statistical Association\u00a057, 33\u201345 (1962)","journal-title":"Journal of American Statistical Association"},{"key":"9_CR16","unstructured":"Bernstein, S.: On a modification of chebyshev\u2019s inequality and of the error formula of laplace. Ann. Sci. Inst. Sav. Ukraine, Sect. Math.\u00a01 (1924)"},{"key":"9_CR17","first-page":"480","volume":"3","author":"M. Ledoux","year":"1991","unstructured":"Ledoux, M., Talagrand, M.: Probability in banach spaces. isoperimetry and processes. Ergebnisse der Mathematik und ihrer Grenzgebiete\u00a03, xii+480 (1991)","journal-title":"Ergebnisse der Mathematik und ihrer Grenzgebiete"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-662-12788-9_6","volume-title":"Probabilistic Methods for Algorithmic Discrete Mathematics","author":"C. Mc Diarmid","year":"1998","unstructured":"Mc Diarmid, C.: Concentration. In: Habib, D.M., Ramirez-Alfonsin, R. (eds.) Probabilistic Methods for Algorithmic Discrete Mathematics, New-York, pp. 195\u2013248. Springer, Heidelberg (1998)"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0304-3975(94)00262-2","volume":"154","author":"C. Fiorio","year":"1996","unstructured":"Fiorio, C., Gustedt, J.: Two linear time Union-Find strategies for image processing. Theoretical Computer Science\u00a0154, 165\u2013181 (1996)","journal-title":"Theoretical Computer Science"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R.E. Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. of the Association for Computing Machinery\u00a022, 215\u2013225 (1975)","journal-title":"J. of the Association for Computing Machinery"}],"container-title":["Lecture Notes in Computer Science","Advances in Visual Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17274-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T07:02:50Z","timestamp":1559804570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17274-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642172731","9783642172748"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17274-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}