분류 전체보기120 8.1 Bag of Visual Words In this lecture, we are going to learn 'Bag of Visual Words'. In last lecture, we learned how classical image classification pipeline looks. What object do these parts belong to? An object is consists of a collection of local features (bag-of-features) Some local feature are very informative. It can deal well with occlusion, scale invariant, rotation invariant. Spatial information of local featu.. 2020. 7. 30. 8.0 Image classification In 'Computer Vision Materials' category, I am going to summarize the data about Computer Vision. ● Classification Classification is used in many ML parts, but today we are going to concentrate on image classification. The object in the yellow bow a street light or not? Not only general object, we can also find specific object. Like finding out whether the object is Potala palace or not? Not only.. 2020. 7. 30. [MYSQL] 사용법 정리 자주 쓰이는 기본적인 MySQL 쿼리 문법을 정리해보겠다. ● 테이블 생성 1. 기본 테이블 생성 CREATE TABLE mytable( id INT NOT NULL AUTO_INCREMENT PRIMARY KEY, NAME VARCHAR(50) NOT NULL ); → NOT NULL : 반드시 입력해야 함. 비어있을 수 없음. → AUTO_INCREMENT : 자동으로 숫자가 증가하도록 함. → PRIMARY KEY : 기본키로 지정. 2. 테이블 생성하면서 외래키 추가하기 FOREIGN KEY (USER_IDX) REFERENCES MEMBER (USER_IDX) ON UPDATE CASCADE ON DELETE CASCADE ● DESCRIBE 조회 1. 테이블 필드와 관련된 정보 조회 DESCR.. 2020. 5. 19. [BOJ] 2667. 단지번호맞추기 백준의 2667번 문제를 DFS를 사용하여 재귀로 풀어보았다. #include #include using namespace std; #define MAX_SIZE 25 int dx[] = { -1,0,1,0 }; int dy[] = { 0,1,0,-1 }; int n; int group_id; int groups[MAX_SIZE * MAX_SIZE]; bool visited[MAX_SIZE][MAX_SIZE]; int map[MAX_SIZE][MAX_SIZE]; void dfs_recursion(int x, int y) { visited[x][y] = true; groups[group_id]++; for (int i = 0; i < 4; i++) { int nx = x + dx[i]; int ny = y.. 2020. 5. 12. 이전 1 2 3 4 5 6 7 8 ··· 30 다음
