Skip to content
Save 5% on your next order with code PREMIUM5!
100,000+ Products for Home, Medical, Office & Classroom Needs
Search

LSTM Recurrent Neural Networks for Signature Verification - Paperback

$76.21 USD
$76.21 USD
Sale Sold out
Shipping calculated at checkout.
In stock (100 units), ready to be shipped

Available Offers

Fast delivery available on most orders

Multiple secure payment options accepted

Secure checkout with
  • American Express
  • Apple Pay
  • Diners Club
  • Discover
  • Google Pay
  • Mastercard
  • PayPal
  • Shop Pay
  • Visa

Flight Range: Up to 1,000 meters (3,280 feet)

Maximum Speed: 45 kilometers per hour (28 miles per hour)

For all orders exceeding a value of 100USD shipping is offered for free.

Returns will be accepted for up to 10 days of Customer’s receipt or tracking number on unworn items. You, as a Customer, are obliged to inform us via email before you return the item.

Otherwise, standard shipping charges apply. Check out our delivery Terms & Conditions for more details.

View Product Details
Shopping cart
Product Product subtotal Quantity Price Product subtotal
LSTM Recurrent Neural Networks for Signature Verification - Paperback
LSTM Recurrent Neural Networks for Signature Verification - Paperback
$76.21/ea
$0.00
$76.21/ea $0.00

Product Description

by Conrad Tiflin (Author)

The author investigated the application of Long Short-Term Memory (LSTM) Recurrent Neural Networks (RNNs) to the task of signature verification. Traditional RNNs are capable of modeling dynamical systems with hidden states; they have been successfully applied to domains ranging from financial forecasting to control and speech recognition. This manuscript is the result of successfully applying on-line signature time series data to traditional LSTM, LSTM with forget gates and LSTM with peephole connections algorithms originally developed by S. Hochreiter and J. Schmidhuber. It can be clearly seen in this pattern classification problem that traditional LSTM RNNs outperform LSTMs with forget gates and peephole connections. The latter also outperform traditional RNNs which cannot seem to even learn this task due to the long-term dependency problem.

Number of Pages: 104
Dimensions: 0.25 x 9 x 6 IN
Publication Date: February 06, 2012
you might like