• 한국콘텐츠학회논문지
• /
• 제12권6호
• /
• pp.9-20
• /
• 2012

컴퓨터비전에서 안정적으로 대응점을 획득하는 것은 매우 중요한 일이다. 그러나 이들은 스케일, 조명, 시점 등이 변하는 환경에서 정확한 대응점을 찾는 과정은 쉽지 않다. SIFT 알고리즘은 객체의 모서리나 꼭지점으로부터 추출한 특징벡터를 사용하므로 스케일링, 회전, 조명변화를 가지는 영상에서도 뛰어난 매칭을 수행한다. 그러나 SIFT는 엣지에 의해 특징점을 추출하므로 엣지가 존재하지 않는 영역에서는 원하는 대응점을 찾을 수 없다. 본 연구는 SIFT에 의한 대응 특징점 추출과 매칭 성능을 향상시키기 위한 마커 모양 및 배치 방법을 제안한다. 제안 방법에서 사용한 마커의 모양은 부착 방향에 따라 SIFT 알고리즘에 의해 한 방향으로 우세한 벡터를 검출할 수 있는 반원형(SemiCircle)으로 구성한다. 그리고 대응점 매칭의 성능을 향상시키기 위하여 마커의 방향 배치는 드 브루인 수열(De Bruijn Sequence)을 이용한다. 실험을 통해 제안한 방법이 기존의 방법보다 더 정확한 특징점 검출과 매칭에 효과적임을 증명하였다.

• Journal of Information Processing Systems
• /
• 제13권6호
• /
• pp.1554-1574
• /
• 2017

This paper introduces a new type of determining factor for Pseudo Random Strings (PRS). This classification depends upon a mathematical property called Finite Induction (FI). FI is similar to a Markov Model in that it presents a model of the sequence under consideration and determines the generating rules for this sequence. If these rules obey certain criteria, then we call the sequence generating these rules FI a PRS. We also consider the relationship of these kinds of PRS's to Good/deBruijn graphs and Linear Feedback Shift Registers (LFSR). We show that binary sequences from these special graphs have the FI property. We also show how such FI PRS's can be generated without consideration of the Hamiltonian cycles of the Good/deBruijn graphs. The FI PRS's also have maximum Shannon entropy, while sequences from LFSR's do not, nor are such sequences FI random.

• 전자공학회논문지S
• /
• 제36S권6호
• /
• pp.9-16
• /
• 1999

이 논문에서는 렘펠의 D-준동현사상을 바탕으로 하여 드브루인 수열을 만드는 효과적인 알고리즘을 제안한다. 이 알고리즘에서는 k차 드브루인 수열에서 n차 드브루인 수열의 다음 비트을 만드는데 필요한 배타논리합 연산수는, r의 2진 표현에서 1의 갯수를 W(r)이라 쓸 때, $k(2^{W(n-k)}-1)$쯤임을 보인다: 딸서, 드브루인 함수를 잘 고르면 이 수는 k가 된다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1988년도 한국자동제어학술회의논문집(국제학술편); 한국전력공사연수원, 서울; 21-22 Oct. 1988
• /
• pp.1033-1036
• /
• 1988

This paper proposes a new method for generation of uniform random numbers using binary random sequences. These binary sequences are obtained from a de Bruijn sequence by random sampling method. Several statistical tests are carried out for the random numbers generated by the proposed method, and it is shown that the random numbers have good random properties.

• 대한수학회논문집
• /
• 제20권4호
• /
• pp.685-693
• /
• 2005

An aperiodic perfect map(APM) is an array with the property that every array of certain size, called a window, arises exactly once as a contiguous subarray in the array. In this article, we deal with the generalization of APM in higher dimensional arrays. First, we reframe all known definitions onto the generalized n-dimensional arrays. Next, some elementary known results on arrays are generalized to propositions on n-dimensional arrays. Finally, with some devised integer representations, two constructions of infinite family of n-dimensional APMs are generalized from known 2-dimensional constructions in [7].

• Journal of Microbiology and Biotechnology
• /
• 제32권2호
• /
• pp.149-159
• /
• 2022

Cancers of the lung and liver are the top 10 leading causes of cancer death worldwide. Thus, it is essential to identify the genes specifically expressed in these two cancer types to develop new therapeutics. Although many messenger RNA (mRNA) sequencing data related to these cancer cells are available due to the advancement of next-generation sequencing (NGS) technologies, optimized data processing methods need to be developed to identify the novel cancer-specific genes. Here, we conducted an analytical comparison between Bowtie2, a Burrows-Wheeler transform-based alignment tool, and Kallisto, which adopts pseudo alignment based on a transcriptome de Bruijn graph using mRNA sequencing data on normal cells and lung/liver cancer tissues. Before using cancer data, simulated mRNA sequencing reads were generated, and the high Transcripts Per Million (TPM) values were compared. mRNA sequencing reads data on lung/liver cancer cells were also extracted and quantified. While Kallisto could directly give the output in TPM values, Bowtie2 provided the counts. Thus, TPM values were calculated by processing the Sequence Alignment Map (SAM) file in R using package Rsubread and subsequently in python. The analysis of the simulated sequencing data revealed that Kallisto could detect more transcripts and had a higher overlap over Bowtie2. The evaluation of these two data processing methods using the known lung cancer biomarkers concludes that in standard settings without any dedicated quality control, Kallisto is more effective at producing faster and more accurate results than Bowtie2. Such conclusions were also drawn and confirmed with the known biomarkers specific to liver cancer.