• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.10
• /
• pp.171-180
• /
• 2013

Generally, when we apply zernike moments value for matching, we can use those moments value obtained from projecting image information under circumscribed circle to zernike basis function. However, the problem is that the power of discrimination can be reduced because hand images include lots of overlapped information due to its special characteristic. On the other hand, when distinguishing hand poses, information in specific area of image information except for overlapped information can increase the power of discrimination. In this paper, in order to solve problems like those, we design R3 ring mask by combining image obtained from R2 ring mask, which can weight information of the power of discrimination and image obtained from R1 ring mask, which eliminate the overlapped information. The moments which are obtained by R3 ring mask decrease operational time by reducing dimension through principle component analysis. In order to confirm the superiority of the suggested method, we conducted some experiments by comparing our method to other method using seven different hand poses.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.1
• /
• pp.54-68
• /
• 2001

This paper proposes a new algorithm that detects and separates the occluding and occluded objects in a 2D image. An input image is represented by the attributed graph where a node corresponds to a surface and an arc connecting two nodes describes the adjacency of the nodes in the image. Each end of arc is weighted by relation value which tells the number of edges connected to the surface represented by the node in the opposite side of the arc. In attributed graph, homogeneous nodes pertained to a same object always construct one of three special patterns which can be simply classified by comparison of relation values of the arcs. The experimental results have shown that the proposed algorithm efficiently separates the objects overlapped arbitrarily, and that this approach of separating objects before matching operation reduces the matching time significantly by simplifying the matching problem of overlapped objects as the one of individual single object.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.12
• /
• pp.58-66
• /
• 1999

In this paper, an advanced histogram equalization algorithm for contrast enhancement is presented. Histogram equalization is the most popular algorithm. Global histogram equalization is simple and fast, but its contrast enhancement power is relatively low. Local histogram equalization, on the other hand, can enhance overall contrast more effectively, but the complexity of computation required is very high. In this paper, a low pass filter type mask is used to get a sub-block histogram equalization function to more simply produce the high contrast. The low pass filter type mask is realized by partially overlapped sub-block histogram equalization (POSHE). With the proposed method. the computation overhead is reduced by a factor of about one hundred compared to that of local histogram equalization while still achieving high contrast.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.12
• /
• pp.1697-1703
• /
• 2014

In this paper, we propose an indoor RSSI (received signal strength indication)-based localization method that uses virtually overlapped visible light with an indoor LED lighting system. In our system, a photodiode (PD) measures the RSSI from LED lamps that blink in one row or column units. Subsequently, the RSSI is used to obtain the horizontal distances between the LED lamps and the receiver with the predetermined characteristics curve, R-D curve, that represents the relation between the RSSI and the horizontal distances. When the controlled LED lamps blink in one row or column units, the R-D curve at the border of the LED lamps is different because of the weak lighting, which results in the position sensing error of the receiver. The deviation of the optical power of each LED also causes the error. To solve these problems, we propose a method that overlaps the visible light through the numerical operation at the receiver side without any modification of the light source side. Our proposed method has been simulated in a room measuring $1.2{\times}1.2{\times}1.8m^3$ considering the effect of the error on the optical power of the LED. The simulation result shows that the proposed method eliminates the error condition with the R-D curve and achieves an average positioning error of 13.4 mm under the error rate 3% of the optical power.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.5
• /
• pp.1320-1332
• /
• 1998

We propose Multiph which is a virtual topology for a reliable group communication platform on dynamic high speed network. We also define group communication primitives for transmission of messages and group management. Multiph consists of a set of nodes which are process groups and a set of edges which are the connection between nodes providing the route of messages. Processes can send and receive messages overlapped in a several multicast groups. Overlapped process organizes non-overlapped logical group, which called meta-group. Multiph guarantees ordering of messages that received at the destination group. It has no extra node that decreases system performance. Although the group has dynamic group change to leave and add process, it does not reconstruct the existing platform structure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9C
• /
• pp.564-572
• /
• 2011

Distributed video coding (DVC) system has been proposed to reduce encoder complexity by using the correlation of frames in decoders. Since the block based motion estimation operation is not performed in the encoder of DVC system, lapped transforms, in which adjacent two blocks are transformed into one block, can be efficiently used in the DVC system. In this paper, an efficient DVC system using lapped transforms is proposed. The overlapped block motion compensated interpolation is used to produce side information, and the corresponding correlation noise between original Wyner-Ziv frame and side information is modeled. Extensive computer simulations show that the proposed DVC system outperforms conventional DVC systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.6159-6174
• /
• 2019

