Saibal Banerjee

According to our database, Saibal Banerjee authored at least 8 papers between 1986 and 1993.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1993

Model-based cluster analysis.

Saibal Banerjee, Azriel Rosenfeld

Pattern Recognit., 1993

Some Results on the Computational Complexity of Symmetric Connectionist Networks.

Simon Kasif, Saibal Banerjee, Arthur L. Delcher, Gregory F. Sullivan

Ann. Math. Artif. Intell., 1993

1992

MAP estimation of context-free grammars.

Saibal Banerjee, Azriel Rosenfeld

Pattern Recognit. Lett., 1992

Maximum-likelihood edge detection in digital signals.

Azriel Rosenfeld, Saibal Banerjee

CVGIP Image Underst., 1992

Detecting parameterized curve segments using MDL and the Hough transform.

Jacob Sheinvald, Byron Dom, Wayne Niblack, Saibal Banerjee

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1992

1991

An optimal algorithm to find the degrees of connectedness in an undirected edge-weighted graph.

Saibal Banerjee

Pattern Recognit. Lett., 1991

Pyramid computation of neighbor distance statistics in dot patterns.

Saibal Banerjee, David M. Mount, Azriel Rosenfeld

CVGIP Graph. Model. Image Process., 1991

1986

Reduced-complexity LQR design using canonical correlation analysis.

Uday B. Desai, Saibal Banerjee

Autom., 1986