![]() ![]() Our experiments with a large database of graffiti images collected by the Orange County Sheriff s Department in California show that our system is (i) effective in determining the gang/moniker The key idea of our system is as follows: given a graffiti query, first find a candidate list of the most similar images from a large graffiti database based on visual and content similarity, and then return the most frequent gang/moniker names associated with the candidate list as the tag for the query graffiti. In this paper, we present a system that is able to automatically identify the gang or the moniker for a given graffiti image. ![]() In current practice, this is typically performed manually by the law enforcement officers, which is not only time-consuming but also results in limited identification performance. ![]() Gang and Moniker Identification by Graffiti Matching Wei Tong Michigan State University East Lansing, MI 48824 Jung-Eun Lee Michigan State University East Lansing, MI 48824 Rong Jin Michigan State University East Lansing, MI 48824 Anil Jain Michigan State University East Lansing, MI 48824 ABSTRACT Identifying criminal gangs and monikers is one of the most important tasks for graffiti analysis in low enforcement. Tong, Wei Lee, Jung-Eun Jin, Rong Jain, Anil K. Gang and moniker identification by graffiti matching Gang and moniker identification by graffiti matching ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |