• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.1
• /
• pp.269-276
• /
• 2015

This paper proves the Erd$\ddot{o}$s-Faber-Lov$\acute{a}$sz conjecture of the vertex coloring problem, which is so far unresolved. The Erd$\ddot{o}$s-Faber-Lov$\acute{a}$sz conjecture states that "the union of k copies of k-cliques intersecting in at most one vertex pairwise is k-chromatic." i.e., x(G)=k. In a bid to prove this conjecture, this paper employs a method in which it determines the number of intersecting vertices and that of cliques that intersect at one vertex so as to count a vertex of the minimum degree ${\delta}(G)$ in the Minimum Independent Set (MIS) if both the numbers are even and to count a vertex of the maximum degree ${\Delta}(G)$ in otherwise. As a result of this algorithm, the number of MIS obtained is x(G)=k. When applied to $K_k$-clique sum intersecting graphs wherein $3{\leq}k{\leq}8$, the proposed method has proved to be successful in obtaining x(G)=k in all of them. To conclude, the Erd$\ddot{o}$s-Faber-Lov$\acute{a}$sz conjecture implying that "the k-number of $K_k$-clique sum intersecting graph is k-chromatic" is proven.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.775-792
• /
• 2015

Person re-identification is an important and challenging task in computer vision with numerous real world applications. Despite significant progress has been made in the past few years, person re-identification remains an unsolved problem. This paper presents a novel appearance-based approach to person re-identification. The approach exploits region covariance matrix and color histograms to capture the statistical properties and chromatic information of each object. Robustness against low resolution, viewpoint changes and pose variations is achieved by a novel signature, that is, the combination of Log Covariance Matrix feature and HSV histogram (LCMH). In order to further improve re-identification performance, third-party image sets are utilized as a common reference to sufficiently represent any image set with the same type. Distinctive and reliable features for a given image set are extracted through decision boundary between the specific set and a third-party image set supervised by max-margin criteria. This method enables the usage of an existing dataset to represent new image data without time-consuming data collection and annotation. Comparisons with state-of-the-art methods carried out on benchmark datasets demonstrate promising performance of our method.

• Journal of the Korean Mathematical Society
• /
• v.54 no.3
• /
• pp.847-865
• /
• 2017

For a finite or an infinite set X, let $2^X$ be the power set of X. A class of simple graph, called strong Boolean graph, is defined on the vertex set $2^X{\setminus}\{X,{\emptyset}\}$, with M adjacent to N if $M{\cap}N={\emptyset}$. In this paper, we characterize the annihilating-ideal graphs $\mathbb{AG}(R)$ that are blow-ups of strong Boolean graphs, complemented graphs and preatomic graphs respectively. In particular, for a commutative ring R such that AG(R) has a maximum clique S with $3{\leq}{\mid}V(S){\mid}{\leq}{\infty}$, we prove that $\mathbb{AG}(R)$ is a blow-up of a strong Boolean graph if and only if it is a complemented graph, if and only if R is a reduced ring. If assume further that R is decomposable, then we prove that $\mathbb{AG}(R)$ is a blow-up of a strong Boolean graph if and only if it is a blow-up of a pre-atomic graph. We also study the clique number and chromatic number of the graph $\mathbb{AG}(R)$.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.5
• /
• pp.263-269
• /
• 2014

In this paper, I disprove Hadwiger conjecture of the vertex coloring problem, which asserts that "All $K_k$-minor free graphs can be colored with k-1 number of colors, i.e., ${\chi}(G)=k$ given $K_k$-minor." Pursuant to Hadwiger conjecture, one shall obtain an NP-complete k-minor to determine ${\chi}(G)=k$, and solve another NP-complete vertex coloring problem as a means to color vertices. In order to disprove Hadwiger conjecture in this paper, I propose an algorithm of linear time complexity O(V) that yields the exact solution to the vertex coloring problem. The proposed algorithm assigns vertex with the minimum degree to the Maximum Independent Set (MIS) and repeats this process on a simplified graph derived by deleting adjacent edges to the MIS vertex so as to finally obtain an MIS with a single color. Next, it repeats the process on a simplified graph derived by deleting edges of the MIS vertex to obtain an MIS whose number of vertex color corresponds to ${\chi}(G)=k$. Also presented in this paper using the proposed algorithm is an additional algorithm that searches solution of ${\chi}^{{\prime}{\prime}}(G)$, the total chromatic number, which also remains NP-complete. When applied to a $K_4$-minor graph, the proposed algorithm has obtained ${\chi}(G)=3$ instead of ${\chi}(G)=4$, proving that the Hadwiger conjecture is not universally applicable to all the graphs. The proposed algorithm, however, is a simple algorithm that directly obtains an independent set minor of ${\chi}(G)=k$ to assign an equal color to the vertices of each independent set without having to determine minors in the first place.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.19 no.6
• /
• pp.96-101
• /
• 2020

