ConjugateGradientPoissonSolver

Instance Constructors

new ConjugateGradientPoissonSolver(tolerance: Double = 1e-6, maxIterations: Int = Int.MaxValue)(implicit arg0: ClassTag[A], vec: ComponentRepresentation[A])

Type Members

case class ImageLinearization(order: IndexedSeq[(Int, Int)], reducedIndex: (Int, Int) ⇒ Int) extends Product with Serializable

provides a linearization (ordering of (x, y) pairs) and reduced index for each (x, y) pair
provides a linearization (ordering of (x, y) pairs) and reduced index for each (x, y) pair

Attributes
protected
Definition Classes
LinearSystemPoissonSolver

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def apply(image: PixelImage[A], mask: PixelImage[Boolean], rhs: PixelImage[A]): PixelImage[A]

solve Poisson's equation in bounding box of mask
solve Poisson's equation in bounding box of mask

Definition Classes
ImageDomainPoissonSolver
final def asInstanceOf[T0]: T0

Definition Classes
Any
def buildNegativeLaplaceMatrix(linearization: ImageLinearization, mask: PixelImage[Boolean], addElement: (Int, Int, Double) ⇒ Unit): Unit

constructs a Laplace matrix, (-Laplace(f) is positive definite) calls addElement for each matrix element
constructs a Laplace matrix, (-Laplace(f) is positive definite) calls addElement for each matrix element

Attributes
protected
Definition Classes
LinearSystemPoissonSolver
def buildNegativeRHS(linearization: ImageLinearization, image: PixelImage[A], rhs: PixelImage[A], component: Int): DenseVector[Double]

negative of righthand side: actually solves (-Laplace(f)) = -rhs
negative of righthand side: actually solves (-Laplace(f)) = -rhs

Attributes
protected
Definition Classes
LinearSystemPoissonSolver
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate() @throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def findLinearization(mask: PixelImage[Boolean]): ImageLinearization

find a good linearization order (currently select column major or row major only)
find a good linearization order (currently select column major or row major only)

Attributes
protected
Definition Classes
LinearSystemPoissonSolver
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
def getNeighbours4(x: Int, y: Int): IndexedSeq[(Int, Int)]

find 4-neighbourhood
find 4-neighbourhood

Attributes
protected
Definition Classes
LinearSystemPoissonSolver
def hashCode(): Int

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def linearizeImage(linearization: ImageLinearization, image: PixelImage[A], component: Int): DenseVector[Double]

Attributes
protected
Definition Classes
LinearSystemPoissonSolver
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
def reconstructImageComponent(solution: DenseVector[Double], linearization: ImageLinearization, image: PixelImage[A], component: Int): PixelImage[Double]

Attributes
protected
Definition Classes
LinearSystemPoissonSolver
def solvePoisson(image: PixelImage[A], mask: PixelImage[Boolean], rhs: PixelImage[A]): PixelImage[A]

solve Poisson's equation
solve Poisson's equation
image
initial and boundary values, fixed values of f
mask
marks domain where solution is required, (true: fill-in trough equation (with f), false: keep fixed (boundary value))
rhs
right-hand side of Poisson equation

Definition Classes
ConjugateGradientPoissonSolver → ImageDomainPoissonSolver
def solvePoissonInBoundingBox(image: PixelImage[A], mask: PixelImage[Boolean], rhs: PixelImage[A]): PixelImage[A]

solve Poisson's equation in bounding box of mask
solve Poisson's equation in bounding box of mask

Definition Classes
ImageDomainPoissonSolver
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Deprecated Value Members

def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
Deprecated
(Since version ) see corresponding Javadoc for more information.

Related Doc: package numerics

class ConjugateGradientPoissonSolver[A] extends LinearSystemPoissonSolver[A]

Instance Constructors

new ConjugateGradientPoissonSolver(tolerance: Double = 1e-6, maxIterations: Int = Int.MaxValue)(implicit arg0: ClassTag[A], vec: ComponentRepresentation[A])

Type Members

case class ImageLinearization(order: IndexedSeq[(Int, Int)], reducedIndex: (Int, Int) ⇒ Int) extends Product with Serializable

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def apply(image: PixelImage[A], mask: PixelImage[Boolean], rhs: PixelImage[A]): PixelImage[A]

final def asInstanceOf[T0]: T0

def buildNegativeLaplaceMatrix(linearization: ImageLinearization, mask: PixelImage[Boolean], addElement: (Int, Int, Double) ⇒ Unit): Unit

def buildNegativeRHS(linearization: ImageLinearization, image: PixelImage[A], rhs: PixelImage[A], component: Int): DenseVector[Double]

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def findLinearization(mask: PixelImage[Boolean]): ImageLinearization

final def getClass(): Class[_]

def getNeighbours4(x: Int, y: Int): IndexedSeq[(Int, Int)]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def linearizeImage(linearization: ImageLinearization, image: PixelImage[A], component: Int): DenseVector[Double]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def reconstructImageComponent(solution: DenseVector[Double], linearization: ImageLinearization, image: PixelImage[A], component: Int): PixelImage[Double]

def solvePoisson(image: PixelImage[A], mask: PixelImage[Boolean], rhs: PixelImage[A]): PixelImage[A]

def solvePoissonInBoundingBox(image: PixelImage[A], mask: PixelImage[Boolean], rhs: PixelImage[A]): PixelImage[A]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

Deprecated Value Members

def finalize(): Unit

Inherited from LinearSystemPoissonSolver[A]

Inherited from ImageDomainPoissonSolver[A]

Inherited from AnyRef

Inherited from Any

Ungrouped