Merge branch 'master' into local-extrema-rebase

Author: hanslovsky

.travis.yml

@@ -4,8 +4,6 @@ branches:
   only: master
 install: true
 script: ".travis/build.sh"
-after_success: ".travis/notify.sh Travis-Success"
-after_failure: ".travis/notify.sh Travis-Failure"
 env:
   global:
   - secure: jGhSqptdMbp00X5BIRqkkHAS5S0ANgvPYZXJY9SEQa4Mdty69vaQk9kmvMdzFUNum0OeevQ1Vh4OFLel6wUaxDpArcVhjyhBvMVErHnWKeR1wnX13JIrZ4A/+UUVRAtP8p7O6vtNI0G5TyV2PcXdrP4a6I08v8BxAbsZOgqHvQ0=

.travis/build.sh

@@ -1,7 +1,10 @@
 #!/bin/sh
 dir="$(dirname "$0")"
-test "$TRAVIS_SECURE_ENV_VARS" = true \
+if [ "$TRAVIS_SECURE_ENV_VARS" = true \
   -a "$TRAVIS_PULL_REQUEST" = false \
-  -a "$TRAVIS_BRANCH" = master &&
-  mvn -Pdeploy-to-imagej deploy --settings "$dir/settings.xml" ||
+  -a "$TRAVIS_BRANCH" = master ]
+then
+  mvn -Pdeploy-to-imagej deploy --settings "$dir/settings.xml"
+else
   mvn install
+fi

.travis/notify.sh

@@ -9,9 +9,8 @@
 		<relativePath />
 	</parent>
 
-	<groupId>net.imglib2</groupId>
 	<artifactId>imglib2-algorithm</artifactId>
-	<version>0.6.4-SNAPSHOT</version>
+	<version>0.8.2-SNAPSHOT</version>
 
 	<name>ImgLib2 Algorithms</name>
 	<description>Useful image processing algorithms.</description>
@@ -189,13 +188,16 @@ Aivar Grislis, Jonathan Hale, Grant Harris, Stefan Helfrich, Mark Hiner,
 Martin Horn, Steffen Jaensch, Lee Kamentsky, Larry Lindsey, Melissa Linkert,
 Mark Longair, Brian Northan, Nick Perry, Curtis Rueden, Johannes Schindelin,
 Jean-Yves Tinevez and Michael Zinsmaier.</license.copyrightOwners>
+
+		<imglib2-realtransform.version>2.0.0-beta-38</imglib2-realtransform.version>
+		<jitk-tps.version>3.0.0</jitk-tps.version>
 	</properties>
 
 	<repositories>
 		<!-- NB: for SciJava dependencies -->
 		<repository>
 			<id>imagej.public</id>
-			<url>http://maven.imagej.net/content/groups/public</url>
+			<url>https://maven.imagej.net/content/groups/public</url>
 		</repository>
 	</repositories>
 
@@ -230,6 +232,11 @@ Jean-Yves Tinevez and Michael Zinsmaier.</license.copyrightOwners>
 			<artifactId>trove4j</artifactId>
 			<version>3.0.3</version>
 		</dependency>
+		<dependency>
+			<groupId>org.ojalgo</groupId>
+			<artifactId>ojalgo</artifactId>
+			<version>43.0</version>
+		</dependency>
 
 		<!-- Test dependencies -->
 		<dependency>
@@ -238,4 +245,15 @@ Jean-Yves Tinevez and Michael Zinsmaier.</license.copyrightOwners>
 			<scope>test</scope>
 		</dependency>
 	</dependencies>
+
+	<build>
+		<plugins>
+			<plugin>
+				<artifactId>maven-javadoc-plugin</artifactId>
+				<configuration>
+					<additionalparam>--allow-script-in-comments -header '&lt;script type="text/javascript" src="http://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML"&gt;&lt;/script&gt;'</additionalparam>
+				</configuration>
+			</plugin>
+		</plugins>
+	</build>
 </project>

pom.xml

