text chunk (tEXt)*/

compressed text chunk (zTXt)*/

Loads a nii and make the matrix that the rest of the code needs.

Loads the nii with the unary potentials and makes a matrix that the rest of the original code needs.

Reads the config file and makes a vector of strings with all the lines of it. Just so that the very same function addPairwiseBilateralToCrfForCorrespo

*/

*/

Resizes to given size. */

Resizes to given size. */

put a pixel, given its RGBA16 color, into image of any color 16-bitdepth type*/

put a pixel, given its RGBA color, into image of any color type*/

* Return the array of compressed row indices of all supernodes */

* Return the array of compressed row indices of all supernodes */

write given buffer to the file, overwriting the file, it doesn't append to it.*/

\returns the largest \c k such that for all \c j in [0,k) index[\c j]\<\a key */

\returns the largest \c k such that for all \c j in [0,k) index[\c j]\<\a key */

Specifies a sub-vector to work on */

Specifies a sub-vector to work on */

* Set appropriate pointers for the lower triangular supernodal matrix * These infos are available at the end of the numerical factorization

* Set appropriate pointers for the lower triangular supernodal matrix * These infos are available at the end of the numerical factorization

///////////////////////// Unary Potentials ///// /////////////////////////

\returns the rotation angle in [-pi,pi] */

\returns the rotation angle in [-pi,pi] */

\returns the number of sub diagonals */

\returns the number of sub diagonals */

\returns the number of super diagonals */

\returns the number of super diagonals */

Helper function. The algorithm works in this 0-250 range in order to be efficient.

To use for operations with the transpose of Q

\brief %Transpose of the Householder sequence. */

To use for operations with the transpose of Q

\brief %Transpose of the Householder sequence. */

The following code is inspired by the following stack-overflow answer: https://stackoverflow.com/questions/30463616/payne-hanek-algorithm-implementati

The following code is inspired by the following stack-overflow answer: https://stackoverflow.com/questions/30463616/payne-hanek-algorithm-implementati

returns 1 if success, 0 if failure ==> nothing done*/

Defaults

Defaults

Get Determinant

Get Determinant

Numeric

Numeric