Multilevel thresholding by fast PNN based algorithm UNIVERSITY OF JOENSUU DEPARTMENT OF COMPUTER SCIENCE FINLAND Olli Virmajoki and Pasi Fränti.

Slides:

Advertisements

Similar presentations

Variable Metric For Binary Vector Quantization UNIVERSITY OF JOENSUU DEPARTMENT OF COMPUTER SCIENCE JOENSUU, FINLAND Ismo Kärkkäinen and Pasi Fränti.

Advertisements

Random Swap EM algorithm for GMM and Image Segmentation

University of Joensuu Dept. of Computer Science P.O. Box 111 FIN Joensuu Tel fax Gaussian Mixture.

The A-tree: An Index Structure for High-dimensional Spaces Using Relative Approximation Yasushi Sakurai (NTT Cyber Space Laboratories) Masatoshi Yoshikawa.

Aggregating local image descriptors into compact codes

Clustering (2). Hierarchical Clustering Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram –A tree like.

Hierarchical Clustering. Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram – A tree-like diagram that.

Surface Simplification Using Quadric Error Metrics Speaker: Fengwei Zhang September

Yasuhiro Fujiwara (NTT Cyber Space Labs)

VisualRank: Applying PageRank to Large-Scale Image Search Yushi Jing, Member, IEEE, and Shumeet Baluja, Member, IEEE.

Statistical Classification Rong Jin. Classification Problems X Input Y Output ? Given input X={x 1, x 2, …, x m } Predict the class label y  Y Y = {-1,1},

Fast High-Dimensional Feature Matching for Object Recognition David Lowe Computer Science Department University of British Columbia.

Otsu’s Thresholding Method Based on a very simple idea: Find the threshold that minimizes the weighted within-class variance. This turns out to be the.

Medical Imaging Mohammad Dawood Department of Computer Science University of Münster Germany.

Medical Imaging Mohammad Dawood Department of Computer Science University of Münster Germany.

Texture Synthesis Tiantian Liu. Definition Texture – Texture refers to the properties held and sensations caused by the external surface of objects received.

CSE 589 Applied Algorithms Spring 1999 Image Compression Vector Quantization Nearest Neighbor Search.

1 Preprocessing for JPEG Compression Elad Davidson & Lilach Schwartz Project Supervisor: Ari Shenhar SPRING 2000 TECHNION - ISRAEL INSTITUTE of TECHNOLOGY.

1 Abstract This paper presents a novel modification to the classical Competitive Learning (CL) by adding a dynamic branching mechanism to neural networks.

Digital Image Processing Final Project Compression Using DFT, DCT, Hadamard and SVD Transforms Zvi Devir and Assaf Eden.

January 26, Nick Feamster Development of a Transcoding Algorithm from MPEG to H.263.

Computer Vision James Hays, Brown

Clustering Methods: Part 2d Pasi Fränti Speech & Image Processing Unit School of Computing University of Eastern Finland Joensuu, FINLAND Swap-based.

Clustering methods Course code: Pasi Fränti Speech & Image Processing Unit School of Computing University of Eastern Finland Joensuu,

Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.

1 Efficient Reference Frame Selector for H.264 Tien-Ying Kuo, Hsin-Ju Lu IEEE CSVT 2008.

Outlier Detection Using k-Nearest Neighbour Graph Ville Hautamäki, Ismo Kärkkäinen and Pasi Fränti Department of Computer Science University of Joensuu,

Self-organizing map Speech and Image Processing Unit Department of Computer Science University of Joensuu, FINLAND Pasi Fränti Clustering Methods: Part.

DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF JOENSUU JOENSUU, FINLAND Image Compression Lecture 9 Optimal Scalar Quantization Alexander Kolesnikov.

IMAGE COMPRESSION USING BTC Presented By: Akash Agrawal Guided By: Prof.R.Welekar.

