DS-1-11 An Algorithm for Optimally Locating Baselines using Quad Decomposition

概要

論文の詳細を見る
In this research, we want to improve the segmented result obtained from the room-edge algorithm. We present an algorithm for placing baselines which gives the optimal room-edge region. The baselines are located using a quad decomposition which recursively decompose a pixel grid P into 4^l rectangular pixel grid for given l levels. The optimal room-edge region of an m×n rectangular pixel grid G can be computed in O(mn^2) time. The optimal location for horizontal and vertical baselines of the given n×n pixel grid P can be computed in O(n^7) time using O(n^4) space. The experimental result is presented in this work.
2012-03-06