"Derich\u016Fv hranov\u00FD detektor je hranov\u00FD oper\u00E1tor vyvinut\u00FD R. Derichem v roce 1987. Jedn\u00E1 se o v\u00EDcekrokov\u00FD algoritmus pro z\u00EDsk\u00E1n\u00ED optim\u00E1ln\u00EDho v\u00FDsledku p\u0159i detekci hran v diskr\u00E9tn\u00EDm dvourozm\u011Brn\u00E9m obraze. Tento algoritmus vych\u00E1z\u00ED z pr\u00E1ce Johna F. Cannyho a p\u0159eb\u00EDr\u00E1 jak jednotliv\u00E9 kroky hranov\u00E9 detekce, tak tak\u00E9 navr\u017Een\u00E1 krit\u00E9ria pro optim\u00E1ln\u00ED hranov\u00FD detektor, kter\u00FDmi jsou: \n* Kvalita detekce \u2013 Mus\u00ED b\u00FDt nalezeny v\u0161echny hrany v obraze, a naopak nesm\u00ED b\u00FDt za hrany ozna\u010Deny ty \u010D\u00E1sti obrazu, kter\u00E9 jimi nejsou. \n* P\u0159esnost \u2212 nalezen\u00E9 hrany mus\u00ED b\u00FDt tak bl\u00EDzko skute\u010Dn\u00E9 hran\u011B v obraze, jak je to jen mo\u017En\u00E9. \n* Jednozna\u010Dnost \u2212 nalezen\u00E1 hrana v obraze je ozna\u010Dena jako hrana pouze jednou, nesm\u00ED doch\u00E1zet ke vzniku v\u00EDcen\u00E1sobn\u00E9 odezvy na jednu hranu. Z tohoto d\u016Fvodu se \u010Dasto tento oper\u00E1tor ozna\u010Duje jako Cannyho-Derich\u016Fv detektor."@cs . "\u062E\u0648\u0627\u0631\u0632\u0645\u064A\u0629 \u062F\u0631\u064A\u0634 \u0644\u0643\u0634\u0641 \u0627\u0644\u062D\u0648\u0627\u0641"@ar . "10412"^^ . . "Deriche edge detector is an edge detection operator developed by Rachid Deriche in 1987. It is a multistep algorithm used to obtain an optimal result of edge detection in a discrete two-dimensional image. This algorithm is based on John F. Canny's work related to the edge detection (Canny's edge detector) and his criteria for optimal edge detection: \n* Detection quality \u2013 all existing edges should be marked and no false detection should occur. \n* Accuracy - the marked edges should be as close to the edges in the real image as possible. \n* Unambiguity - a given edge in the image should only be marked once. No multiple responses to one edge in the real image should occur. For this reason, this algorithm is often referred to as Canny-Deriche detector."@en . . . . . "Deriche edge detector"@en . . . . "34030855"^^ . . . . . . . . . "Derich\u016Fv hranov\u00FD detektor"@cs . . . . . . "Derich\u016Fv hranov\u00FD detektor je hranov\u00FD oper\u00E1tor vyvinut\u00FD R. Derichem v roce 1987. Jedn\u00E1 se o v\u00EDcekrokov\u00FD algoritmus pro z\u00EDsk\u00E1n\u00ED optim\u00E1ln\u00EDho v\u00FDsledku p\u0159i detekci hran v diskr\u00E9tn\u00EDm dvourozm\u011Brn\u00E9m obraze. Tento algoritmus vych\u00E1z\u00ED z pr\u00E1ce Johna F. Cannyho a p\u0159eb\u00EDr\u00E1 jak jednotliv\u00E9 kroky hranov\u00E9 detekce, tak tak\u00E9 navr\u017Een\u00E1 krit\u00E9ria pro optim\u00E1ln\u00ED hranov\u00FD detektor, kter\u00FDmi jsou: Z tohoto d\u016Fvodu se \u010Dasto tento oper\u00E1tor ozna\u010Duje jako Cannyho-Derich\u016Fv detektor."@cs . . . . . . "1120132033"^^ . . . . . "\u0412\u0438\u044F\u0432\u043B\u044F\u0447 \u043A\u043E\u043D\u0442\u0443\u0440\u0456\u0432 \u0414\u0435\u0440\u0456\u0448\u0430"@uk . . . . . . . . . "\u062E\u0648\u0627\u0631\u0632\u0645\u064A\u0629 \u062F\u0631\u064A\u0634 \u0644\u0643\u0634\u0641 \u0627\u0644\u062D\u0648\u0627\u0641 \u0623\u0648 \u0627\u0644\u0645\u0631\u0634\u062D \u0627\u0644\u0631\u0642\u0645\u064A \u0644\u062F\u0631\u064A\u0634 \u0623\u0648 \u0643\u0627\u0634\u0641 \u0627\u0644\u062D\u0648\u0627\u0641 \u0644\u062F\u0631\u064A\u0634 \u0647\u064A \u062E\u0648\u0627\u0631\u0632\u0645\u064A\u0629 \u0643\u0634\u0641 \u0627\u0644\u062D\u0648\u0627\u0641 \u0645\u0646 \u0627\u0643\u062A\u0634\u0627\u0641 \u0627\u0644\u0628\u0631\u0648\u0641\u064A\u0633\u0648\u0631 \u0627\u0644\u062C\u0632\u0627\u0626\u0631\u064A \u0631\u0634\u064A\u062F \u062F\u0631\u064A\u0634 \u062E\u0644\u0627\u0644 \u0639\u0627\u0645 1987\u0645."@ar . . . . . "\u062E\u0648\u0627\u0631\u0632\u0645\u064A\u0629 \u062F\u0631\u064A\u0634 \u0644\u0643\u0634\u0641 \u0627\u0644\u062D\u0648\u0627\u0641 \u0623\u0648 \u0627\u0644\u0645\u0631\u0634\u062D \u0627\u0644\u0631\u0642\u0645\u064A \u0644\u062F\u0631\u064A\u0634 \u0623\u0648 \u0643\u0627\u0634\u0641 \u0627\u0644\u062D\u0648\u0627\u0641 \u0644\u062F\u0631\u064A\u0634 \u0647\u064A \u062E\u0648\u0627\u0631\u0632\u0645\u064A\u0629 \u0643\u0634\u0641 \u0627\u0644\u062D\u0648\u0627\u0641 \u0645\u0646 \u0627\u0643\u062A\u0634\u0627\u0641 \u0627\u0644\u0628\u0631\u0648\u0641\u064A\u0633\u0648\u0631 \u0627\u0644\u062C\u0632\u0627\u0626\u0631\u064A \u0631\u0634\u064A\u062F \u062F\u0631\u064A\u0634 \u062E\u0644\u0627\u0644 \u0639\u0627\u0645 1987\u0645."@ar . . . . . . "Deriche edge detector is an edge detection operator developed by Rachid Deriche in 1987. It is a multistep algorithm used to obtain an optimal result of edge detection in a discrete two-dimensional image. This algorithm is based on John F. Canny's work related to the edge detection (Canny's edge detector) and his criteria for optimal edge detection: For this reason, this algorithm is often referred to as Canny-Deriche detector."@en . . . . .