Item searching is an important step in form analysis. The goal of this paper is to describe a robust method to locate the items whose boundaries are black lines, and an algorithm to classify those items. Our method is based on detection of lines by Hough transform and on searching of cycles in a graph that represents the cells (boundaries of the items). We will show that our approach is robust, skew independent and can be applied to several kind of lines such as continuous, dashed, doubled, etc. We classify the items in four categories: blank, black, gray and meaningful.