java - 分岔和山脊终点

Question

有没有办法通过仅使用 Java 代码而不是 Matlab 等来找到图像（手、静脉）中的分叉点和脊终点？我可以通过 Java 的 ImageJ 库来实现这一点吗？

Answer 1

有一个 ImageJ 插件可以帮助你做到这一点：

分析骨架 （源见这里）

您可以在其SkeletonResult类的帮助下提取分支点和端点。

Answer 2

您在从指纹图像中提取细节中找到的科学描述。在OpenCV中实现了一些算法，请参见分段部分。

OpenCV 库可以使用 JNI 链接到 java。

Answer 3

非常感谢帮助我，我通过了 AnalyzeSkeleton 并通过使用 IJ 在 SkeletonResult Response 中得到了结果。为此，我使用了 IJ.run(imp, "Skeletonize", "");

 // Initialize AnalyzeSkeleton_
  AnalyzeSkeleton_ skel = new AnalyzeSkeleton_();
 skel.calculateShortestPath = true;
 skel.setup("", imp);

 // Perform analysis in silent mode
 // (work on a copy of the ImagePlus if you don't want it displayed)
 // run(int pruneIndex, boolean pruneEnds, boolean shortPath, ImagePlus origIP, boolean silent, boolean verbose)
 SkeletonResult skelResult = skel.run(AnalyzeSkeleton_.NONE, false, true, null, true, false);

 // Read the results
 Object shortestPaths[] = skelResult.getShortestPathList().toArray();
 double branchLengths[] = skelResult.getAverageBranchLength();
 int branchNumbers[] = skelResult.getBranches();

 long totalLength = 0;
 for (int i = 0; i < branchNumbers.length; i++) {
     totalLength += branchNumbers[i] * branchLengths[i];
 }

 double cumulativeLengthOfShortestPaths = 0;
 for (int i = 0; i < shortestPaths.length; i++) {
     cumulativeLengthOfShortestPaths +=(Double)shortestPaths[i];
 }
  System.out.println("totalLength "+totalLength);
  System.out.println("cumulativeLengthOfShortestPaths "+cumulativeLengthOfShortestPaths);
System.out.println("getNumOfTrees "+skelResult.getNumOfTrees());
System.out.println("getAverageBranchLength "+skelResult.getAverageBranchLength().length);
System.out.println("getBranches "+skelResult.getBranches().length);
System.out.println("getEndPoints "+skelResult.getEndPoints().length);
System.out.println("getGraph "+skelResult.getGraph().length);
System.out.println("getJunctions "+skelResult.getJunctions().length);
System.out.println("getJunctionVoxels "+skelResult.getJunctionVoxels().length);
System.out.println("getListOfEndPoints "+skelResult.getListOfEndPoints().size());
System.out.println("getListOfJunctionVoxels "+skelResult.getListOfJunctionVoxels().size());
System.out.println("getMaximumBranchLength "+skelResult.getMaximumBranchLength().length);
System.out.println("getNumberOfVoxels "+skelResult.getNumberOfVoxels().length);
System.out.println("getQuadruples "+skelResult.getQuadruples().length); this method .but I am not able to find which method in Skeleton Result class returns bifuraction point could you please help me little more thanks Amar