A Probabilistic Approach to Quantification of Melanin and Hemoglobin Content in Dermoscopy Images

We describe a technique that employs the stochastic Latent Topic Models framework to allow quantification of melanin and hemoglobin content in dermoscopy images. Such information bears useful implications for analysis of skin hyperpigmentation, and for classification of skin diseases. The proposed method outperforms existing approaches while allowing for more stringent and probabilistic modeling than previously.

[1]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[2]  W. Clem Karl,et al.  Multiscale segmentation and anomaly enhancement of SAR imagery , 1997, IEEE Trans. Image Process..

[3]  Hirotsugu Takiwaki,et al.  Measurement of Erythema and Melanin Indices , 2006 .

[4]  Hervé Delingette,et al.  Medical Image Computing and Computer-Assisted Intervention – MICCAI 2012 , 2012, Lecture Notes in Computer Science.

[5]  Michael R. Fellows,et al.  FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .

[6]  Amol Deshpande,et al.  Indexing correlated probabilistic databases , 2009, SIGMOD Conference.

[7]  Fernando Pereira,et al.  Shallow Parsing with Conditional Random Fields , 2003, NAACL.

[8]  Christopher Ré,et al.  Approximate lineage for probabilistic databases , 2008, Proc. VLDB Endow..

[9]  Christopher Ré,et al.  Event queries on correlated probabilistic streams , 2008, SIGMOD Conference.

[10]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[11]  Sean R. Eddy,et al.  Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids , 1998 .

[12]  Susanne E. Hambrusch,et al.  Database Support for Probabilistic Attributes and Tuples , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[13]  Anthony J. Bonner,et al.  Sequences, Datalog and transducers , 1995, PODS '95.

[14]  J. Parrish,et al.  QUANTITATIVE EVALUATION OF ULTRAVIOLET INDUCED ERYTHEMA , 1983, Photochemistry and photobiology.

[15]  Dan Suciu,et al.  The dichotomy of conjunctive queries on probabilistic structures , 2006, PODS.

[16]  Takashi Saito,et al.  Semantics analysis through elementary meanings: theoretical foundation for generalized thesaurus construction , 2000 .

[17]  Christopher Ré,et al.  Access Methods for Markovian Streams , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[18]  André Kempe,et al.  Finite State Transducers Approximating Hidden Markov Models , 1997, ACL.

[19]  Sampath Kannan,et al.  Counting and random generation of strings in regular languages , 1995, SODA '95.

[20]  Christoph Koch,et al.  A compositional query algebra for second-order logic and uncertain databases , 2008, ICDT '09.

[21]  Jennifer Widom,et al.  Exploiting Lineage for Confidence Computation in Uncertain and Probabilistic Databases , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[22]  Yehoshua Sagiv,et al.  Maximally joining probabilistic data , 2007, PODS.

[23]  Michael Zink,et al.  Capturing Data Uncertainty in High-Volume Stream Processing , 2009, CIDR.

[24]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

[25]  Roland Badeau,et al.  Scale-invariant probabilistic latent component analysis , 2011, 2011 IEEE Workshop on Applications of Signal Processing to Audio and Acoustics (WASPAA).

[26]  Andrew McCallum,et al.  Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data , 2001, ICML.

[27]  Yehoshua Sagiv,et al.  Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties , 2008, J. Comput. Syst. Sci..

[28]  David Eppstein,et al.  Finding the k Shortest Paths , 1999, SIAM J. Comput..

[29]  Frank Neven,et al.  Typechecking Top-Down Uniform Unranked Tree Transducers , 2003, ICDT.

[30]  H. Takiwaki.  Measurement of skin color: practical application and theoretical considerations. , 1998, The journal of medical investigation : JMI.

[31]  Moni Naor,et al.  Optimal aggregation algorithms for middleware , 2001, PODS '01.

[32]  Yehoshua Sagiv,et al.  Running tree automata on probabilistic XML , 2009, PODS.

[33]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[34]  Christopher Ré,et al.  Lahar Demonstration: Warehousing Markovian Streams , 2009, Proc. VLDB Endow..

