• 한국멀티미디어학회논문지
• /
• 제19권2호
• /
• pp.138-145
• /
• 2016

LLAH(Locally Likely Arrangement Hashing) is a method which describes image features by exploiting the geometric relationship between their neighbors. Inherently, it is more robust to large view change and poor scene texture than conventional texture-based feature description methods. However, LLAH strongly requires that image features should be detected with high repeatability. The problem is that such requirement is difficult to satisfy in real applications. To alleviate the problem, this paper proposes a method that improves the matching rate of LLAH by exploiting together the brightness of features. Then, it is verified that the matching rate is increased by about 5% in experiments with synthetic images in the presence of Gaussian noise.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2009년도 정보 및 제어 심포지움 논문집
• /
• pp.231-233
• /
• 2009

The object recognition is one of the major computer vision fields. The object recognition using features(SIFT) is finding common features in input images and query images. But the object recognition using feature methods has suffered of difficulties due to heavy calculations when resizing input images and query images. In this paper, we focused on speed up finding features in the images. we proposed method using block segmentation and histogram. Block segmentation used diving input image and than histogram decided correlation between each 1]lock and query image. This paper has confirmed that tile matching time reduced for object recognition since reducing block.

• 전기학회논문지
• /
• 제58권5호
• /
• pp.1025-1034
• /
• 2009

In steel making production line, steel slabs are given a unique identification number. This identification number, Slab management number(SMN), gives information about the use of the slab. Identification of SMN has been done by humans for several years, but this is expensive and not accurate and it has been a heavy burden on the workers. Consequently, to improve efficiency, automatic recognition system is desirable. Generally, a recognition system consists of text localization, text extraction, character segmentation, and character recognition. For exact SMN identification, all the stage of the recognition system must be successful. In particular, the text localization is great important stage and difficult to process. However, because of many text-like patterns in a complex background and high fuzziness between the slab and background, directly extracting text region is difficult to process. If the slab region including SMN can be detected precisely, text localization algorithm will be able to be developed on the more simple method and the processing time of the overall recognition system will be reduced. This paper describes about the slab region localization using SIFT(Scale Invariant Feature Transform) features in the image. First, SIFT algorithm is applied the captured background and slab image, then features of two images are matched by Nearest Neighbor(NN) algorithm. However, correct matching rate can be low when two images are matched. Thus, to remove incorrect match between the features of two images, geometric locations of the matched two feature points are used. Finally, search rectangle method is performed in correct matching features, and then the top boundary and side boundaries of the slab region are determined. For this processes, we can reduce search region for extraction of SMN from the slab image. Most cases, to extract text region, search region is heuristically fixed [1][2]. However, the proposed algorithm is more analytic than other algorithms, because the search region is not fixed and the slab region is searched in the whole image. Experimental results show that the proposed algorithm has a good performance.

• 인터넷정보학회논문지
• /
• 제20권6호
• /
• pp.1-10
• /
• 2019

객체기반 이미지 매칭 알고리즘 기술은 이미지 프로세싱 및 컴퓨터 비전 분야에서 광범위하게 사용되어 왔다. 이러한 이미지 매칭 알고리즘 기반의 수 많은 응용 프로그램은 객체인식, 3D 모델링, 비디오 추적 및 바이오 정보학 분야에서 개발되어 왔다. 이미지 매칭 알고리즘의 좋은 예는 Scale invariant Feature Transform(SIFT) 이다. 하지만 SIFT 알고리즘 기술을 이용한 많은 응용 프로그램은 클라이언트-서버 구조가 아닌 하나의 시스템으로 운영되어 왔다. 본 논문은 모바일 플랫폼 기반에서 SIFT 알고리즘 기술을 이용하여 클라이언트-서버 구조로 이미지 매칭 시스템을 구현하였다. 제안된 시스템은 바이오 이미지 객체를 매칭하고 식별하여 사용자에게 유용한 정보를 제공한다. 또한 본 논문의 주요 방법론적 기여는 모바일 장치에 유비쿼터스 인터넷 연결을 활용하여 편리한 사용자 인터페이스와 객체간의 상호작용적인 묘사, 분할, 표현, 매칭 및 바이오 이미지를 검색한다. 본 논문은 이러한 기술과 함께 바이오 정보학에 대한 의미론적 이미지 검색을 수행하며 응용 프로그램에서 객체 이미지의 다른 점을 추출하여 신뢰할 수 있는 이미지 매칭을 수행하는 예를 제시해주었다.

• 한국측량학회지
• /
• 제28권4호
• /
• pp.463-469
• /
• 2010

