Author hosts Fast Stereo Matching Demo website
Author is widely-published leader in the field
Computer vision problems are much larger than ever before. One way to satisfy demand is to design more efficient and clever algorithms that optimize computations in an existing processor. Such fast algorithms are becoming increasingly important for tele-reality, interactive media and visual serving applications. This book presents fast and reliable algorithms for dense stereo matching – for every point on the image – and optical-flow estimations using a general language, such as C, rather than dedicated hardware implementation.
Techniques described are: fast algorithms for similarity measure, use of subregioning technique to expedite similarity calculation, multiresolution scheme, fast 3-D surface technique for stereo matching, and stereo matching using warping. Fast Algorithms for Stereo Matching is a useful reference for academics, professionals, researchers, practitioners, and advanced graduate students in the areas of computer vision, digital photogrammetry, and 3-D video coding.
|An ongoing effort is being made in the field of computer vision to refine algorithms for optimal/better performance, which can mean reliability and increased computational speed. This is highly important given that vision problems are much larger than ever before. One way to satisfy part of the demand is to design more efficient and clever algorithms that optimize computations in an existing processor, rather than require expanded processor performance. Such fast algorithms are becoming increasingly important for tele-reality, interactive media and visual serving applications. This book presents some fast and reliable algorithms for dense stereo matching and optical-flow estimations using a general language, such as C, rather than dedicated hardware implementation. "Dense" in this instance means performing stereo matching for every point on the image rather than just matching features such as points, lines or regions. Techniques described are: fast algorithms for similarity measure, use of subregioning technique to expedite similarity calculation, multiresolution scheme, fast 3-D surface technique for stereo matching, and stereo matching using warping. Fast Algorithms for Stereo Matching is useful for academics, professionals, researchers, practitioners, and advanced graduate students in the areas of computer vision, digital photogrammetry, and 3-D video coding.|
An ongoing effort is being made in the field of computer vision to refine algorithms for optimal/better performance, which can mean reliability and increased computational speed. Such fast algorithms are becoming increasingly important for tele-reality, interactive media and visual serving applications. This book presents some fast and reliable algorithms for dense stereo matching and optical-flow estimations. Techniques described include: fast algorithms for similarity measure, use of subregioning technique to expedite similarity calculation, multiresolution scheme, fast 3-D surface technique for stereo matching, and stereo matching using warping.
Introduction.- Stereo vision.- Fast calculation of similarity measures.- Rectangular subregioning.- Multi-resolution Scheme.- Fast stereo matching.- Stereo matching using 3-D surface.- Stereo matching using warping.- Panoramic stereo matching.- Fast optical flow.- Discussions on reliability and speed.- Applications.
This book presents fast and reliable algorithms for dense stereo matching - for every point on the image - and optical-flow estimations using a general language, such as C, optimize computations in an existing processor.
Computer vision problems are much larger than ever before. One way to satisfy demand is to design more efficient and clever algorithms that optimize computations in an existing processor. Such fast algorithms are becoming increasingly important for tele-reality, interactive media and visual serving applications. This book presents fast and reliable algorithms for dense stereo matching - for every point on the image - and optical-flow estimations using a general language, such as C, rather than dedicated hardware implementation.
Techniques described are: fast algorithms for similarity measure, use of subregioning technique to expedite similarity calculation, multiresolution scheme, fast 3-D surface technique for stereo matching, and stereo matching using warping. Fast Algorithms for Stereo Matching is a useful reference for academics, professionals, researchers, practitioners, and advanced graduate students in the areas of computer vision, digital photogrammetry, and 3-D video coding.
Introduction.- Stereo vision.- Fast calculation of similarity measures.- Rectangular subregioning.- Multi-resolution Scheme.- Fast stereo matching.- Stereo matching using 3-D surface.- Stereo matching using warping.- Panoramic stereo matching.- Fast optical flow.- Discussions on reliability and speed.- Applications.
An ongoing effort is being made in the field of computer vision to refine algorithms for optimal/better performance, which can mean reliability and increased computational speed. Such fast algorithms are becoming increasingly important for tele-reality, interactive media and visual serving applications. This book presents some fast and reliable algorithms for dense stereo matching and optical-flow estimations. Techniques described include: fast algorithms for similarity measure, use of subregioning technique to expedite similarity calculation, multiresolution scheme, fast 3-D surface technique for stereo matching, and stereo matching using warping.
Inhaltsverzeichnis
Introduction.- Stereo vision.- Fast calculation of similarity measures.- Rectangular subregioning.- Multi-resolution Scheme.- Fast stereo matching.- Stereo matching using 3-D surface.- Stereo matching using warping.- Panoramic stereo matching.- Fast optical flow.- Discussions on reliability and speed.- Applications.
Klappentext
Computer vision problems are much larger than ever before. One way to satisfy demand is to design more efficient and clever algorithms that optimize computations in an existing processor. Such fast algorithms are becoming increasingly important for tele-reality, interactive media and visual serving applications. This book presents fast and reliable algorithms for dense stereo matching - for every point on the image - and optical-flow estimations using a general language, such as C, rather than dedicated hardware implementation.
Techniques described are: fast algorithms for similarity measure, use of subregioning technique to expedite similarity calculation, multiresolution scheme, fast 3-D surface technique for stereo matching, and stereo matching using warping. Fast Algorithms for Stereo Matching is a useful reference for academics, professionals, researchers, practitioners, and advanced graduate students in the areas of computer vision, digital photogrammetry, and 3-D video coding.
An ongoing effort is being made in the field of computer vision to refine algorithms for optimal/better performance, which can mean reliability and increased computational speed. Such fast algorithms are becoming increasingly important for tele-reality, interactive media and visual serving applications. This book presents some fast and reliable algorithms for dense stereo matching and optical-flow estimations. Techniques described include: fast algorithms for similarity measure, use of subregioning technique to expedite similarity calculation, multiresolution scheme, fast 3-D surface technique for stereo matching, and stereo matching using warping.
