#### Filter Results:

- Full text PDF available (12)

#### Publication Year

1984

2016

- This year (0)
- Last 5 years (5)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- K. S. Sesh Kumar, Anoop M. Namboodiri, C. V. Jawahar
- ICVGIP
- 2006

Most of the state-of-the-art segmentation algorithms are designed to handle complex document layouts and backgrounds, while assuming a simple script structure such as in Roman script. They perform poorly when used with Indian languages, where the components are not strictly collinear. In this paper, we propose a document segmentation algorithm that can… (More)

Derivation of Cost Function. The projection of the joint probability distribution of the random variables X = (X1, X2, . . . , Xn), associated with the vertices in V , on a decomposable graph G is given by: pG(x) = ∏ C∈C(G) pC(xC) ∏ (C,D)∈T (G) pC∩D(xC∩D) , (1) where x is an instance in the domain of X, which we denote by X . pC(xC) denotes the marginal… (More)

- K. S. Sesh Kumar, Sanjeev Kumar, C. V. Jawahar
- Ninth International Conference on Document…
- 2007

Document image segmentation algorithms primarily aim at separating text and graphics in presence of complex layouts. However, for many non-Latin scripts, segmentation becomes a challenge due to the characteristics of the script. In this paper, we empirically demonstrate that successful algorithms for Latin scripts may not be very effective for Indic and… (More)

- Sachin Rawat, K. S. Sesh Kumar, Million Meshesha, Indraneel Deb Sikdar, A. Balasubramanian, C. V. Jawahar
- Document Analysis Systems
- 2006

This paper presents a novel approach for designing a semi-automatic adaptive OCR for large document image collections in digital libraries. We describe an interactive system for continuous improvement of the results of the OCR. In this paper a semi-automatic and adaptive system is implemented. Applicability of our design for the recognition of Indian… (More)

- K. S. Sesh Kumar, Francis R. Bach
- ICML
- 2013

We consider the problem of learning the structure of undirected graphical models with bounded treewidth, within the maximum likelihood framework. This is an NP-hard problem and most approaches consider local search techniques. In this paper, we pose it as a combinatorial optimization problem, which is then relaxed to a convex optimization problem that… (More)

- K. S. Sesh Kumar, Anoop M. Namboodiri, C. V. Jawahar
- PReMI
- 2005

A hierarchical framework for document segmentation is proposed as an optimization problem. The model incorporates the dependencies between various levels of the hierarchy unlike traditional document segmentation algorithms. This framework is applied to learn the parameters of the document segmentation algorithm using optimization methods like gradient… (More)

Energy minimization has been an intensely studied core problem in computer vision. With growing image sizes (2D and 3D), it is now highly desirable to run energy minimization algorithms in parallel. But many existing algorithms, in particular, some efficient combinatorial algorithms, are difficult to parallelize. By exploiting results from convex and… (More)

- K. S. Sesh Kumar, Francis R. Bach
- ArXiv
- 2013

We consider the problem of maximizing submodular functions; while this problem is known to be NP-hard, several numerically efficient local search techniques with approximation guarantees are available. In this paper, we propose a novel convex relaxation which is based on the relationship between submodular functions, entropies and probabilistic graphical… (More)

In addition to buildings, the terrain forms an important part of a 3D city model. Although in GIS terrains are usually represented with 2D grids, TINs are also increasingly being used in practice. One example is 3DTOP10NL, the 3D city model covering the whole of the Netherlands, which stores the relief with a constrained TIN containing more than 1 billion… (More)

- K. S. Sesh Kumar, Y.Prabhu Suresh Babu, P. Prakash
- 2012

In this paper we are going to learn about the minimization of distortion in steganography. For this purpose we use a general nonbinary embedding operation and discuss various system requirements. We assume every possible value of stego element by assigning a scalar which expresses the distortion of a embedding change done by replacing the cover element by… (More)