• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.11
• /
• pp.66-72
• /
• 2014

Histogram of oriented gradient (HOG) feature is widely used in vision-based pedestrian detection. The interpolation is the most important technique in HOG feature calculation to provide high detection rate. In interpolation technique of HOG feature calculation, two nearest orientation bins to gradient orientation for each pixel and the corresponding weights are required. In this paper, therefore, an efficient gradient orientation bin and weight calculation circuit for HOG feature is proposed. In the proposed circuit, pre-calculated values are defined in tables to avoid the operations of tangent function and division, and the size of tables is minimized by utilizing the characteristics of tangent function and weights for each gradient orientation. Pipeline architecture is adopted to the proposed circuit to accelerate the processing speed, and orientation bins and the corresponding weights for each pixel are calculated in two clock cycles by applying efficient coarse and fine search schemes. Since the proposed circuit calculates gradient orientation for each pixel with the interval of $1^{\circ}$ and determines both orientation bins and weights required in interpolation technique, it can be utilized in HOG feature calculation to support interpolation technique to provide high detection rate.

• Journal of Korea Multimedia Society
• /
• v.9 no.11
• /
• pp.1381-1394
• /
• 2006

Generation methods of data cube have been studied for many years in data warehouse which supports decision making using stored data. There are two previous studies, one is multi-way array algorithm and the other is H-cubing algorithm which is based on the hyper-tree. The multi-way array algorithm stores all aggregation data in arrays, so if the base data is increased, the size of memory is also grow. The H-cubing algorithm which is based on the hyper-tree stores all tuples in one tree so the construction cost is increased. In this paper, we present an efficient data cube generation method based on hash table using weight mapping table and record hash table. Because the proposed method uses a hash table, the generation cost of data cube is decreased and the memory usage is also decreased. In the performance study, we shows that the proposed method provides faster search operation time and make data cube generation operate more efficiently.

• The KIPS Transactions:PartA
• /
• v.13A no.1 s.98
• /
• pp.11-18
• /
• 2006

In the Internet of various networks, it is difficult to reduce real routing time by just minimizing their hop count. We propose an adaptive proximity route selection method in DHT-based peer-to-peer systems, in which nodes select the nぉe with smallest lookup latency among their routing table entries as a next routing node. Using Q-Routing algorithm and exponential recency-weighted average, each node estimates the total latency and establishes a lookup table. Moreover, without additional overhead, nodes exchange their lookup tables to update their routing tables. Several simulations measuring the lookup latencies and hop-to-hop latency show that our method outperforms the original Chord method as well as CFS' server selection method.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.2
• /
• pp.16-32
• /
• 2002

효율적인 데이타마트 정보의 축척과 질의 정보 추출을 위한 연관 마이닝 방법을 적용하여 검색 속도를 빠르게 할 수 있도록 테이블을 생성하고 고객의 속성별 가중치와 선호기준을 입력받아 선호 점수를 계산하여 점수가 높은 과목을 우선적으로 검색할 수 있도록 기존 연관 알고리즘에서 사용한 단일 항목 입력 데이터 구조를 확장하여 다중 항목 연관 알고리즘(Multiple Item Association Mining : MIAM)을 이용하여 생성된 연관 검색 유형 테이블을 데이터베이스캐시화를 설계하였다. 동일한 알고리즘에서도 데이터베이스캐시 시스템을 적용한 시스템의 질의 처리 수행속도가 우수성을 이용하여 설계함으로써 효율적인 웹 서버 기능을 수행할 수 있음과 동시에 데이터베이스 캐싱의 주요 이점인 효율성 증대, 속도 향상, 비용절감의 효과를 얻을 수 있으므로 연구 설계하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1035-1038
• /
• 2004