화성의 고도정보를 제공하는 MOLA 센서는 화성전역에 대한 데이터를 제공하지 못하므로, 수치표고모형을 만들기 위해서는 MOC-NA영상을 이용한 영상정합이 수행되어야만 한다. 그러나 특색(feature)이 적고 명암대비가 낮은 화성영상의 특성상, 자동 영상정합은 어려운 실정이다. 본 논문은 MOC-NA 영상에 대하여 영역기준 영상정합에 기반한 반 자동 영상정합의 알고리즘을 다룬다. 공액점을 나타내는 시드(seed)포인트 들이 수동으로 스테레오 영상에 추가되고 이를 바탕으로 특징점들이 자동으로 삽입된다. 각 영상의 특징점들은 서로의 초기 공액점으로 사용되며, 영역기준 영상정합으로 정제된다. 영상정합의 과정 중 정합에 실패한 점들은 초기 공액점의 위치를 정합에 성공한 주변의 여섯 점들을 이용하여 재 계산한 후 정제된다. 타깃영상과 검색영상의 역할을 바꾸어 수행한 영상정합의 질적 평가 결과, 97.3%의 점들이 한 화소 이하의 절대거리를 나타내었다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2009년도 춘계학술발표대회
• /
• pp.106-109
• /
• 2009

Recently, image matching becomes important in Computer Aided Diagnosis (CAD) due to the huge amount of medical images. Specially, texture feature is useful in medical image matching. However, texture features such as co-occurrence matrices can't describe well the spatial distribution of gray levels of the neighborhood pixels. In this paper we propose a frequency domain-based texture feature extractor that describes the local spatial distribution for medical image retrieval. This method is based on 2D Local Discrete Fourier transform of local images. The features are extracted from local Fourier histograms that generated by four Fourier images. Experimental results using 40 classes Brodatz textures and 1 class of Emphysema CT images show that the average accuracy of retrieval is about 93%.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2007년도 Proceedings of ISRS 2007
• /
• pp.234-237
• /
• 2007

Road networks are important geospatial databases for various GIS (Geographic Information System) applications. Road digital maps may contain geometric spatial errors due to human and scanning errors, but manually updating roads information is time consuming. In this paper, we developed a new road features updating methodology using from multispectral high-resolution satellite image and pre-existing vector map. The approach is based on initial seed point generation using line segment matching and a modified double snake algorithm. Firstly, we conducted line segment matching between the road vector data and the edges of image obtained by Canny operator. Then, the translated road data was used to initialize the seed points of the double snake model in order to refine the updating of road features. The double snake algorithm is composed of two open snake models which are evolving jointly to keep a parallel between them. In the proposed algorithm, a new energy term was added which behaved as a constraint. It forced the snake nodes not to be out of potential road pixels in multispectral image. The experiment was accomplished using a QuickBird pan-sharpened multispectral image and 1:5,000 digital road maps of Daejeon. We showed the feasibility of the approach by presenting results in this urban area.

• 한국측량학회지
• /
• 제25권6_1호
• /
• pp.529-536
• /
• 2007

Registration between image and object space is a fundamental step in photogrammetry and computer vision. Along with rapid development of sensors - multi/hyper spectral sensor, laser scanning sensor, radar sensor etc., the needs for registration between different sensors are ever increasing. There are two important considerations on different sensor registration. They are sensor invariant feature extraction and correspondence between them. Since point to point correspondence does not exist in image and laser scanning data, it is necessary to have higher entities for extraction and correspondence. This leads to modify first, existing mathematical and geometrical model which was suitable for point measurement to line measurements, second, matching scheme. In this research, linear feature is selected for sensor invariant features and matching entity. Linear features are incorporated into mathematical equation in the form of extended collinearity equation for registration problem known as photo resection which calculates exterior orientation parameters. The other emphasis is on the scheme of finding matched entities in the aide of RANSAC (RANdom SAmple Consensus) in the absence of correspondences. To relieve computational load which is a common problem in sampling theorem, deterministic sampling technique and selecting 4 line features from 4 sectors are applied.

• 한국멀티미디어학회논문지
• /
• 제15권3호
• /
• pp.312-322
• /
• 2012

The paper presents an approach for recognizing the broken area of the traffic signs. The method is based on the Recognition System for Traffic Signs (RSTS). This paper describes an approach to using the location histogram matching for the broken traffic signs recognition, after the general process of the image detection and image categorization. The recognition proceeds by using the SIFT matching to adjust the acquired image to a standard position, then the histogram bin will be compared preprocessed image with reference image, and finally output the location and percents value of the broken area. And between the processing, some preprocessing like the blurring is added in the paper to improve the performance. And after the reorganization, the program can operate with the GPS for traffic signs maintenance. Experimental results verified that our scheme have a relatively high recognition rate and a good performance in general situation.

• 로봇학회논문지
• /
• 제8권2호
• /
• pp.82-91
• /
• 2013

This paper proposes a building recognition algorithm using watershed image segmentation algorithm and integrated region matching (IRM). To recognize a building, a preprocessing algorithm which is using Gaussian filter to remove noise and using canny edge extraction algorithm to extract edges is applied to input building image. First, images are segmented by watershed algorithm. Next, a region adjacency graph (RAG) based on the information of segmented regions is created. And then similar and small regions are merged. Second, a color distribution feature of each region is extracted. Finally, similar building images are obtained and ranked. The building recognition algorithm was evaluated by experiment. It is verified that the result from the proposed method is superior to color histogram matching based results.