Paper Info
Title
An Algorithm for Constrained Maximization of the Trace of a Matrix
Abstract
The "trace" of a rectangular matrix is defined as the trace of a square matrix obtained by appending null rows (or columns) at the bottom (or right) end. The problem of maximizing the trace of a matrix, by permutations and mergers of rows and columns with constraints on the resulting size of the matrix, is of interest in comparison of maps and image-change detection. This correspondence presents an algorithm based on dynamic propramming for efficient maximization of trace.
Year
DOI
Venue
1977
10.1109/TC.1977.1674799
IEEE Transactions on Computers
Keywords
DocType
Volume
resulting size,rectangular matrix,constrained maximization,null row,square matrix,image-change detection,efficient maximization,dynamic propramming,change detection,matrices,dynamic programming,pattern recognition,optimization,image processing
Journal
C-26
Issue
ISSN
Citations 
12
0018-9340
0
PageRank 
References 
Authors
0.34
0
1
Name
Order
Citations
PageRank
H. K. Ramapriyan110624.06