In this paper, we present the results of our research to perform 3D laser scanning functions by adding a focusing lens to a conventional 2D laser scanner. For the optical design, the ray-tracing technique was used along with a total of four lenses as the variable incident focusing lens, the collimating lens, and the F-Theta lens. As design variables, the curvature of the incident focusing lens (Lens #1) was assumed to be us, l mm and sumed mm, and the incident angles were set at 0cidenus, l. In addition, the distance between the focusing lens and the collimating lens was set to vary from 5 mm to 15 mm. When the incident focal length was varied from 5 mm to 15 mm, the exit focal length was calculated to vary from 67.5 mm to 56.8 mm for the lens with R = 100 mm and from 108.5 mm to 99.0 mm for the lens with R = 150 mm. When the incident angle was 0°, the focal aberration was only slightly observable at 10㎛ in both the x- and y-direction. At 7.5° was the focal aberration of approximately 20~50㎛ was measured at 20㎛. To investigate the chromatic aberration of the designed optical device, the distortion of the focus was observed when the 550 nm beam was simulated on lens designed for a 980 nm wavelength.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2007.04a
• /
• pp.357-360
• /
• 2007

Efficient extraction and update of imagery is a crucial element in establishing latest geospatial information in today's fast changing Information society. Provision of Quick Bird imagery, with 61cm resolution panchromatic imagery and 2.5m resolution multi-chromatic imagery is contributing greatly in the application field if high density geospatial information. This research have conducted digital plotting utilizing stereo images provided by QuickBird satellite and evaluated the accuracy through comparison and analysis with digital map results. It turned out that result has smaller error than standard deviation of scale of 1:5,000 set by the NGII. This proves that the production of digital map at scale of 1:5,000 is possible.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.7-10
• /
• 2000

There are many Problems such as low detection ratio, velocity and increase of false hit ratio on the detection of gradual scene changes with the previous shot transition detection algorithms. In this paper, we Propose an improved dissolve detection method using color information on low-frequency subband and edge elements on high-frequency subband. The Possible dissolve transition are found by analyzing the edge change ratio in the high-frequency subband with edge elements of each direction. Using the double chromatic difference on the lowest frequency subband, we have the improvement of the dissolve detection ratio. The simulation results show that the performance of the proposed algorithm is better than the conventional one for dissolve detection on a diverse set of uncompressed video sequences.

• Journal of Korea Multimedia Society
• /
• v.20 no.9
• /
• pp.1502-1508
• /
• 2017

A musical key is a fundamental concept in Western music theory. It is a collective characterization of pitches and chords that together create a musical perception of the entire piece. It is based on a group of pitches in a scale with which a music is constructed. Each key specifies the set of seven primary chromatic notes that are used out of the twelve possible notes. This paper presents a method that identifies the key of a song using Hidden Markov Models given a sequence of chroma features. Given an input song, a sequence of chroma features are computed. It is then classified into one of the 24 keys using a discrete Hidden Markov Models. The proposed method can help musicians and disc-jockeys in mixing a segment of tracks to create a medley. When tested on 120 songs, the success rate of the music key identification reached around 87.5%.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.6
• /
• pp.179-186
• /
• 2011

This paper suggests the minimum number of vertex guards algorithm. Given n rooms, the exact number of minimum vertex guards is proposed. However, only approximation algorithms are presented about the maximum number of vertex guards for polygon and orthogonal polygon without or with holes. Fisk suggests the maximum number of vertex guards for polygon with n vertices as follows. Firstly, you can triangulate with n-2 triangles. Secondly, 3-chromatic vertex coloring of every triangulation of a polygon. Thirdly, place guards at the vertices which have the minority color. This paper presents the minimum number of vertex guards using dominating set. Firstly, you can obtain the visibility graph which is connected all edges if two vertices can be visible each other. Secondly, you can obtain dominating set from visibility graph or visibility matrix. This algorithm applies various art galley problems. As a results, the proposed algorithm is simple and can be obtain the minimum number of vertex guards.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.15 no.4
• /
• pp.46-50
• /
• 2016

A laser head was designed for micro-scale patterning and joining applications. The target feature size of the pattern was $100{\mu}m$, and optics were designed to perform the target. Two singlet lenses were combined to minimize the chromatic aberration, and the geometry of the lenses was calculated by using the raytracing method with a commercial software program. As a restriction of lens design, the focal length was set at 100mm, and the maximum diameter of the lens or beam size was limited to 10mm for the assembly in the limited cage size. The maximum temperatures were calculated to be $1367^{\circ}C$, $1508^{\circ}C$, and $1905^{\circ}C$ for 10, 12, and 15 Watts of power, respectively. A specially designed laser head was used to compensate for the distance between the object and the lens. The detailed design mechanism and 3D data were presented. The optics design and detailed performance of the lens were analyzed by using MTF and spot diagram calculation.