Recently, Kim et al. introduced the Hamming + k with m overlapped pixels data hiding (Hk_mDH) based on matrix encoding. The embedding rate (ER) of this method is 0.54, which is better than Hamming code HC (n, n - k) and HC (n, n - k) +1 DH (H1DH), but not enough. Hamming code data hiding (HDH) is using a covering function COV(1, n = 2^k -1, k) and H1DH has a better embedding efficiency, when compared with HDH. The demerit of this method is that they do not exploit their space of pixels enough to increase ER. In this paper, we increase ER using sequential Hk_mDH (SHk_mDH ) through fully exploiting every pixel in a cover image. In SHk_mDH, a collision maybe happens when the position of two pixels within overlapped two blocks is the same. To solve the collision problem, in this paper, we have devised that the number of modification does not exceed 2 bits even if a collision occurs by using OPAP and LSB. Theoretical estimations of the average mean square error (AMSE) for these schemes demonstrate the advantage of our SHk_mDH scheme. Experimental results show that the proposed method is superior to previous schemes.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.4
• /
• pp.425-430
• /
• 2005

Many problems can be formulated in terms nf graphs and thus solved by graph-theoretic algorithms. This paper is concerned with finding paths between nodes over the distributed and overlapped graphs. The proposed method allows multiple agents to cooperate to find paths without merging the distributed graphs. For each graph there is a designated agent which is charged of providing path-finding service for hot graph and initiating the path-finding tasks of which path starts from the graph. The proposed method earlier on constructs an abstract graph so-called viewgraph for the distributed overlapped graphs and thus enables to extract the information about how to guide the path finding over the graphs. The viewgraph is shared by all agents which determine how to coordinate other agents for the purpose of finding paths. Each agent maintains the shortest path information among the nodes which are placed in different overlapped subgraphs of her graph. Once an agent is asked to get a path from a node on her graph to another node on another's graph, she directs other agents to provide the necessary information for finding paths.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.2
• /
• pp.11-22
• /
• 2004

Conventional algorithms of separating overlapped objects are mostly based on template matching methods and thus their application domain is restricted to 2D objects and the processing time increases when the number of templates (object models) does. To solve these problems, this paper proposes a new approach of separating the occluding object from the stack of 3D objects using the relationship between surfaces without any information on the objects. The proposed algorithm considers an object as a combination of surfaces which are consisted with a set of boundary edges. Overlap of 3D objects appears as overlap of surfaces and thus as crossings of edges in 2D image. Based on this observation, the types of edge crossings are classified from which the types of overlap of 3D objects can be identified. The relationships between surfaces are represented by an attributed graph where the types of overlaps are represented by relation values. Using the relation values, the surfaces pertained to the same object are discerned and the overlapping object on the top of the stack can be separated. The performance of the proposed algorithm has been proved by the experiments using the overlapped images of 3D objects selected among the standard industrial parts.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2009.09a
• /
• pp.815-826
• /
• 2009

The paper presents a case study addressing the design and construction aspects for DCM(Deep Cement Mixing) method employed as the foundation of a caisson type breakwater with heavy weight(10,700 ton/EA) and a high design wave height($H_{1/3}$=8.7m). The DCM was designed for the project(Ulsan New Port North Breakwater Phase 1) by optimizing the pattern of DCM columns with a combination of short and long columns (i.e., block type(upper 3m)+wall type(lower)) and considering overlapped section between columns as a critical section against shear force where the coefficient of effective width of treated column($\alpha$) was estimated with caution. It was shown that the value can be 0.9 under the condition with the overlapped width of 30cm. In addition to that, a field trial test was performed after improving conventional DCM equipment (e.g., mixing blades, cement paste supplying pipes, multi auger motor, etc.) to establish a standardized DCM construction cycle (withdrawal rate of mixing blades) which can provide the prescribed strength. The result of the field strength test for cored DCM specimens shows that the averaged strength is larger than the target strength and the distribution of the strength(with a defect rate of 7%) also satisfies with the quality control normal distribution curve which allows defect rate of 15.9%.