스테가노그라피는 비밀 정보를 이미지나 오디오, 비디오 또는 텍스트 등 커버(cover) 라고 불리는 다른 미디어에 숨겨서 전송하는 방법으로 제 3자는 정보가 숨겨져 있다는 사실 자체를 알지 못하도록 하는 것이다. 대부분 영상 데이터를 이용하고 있으나, 제한된 색으로만 구성된 이진 영상 및 다치 영상의 경우 비시각적으로 비밀 정보를 숨기는 것이 일반 컬러 또는 그레이 영상에 비해 어려움이 있다. 본 논문에서는 가중치 테이블을 사용하여 영상의 한 블록에 최대 2비트만을 변경시키면서 많은 양의 정보를 숨기는 방법을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.57-59
• /
• 2000

인터넷에 돌아다니는 정보의 양은 무한정에 가까워지고 있고 이용자는 필요한 정보들을 얻을 수 있게 되었으나 검색 가능한 정보의 양이 폭발적으로 증가함에 따라 이용자는 정보검색을 하는데 있어 어려움이 따랐고, 이는 원하는 정보만을 필터링하여 보여주는 정보검색방법이 필요하게 되었다. 본 연구에서는 웹 사용자들이 정보검색을 하는데 원하는 정보를 정확하게 찾아주기 위해 웹 문서에 대한 TAG 가중치와 관련용어 영역지식의 구축 및 웹 문서 평가작업을 통한 Term의 웹 문서 DF테이블의 구축을 이용한 필터링 방법을 제안하고 그 유효성을 확인하였다.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.10
• /
• pp.233-240
• /
• 2009

In this paper we made the serious game learning multiplication table to be evolved. The serious game is to induce the interest of the learner. This program has an interaction form which reflects the intention of the user and using this program a learner to learn the multiplication table as teacher's location are training a program that are seen as the abata and came to be that learner is smart. A study ability to be evolved used an back propagation neural networks. But we improved a study speed using divided weight table concept. The engine is studied perfectly in 60~80 times training. The learning rate increase to various non-monotonic functional form not to do a mechanical rise. And the learning rate is similar with the study ability of the human.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.251-259
• /
• 2007

A Bluetooth ad hoc network can be formed by interconnecting piconets into scatternet. Many algorithms of scatternet formation have been proposed so far. However, these have a problem that takes a long time to reform scatternet, especially for the case of master moving out. In this paper we propose a Fast-Recovery algorithm. which aims at reducing the time of scatternet reformation owing to master moving out. In the algorithm, we select a slave with the weigh similar to its master as Sub-Master from a piconet device table created by the master When a master leaves its piconet is detected by its slaves, the Sub-Master becomes the new master of the piconet instead of the old and directly connect to other slaves and bridge(s) through piconet device table in page state.

• Journal of Korea Multimedia Society
• /
• v.5 no.6
• /
• pp.609-615
• /
• 2002

In this paper, we propose a contrast for the improvement of multi-gray scale image on display system. The proposed method distinguishes a maximum value and a minimum value in input fields or frames. By this judgement, the improvement degree of image quality is decided. This method does not require field and frame memory. Moreover, its lower hardware complexity than conventional methods make it easy to apply this method for flat panel display(FPD) which requires real-time processing. And the contrast of input gray level can be controled flexibly by varying the weight the weight value which controls the contrast range. The proposed method gives an image by controlling weighting slope selectively at intervals according to the brightness-control algorithm and the type of image in the look-up table. The function of the proposed method has been verified through Synopsys VHDL and computer simulation. And its results show that the proposed method can improve the quality of image.

• Journal of Advanced Navigation Technology
• /
• v.12 no.5
• /
• pp.494-501
• /
• 2008

In this paper, to merge whole 3D information of an occluded body from view point, the new image merging algorithm is introduced after obtaining images of body on the turn table from 4 directions. The two images represented by polygon meshes are merged using weight bipartite matching method with different weights according to coordinates and axes based on minimum distance since two images merged don't present abrupt variation of 3D coordinates and scan direction is one direction. To obtain entire 3D information of body, these steps are repeated 3 times since the obtained images are 4. This proposed method has advantage 200 - 300% searching time reduction rather than conventional branch and bound, dynamic programming, and hungarian method though the matching accuracy rate is a little bit less than these methods.