Hierarchical Distributed Genetic Algorithm for Image Segmentation Hanchuan Peng, Fuhui Long*, Zheru Chi, and Wanshi Siu {fhlong, phc,

Cut-based & divisive clustering Clustering algorithms: Part 2b Pasi Fränti Speech & Image Processing Unit School of Computing University of Eastern.

Genetic Algorithm Using Iterative Shrinking for Solving Clustering Problems UNIVERSITY OF JOENSUU DEPARTMENT OF COMPUTER SCIENCE FINLAND Pasi Fränti and.

A fast algorithm for the generalized k- keyword proximity problem given keyword offsets Sung-Ryul Kim, Inbok Lee, Kunsoo Park Information Processing Letters,

Compression of aerial images for reduced-color devices UNIVERSITY OF JOENSUU DEPARTMENT OF COMPUTER SCIENCE FINLAND Pasi Fränti and Ville Hautamäki

Color Image Segmentation Speaker: Deng Huipeng 25th Oct ， 2007.

Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.

Compression of Real-Time Cardiac MRI Video Sequences EE 368B Final Project December 8, 2000 Neal K. Bangerter and Julie C. Sabataitis.

Lectures on Greedy Algorithms and Dynamic Programming

CS654: Digital Image Analysis

Genetic algorithms (GA) for clustering Pasi Fränti Clustering Methods: Part 2e Speech and Image Processing Unit School of Computing University of Eastern.

CS 241 Discussion Section (11/17/2011). Outline Review of MP7 MP8 Overview Simple Code Examples (Bad before the Good) Theory behind MP8.

Reference line approach in vector data compression Alexander Akimov, Alexander Kolesnikov and Pasi Fränti UNIVERSITY OF JOENSUU DEPARTMENT OF COMPUTER.

1 On Optimal Worst-Case Matching Cheng Long (Hong Kong University of Science and Technology) Raymond Chi-Wing Wong (Hong Kong University of Science and.

Symbol Representation in Map Image Compression UNIVERSITY OF JOENSUU DEPARTMENT OF COMPUTER SCIENCE FINLAND Alexander Akimov and Pasi Fränti ACM Symposium.

Finding Optimal Solutions to Cooperative Pathfinding Problems Trevor Standley and Rich Korf Computer Science Department University of California, Los Angeles.

Zhongyan Liang, Sanyuan Zhang Under review for Journal of Zhejiang University Science C (Computers & Electronics) Publisher: Springer A Credible Tilt License.

Visual Tracking by Cluster Analysis Arthur Pece Department of Computer Science University of Copenhagen

Updating Designed for Fast IP Lookup Author : Natasa Maksic, Zoran Chicha and Aleksandra Smiljani´c Conference: IEEE High Performance Switching and Routing.

CS 241 Discussion Section (2/9/2012). MP2 continued Implement malloc, free, calloc and realloc Reuse free memory – Sequential fit – Segregated fit.

CS 241 Discussion Section (12/1/2011). Tradeoffs When do you: – Expand Increase total memory usage – Split Make smaller chunks (avoid internal fragmentation)

Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!

Iterative K-Means Algorithm Based on Fisher Discriminant UNIVERSITY OF JOENSUU DEPARTMENT OF COMPUTER SCIENCE JOENSUU, FINLAND Mantao Xu to be presented.

Non-parametric Methods for Clustering Continuous and Categorical Data Steven X. Wang Dept. of Math. and Stat. York University May 13, 2010.

Filtering of map images by context tree modeling Pavel Kopylov and Pasi Fränti UNIVERSITY OF JOENSUU DEPARTMENT OF COMPUTER SCIENCE FINLAND.

Computer Vision Lecture 7 Classifiers. Computer Vision, Lecture 6 Oleh Tretiak © 2005Slide 1 This Lecture Bayesian decision theory (22.1, 22.2) –General.

How to cluster data Algorithm review Extra material for DAA Prof. Pasi Fränti Speech & Image Processing Unit School of Computing University.

Genetic Algorithms for clustering problem Pasi Fränti

Journal of Computational and Applied Mathematics Volume 253, 1 December 2013, Pages 14–25 Reporter : Zong-Dian Lee A hybrid quantum inspired harmony search.

S.R.Subramanya1 Outline of Vector Quantization of Images.

Agglomerative clustering (AC)

The Johns Hopkins University

Random Swap algorithm Pasi Fränti

Chapter 3 向量量化編碼法.

Random Swap algorithm Pasi Fränti

Foundation of Video Coding Part II: Scalar and Vector Quantization

Clustering Wei Wang.

Analysis of Algorithms

Pasi Fränti and Sami Sieranoja

Source: Pattern Recognition Letters 29 (2008)

Presentation transcript:

Multilevel thresholding by fast PNN based algorithm UNIVERSITY OF JOENSUU DEPARTMENT OF COMPUTER SCIENCE FINLAND Olli Virmajoki and Pasi Fränti

Multi-level thresholding Given image with N input values, threshold the image into M values. Considered as algorithmic problem: given a minimization criterion (MSE), find optimal thresholds.

Optimal thresholding Optimal thresholding by exhaustive search in O(N M-1 ) time [Otsu 1979]. Medical images can have 16 bpp. Exhaustive search takes ~ Sub-optimal methods: Lloyd-Max quantizer with O(N) time.

Pairwise Nearest Neighbor method (PNN) New multilevel thresholding algorithm based on the pairwise nearest neighbor (PNN). PNN used in vector quantization (Equitz 1989) but considered slow: Original method takes O(N 3 ), Kurita’s method takes O(N 2 log N) Using Nearest neighbor pointers: O(  N 2 ). PNN is lower limited by  (N 2 ) Our contribution: To show that PNN can be implemented in O(N log N) time !!!

PNN algorithm SET m=N (N-1 thresholds) REPEAT  Find threshold to be removed: O(N)  Remove threshold: O(1)  Update the class parameters: O(1)  SET m=m-1 UNTIL m=M

PNN with heap structure

Time complexity STEP:NAIVE:WITH HEAP: 1. Find threshold O(N)O(N)O(1) 2. Remove threshold O(1) 3. Update classes O(1)O(log N) TOTALO(N2)O(N2)O(N log N)

Histograms of test images 8 bpp12 bpp16 bpp

Methods in comparison Uniform quantizer (UQ) LMQ PNN PNN + LMQ Optimal (Otsu’s method)

MSE comparison (Medical3) 2. PNN+LMQ gives near-optimal results (for small M values) 1. MSE values significantly smaller than Uniform Quantizer 3. PNN+LMQ values can be significantly smaller than LMQ alone

Time Comparison (Medical3) 1.All sub-optimal methods are fast 2. Optimal thresholding is too slow for larger M values.

Conclusions Fast PNN-based O(N log N) time algorithm for multilevel non- parametric thresholding. Considerably faster than optimal thresholding. Better quality than the Lloyd-Max quantizer alone.