K. Balasubramaniam

Papers

Total Citations

H-Index

About

K. Balasubramaniam is a researcher whose work lies at the intersection of evolutionary computation and pattern recognition, with a particular focus on applying genetic algorithms to complex matching problems. His most cited contribution, "Matching horizon features using a Messy Genetic Algorithm" (2000), introduced an innovative approach to feature correspondence by leveraging the adaptive search capabilities of messy genetic algorithms—a technique that allows for variable-length chromosome representations. This work has garnered 4 citations, establishing a foundation for subsequent studies in feature matching and optimization. Balasubramaniam's research demonstrates how biologically inspired algorithms can be effectively applied to solve challenging problems in computer vision and spatial data analysis. His contributions highlight the potential of evolutionary methods in handling the combinatorial complexity inherent in matching tasks, offering a robust alternative to traditional deterministic approaches. For students and researchers exploring the synergy between artificial intelligence and optimization, Balasubramaniam's work provides a compelling example of how messy genetic algorithms can be tailored to address real-world feature correspondence challenges.