🐍Python
[알고리즘] 20. Bon Appétit
Anna and Brian are sharing a meal at a restuarant and they agree to split the bill equally. Brian wants to order something that Anna is allergic to though, and they agree that Anna won't pay for that item. Brian gets the check and calculates Anna's portion. You must determine if his calculation is correct.For example, assume the bill has the following prices: . Anna declines to eat item which co..
[알고리즘] 19. Day of the Programmer
Marie invented a Time Machine and wants to test it by time-traveling to visit Russia on the Day of the Programmer (the day of the year) during a year in the inclusive range from to .From to , Russia's official calendar was the Julian calendar; since they used the Gregorian calendar system. The transition from the Julian to Gregorian calendar system occurred in , when the next day after January w..
![[OpenCV] 05-3. Shi-Tomasi Corner Detector & Good Features to Track](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Ft1.daumcdn.net%2Fcfile%2Ftistory%2F991248505D8B22D00F)
[OpenCV] 05-3. Shi-Tomasi Corner Detector & Good Features to Track
이번 장에서는Shi-Tomasi Corner Detector라는 다른 모서리 탐지 기법cv2.goodFeaturesToTrack() 함수에 대해 배워 볼 것이다.Theory이전 장에서 Harris Corner Detector을 봤다. 그 이후에 조금의 수정을 더한 Good Features to Track은 Harris Corner Detector에 비해 결과가 좋았다. Harris Corner Detector의 스코어링 함수는 다음과 같았다.R=λ1λ2−k(λ1+λ2)2이 대신에, Shi-Tomasi의 스코어링 함수는 다음과 같다.R=min(λ1,λ2)이 값이 임계값보다 더 크다면, 모서리로 인식될 것이다...
![[OpenCV] 05-2. Harris Corner Detection](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Ft1.daumcdn.net%2Fcfile%2Ftistory%2F997272345D8B0B2821)
[OpenCV] 05-2. Harris Corner Detection
이번 장에서는Harris Corner Detection의 개념의 이해cv2.cornerHarris(), cv2.cornerSubPix()에 대해 볼 것 이다.Theory마지막 장에서, 모든 방향으로 채도의 변화가 큰 이미지에서 모서리는 영역이라는 것을 봤다. 초창기에 이 모서리를 찾기 위한 시도가 바로 지금에 와서 Harris Corner Detection라고 불리는 것이다. 그는 이 간단한 아이디어를 수학적 형태로 나타냈다. 이는 모든 방향에서 (u,v)의 이동에 의한 채도 차이를 찾는 것이다. 아래 처럼 나타내진다. E(u,v)=∑x,yw(x,y)[I(x+u,y+v)−I(x,y)]2w(x,y) : window functionI(x+u,y+v) : shi..
[알고리즘] 18. Migratory Birds
You have been asked to help study the population of birds migrating across the continent. Each type of bird you are interested in will be identified by an integer value. Each time a particular kind of bird is spotted, its id number will be added to your array of sightings. You would like to be able to find out which type of bird is most common given a list of sightings. Your task is to print the..
[알고리즘] 17. Divisivle Sum Pairs
You are given an array of integers, , and a positive integer, . Find and print the number of pairs where and + is divisible by .For example, and . Our three pairs meeting the criteria are and .Function DescriptionComplete the divisibleSumPairs function in the editor below. It should return the integer count of pairs meeting the criteria.divisibleSumPairs has the following parameter(s):n: the int..