Measuring Regularity Of Network Patterns By Grid Approximations Using The Lll Algorithm

2016 23RD INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR)(2016)

引用 8|浏览22
暂无评分
摘要
In a recent work, we have proposed a novel way to approximate point sets with grids using the LLL algorithm, which operates in polynomial time. Now, we show how this approach can be applied to pattern recognition purposes with interpreting the rate of approximation as a new feature for regularity measurement. Our practical problem is the characterization of pigment networks in skin lesions. For this task we also introduce a novel image processing method for the extraction of the pigment network. Then, we show how our grid approximation framework can be applied with specializing it for the recognition of hexagonal patterns. The classification performance of our approach for the pigment network characterization problem is measured on a database annotated by a clinical expert. Throughout the paper we address several practical issues that may help to apply our general framework to other practical tasks, as well.
更多
查看译文
关键词
network pattern regularity measurement,grid approximation,LLL algorithm,point set approximation,polynomial time algorithm,pattern recognition,approximation rate,skin lesions,image processing method,pigment network extraction,grid approximation framework,hexagonal pattern recognition,classification performance,pigment network characterization problem,annotated database
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要