Pathamadi V. Sankar

Learn More
An algorithm is presented for partitioning a finite region of the digital plane into a minimum number of rectangular regions. It is demonstrated that the partition problem is equivalent to finding the maximum number of independent vertices in a bipartite graph. The graph’s matching properties are used to develop an algorithm that solves the independent(More)
We prove that the Toeplitz binary value matrix inversion associated with mth order E-spline interpolation can be implemented using only 2 ( m + 1) additions. We develop pipelined architectures for real time B-spline interpolation based on simple running average filters. We also show that an ideal interpolating function, which is approximated by a truncated(More)
The B-spline functions are used to develop recursive algorithms for the efficient implementation of two-dimensional linear digital image filters. These filters may be spatially varying. The B-splines are used in a representation of the desired point spread function. We show that this leads to recursive algorithms and hardware implementations which are more(More)
A ``piecewise heuristic'' follower of the boundaries of difficult-to-notice nonoverlapping blobs in digitized images is described. The technique was tested on 324 X-ray images of candidate lung nodules from eight radiographs with good results. This technique is several times faster than earlier detectors of the boundaries of lung nodules, while maintaining(More)
A detailed error analysis for the dual-sampling region-ofinterest X-ray tomography is presented. Simulation studies are used along with a range of sampling rates to quantitate the amount of sampling errors within the region of interest. It is shown that as the rate of sampling outside the region of interest becomes sparse the amount of sampling errors(More)