[35]  Galina Jirásková,et al.  State complexity of some operations on binary regular languages , 2005, Theor. Comput. Sci..

[36]  Aapo Hyvärinen,et al.  Fast and robust fixed-point algorithms for independent component analysis , 1999, IEEE Trans. Neural Networks.

[37]  Jennifer Widom,et al.  Trio: A System for Integrated Management of Data, Accuracy, and Lineage , 2004, CIDR.

[38]  Jian Zhou,et al.  Off-Line Handwritten Word Recognition Using a Hidden Markov Model Type Stochastic Network , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[39]  K. G. Murty.  An Algorithm for Ranking All the Assignment in Order of Increasing Cost , 1968 .

[40]  D. J. Ellis,et al.  A theoretical and experimental study of light absorption and scattering by in vivo skin. , 1980, Physics in medicine and biology.

[41]  Ali Madooei,et al.  Intrinsic Melanin and Hemoglobin Colour Components for Skin Lesion Malignancy Detection , 2012, MICCAI.

[42]  Bhiksha Raj,et al.  Adobe Systems , 1998 .

[43]  Steven A. Shafer,et al.  Using color to separate reflection components , 1985 .

[44]  Norimichi Tsumura,et al.  Image-based skin color and texture analysis/synthesis by extracting hemoglobin and melanin information in the skin , 2003, ACM Trans. Graph..

[45]  E. Lawler.  A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .

[46]  Yehoshua Sagiv,et al.  Finding and approximating top-k answers in keyword proximity search , 2006, PODS '06.

[47]  Dan Suciu,et al.  Efficient query evaluation on probabilistic databases , 2004, The VLDB Journal.

[48]  Prashant J. Shenoy,et al.  Probabilistic Inference over RFID Streams in Mobile Environments , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[49]  Giuseppe Argenziano,et al.  Interactive Atlas of Dermoscopy (Book and CD-ROM) , 2000 .

[50]  Bruno Escoffier,et al.  Differential approximation of min sat , 2007, Eur. J. Oper. Res..

[51]  Amol Deshpande,et al.  Online Filtering, Smoothing and Probabilistic Modeling of Streaming data , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[52]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[53]  Bhiksha Raj,et al.  Sparse Overcomplete Latent Variable Decomposition of Counts Data , 2007, NIPS.

[54]  Bertram Ludäscher,et al.  A Transducer-Based XML Query Processor , 2002, VLDB.

[55]  Sunil Prabhakar,et al.  Evaluating probabilistic queries over imprecise data , 2003, SIGMOD '03.

[56]  Wei Hong,et al.  Model-Driven Data Acquisition in Sensor Networks , 2004, VLDB.

[57]  Mitsunori Ogihara,et al.  Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy , 1992, SIAM J. Comput..

[58]  Mihalis Yannakakis,et al.  On the Complexity of Database Queries , 1999, J. Comput. Syst. Sci..

[59]  Amol Deshpande,et al.  Ef?cient Query Evaluation over Temporally Correlated Probabilistic Streams , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[60]  Dan Olteanu,et al.  MayBMS: a probabilistic database management system , 2009, SIGMOD Conference.

[61]  Stathis Zachos,et al.  Probabilistic Quantifiers and Games , 1988, J. Comput. Syst. Sci..

[62]  B. Diffey,et al.  A portable instrument for quantifying erythema induced by ultraviolet radiation , 1984, The British journal of dermatology.

[63]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[64]  Miron Livny,et al.  SEQ: A model for sequence databases , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[65]  Yehoshua Sagiv,et al.  Efficiently enumerating results of keyword search over data graphs , 2008, Inf. Syst..

[66]  J. Y. Yen.  Finding the K Shortest Loopless Paths in a Network , 1971 .

[67]  Christoph Koch,et al.  Approximating predicates and expressive queries on probabilistic databases , 2008, PODS.

[68]  Lawrence K. Saul,et al.  Large Margin Hidden Markov Models for Automatic Speech Recognition , 2006, NIPS.