Count number of palindromic path in a matrix

import java.util.HashMap;
/*
    Java Program for
    Count number of palindromic path in a matrix
*/
class Coordinates
{
	public int sc;
	public int ec;
	public int sr;
	public int er;
	public Coordinates(int sc, int ec, int sr, int er)
	{
		this.sc = sc;
		this.ec = ec;
		this.sr = sr;
		this.er = er;
	}
}
public class PalindromicPath
{
	public int absValue(int value)
	{
		if (value < 0)
		{
			return -value;
		}
		return value;
	}
	public int countPath(char[][] matrix, HashMap < Coordinates, Integer > dp, int sc, int ec, int sr, int er, int n, int m)
	{
		if (sc < 0 || ec < 0 || sr < 0 || er < 0 || 
            sc >= m || ec >= m || sr >= n || er >= n)
		{
			// When index are out of range
			return 0;
		}
		if (sc > ec || sr > er)
		{
			// Overlapping case
			return 0;
		}
		else if (matrix[er][ec] != matrix[sr][sc])
		{
			// When palindrome not exist in given indexes
			return 0;
		}
		else if (absValue((sr - er) + (sc - ec)) <= 1)
		{
			return 1;
		}
		Coordinates point = new Coordinates(sc, ec, sr, er);
		if (dp.containsKey(point))
		{
			// When point already exists
			return dp.get(point);
		}
		// Calculate palindromic path using recursion
		int count = countPath(matrix, dp, sc, ec, sr + 1, er - 1, n, m) + 
          countPath(matrix, dp, sc, ec - 1, sr + 1, er, n, m) + 
          countPath(matrix, dp, sc + 1, ec, sr, er - 1, n, m) + 
          countPath(matrix, dp, sc + 1, ec - 1, sr, er, n, m);
		dp.put(point, count);
		return count;
	}
	// This function are handling the request of counting palindromic path.
	public void countPalindromicPath(char[][] matrix)
	{
		// Get the length
		int n = matrix.length;
		int m = matrix[0].length;
		// Manage coordinates points
		HashMap < Coordinates, Integer > dp = 
          new HashMap < Coordinates, Integer > ();
		int result = countPath(matrix, dp, 0, m - 1, 0, n - 1, n, m);
		System.out.print("\n Result : " + result);
	}
	public static void main(String[] args)
	{
		PalindromicPath task = new PalindromicPath();
		char[][] matrix = {
			{
				'a' , 'a' , 'a' , 'b'
			},
			{
				'b' , 'b' , 'c' , 'b'
			},
			{
				'b' , 'b' , 'c' , 'a'
			},
			{
				'a' , 'a' , 'b' , 'a'
			},
			{
				'a' , 'b' , 'b' , 'a'
			}
		};
		/*
		    a  b  b  a  a  b  b  a
		    a  b  b  a  a  b  b  a
		    a  b  b  a  a  b  b  a
		    a  b  b  c  c  b  b  a
		    a  a  b  c  c  b  a  a
		    a  a  a  c  c  a  a  a
		    a  a  a  b  b  a  a  a
		    --------------------------
		    Result = 7
		*/
		task.countPalindromicPath(matrix);
	}
}

Output

 Result :  7