Iterative Hillclimbing Optimization Techniques: For Transform Image Encoding / Decoding And For Image Segmentation,Used

Iterative Hillclimbing Optimization Techniques: For Transform Image Encoding / Decoding And For Image Segmentation,Used

In Stock
SKU: DADAX3838336658
Brand: LAP Lambert Academic Publishing
Condition: New
Regular price$89.87
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 1–3 business days
  • Estimated Delivery: 3–5 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
  • Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund

Returns accepted within 30 days of delivery.

Damaged or Defective Item

Free return shipping + replacement or full refund

Wrong Item Received

Free return shipping + replacement or full refund

Change of Mind

Return shipping at customer's expense · 25% restocking fee applies

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

This book is a reproduction of my thesis work. An iterative hillclimbing optimization technique was introduced in this thesis. It was used to tackle many index assignment problems, i.e. transform image encoding, noisy image decoding, and image segmentation. We introduced an iterative algorithm which has a hillclimbing property on the cost function. We then extended the algorithm to hyperspectral image coding. We realized that the algorithm can be generalized to other applications as well. We applied the iterative hillclimbing idea to noisy channel image decoding. We also investigated a Turbolike joint source channel decoding technique, which is another kind of iterative decoding. Lastly, we reinvestigated the image segmentation application, using the iterative hillclimbing algorithm. The hillclimbing method inspired development of another iterative algorithm which is an extension to meanfield annealing, with applications both to image decoding and image segmentation. The hillclimbing algorithm at the heart of this thesis thus yielded several promising offshoot directions for continuing research.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed