Home > Computing and Information Technology > Graphical and digital media applications > Discrete Geometry for Computer Imagery: 13th International Conference, DGCI 2006, Szeged, Hungary, October 25-27, 2006, Proceedings(4245 Lecture Notes in Computer Science)
60%
Discrete Geometry for Computer Imagery: 13th International Conference, DGCI 2006, Szeged, Hungary, October 25-27, 2006, Proceedings(4245 Lecture Notes in Computer Science)

Discrete Geometry for Computer Imagery: 13th International Conference, DGCI 2006, Szeged, Hungary, October 25-27, 2006, Proceedings(4245 Lecture Notes in Computer Science)

          
5
4
3
2
1

Available


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

This book constitutes the refereed proceedings of the 13th International Conference on Discrete Geometry for Computer Imagery, DGCI 2006, held in Szeged, Hungary in October 2006. The 28 revised full papers and 27 revised poster papers presented together with two invited papers were carefully reviewed and selected from 99 submissions.

Table of Contents:
Discrete Geometry.- Duality and Geometry Straightness, Characterization and Envelope.- On Minimal Perimeter Polyminoes.- A Generic Approach for n-Dimensional Digital Lines.- Two Discrete-Euclidean Operations Based on the Scaling Transform.- Geometry of Neighborhood Sequences in Hexagonal Grid.- Recognition of Blurred Pieces of Discrete Planes.- Discrete Tomography.- The Number of Line-Convex Directed Polyominoes Having the Same Orthogonal Projections.- A Network Flow Algorithm for Binary Image Reconstruction from Few Projections.- Fast Filling Operations Used in the Reconstruction of Convex Lattice Sets.- Reconstruction Algorithm and Switching Graph for Two-Projection Tomography with Prohibited Subregion.- A Geometry Driven Reconstruction Algorithm for the Mojette Transform.- Quantised Angular Momentum Vectors and Projection Angle Distributions for Discrete Radon Transformations.- A Benchmark Evaluation of Large-Scale Optimization Approaches to Binary Tomography.- Construction of Switching Components.- Discrete Topology.- Minimal Non-simple and Minimal Non-cosimple Sets in Binary Images on Cell Complexes.- Combinatorial Relations for Digital Pictures.- Reusing Integer Homology Information of Binary Digital Images.- On the Lattice Structure of Subsets of Octagonal Neighborhood Sequences in ?n.- On the Connectedness of Rational Arithmetic Discrete Hyperplanes.- Homology of Simploidal Set.- Measuring Intrinsic Volumes in Digital 3d Images.- Distance.- An Objective Comparison Between Gray Weighted Distance Transforms and Weighted Distance Transforms on Curved Spaces.- Chordal Axis on Weighted Distance Transforms.- Attention-Based Mesh Simplification Using Distance Transforms.- Generating Distance Maps with Neighbourhood Sequences.- Hierarchical Chamfer Matching Based on Propagation of Gradient Strengths.- Elliptical Distance Transforms and Applications.- Image Analysis.- A Composite and Quasi Linear Time Method for Digital Plane Recognition.- Fusion Graphs, Region Merging and Watersheds.- Revisiting Digital Straight Segment Recognition.- On Discrete Moments of Unbounded Order.- Feature Based Defuzzification in ?2 and ?3 Using a Scale Space Approach.- Improving Difference Operators by Local Feature Detection.- Shape Representation.- An Optimal Algorithm for Detecting Pseudo-squares.- Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification.- Arithmetic Discrete Hyperspheres and Separatingness.- The Eccentricity Transform (of a Digital Shape).- Projected Area Based 3D Shape Similarity Evaluation.- Continuous Level of Detail on Graphics Hardware.- Topological and Geometrical Reconstruction of Complex Objects on Irregular Isothetic Grids.- Fast Polynomial Segmentation of Digitized Curves.- Segmentation.- Fuzzy Segmentation of Color Video Shots.- Application of Surface Topological Segmentation to Seismic Imaging.- Watershed Segmentation with Chamfer Metric.- Generalized Map Pyramid for Multi-level 3D Image Segmentation.- Topologically Correct Image Segmentation Using Alpha Shapes.- Skeletonization.- New Removal Operators for Surface Skeletonization.- Skeleton Pruning by Contour Partitioning.- A New 3D Parallel Thinning Scheme Based on Critical Kernels.- Order Independence in Binary 2D Homotopic Thinning.- Exact Euclidean Medial Axis in Higher Resolution.- Skeletonization and Distance Transforms of 3D Volumes Using Graphics Hardware.- Surfaces and Volumes.- How to Tile by Dominoes the Boundary of a Polycube.- A Generalized Preimage for the Standard and Supercover Digital Hyperplane Recognition.- Distance Transforms on Anisotropic Surfaces for Surface Roughness Measurement.- A 3D Live-Wire Segmentation Method for Volume Images Using Haptic Interaction.- Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard.- Erratum.- Topological and Geometrical Reconstruction of Complex Objects on Irregular Isothetic Grids.


Best Sellers


Product Details
  • ISBN-13: 9783540476511
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Depth: 0.3125
  • Height: 235 mm
  • No of Pages: 688
  • Series Title: 4245 Lecture Notes in Computer Science
  • Spine Width: 25 mm
  • Weight: 978 gr
  • ISBN-10: 3540476512
  • Publisher Date: 10 Oct 2006
  • Binding: Paperback
  • Edition: 2006 ed.
  • Language: English
  • Returnable: Y
  • Series Title: Image Processing, Computer Vision, Pattern Recognition, and Graphics
  • Sub Title: 13th International Conference, DGCI 2006, Szeged, Hungary, October 25-27, 2006, Proceedings
  • Width: 155 mm


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Discrete Geometry for Computer Imagery: 13th International Conference, DGCI 2006, Szeged, Hungary, October 25-27, 2006, Proceedings(4245 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Discrete Geometry for Computer Imagery: 13th International Conference, DGCI 2006, Szeged, Hungary, October 25-27, 2006, Proceedings(4245 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Discrete Geometry for Computer Imagery: 13th International Conference, DGCI 2006, Szeged, Hungary, October 25-27, 2006, Proceedings(4245 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA