Predicting Image Data Srs 12 by Güth Philipp (6 results)
- Softcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller4-star sellerCondition: New
£ 30.95
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 24.63
£ 51.69 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Bachelor Thesis from the year 2015 in the subject Computer Science - Applied, grade: 1.0, University of Heidelberg (Computer Science), language: English, abstract: Determining point similarity is a cornerstone for a wide variety of applications. Wh…enever data is being compared, the problem can be stated as a matter of comparing vectors. Dueto this fundamental importance, research has been conducted in this area for decades. For a long time, even for relatively low dimensions such as for example d = 10, complexity was far beyond of what was considered to be feasible in practice. A common approach is to soften the requirements for the accuracy of the neighbor search and look for points within a certain proximity to the query point instead of searching for exact neighbors.In this thesis we evaluate how well the SRS-12 algorithm works on real-world image data in order to lay the ground for future work such as image prediction. The SRS-12 algorithm is an approach to c-approximate nearest-neighbors and claims to have a tiny index and arbitrary approximation ratio while maintaining good theoretical guarantees.We first implement and verify the algorithm and subsequently examine the quality of its outputs when it is applied to image data by performing block matching. We find that the SRS-12algorithm is indeed very suitable for processing image data as long as the input images are cut into patches that are sufficiently large. However the parameters of the algorithm have to be tuned carefully because they significantly affect not only the quality of the results, but also the computation time which can easily exceed an exact nearest-neighbor query if the parameters are not set properly. We conclude our experiment with a recommendation for well-working parameter settings and propose approaches to enhance the quality and speed of approximate nearest-neighbor queries on image data made with the SRS-12 algorithm such that it can be used in real-time.
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
£ 24.63
£ 19.68 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Bachelor Thesis from the year 2015 in the subject Computer Science - Applied, grade: 1.0, University of Heidelberg (Computer Science), language: English, abstract: Determining point similarity is a cornerstone for a wide variety of…applications. Whenever data is being compared, the problem can be stated as a matter of comparing vectors. Dueto this fundamental importance, research has been conducted in this area for decades. For a long time, even for relatively low dimensions such as for example d = 10, complexity was far beyond of what was considered to be feasible in practice. A common approach is to soften the requirements for the accuracy of the neighbor search and look for points within a certain proximity to the query point instead of searching for exact neighbors.In this thesis we evaluate how well the SRS-12 algorithm works on real-world image data in order to lay the ground for future work such as image prediction. The SRS-12 algorithm is an approach to c-approximate nearest-neighbors and claims to have a tiny index and arbitrary approximation ratio while maintaining good theoretical guarantees.We first implement and verify the algorithm and subsequently examine the quality of its outputs when it is applied to image data by performing block matching. We find that the SRS-12algorithm is indeed very suitable for processing image data as long as the input images are cut into patches that are sufficiently large. However the parameters of the algorithm have to be tuned carefully because they significantly affect not only the quality of the results, but also the computation time which can easily exceed an exact nearest-neighbor query if the parameters are not set properly. We conclude our experiment with a recommendation for well-working parameter settings and propose approaches to enhance the quality and speed of approximate nearest-neighbor queries on image data made with the SRS-12 algorithm such that it can be used in real-time. 48 pp. Englisch.
- Softcover
- Print on Demand
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: New
£ 46.97
£ 6.50 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
Condition: New. Print on Demand pp. 48.
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
£ 24.63
£ 51.33 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Bachelor Thesis from the year 2015 in the subject Computer Science - Applied, grade: 1.0, University of Heidelberg (Computer Science), language: English, abstract: Determining point similarity is a cornerstone for a wide variety of appl…ications. Whenever data is being compared, the problem can be stated as a matter of comparing vectors. Dueto this fundamental importance, research has been conducted in this area for decades. For a long time, even for relatively low dimensions such as for example d = 10, complexity was far beyond of what was considered to be feasible in practice. A common approach is to soften the requirements for the accuracy of the neighbor search and look for points within a certain proximity to the query point instead of searching for exact neighbors. In this thesis we evaluate how well the SRS-12 algorithm works on real-world image data in order to lay the ground for future work such as image prediction. The SRS-12 algorithm is an approach to c-approximate nearest-neighbors and claims to have a tiny index and arbitrary approximation ratio while maintaining good theoretical guarantees. We first implement and verify the algorithm and subsequently examine the quality of its outputs when it is applied to image data by performing block matching. We find that the SRS-12 algorithm is indeed very suitable for processing image data as long as the input images are cut into patches that are sufficiently large. However the parameters of the algorithm have to be tuned carefully because they significantly affect not only the quality of the results, but also the computation time which can easily exceed an exact nearest-neighbor query if the parameters are not set properly. We conclude our experiment with a recommendation for well-working parameter settings and propose approaches to enhance the quality and speed of approximate nearest-neighbor queries on image data made with the SRS-12 algorithm such that it can be used in real-time.Books on Demand GmbH, Überseering 33, 22297 Hamburg 48 pp. Englisch.
- Softcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 24.63
£ 59.88 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Predicting image data with the SRS-12 algorithm. Applying random projection-based c-approximate nearest-neighbor queries to image data | Philipp Güth | Taschenbuch | 48 S. | Englisch | 2015 | GRIN Verlag | EAN 9783668033559 | Verantwortliche Person für die EU: GRIN Publishing GmbH, Waltherstr. 23, 80…337 München, info[at]grin[dot]com | Anbieter: preigu Print on Demand.