@@ -35,7 +35,8 @@
 package net.imglib2.algorithm;
 
 /**
- * TODO This interface should be empty and extend Callable<F>, Algorithm.
+ * TODO This interface should be empty and extend {@code Callable<F>},
+ * {@link Algorithm}.
  * 
  * @author Stephan Preibisch
  * @author Stephan Saalfeld

src/main/java/net/imglib2/algorithm/OutputAlgorithm.java

@@ -64,8 +64,8 @@ public class Thresholder
 	 * @param threshold
 	 *            the threshold.
 	 * @param above
-	 *            if <code>true</code>, the target value will be true for source
-	 *            values above the threshold, <code>false</code> otherwise.
+	 *            if {@code true}, the target value will be true for source
+	 *            values above the threshold, {@code false} otherwise.
 	 * @param numThreads
 	 *            the number of threads to use for thresholding.
 	 * @return a new {@link Img} of type {@link BitType} and of same dimension

src/main/java/net/imglib2/algorithm/binary/Thresholder.java

@@ -52,20 +52,21 @@
 
 /**
  * Build the component tree of an image. This is an implementation of the
- * algorithm described by D. Nister and H. Stewenius in
- * "Linear Time Maximally Stable Extremal Regions" (ECCV 2008).
- * 
- * The input to the algorithm is a RandomAccessibleInterval< T >. Further, a
- * Comparator<T> and a {@link PartialComponent.Generator} to instantiate new
- * components are required. Pixel locations are aggregated in
+ * algorithm described by D. Nister and H. Stewenius in "Linear Time Maximally
+ * Stable Extremal Regions" (ECCV 2008).
+ * <p>
+ * The input to the algorithm is a {@code RandomAccessibleInterval< T >}.
+ * Further, a {@code Comparator<T>} and a {@link PartialComponent.Generator} to
+ * instantiate new components are required. Pixel locations are aggregated in
  * {@link PartialComponent}s which are passed to a
  * {@link PartialComponent.Handler} whenever a connected component for a
  * specific threshold is completed.
- * 
+ * </p>
+ * <p>
  * Building up a tree structure out of the completed components should happen in
  * the {@link PartialComponent.Handler} implementation. See
  * {@link PixelListComponentTree} for an example.
- * 
+ * </p>
  * <p>
  * <strong>TODO</strong> Add support for non-zero-min RandomAccessibleIntervals.
  * (Currently, we assume that the input image is a <em>zero-min</em> interval.)

src/main/java/net/imglib2/algorithm/componenttree/BuildComponentTree.java

@@ -37,8 +37,10 @@
 /**
  * For a given threshold value compute the threshold value delta steps down the
  * component tree. This might mean addition or subtraction, depending on whether
- * it's a dark-to-bright or bright-to-dark pass. {@see ComputeDeltaBrightToDark}
- * {@see ComputeDeltaDarkToBright}
+ * it's a dark-to-bright or bright-to-dark pass.
+ * 
+ * @see ComputeDeltaBrightToDark
+ * @see ComputeDeltaDarkToBright
  * 
  * @param <T>
  *            value type of the input image.

src/main/java/net/imglib2/algorithm/componenttree/mser/ComputeDelta.java

@@ -65,23 +65,10 @@
  * Maximally Stable Extremal Regions (MSER) are selected from the component tree
  * as follows. For each component, an instability score is computed as
  * <!-- |R_i - R_{i-\Delta}| / |R_i| -->
- * <math style="display:block">
- * <mi>s</mi><mfenced><msub><mi>R</mi><mi>i</mi></msub></mfenced>
- * <mo>=</mo>
- * <mfrac>
- *   <mfenced open="|" close="|">
- *     <mrow><msub><mi>R</mi><mi>i</mi></msub>
- *   	   <mo lspace=mediummathspace rspace=mediummathspace>\</mo>
- *         <msub><mi>R</mi><mrow><mi>i</mi><mo>-</mo><mi>&Delta;</mi></mrow></msub>
- *     </mrow>
- *   </mfenced>
- *   <mfenced open="|" close="|">
- *     <msub><mi>R</mi><mi>i</mi></msub>
- *   </mfenced>
- * </mfrac>
- * </math>
  * </p>
- * 
+ * <blockquote>
+ * \[\frac{|R_i - R_{i-\Delta}|}{|R_i|}\]
+ * </blockquote>
  * <p>
  * Regions whose score is a local minimum are selected as MSER candidates.
  * </p>
@@ -96,20 +83,10 @@
  * A tree is build of the remaining candidates. Finally, candidates are pruned
  * from the tree, if they are too similar to their parent: Let <em>A</em>,
  * <em>B</em> be a region and its parent. Then <em>A</em> is discarded if
- * <!-- |B - A| / |B| <= minDiversity -->
- * <math style="display:block">
- * <mfrac>
- *   <mfenced open="|" close="|"><mrow>
- *     <mi>B</mi>
- *     <mo lspace=mediummathspace rspace=mediummathspace>\</mo>
- *     <mi>A</mi>
- *   </mrow></mfenced>
- *   <mfenced open="|" close="|"><mi>B</mi></mfenced>
- * </mfrac>
- * <mo>&le;</mo><mi>minDiversity</mi>
- * </math>
  * </p>
- * 
+ * <blockquote>
+ * \[\frac{|B - A|}{|B|} \leq minDiversity\]
+ * </blockquote>
  * <p>
  * <strong>TODO</strong> Add support for non-zero-min RandomAccessibleIntervals.
  * (Currently, we assume that the input image is a <em>zero-min</em> interval.)

src/main/java/net/imglib2/algorithm/componenttree/mser/MserTree.java

@@ -97,8 +97,8 @@ public static < T extends RealType< T > > PixelListComponentTree< T > buildCompo
 	 * @param type
 	 *            a variable of the input image type.
 	 * @param imgFactory
-	 *            used for creating the {@link PixelList} image {@see
-	 *            PixelListComponentGenerator}.
+	 *            used for creating the {@link PixelList} image (see
+	 *            {@link PixelListPartialComponentGenerator}).
 	 * @param darkToBright
 	 *            whether to apply thresholds from dark to bright (true) or
 	 *            bright to dark (false)
@@ -146,8 +146,8 @@ public static < T extends Type< T > > PixelListComponentTree< T > buildComponent
 	 * @param comparator
 	 *            determines ordering of threshold values.
 	 * @param imgFactory
-	 *            used for creating the {@link PixelList} image {@see
-	 *            PixelListComponentGenerator}.
+	 *            used for creating the {@link PixelList} image
+	 *            {@link PixelListPartialComponentGenerator}.
 	 * @return component tree of the image.
 	 */
 	public static < T extends Type< T > > PixelListComponentTree< T > buildComponentTree( final RandomAccessibleInterval< T > input, final T maxValue, final Comparator< T > comparator, final ImgFactory< LongType > imgFactory )