Packages

  • package root
    Definition Classes
    root
  • package scalismo
    Definition Classes
    root
  • package image

    Contains classes for representing discrete and continuous images as well as filters for filtering both types of images.

    Contains classes for representing discrete and continuous images as well as filters for filtering both types of images.

    In this library, the standard type of images are just functions, defined on some domain. There is also the more traditional discrete image type, which represents image data on a regular pixel/voxel grid.

    DiscreteImages are mainly used for reading/writing and simple manipulation of image values. The continuous representation of images is much more flexible and most method for manipulating images are defined only on this image type. A discrete image can be converted to a continuous image by using an interpolation procedure:

    val domain = StructuredPoints(Point(0,0), Vector(1,1), Index(255,255))
val di = DiscreteImage(domain)(0)
val discreteImage =  DiscreteImage(domain, (_ : Point[_2D]) => 1.0f)
val continuousImage = discreteImage.interpolate(3)

    To get back the discrete representation, we can sample the image values on a regular grid:

    val newDomain = StructuredPoints(Point(0,0), Vector(1,1), Index(128,128))
val resampledDiscreteImage = continuousImage.sample(domain, 0)
    Definition Classes
    scalismo
  • package filter
    Definition Classes
    image
  • CreateStructuredPoints
  • DiscreteImage
  • DiscreteImage1D
  • DiscreteImage2D
  • DiscreteImage3D
  • DiscreteImageDomain
  • DiscreteImageDomain1D
  • DiscreteImageDomain2D
  • DiscreteImageDomain3D
  • DiscreteImageOps
  • StructuredPoints
  • StructuredPoints1D
  • StructuredPoints2D
  • StructuredPoints3D

abstract class StructuredPoints[D] extends PointSet[D] with Equals

Defines points in D dimension which are aligned on a regular grid.

The grid points are defined by specifying an origin, a spacing between the grid points, and the size (number of points) in each direction.

A global coordinate system is assumed, and all units are measured in mm.

D

The dimensionality of the domain

Linear Supertypes
PointSet[D], Equals, AnyRef, Any
Known Subclasses
StructuredPoints1D, StructuredPoints2D, StructuredPoints3D
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. StructuredPoints
  2. PointSet
  3. Equals
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new StructuredPoints()(implicit arg0: NDSpace[D])

Abstract Value Members

  1. abstract def boundingBox: BoxDomain[D]

    a rectangular region that represents the area, which defines the bounding box of the points

    a rectangular region that represents the area, which defines the bounding box of the points

    Definition Classes
    StructuredPoints → PointSet
  2. abstract def directions: SquareMatrix[D]

    Direction cosine matrix

  3. abstract def index(pointId: PointId): IntVector[D]

    The index for the given point id

  4. abstract def origin: Point[D]

    the first point (lower-left corner in 2D) of the grid

  5. abstract def pointId(idx: IntVector[D]): PointId

    converts a grid index into a id that identifies a point

  6. abstract def points: Iterator[Point[D]]
    Definition Classes
    PointSet
  7. abstract def pointsInChunks(nbChunks: Int): IndexedSeq[Iterator[Point[D]]]

    * Returns the domain points in n chunks.

    * Returns the domain points in n chunks. Each chunk of the points is given as an iterator

    The main idea behind this method is to be able to easily parallelize on the domain points, as parallel operations on a single iterator in Scala end up more costly than sequential access in our case. Using this method, one would parallelize on the Seq of iterators instead.

    Definition Classes
    StructuredPoints → PointSet
  8. abstract def size: IntVector[D]

    the number of points in each direction

  9. abstract def spacing: EuclideanVector[D]

    the distance (in mm) between two points in each space direction

  10. abstract def transform(t: (Point[D]) => Point[D]): PointSet[D]
    Definition Classes
    PointSet

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def canEqual(a: Any): Boolean
    Definition Classes
    StructuredPoints → PointSet → Equals
  6. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  7. val dimensionality: Int

    the dimensionality of the domain

  8. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  9. def equals(a: Any): Boolean
    Definition Classes
    StructuredPoints → PointSet → Equals → AnyRef → Any
  10. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  11. def findClosestPoint(pt: Point[D]): PointWithId[D]

    returns the closest point in this set to the given point

    returns the closest point in this set to the given point

    Definition Classes
    StructuredPoints → PointSet
  12. def findNClosestPoints(pt: Point[D], n: Int): Seq[PointWithId[D]]

    returns the n closest points to the given set of points

    returns the n closest points to the given set of points

    Definition Classes
    StructuredPoints → PointSet
  13. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  14. def hashCode(): Int
    Definition Classes
    StructuredPoints → PointSet → AnyRef → Any
  15. def indexToPoint(i: IntVector[D]): Point[D]
  16. def isDefinedAt(idx: IntVector[D]): Boolean

    true if the point is part of the grid points

  17. def isDefinedAt(pt: Point[D]): Boolean

    true if the point is part of the grid points

    true if the point is part of the grid points

    Definition Classes
    StructuredPoints → PointSet
  18. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  19. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  21. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  22. def numberOfPoints: Int
    Definition Classes
    StructuredPoints → PointSet
  23. def point(id: PointId): Point[D]

    returns the points belonging to the given id

    returns the points belonging to the given id

    Definition Classes
    StructuredPoints → PointSet
  24. def pointId(pt: Point[D]): Option[PointId]

    returns the point id in case it is defined, None otherwise.

    returns the point id in case it is defined, None otherwise.

    Definition Classes
    StructuredPoints → PointSet
  25. def pointIds: Iterator[PointId]
    Definition Classes
    PointSet
  26. def pointsWithId: Iterator[(Point[D], PointId)]
    Definition Classes
    PointSet
  27. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  28. def toString(): String
    Definition Classes
    AnyRef → Any
  29. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  30. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  31. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from PointSet[D]

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped